1.37/1.38 YES 1.37/1.38 1.37/1.38 Solver Timeout: 4 1.37/1.38 Global Timeout: 300 1.37/1.38 No parsing errors! 1.37/1.38 Init Location: 0 1.37/1.38 Transitions: 1.37/1.38 1.37/1.38 1.37/1.38 (0 + m^0), x^0 -> 0}> 1.37/1.38 1.37/1.38 1.37/1.38 (1 + m^0)}> 1.37/1.38 (1 + i^0)}> 1.37/1.38 1.37/1.38 1.37/1.38 (1 + j^0)}> 1.37/1.38 1.37/1.38 (1 + j^0)}> 1.37/1.38 undef96}> 1.37/1.38 1.37/1.38 1.37/1.38 1.37/1.38 1.37/1.38 1.37/1.38 undef144}> 1.37/1.38 1.37/1.38 1.37/1.38 1.37/1.38 1.37/1.38 1.37/1.38 (1 + j^0), y^0 -> undef192}> 1.37/1.38 1.37/1.38 (1 + j^0), y^0 -> undef208}> 1.37/1.38 1.37/1.38 1.37/1.38 1.37/1.38 1.37/1.38 (1 + j^0)}> 1.37/1.38 1.37/1.38 (0 + j^0), x^0 -> undef263}> 1.37/1.38 1.37/1.38 undef277, tmp___0^0 -> undef278}> 1.37/1.38 1.37/1.38 1.37/1.38 1.37/1.38 Fresh variables: 1.37/1.38 undef96, undef144, undef192, undef208, undef263, undef277, undef278, 1.37/1.38 1.37/1.38 Undef variables: 1.37/1.38 undef96, undef144, undef192, undef208, undef263, undef277, undef278, 1.37/1.38 1.37/1.38 Abstraction variables: 1.37/1.38 1.37/1.38 Exit nodes: 1.37/1.38 1.37/1.38 Accepting locations: 1.37/1.38 1.37/1.38 Asserts: 1.37/1.38 1.37/1.38 Preprocessed LLVMGraph 1.37/1.38 Init Location: 0 1.37/1.38 Transitions: 1.37/1.38 1.37/1.38 (0 + m^0), x^0 -> 0}> 1.37/1.38 (1 + m^0)}> 1.37/1.38 (0 + (1 + m^0)), m^0 -> (1 + m^0), x^0 -> 0}> 1.37/1.38 1.37/1.38 1.37/1.38 1.37/1.38 1.37/1.38 (1 + j^0)}> 1.37/1.38 (0 + j^0), j^0 -> (1 + j^0), x^0 -> undef263}> 1.37/1.38 1.37/1.38 (1 + j^0)}> 1.37/1.38 (1 + m^0)}> 1.37/1.38 (0 + (1 + m^0)), m^0 -> (1 + m^0), x^0 -> 0}> 1.37/1.38 (1 + i^0)}> 1.37/1.38 1.37/1.38 1.37/1.38 (1 + m^0)}> 1.37/1.38 (0 + (1 + m^0)), m^0 -> (1 + m^0), x^0 -> 0}> 1.37/1.38 1.37/1.38 1.37/1.38 (1 + j^0)}> 1.37/1.38 (1 + i^0)}> 1.37/1.38 (1 + j^0)}> 1.37/1.38 1.37/1.38 (1 + j^0)}> 1.37/1.38 1.37/1.38 Fresh variables: 1.37/1.38 undef96, undef144, undef192, undef208, undef263, undef277, undef278, 1.37/1.38 1.37/1.38 Undef variables: 1.37/1.38 undef96, undef144, undef192, undef208, undef263, undef277, undef278, 1.37/1.38 1.37/1.38 Abstraction variables: 1.37/1.38 1.37/1.38 Exit nodes: 1.37/1.38 1.37/1.38 Accepting locations: 1.37/1.38 1.37/1.38 Asserts: 1.37/1.38 1.37/1.38 ************************************************************* 1.37/1.38 ******************************************************************************************* 1.37/1.38 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 1.37/1.38 ******************************************************************************************* 1.37/1.38 1.37/1.38 Init Location: 0 1.37/1.38 Graph 0: 1.37/1.38 Transitions: 1.37/1.38 Variables: 1.37/1.38 1.37/1.38 Graph 1: 1.37/1.38 Transitions: 1.37/1.38 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}> 1.37/1.38 1.37/1.38 1.37/1.38 1.37/1.38 1.37/1.38 1 + j^0, rest remain the same}> 1.37/1.38 j^0, j^0 -> 1 + j^0, x^0 -> undef263, rest remain the same}> 1.37/1.38 1.37/1.38 1 + j^0, rest remain the same}> 1.37/1.38 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}> 1.37/1.38 1 + i^0, rest remain the same}> 1.37/1.38 1.37/1.38 1.37/1.38 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}> 1.37/1.38 1.37/1.38 1.37/1.38 1 + j^0, rest remain the same}> 1.37/1.38 1 + i^0, rest remain the same}> 1.37/1.38 1 + j^0, rest remain the same}> 1.37/1.38 1.37/1.38 1 + j^0, rest remain the same}> 1.37/1.38 Variables: 1.37/1.38 i^0, j^0, m^0, n^0, x^0 1.37/1.38 1.37/1.38 Graph 2: 1.37/1.38 Transitions: 1.37/1.38 Variables: 1.37/1.38 1.37/1.38 Precedence: 1.37/1.38 Graph 0 1.37/1.38 1.37/1.38 Graph 1 1.37/1.38 m^0, x^0 -> 0, rest remain the same}> 1.37/1.38 1.37/1.38 Graph 2 1.37/1.38 1.37/1.38 1 + m^0, rest remain the same}> 1.37/1.38 1 + m^0, rest remain the same}> 1.37/1.38 1 + m^0, rest remain the same}> 1.37/1.38 1.37/1.38 Map Locations to Subgraph: 1.37/1.38 ( 0 , 0 ) 1.37/1.38 ( 2 , 2 ) 1.37/1.38 ( 3 , 1 ) 1.37/1.38 ( 5 , 1 ) 1.37/1.38 ( 10 , 1 ) 1.37/1.38 ( 11 , 1 ) 1.37/1.38 ( 14 , 1 ) 1.37/1.38 ( 16 , 1 ) 1.37/1.38 1.37/1.38 ******************************************************************************************* 1.37/1.38 ******************************** CHECKING ASSERTIONS ******************************** 1.37/1.38 ******************************************************************************************* 1.37/1.38 1.37/1.38 Proving termination of subgraph 0 1.37/1.38 Proving termination of subgraph 1 1.37/1.38 Checking unfeasibility... 1.37/1.38 Time used: 0.298144 1.37/1.38 Some transition disabled by a set of invariant(s): 1.37/1.38 Invariant at l14: 1 + n^0 <= j^0 1.37/1.38 1.37/1.38 Strengthening and disabling transitions... 1.37/1.38 > It's unfeasible. Removing transition: 1.37/1.38 1 + j^0, rest remain the same}> 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1 + i^0, rest remain the same}> 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Checking unfeasibility... 1.37/1.38 Time used: 0.132375 1.37/1.38 Some transition disabled by a set of invariant(s): 1.37/1.38 Invariant at l3: 1 + m^0 <= n^0 1.37/1.38 Invariant at l5: 1 + n^0 <= j^0 1.37/1.38 Invariant at l10: n^0 <= 1 + j^0 1.37/1.38 Invariant at l14: i^0 <= 1 + j^0 1.37/1.38 Invariant at l16: i^0 <= 1 + j^0 1.37/1.38 1.37/1.38 Strengthening and disabling transitions... 1.37/1.38 > It's unfeasible. Removing transition: 1.37/1.38 1 + j^0, rest remain the same}> 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}> 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1 + j^0, rest remain the same}> 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 j^0, j^0 -> 1 + j^0, x^0 -> undef263, rest remain the same}> 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}> 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1 + i^0, rest remain the same}> 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1 + i^0, rest remain the same}> 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1 + j^0, rest remain the same}> 1.37/1.38 Checking unfeasibility... 1.37/1.38 Time used: 0.163462 1.37/1.38 Some transition disabled by a set of invariant(s): 1.37/1.38 Invariant at l5: 1 + m^0 <= n^0 1.37/1.38 Invariant at l10: 1 + n^0 <= j^0 1.37/1.38 Invariant at l11: 1 + m^0 <= n^0 1.37/1.38 Invariant at l16: 1 + n^0 <= j^0 1.37/1.38 1.37/1.38 Strengthening and disabling transitions... 1.37/1.38 > It's unfeasible. Removing transition: 1.37/1.38 1 + j^0, rest remain the same}> 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}> 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1 + i^0, rest remain the same}> 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}> 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1 + j^0, rest remain the same}> 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 Checking unfeasibility... 1.37/1.38 Time used: 0.198546 1.37/1.38 Some transition disabled by a set of invariant(s): 1.37/1.38 Invariant at l3: 1 + m^0 <= n^0 1.37/1.38 Invariant at l5: n^0 <= j^0 1.37/1.38 Invariant at l11: 1 + n^0 <= j^0 1.37/1.38 1.37/1.38 Strengthening and disabling transitions... 1.37/1.38 > It's unfeasible. Removing transition: 1.37/1.38 1 + j^0, rest remain the same}> 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}> 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1 + j^0, rest remain the same}> 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 j^0, j^0 -> 1 + j^0, x^0 -> undef263, rest remain the same}> 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}> 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 1.37/1.38 LOG: CALL solverLinear in Graph for feasibility 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear in Graph for feasibility 1.37/1.38 Strengthening transition (result): 1.37/1.38 1.37/1.38 Checking unfeasibility... 1.37/1.38 Time used: 0.323912 1.37/1.38 1.37/1.38 Checking conditional termination of SCC {l3, l5, l10, l11, l14, l16}... 1.37/1.38 1.37/1.38 LOG: CALL solveLinear 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear - Elapsed time: 0.016988s 1.37/1.38 Ranking function: -2 - 8*j^0 - 2*m^0 + 10*n^0 1.37/1.38 New Graphs: 1.37/1.38 Transitions: 1.37/1.38 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}> 1.37/1.38 1.37/1.38 1.37/1.38 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}> 1.37/1.38 1.37/1.38 1.37/1.38 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}> 1.37/1.38 1.37/1.38 1.37/1.38 1 + m^0, m^0 -> 1 + m^0, x^0 -> 0, rest remain the same}> 1.37/1.38 1 + i^0, rest remain the same}> 1.37/1.38 1 + i^0, rest remain the same}> 1.37/1.38 1 + i^0, rest remain the same}> 1.37/1.38 Variables: 1.37/1.38 i^0, j^0, m^0, n^0, x^0 1.37/1.38 Checking conditional termination of SCC {l3, l10}... 1.37/1.38 1.37/1.38 LOG: CALL solveLinear 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear - Elapsed time: 0.006356s 1.37/1.38 Ranking function: -5 + (~(9) / 2)*m^0 + (9 / 2)*n^0 1.37/1.38 New Graphs: 1.37/1.38 Transitions: 1.37/1.38 1 + i^0, rest remain the same}> 1.37/1.38 1 + i^0, rest remain the same}> 1.37/1.38 1 + i^0, rest remain the same}> 1.37/1.38 Variables: 1.37/1.38 i^0, j^0, n^0 1.37/1.38 Checking conditional termination of SCC {l10}... 1.37/1.38 1.37/1.38 LOG: CALL solveLinear 1.37/1.38 1.37/1.38 LOG: RETURN solveLinear - Elapsed time: 0.002888s 1.37/1.38 Ranking function: -i^0 + n^0 1.37/1.38 New Graphs: 1.37/1.38 Proving termination of subgraph 2 1.37/1.38 Analyzing SCC {l2}... 1.37/1.38 No cycles found. 1.37/1.38 1.37/1.38 Program Terminates 1.37/1.38 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 1.37/1.38 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 1.37/1.38 EOF