NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: (1 + l^0)}> (1 + i^0)}> (~(1) + i^0)}> undef298, k^0 -> (1 + k^0)}> undef317, g^0 -> undef320, p^0 -> undef327, r^0 -> undef328, s^0 -> undef329}> undef443, f^0 -> undef446, r^0 -> undef455}> undef486, g^0 -> undef489, p^0 -> 0, s^0 -> (0 + undef486)}> undef525, tmp___5^0 -> (0 + (~(1) * undef525))}> undef545, tmp___5^0 -> (0 + undef545)}> undef552, r^0 -> undef560}> (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> (1 + m^0)}> ((0 + undef898) + undef899), tmp^0 -> undef898, tmp___0^0 -> undef899, tmp___1^0 -> undef900}> 0}> Fresh variables: undef298, undef317, undef320, undef327, undef328, undef329, undef337, undef443, undef446, undef455, undef486, undef489, undef525, undef545, undef552, undef560, undef898, undef899, undef900, Undef variables: undef298, undef317, undef320, undef327, undef328, undef329, undef337, undef443, undef446, undef455, undef486, undef489, undef525, undef545, undef552, undef560, undef898, undef899, undef900, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0}> (1 + i^0)}> (1 + l^0)}> 0, l^0 -> (1 + l^0)}> (1 + l^0)}> 0, l^0 -> (1 + l^0)}> (1 + l^0)}> 0, l^0 -> (1 + l^0)}> (1 + l^0)}> 0, l^0 -> (1 + l^0)}> (~(1) + i^0)}> (~(1) + i^0), r^0 -> undef328}> (~(1) + i^0), r^0 -> undef328}> (~(1) + i^0), r^0 -> undef455}> (1 + k^0)}> (1 + l^0)}> (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> (1 + m^0)}> (1 + m^0)}> 0, l^0 -> (1 + l^0)}> (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> undef560}> undef328}> undef328}> undef455}> undef560}> undef328}> undef328}> undef455}> undef560}> undef328}> undef328}> undef455}> undef560}> undef328}> undef328}> undef455}> undef560}> undef328}> undef328}> undef455}> undef560}> undef328}> undef328}> undef455}> Fresh variables: undef298, undef317, undef320, undef327, undef328, undef329, undef337, undef443, undef446, undef455, undef486, undef489, undef525, undef545, undef552, undef560, undef898, undef899, undef900, Undef variables: undef298, undef317, undef320, undef327, undef328, undef329, undef337, undef443, undef446, undef455, undef486, undef489, undef525, undef545, undef552, undef560, undef898, undef899, undef900, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + i^0, rest remain the same}> Variables: i^0, n^0 Graph 2: Transitions: 0, l^0 -> 1 + l^0, rest remain the same}> 0, l^0 -> 1 + l^0, rest remain the same}> 0, l^0 -> 1 + l^0, rest remain the same}> 0, l^0 -> 1 + l^0, rest remain the same}> -1 + i^0, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef455, rest remain the same}> 1 + k^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + m^0, rest remain the same}> 1 + m^0, rest remain the same}> 0, l^0 -> 1 + l^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> Variables: l^0, m^0, n^0, r^0, i^0, k^0, iter^0, tmp___2^0 Graph 3: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 0, rest remain the same}> Graph 3 1 + l^0, rest remain the same}> 1 + l^0, rest remain the same}> 1 + l^0, rest remain the same}> 1 + l^0, rest remain the same}> 1 + l^0, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 6 , 1 ) ( 9 , 2 ) ( 13 , 2 ) ( 15 , 2 ) ( 22 , 2 ) ( 28 , 3 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.000878 Checking conditional termination of SCC {l6}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000657s Ranking function: -i^0 + n^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.630135 Some transition disabled by a set of invariant(s): Invariant at l9: l^0 <= n^0 Invariant at l13: l^0 <= n^0 Invariant at l15: l^0 <= n^0 Invariant at l22: l^0 <= n^0 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, l^0 -> 1 + l^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, l^0 -> 1 + l^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, l^0 -> 1 + l^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, l^0 -> 1 + l^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + m^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + m^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, l^0 -> 1 + l^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> Checking unfeasibility... Time used: 0.754107 Checking conditional termination of SCC {l9, l13, l15, l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.026497s Ranking function: -38 - 35*l^0 - 3*m^0 + 38*n^0 New Graphs: Transitions: -1 + i^0, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef455, rest remain the same}> 1 + k^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + m^0, rest remain the same}> 1 + m^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> Variables: i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9, l13, l15, l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.018589s Ranking function: -35 + 35*i^0 - 35*l^0 New Graphs: Transitions: -1 + i^0, rest remain the same}> 1 + k^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + m^0, rest remain the same}> 1 + m^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> Variables: i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9, l13, l15, l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.017060s Ranking function: 2 - k^0 - l^0 + 2*n^0 New Graphs: Transitions: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + m^0, rest remain the same}> 1 + m^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> Variables: i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9, l15, l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019346s Ranking function: -34 - 34*l^0 - 35*m^0 + 69*n^0 It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> New Graphs: Transitions: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> Variables: i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9, l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.023178s Ranking function: -34 + i^0 + 34*k^0 - 33*l^0 - 2*n^0 New Graphs: Transitions: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> undef560, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef455, rest remain the same}> Variables: i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9, l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011115s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.154503s Trying to remove transition: undef455, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.081304s Time used: 0.079848 Trying to remove transition: undef560, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.049892s Time used: 0.04837 Trying to remove transition: undef455, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.089138s Time used: 0.087644 Trying to remove transition: undef560, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.078591s Time used: 0.077045 Trying to remove transition: undef455, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038935s Time used: 0.037403 Trying to remove transition: undef560, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040911s Time used: 0.039542 Trying to remove transition: undef455, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.039180s Time used: 0.037794 Trying to remove transition: undef560, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041479s Time used: 0.040098 Trying to remove transition: undef455, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.042881s Time used: 0.041462 Trying to remove transition: undef560, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.044674s Time used: 0.043271 Trying to remove transition: undef455, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.043275s Time used: 0.041822 Trying to remove transition: undef560, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045437s Time used: 0.043963 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.054838s Time used: 0.053395 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.108747s Time used: 0.106874 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.054903s Time used: 0.05287 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.152612s Time used: 0.150784 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.115530s Time used: 0.11343 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.110240s Time used: 0.108155 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.062355s Time used: 0.060223 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.083055s Time used: 0.081194 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.066700s Time used: 0.064817 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.060846s Time used: 0.058996 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.152875s Time used: 0.151045 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.146920s Time used: 0.144863 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.798855s Time used: 2.79459 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002113s Time used: 1.00211 LOG: SAT solveNonLinear - Elapsed time: 3.800968s Cost: 1; Total time: 3.7967 Failed at location 15: 1 + n^0 <= m^0 Before Improving: Quasi-invariant at l9: 1 + n^0 <= m^0 Quasi-invariant at l13: 1 + n^0 <= m^0 Quasi-invariant at l15: 1 + n^0 <= m^0 Quasi-invariant at l22: 1 + n^0 <= m^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.048781s Remaining time after improvement: 0.968567 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l9: 1 + n^0 <= m^0 Quasi-invariant at l13: 1 + n^0 <= m^0 Quasi-invariant at l15: 1 + n^0 <= m^0 Quasi-invariant at l22: 1 + n^0 <= m^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: 0, l^0 -> 1 + l^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, l^0 -> 1 + l^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, l^0 -> 1 + l^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, l^0 -> 1 + l^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + m^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + m^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, l^0 -> 1 + l^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, 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 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> It's unfeasible after collapsing. Removing transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> New Graphs: Transitions: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Variables: i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.047398s Ranking function: -34 - 1107*i^0 - 37*iter^0 + 1107*l^0 New Graphs: Transitions: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Variables: i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.037552s Ranking function: 1015 + 4*i^0 - 35*iter^0 - 4*l^0 New Graphs: Transitions: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Variables: i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.026172s Ranking function: 1105 - 35*i^0 - 38*iter^0 + 35*l^0 New Graphs: Transitions: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Variables: i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.023737s Ranking function: 1050 + 4*i^0 - 35*iter^0 - 4*l^0 New Graphs: Transitions: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Variables: i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009555s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.242992s Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.081292s Time used: 0.070824 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.080754s Time used: 0.065452 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.086925s Time used: 0.070947 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.086554s Time used: 0.070322 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.096451s Time used: 0.079945 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.093011s Time used: 0.076145 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.093162s Time used: 0.076044 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.088440s Time used: 0.070995 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.097831s Time used: 0.080384 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.101348s Time used: 0.083813 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.098052s Time used: 0.080447 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.096747s Time used: 0.079039 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.016159s Time used: 4.00298 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005293s Time used: 4.00002 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.018952s Time used: 1.00033 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.243675s Time used: 1.21396 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.003152s Time used: 1.00314 LOG: SAT solveNonLinear - Elapsed time: 2.246827s Cost: 1; Total time: 2.2171 Termination implied by a set of invariant(s): Invariant at l9: iter^0 + l^0 <= 1 + m^0 + tmp___2^0 Invariant at l13: iter^0 + n^0 <= 1 + m^0 + tmp___2^0 Invariant at l15: l^0 <= n^0 Invariant at l22: iter^0 <= 1 + tmp___2^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, 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): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Quasi-ranking function: 50000 - iter^0 - 30*l^0 + 30*m^0 New Graphs: Transitions: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Variables: i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012417s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.005164s Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.128410s Time used: 0.122939 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.125872s Time used: 0.107284 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.093280s Time used: 0.078512 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.095205s Time used: 0.079883 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.111428s Time used: 0.095948 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.112011s Time used: 0.097358 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.105332s Time used: 0.088128 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.119832s Time used: 0.103293 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.128080s Time used: 0.112536 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.104188s Time used: 0.087407 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.117477s Time used: 0.10043 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.120267s Time used: 0.104842 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.016098s Time used: 4.00357 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005658s Time used: 4.00001 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.017216s Time used: 1.00001 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.250467s Time used: 1.22025 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.003566s Time used: 1.00355 LOG: SAT solveNonLinear - Elapsed time: 2.254033s Cost: 1; Total time: 2.2238 Termination implied by a set of invariant(s): Invariant at l13: n^0 <= 1 + m^0 Invariant at l15: l^0 <= 1 + n^0 Invariant at l22: n^0 <= 1 + m^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... Quasi-ranking function: 50000 - iter^0 + m^0 - n^0 New Graphs: Transitions: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Variables: i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013614s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.005757s Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.099541s Time used: 0.094553 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.084861s Time used: 0.081601 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.087687s Time used: 0.083831 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.084448s Time used: 0.081388 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.104918s Time used: 0.098951 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.100702s Time used: 0.097295 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.102159s Time used: 0.098291 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.085679s Time used: 0.082275 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.105616s Time used: 0.101877 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.081552s Time used: 0.076861 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.093574s Time used: 0.090018 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.102508s Time used: 0.096401 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005355s Time used: 4.00372 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005778s Time used: 4.00036 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.017070s Time used: 1.00001 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.209727s Time used: 1.17922 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.003823s Time used: 1.00381 LOG: SAT solveNonLinear - Elapsed time: 2.213550s Cost: 1; Total time: 2.18303 Termination implied by a set of invariant(s): Invariant at l9: iter^0 + l^0 <= 1 + n^0 + tmp___2^0 Invariant at l13: iter^0 + l^0 <= 1 + n^0 + tmp___2^0 Invariant at l15: l^0 <= n^0 Invariant at l22: 1 + tmp___2^0 <= iter^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, 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): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Quasi-ranking function: 50000 - iter^0 + l^0 + m^0 - 2*n^0 New Graphs: Transitions: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Variables: i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019633s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.007663s Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.103750s Time used: 0.101086 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.106853s Time used: 0.102972 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.109125s Time used: 0.104646 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.100240s Time used: 0.094962 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.127509s Time used: 0.123259 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.118501s Time used: 0.114704 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.134319s Time used: 0.128083 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.118934s Time used: 0.114609 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.128841s Time used: 0.123049 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.115098s Time used: 0.110594 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.135491s Time used: 0.131008 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.119857s Time used: 0.115333 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006538s Time used: 4.0049 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005734s Time used: 4.00022 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.017403s Time used: 1.00013 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.505401s Time used: 1.47485 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.004278s Time used: 1.00427 LOG: SAT solveNonLinear - Elapsed time: 2.509679s Cost: 1; Total time: 2.47912 Termination implied by a set of invariant(s): Invariant at l9: n^0 + tmp___2^0 <= iter^0 + m^0 Invariant at l13: tmp___2^0 <= 1 + iter^0 Invariant at l15: l^0 <= n^0 Invariant at l22: l^0 <= m^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, 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): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Quasi-ranking function: 50000 - iter^0 + l^0 - 2*m^0 + n^0 New Graphs: Transitions: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Variables: i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019953s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.006615s Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.101827s Time used: 0.098926 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.102196s Time used: 0.100179 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.141437s Time used: 0.137467 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.133597s Time used: 0.129289 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.147075s Time used: 0.142635 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.131987s Time used: 0.127966 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.151860s Time used: 0.148082 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.115441s Time used: 0.111325 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.137246s Time used: 0.133199 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.139525s Time used: 0.134867 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.153606s Time used: 0.149362 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.114969s Time used: 0.110599 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006870s Time used: 4.00517 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009393s Time used: 4.00397 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.017330s Time used: 1.00001 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.782044s Time used: 1.75072 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.004869s Time used: 1.00485 LOG: SAT solveNonLinear - Elapsed time: 2.786913s Cost: 1; Total time: 2.75557 Termination implied by a set of invariant(s): Invariant at l9: n^0 + tmp___2^0 <= iter^0 + m^0 Invariant at l13: l^0 + n^0 + tmp___2^0 <= 1 + i^0 + iter^0 + m^0 Invariant at l22: iter^0 <= 1 + tmp___2^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, 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): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Quasi-ranking function: 50000 - iter^0 + l^0 - n^0 New Graphs: Transitions: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Variables: i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.020310s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.006845s Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.123190s Time used: 0.118013 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.127209s Time used: 0.123247 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.112709s Time used: 0.108925 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.117746s Time used: 0.113363 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.133837s Time used: 0.128072 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.122331s Time used: 0.118226 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.136492s Time used: 0.132153 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.131454s Time used: 0.127341 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.145791s Time used: 0.140826 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.127355s Time used: 0.123094 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.152670s Time used: 0.148271 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.123100s Time used: 0.117081 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007075s Time used: 4.00535 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007680s Time used: 4.00238 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.017676s Time used: 1.00001 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.368819s Time used: 1.33745 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.003335s Time used: 1.00333 LOG: SAT solveNonLinear - Elapsed time: 2.372155s Cost: 1; Total time: 2.34077 Termination implied by a set of invariant(s): Invariant at l9: 1 + tmp___2^0 <= iter^0 Invariant at l13: 1 + tmp___2^0 <= iter^0 Invariant at l15: l^0 <= n^0 Invariant at l22: iter^0 + l^0 <= 1 + n^0 + tmp___2^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, 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): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Quasi-ranking function: 50000 - 2*iter^0 + l^0 + m^0 - 2*n^0 - tmp___2^0 New Graphs: Transitions: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Variables: i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.027623s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.018800s Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.140447s Time used: 0.134 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.141484s Time used: 0.137137 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.139994s Time used: 0.135522 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.128202s Time used: 0.123797 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.167576s Time used: 0.163187 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.129391s Time used: 0.124871 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.196147s Time used: 0.190146 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.132657s Time used: 0.127426 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.176934s Time used: 0.172125 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.142064s Time used: 0.137268 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.157756s Time used: 0.153147 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.156829s Time used: 0.150088 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001848s Time used: 4.00001 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005377s Time used: 4.0004 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.017772s Time used: 1.00001 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.954447s Time used: 1.92289 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.004167s Time used: 1.00416 LOG: SAT solveNonLinear - Elapsed time: 2.958614s Cost: 1; Total time: 2.92705 Termination implied by a set of invariant(s): Invariant at l9: iter^0 + n^0 <= 1 + m^0 + tmp___2^0 Invariant at l13: iter^0 + l^0 <= 1 + m^0 + tmp___2^0 Invariant at l15: l^0 <= n^0 Invariant at l22: iter^0 <= 1 + tmp___2^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, 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): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Quasi-ranking function: 50000 - iter^0 + 2*l^0 - m^0 - n^0 New Graphs: Transitions: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Variables: i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.041418s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.008050s Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.147395s Time used: 0.141643 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.154439s Time used: 0.150199 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.129903s Time used: 0.126221 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.145627s Time used: 0.139152 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.175790s Time used: 0.172114 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.158289s Time used: 0.153309 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.194899s Time used: 0.190599 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.154099s Time used: 0.149091 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.168737s Time used: 0.1642 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.161552s Time used: 0.157168 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.168600s Time used: 0.163421 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.157640s Time used: 0.150551 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002730s Time used: 4.00007 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005521s Time used: 4.00039 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.018091s Time used: 1.00001 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.457606s Time used: 1.42591 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.003982s Time used: 1.00397 LOG: SAT solveNonLinear - Elapsed time: 2.461588s Cost: 1; Total time: 2.42988 Termination implied by a set of invariant(s): Invariant at l13: iter^0 <= 1 + tmp___2^0 Invariant at l15: l^0 <= n^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility [ Termination Graph ] Strengthening and disabling transitions... Quasi-ranking function: 50000 + i^0 + iter^0 + l^0 + m^0 - 3*n^0 - 2*tmp___2^0 New Graphs: Transitions: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Variables: i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.032458s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.047482s Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.161696s Time used: 0.158084 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.154026s Time used: 0.149599 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.171038s Time used: 0.166574 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.157407s Time used: 0.153266 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.185576s Time used: 0.180739 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.177655s Time used: 0.173113 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.180674s Time used: 0.173355 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.160938s Time used: 0.156408 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.179712s Time used: 0.175135 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.164689s Time used: 0.159989 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.192794s Time used: 0.185136 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.168751s Time used: 0.163864 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002179s Time used: 4.00031 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005277s Time used: 4.00001 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.018216s Time used: 1.00001 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.878946s Time used: 2.84711 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.694102s Time used: 0.69409 LOG: SAT solveNonLinear - Elapsed time: 3.573048s Cost: 1; Total time: 3.5412 Termination implied by a set of invariant(s): Invariant at l9: l^0 <= 1 + n^0 + tmp___2^0 Invariant at l13: l^0 <= 1 + n^0 + tmp___2^0 Invariant at l15: l^0 <= iter^0 + n^0 Invariant at l22: l^0 <= n^0 + tmp___2^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, 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): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Quasi-ranking function: 50000 + 1853*i^0 + iter^0 + l^0 + m^0 + n^0 - 2*tmp___2^0 New Graphs: Transitions: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Variables: i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.072006s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.135373s Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.172678s Time used: 0.168973 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.179413s Time used: 0.17466 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.164113s Time used: 0.160128 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.178609s Time used: 0.173609 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.203621s Time used: 0.198939 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.189236s Time used: 0.184704 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.206249s Time used: 0.202106 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.182675s Time used: 0.178292 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.189448s Time used: 0.184155 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.157745s Time used: 0.153657 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef455, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.218484s Time used: 0.213223 Trying to remove transition: ((0 + 1) + 0) + iter^0, r^0 -> undef560, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.211629s Time used: 0.206159 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.508560s Time used: 0.506672 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.965185s Time used: 0.960718 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.959306s Time used: 0.942595 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.495336s Time used: 1.46665 Termination failed. Trying to show unreachability... Proving unreachability of entry: 0, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: 0, rest remain the same}> * Postcondition : 1 <= 0 Postcodition moved up: 1 <= 0 LOG: Try proving POST Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 2 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011307s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.011346s LOG: NarrowEntry size 1 Narrowing transition: 1 + i^0, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: 1 + i^0, rest remain the same}> END GRAPH: EXIT: 0, rest remain the same}> POST: 1 <= 0 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.083982s Time used: 0.083832 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.029568s Time used: 1.02955 LOG: SAT solveNonLinear - Elapsed time: 1.113549s Cost: 51; Total time: 1.11338 Failed at location 6: 1 + n^0 <= i^0 Before Improving: Quasi-invariant at l6: 1 + n^0 <= i^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004603s Remaining time after improvement: 0.996639 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l6: 1 + n^0 <= i^0 LOG: NEXT CALL check - disable LOG: CALL check - Post:1 + n^0 <= i^0 - Process 3 * Exit transition: * Postcondition : 1 + n^0 <= i^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011620s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.011664s Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.164838s Time used: 0.164652 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.010716s Time used: 1.01071 LOG: SAT solveNonLinear - Elapsed time: 1.175554s Cost: 51; Total time: 1.17536 Failed at location 6: 1 + n^0 <= i^0 Before Improving: Quasi-invariant at l6: 1 + n^0 <= i^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005086s Remaining time after improvement: 0.99665 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l6: 1 + n^0 <= i^0 LOG: NEXT CALL check - disable LOG: CALL check - Post:1 + n^0 <= i^0 - Process 4 * Exit transition: * Postcondition : 1 + n^0 <= i^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011443s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.011487s Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000117s Time used: 1.00002 LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 3.426104s Cannot prove unreachability Proving non-termination of subgraph 2 Transitions: 0, l^0 -> 1 + l^0, rest remain the same}> 0, l^0 -> 1 + l^0, rest remain the same}> 0, l^0 -> 1 + l^0, rest remain the same}> 0, l^0 -> 1 + l^0, rest remain the same}> -1 + i^0, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef455, rest remain the same}> 1 + k^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + m^0, rest remain the same}> 1 + m^0, rest remain the same}> 0, l^0 -> 1 + l^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> Variables: l^0, m^0, n^0, r^0, i^0, k^0, iter^0, tmp___2^0 Checking conditional non-termination of SCC {l9, l13, l15, l22}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.000157s Time used: 5.00002 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.015376s Time used: 5.00058 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.030044s Time used: 5.00066 > Checking if the negation of the conditions of every pending exit is quasi-invariant... NO Proving non-termination of subgraph 2 Transitions: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> undef560, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef455, rest remain the same}> Variables: i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional non-termination of SCC {l9, l22}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.203109s Time used: 1.20301 LOG: SAT solveNonLinear - Elapsed time: 1.203109s Cost: 0; Total time: 1.20301 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.171162s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l9: 1 + l^0 <= m^0 Quasi-invariant at l22: 1 + l^0 <= m^0 Strengthening and disabling EXIT transitions... Closed exits from l9: 4 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> Calling reachability with... Transition: Conditions: OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: 0, rest remain the same}> Conditions: OPEN EXITS: 0, rest remain the same}> (condsUp: l^0 <= n^0) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 + n^0 <= i^0, l^0 <= n^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate