YES Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: (1 + m^0)}> (0 + undef38), pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40}> (~(1) + pi^0), wpos^0 -> 0}> (1 + wpos^0)}> (~(1) + m^0)}> (1 + pos^0)}> (~(1) + z^0)}> (0 + undef188), pos^0 -> 0, seq^0 -> undef188, wpos^0 -> 0, z^0 -> undef190}> (~(1) + pi^0), wpos^0 -> 0}> (1 + wpos^0)}> undef282}> (1 + pos^0)}> (~(1) + z^0)}> undef333, max^0 -> undef334, n^0 -> undef335, pi^0 -> (0 + undef338), pos^0 -> 0, seq^0 -> undef338, wpos^0 -> 0, z^0 -> undef340}> undef351}> Fresh variables: undef38, undef40, undef188, undef190, undef282, undef333, undef334, undef335, undef338, undef340, undef351, Undef variables: undef38, undef40, undef188, undef190, undef282, undef333, undef334, undef335, undef338, undef340, undef351, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef351, z^0 -> (~(1) + z^0)}> undef351}> undef351, pi^0 -> (0 + undef188), pos^0 -> 0, seq^0 -> undef188, wpos^0 -> 0, z^0 -> undef190}> undef351, pi^0 -> (0 + undef188), pos^0 -> 0, seq^0 -> undef188, wpos^0 -> 0, z^0 -> undef190}> undef351, pi^0 -> (~(1) + pi^0), wpos^0 -> 0}> undef351, wpos^0 -> (1 + wpos^0)}> undef351, pos^0 -> (1 + pos^0)}> undef282, m^0 -> (~(1) + m^0), z^0 -> (~(1) + z^0)}> undef282, z^0 -> (~(1) + z^0)}> undef282, m^0 -> (1 + m^0), z^0 -> (~(1) + z^0)}> undef282, m^0 -> (~(1) + m^0)}> undef282}> undef282, m^0 -> (1 + m^0)}> undef282, m^0 -> (~(1) + m^0), pi^0 -> (0 + undef38), pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40}> undef282, pi^0 -> (0 + undef38), pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40}> undef282, m^0 -> (1 + m^0), pi^0 -> (0 + undef38), pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40}> undef282, m^0 -> (~(1) + m^0), pi^0 -> (0 + undef38), pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40}> undef282, pi^0 -> (0 + undef38), pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40}> undef282, m^0 -> (1 + m^0), pi^0 -> (0 + undef38), pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40}> undef282, m^0 -> (~(1) + m^0), pi^0 -> (~(1) + pi^0), wpos^0 -> 0}> undef282, pi^0 -> (~(1) + pi^0), wpos^0 -> 0}> undef282, m^0 -> (1 + m^0), pi^0 -> (~(1) + pi^0), wpos^0 -> 0}> undef282, m^0 -> (~(1) + m^0), wpos^0 -> (1 + wpos^0)}> undef282, wpos^0 -> (1 + wpos^0)}> undef282, m^0 -> (1 + m^0), wpos^0 -> (1 + wpos^0)}> undef282, m^0 -> (~(1) + m^0), pos^0 -> (1 + pos^0)}> undef282, pos^0 -> (1 + pos^0)}> undef282, m^0 -> (1 + m^0), pos^0 -> (1 + pos^0)}> Fresh variables: undef38, undef40, undef188, undef190, undef282, undef333, undef334, undef335, undef338, undef340, undef351, Undef variables: undef38, undef40, undef188, undef190, undef282, undef333, undef334, undef335, undef338, undef340, undef351, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef351, z^0 -> -1 + z^0, rest remain the same}> undef351, rest remain the same}> undef351, pi^0 -> undef188, pos^0 -> 0, seq^0 -> undef188, wpos^0 -> 0, z^0 -> undef190, rest remain the same}> undef351, pi^0 -> undef188, pos^0 -> 0, seq^0 -> undef188, wpos^0 -> 0, z^0 -> undef190, rest remain the same}> undef351, pi^0 -> -1 + pi^0, wpos^0 -> 0, rest remain the same}> undef351, wpos^0 -> 1 + wpos^0, rest remain the same}> undef351, pos^0 -> 1 + pos^0, rest remain the same}> undef282, m^0 -> -1 + m^0, z^0 -> -1 + z^0, rest remain the same}> undef282, z^0 -> -1 + z^0, rest remain the same}> undef282, m^0 -> 1 + m^0, z^0 -> -1 + z^0, rest remain the same}> undef282, m^0 -> -1 + m^0, rest remain the same}> undef282, rest remain the same}> undef282, m^0 -> 1 + m^0, rest remain the same}> undef282, m^0 -> -1 + m^0, pi^0 -> undef38, pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40, rest remain the same}> undef282, pi^0 -> undef38, pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40, rest remain the same}> undef282, m^0 -> 1 + m^0, pi^0 -> undef38, pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40, rest remain the same}> undef282, m^0 -> -1 + m^0, pi^0 -> undef38, pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40, rest remain the same}> undef282, pi^0 -> undef38, pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40, rest remain the same}> undef282, m^0 -> 1 + m^0, pi^0 -> undef38, pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40, rest remain the same}> undef282, m^0 -> -1 + m^0, pi^0 -> -1 + pi^0, wpos^0 -> 0, rest remain the same}> undef282, wpos^0 -> 1 + wpos^0, rest remain the same}> undef282, m^0 -> 1 + m^0, wpos^0 -> 1 + wpos^0, rest remain the same}> undef282, m^0 -> -1 + m^0, pos^0 -> 1 + pos^0, rest remain the same}> Variables: c1^0, m^0, z^0, pos^0, pi^0, seq^0, wpos^0, n^0, c2^0, max^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 13 , 1 ) ( 22 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.501805 Some transition disabled by a set of invariant(s): Invariant at l2: wpos^0 <= 1 Invariant at l13: wpos^0 <= 1 Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef351, pi^0 -> undef188, pos^0 -> 0, seq^0 -> undef188, wpos^0 -> 0, z^0 -> undef190, rest remain the same}> > It's unfeasible. Removing transition: undef282, m^0 -> -1 + m^0, pi^0 -> undef38, pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef351, z^0 -> -1 + z^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef351, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef351, pi^0 -> undef188, pos^0 -> 0, seq^0 -> undef188, wpos^0 -> 0, z^0 -> undef190, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef351, pi^0 -> -1 + pi^0, wpos^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef351, wpos^0 -> 1 + wpos^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef351, pos^0 -> 1 + pos^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): undef282, m^0 -> -1 + m^0, z^0 -> -1 + z^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, z^0 -> -1 + z^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, m^0 -> 1 + m^0, z^0 -> -1 + z^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, m^0 -> -1 + m^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, m^0 -> 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: undef282, pi^0 -> undef38, pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef282, m^0 -> 1 + m^0, pi^0 -> undef38, pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, m^0 -> -1 + m^0, pi^0 -> undef38, pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, pi^0 -> undef38, pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, m^0 -> 1 + m^0, pi^0 -> undef38, pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, m^0 -> -1 + m^0, pi^0 -> -1 + pi^0, wpos^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, wpos^0 -> 1 + wpos^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, m^0 -> 1 + m^0, wpos^0 -> 1 + wpos^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, m^0 -> -1 + m^0, pos^0 -> 1 + pos^0, rest remain the same}> Checking unfeasibility... Time used: 1.1221 Some transition disabled by a set of invariant(s): Invariant at l2: pos^0 <= 1 Invariant at l13: pos^0 <= 1 Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef351, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef351, z^0 -> -1 + z^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef351, pi^0 -> undef188, pos^0 -> 0, seq^0 -> undef188, wpos^0 -> 0, z^0 -> undef190, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef351, pi^0 -> -1 + pi^0, wpos^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef351, wpos^0 -> 1 + wpos^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef351, pos^0 -> 1 + pos^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): undef282, m^0 -> -1 + m^0, z^0 -> -1 + z^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, z^0 -> -1 + z^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, m^0 -> 1 + m^0, z^0 -> -1 + z^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef282, m^0 -> -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: undef282, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef282, m^0 -> 1 + m^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, m^0 -> -1 + m^0, pi^0 -> undef38, pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, pi^0 -> undef38, pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, m^0 -> 1 + m^0, pi^0 -> undef38, pos^0 -> 0, seq^0 -> undef38, wpos^0 -> 0, z^0 -> undef40, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, m^0 -> -1 + m^0, pi^0 -> -1 + pi^0, wpos^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, wpos^0 -> 1 + wpos^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, m^0 -> 1 + m^0, wpos^0 -> 1 + wpos^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef282, m^0 -> -1 + m^0, pos^0 -> 1 + pos^0, rest remain the same}> Checking unfeasibility... Time used: 1.89658 Checking conditional termination of SCC {l2, l13}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.028840s Ranking function: 2 + 6*n^0 - 2*pos^0 - 6*seq^0 It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pi^0 -> -1 + undef188, pos^0 -> 0, seq^0 -> undef188, wpos^0 -> 0, z^0 -> undef190, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, pi^0 -> undef188, pos^0 -> 0, seq^0 -> undef188, wpos^0 -> 1, z^0 -> undef190, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, m^0 -> 1 + m^0, pi^0 -> undef188, pos^0 -> 0, seq^0 -> undef188, wpos^0 -> 1, z^0 -> undef190, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pi^0 -> ((0 + ~(1)) + 0) + pi^0, wpos^0 -> 0, z^0 -> -1 + z^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, pi^0 -> ((0 + ~(1)) + 0) + pi^0, wpos^0 -> 0, z^0 -> -1 + z^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, m^0 -> 1 + m^0, pi^0 -> ((0 + ~(1)) + 0) + pi^0, wpos^0 -> 0, z^0 -> -1 + z^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pi^0 -> -2 + pi^0, wpos^0 -> 0, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, pi^0 -> ((0 + ~(1)) + 0) + pi^0, wpos^0 -> 1, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, m^0 -> 1 + m^0, pi^0 -> ((0 + ~(1)) + 0) + pi^0, wpos^0 -> 1, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pi^0 -> ((0 + ~(1)) + 0) + pi^0, pos^0 -> 1 + pos^0, wpos^0 -> 0, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, wpos^0 -> ((0 + 1) + 0) + wpos^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, m^0 -> -1 + m^0, wpos^0 -> ((0 + 1) + 0) + wpos^0, z^0 -> -1 + z^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, wpos^0 -> ((0 + 1) + 0) + wpos^0, z^0 -> -1 + z^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, m^0 -> 1 + m^0, wpos^0 -> ((0 + 1) + 0) + wpos^0, z^0 -> -1 + z^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pos^0 -> 1 + pos^0, wpos^0 -> ((0 + 1) + 0) + wpos^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pos^0 -> ((0 + 1) + 0) + pos^0, z^0 -> -1 + z^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, pos^0 -> ((0 + 1) + 0) + pos^0, z^0 -> -1 + z^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, m^0 -> 1 + m^0, pos^0 -> ((0 + 1) + 0) + pos^0, z^0 -> -1 + z^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pi^0 -> -1 + pi^0, pos^0 -> ((0 + 1) + 0) + pos^0, wpos^0 -> 0, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, pos^0 -> ((0 + 1) + 0) + pos^0, wpos^0 -> 1 + wpos^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, m^0 -> 1 + m^0, pos^0 -> ((0 + 1) + 0) + pos^0, wpos^0 -> 1 + wpos^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pos^0 -> 2 + pos^0, rest remain the same}> New Graphs: Transitions: undef351, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> -1 + m^0, z^0 -> -2 + z^0, rest remain the same}> undef351, c2^0 -> undef282, z^0 -> -2 + z^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> 1 + m^0, z^0 -> -2 + z^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pi^0 -> -1 + pi^0, wpos^0 -> 0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}> undef351, c2^0 -> undef282, wpos^0 -> 1 + wpos^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> 1 + m^0, wpos^0 -> 1 + wpos^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pos^0 -> 1 + pos^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}> undef351, pi^0 -> undef188, pos^0 -> 0, seq^0 -> undef188, wpos^0 -> 0, z^0 -> undef190, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pi^0 -> undef188, pos^0 -> 0, seq^0 -> undef188, wpos^0 -> 0, z^0 -> -1 + undef190, rest remain the same}> undef351, c2^0 -> undef282, pi^0 -> undef188, pos^0 -> 0, seq^0 -> undef188, wpos^0 -> 0, z^0 -> -1 + undef190, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> 1 + m^0, pi^0 -> undef188, pos^0 -> 0, seq^0 -> undef188, wpos^0 -> 0, z^0 -> -1 + undef190, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pi^0 -> undef188, pos^0 -> 1, seq^0 -> undef188, wpos^0 -> 0, z^0 -> undef190, rest remain the same}> undef351, pi^0 -> ((0 + ~(1)) + 0) + pi^0, wpos^0 -> 0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pi^0 -> -1 + pi^0, wpos^0 -> 0, rest remain the same}> undef351, c2^0 -> undef282, wpos^0 -> 2 + wpos^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> 1 + m^0, wpos^0 -> 2 + wpos^0, rest remain the same}> undef351, pos^0 -> ((0 + 1) + 0) + pos^0, rest remain the same}> Variables: c1^0, c2^0, m^0, max^0, n^0, pi^0, pos^0, seq^0, wpos^0, z^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.045813s Ranking function: 6 + 6*n^0 - 6*pos^0 - 6*seq^0 New Graphs: Transitions: undef351, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> -1 + m^0, z^0 -> -2 + z^0, rest remain the same}> undef351, c2^0 -> undef282, z^0 -> -2 + z^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> 1 + m^0, z^0 -> -2 + z^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pi^0 -> -1 + pi^0, wpos^0 -> 0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}> undef351, c2^0 -> undef282, wpos^0 -> 1 + wpos^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> 1 + m^0, wpos^0 -> 1 + wpos^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}> undef351, pi^0 -> undef188, pos^0 -> 0, seq^0 -> undef188, wpos^0 -> 0, z^0 -> undef190, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pi^0 -> undef188, pos^0 -> 0, seq^0 -> undef188, wpos^0 -> 0, z^0 -> -1 + undef190, rest remain the same}> undef351, c2^0 -> undef282, pi^0 -> undef188, pos^0 -> 0, seq^0 -> undef188, wpos^0 -> 0, z^0 -> -1 + undef190, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> 1 + m^0, pi^0 -> undef188, pos^0 -> 0, seq^0 -> undef188, wpos^0 -> 0, z^0 -> -1 + undef190, rest remain the same}> undef351, pi^0 -> ((0 + ~(1)) + 0) + pi^0, wpos^0 -> 0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pi^0 -> -1 + pi^0, wpos^0 -> 0, rest remain the same}> undef351, c2^0 -> undef282, wpos^0 -> 2 + wpos^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> 1 + m^0, wpos^0 -> 2 + wpos^0, rest remain the same}> Variables: c1^0, c2^0, m^0, max^0, n^0, pi^0, pos^0, seq^0, wpos^0, z^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.028052s Ranking function: 5 + 6*n^0 - 5*pos^0 - 6*seq^0 New Graphs: Transitions: undef351, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> -1 + m^0, z^0 -> -2 + z^0, rest remain the same}> undef351, c2^0 -> undef282, z^0 -> -2 + z^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> 1 + m^0, z^0 -> -2 + z^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pi^0 -> -1 + pi^0, wpos^0 -> 0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}> undef351, c2^0 -> undef282, wpos^0 -> 1 + wpos^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> 1 + m^0, wpos^0 -> 1 + wpos^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}> undef351, pi^0 -> ((0 + ~(1)) + 0) + pi^0, wpos^0 -> 0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pi^0 -> -1 + pi^0, wpos^0 -> 0, rest remain the same}> undef351, c2^0 -> undef282, wpos^0 -> 2 + wpos^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> 1 + m^0, wpos^0 -> 2 + wpos^0, rest remain the same}> Variables: c1^0, c2^0, m^0, max^0, n^0, pi^0, pos^0, seq^0, wpos^0, z^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.017460s Ranking function: -17 + n^0 - seq^0 + 9*z^0 New Graphs: Transitions: undef351, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pi^0 -> -1 + pi^0, wpos^0 -> 0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}> undef351, c2^0 -> undef282, wpos^0 -> 1 + wpos^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> 1 + m^0, wpos^0 -> 1 + wpos^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}> undef351, pi^0 -> ((0 + ~(1)) + 0) + pi^0, wpos^0 -> 0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pi^0 -> -1 + pi^0, wpos^0 -> 0, rest remain the same}> undef351, c2^0 -> undef282, wpos^0 -> 2 + wpos^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> 1 + m^0, wpos^0 -> 2 + wpos^0, rest remain the same}> Variables: c1^0, c2^0, m^0, max^0, n^0, pi^0, pos^0, seq^0, wpos^0, z^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012162s Ranking function: -6 + n^0 - seq^0 + 7*z^0 New Graphs: Transitions: undef351, pi^0 -> ((0 + ~(1)) + 0) + pi^0, wpos^0 -> 0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> -1 + m^0, pi^0 -> -1 + pi^0, wpos^0 -> 0, rest remain the same}> undef351, c2^0 -> undef282, wpos^0 -> 2 + wpos^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> 1 + m^0, wpos^0 -> 2 + wpos^0, rest remain the same}> Variables: c1^0, c2^0, m^0, max^0, n^0, pi^0, pos^0, seq^0, wpos^0, z^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006718s Ranking function: (3 / 2) + n^0 + (3 / 2)*pi^0 - pos^0 - seq^0 + (~(1) / 2)*wpos^0 New Graphs: Transitions: undef351, c2^0 -> undef282, wpos^0 -> 2 + wpos^0, rest remain the same}> undef351, c2^0 -> undef282, m^0 -> 1 + m^0, wpos^0 -> 2 + wpos^0, rest remain the same}> Variables: c1^0, c2^0, m^0, max^0, n^0, pos^0, seq^0, wpos^0, z^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004019s Ranking function: -6 - 6*m^0 + 6*max^0 New Graphs: Transitions: undef351, c2^0 -> undef282, wpos^0 -> 2 + wpos^0, rest remain the same}> Variables: c1^0, c2^0, m^0, max^0, n^0, pos^0, seq^0, wpos^0, z^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002697s Ranking function: (~(1) / 2) + (~(1) / 2)*wpos^0 New Graphs: Proving termination of subgraph 2 Analyzing SCC {l22}... No cycles found. Program Terminates