11.29/11.30 YES 11.29/11.30 11.29/11.30 Solver Timeout: 4 11.29/11.30 Global Timeout: 300 11.29/11.30 No parsing errors! 11.29/11.30 Init Location: 0 11.29/11.30 Transitions: 11.29/11.30 11.29/11.30 11.29/11.30 (1 + i^0)}> 11.29/11.30 (1 + i^0)}> 11.29/11.30 (1 + j^0)}> 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 (1 + k^0)}> 11.29/11.30 (1 + j^0)}> 11.29/11.30 (1 + i^0)}> 11.29/11.30 11.29/11.30 undef356}> 11.29/11.30 (1 + i^0), sum^0 -> undef387}> 11.29/11.30 11.29/11.30 0}> 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 undef644}> 11.29/11.30 11.29/11.30 (1 + i^0)}> 11.29/11.30 (1 + j^0)}> 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 undef984}> 11.29/11.30 11.29/11.30 (1 + i^0), sum^0 -> ((0 + sum^0) + tmp___1^0)}> 11.29/11.30 11.29/11.30 11.29/11.30 0}> 11.29/11.30 1}> 11.29/11.30 undef1192}> 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 (1 + i^0)}> 11.29/11.30 11.29/11.30 (0 + undef1382), tmp^0 -> undef1382}> 11.29/11.30 11.29/11.30 undef1445}> 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 (1 + i^0)}> 11.29/11.30 11.29/11.30 11.29/11.30 (0 + temp^0)}> 11.29/11.30 undef1938}> 11.29/11.30 (0 + maxarg2^0)}> 11.29/11.30 (0 + maxarg1^0)}> 11.29/11.30 11.29/11.30 11.29/11.30 (0 + undef2097), maxarg2^0 -> 1, tmp___10^0 -> undef2097, tmp___9^0 -> undef2108}> 11.29/11.30 (1 + its^0)}> 11.29/11.30 11.29/11.30 (1 + i^0)}> 11.29/11.30 0, test^0 -> 0}> 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 (1 + i^0)}> 11.29/11.30 11.29/11.30 (0 + undef2416), tmp___7^0 -> undef2416}> 11.29/11.30 undef2440}> 11.29/11.30 undef2479}> 11.29/11.30 11.29/11.30 11.29/11.30 (1 + i^0)}> 11.29/11.30 (1 + j^0), sum^0 -> undef2588}> 11.29/11.30 11.29/11.30 0}> 11.29/11.30 11.29/11.30 (0 + f_promoted_1^0)}> 11.29/11.30 (1 + i^0)}> 11.29/11.30 11.29/11.30 (~(1) + i^0)}> 11.29/11.30 (1 + j^0), sum^0 -> undef2836}> 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 (1 + i^0)}> 11.29/11.30 (1 + j^0), sum^0 -> undef2991}> 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 (1 + i^0)}> 11.29/11.30 11.29/11.30 (1 + i^0)}> 11.29/11.30 11.29/11.30 undef3283}> 11.29/11.30 ((0 + den^0) + tmp___6^0), i^0 -> (1 + i^0)}> 11.29/11.30 11.29/11.30 11.29/11.30 0}> 11.29/11.30 11.29/11.30 undef3455}> 11.29/11.30 11.29/11.30 (1 + i^0)}> 11.29/11.30 (1 + j^0), sum^0 -> undef3549}> 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 (1 + i^0)}> 11.29/11.30 11.29/11.30 0}> 11.29/11.30 11.29/11.30 undef3900, tmp___4^0 -> undef3901, tmp___5^0 -> undef3902}> 11.29/11.30 (1 + j^0), sum^0 -> undef3921}> 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 (1 + i^0)}> 11.29/11.30 (1 + j^0), sum^0 -> undef4076}> 11.29/11.30 1}> 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 Fresh variables: 11.29/11.30 undef356, undef387, undef644, undef984, undef1192, undef1382, undef1445, undef1938, undef2097, undef2108, undef2416, undef2440, undef2479, undef2588, undef2836, undef2991, undef3283, undef3455, undef3549, undef3900, undef3901, undef3902, undef3921, undef4076, 11.29/11.30 11.29/11.30 Undef variables: 11.29/11.30 undef356, undef387, undef644, undef984, undef1192, undef1382, undef1445, undef1938, undef2097, undef2108, undef2416, undef2440, undef2479, undef2588, undef2836, undef2991, undef3283, undef3455, undef3549, undef3900, undef3901, undef3902, undef3921, undef4076, 11.29/11.30 11.29/11.30 Abstraction variables: 11.29/11.30 11.29/11.30 Exit nodes: 11.29/11.30 11.29/11.30 Accepting locations: 11.29/11.30 11.29/11.30 Asserts: 11.29/11.30 11.29/11.30 Preprocessed LLVMGraph 11.29/11.30 Init Location: 0 11.29/11.30 Transitions: 11.29/11.30 11.29/11.30 1}> 11.29/11.30 1}> 11.29/11.30 (1 + i^0)}> 11.29/11.30 (1 + i^0)}> 11.29/11.30 (1 + i^0)}> 11.29/11.30 (1 + i^0)}> 11.29/11.30 (1 + j^0)}> 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 (1 + k^0)}> 11.29/11.30 (1 + k^0)}> 11.29/11.30 0}> 11.29/11.30 (1 + k^0)}> 11.29/11.30 0}> 11.29/11.30 (1 + j^0), k^0 -> (1 + k^0)}> 11.29/11.30 (1 + j^0), sum^0 -> 0}> 11.29/11.30 (1 + i^0)}> 11.29/11.30 (~(1) + i^0)}> 11.29/11.30 (~(1) + i^0)}> 11.29/11.30 (1 + j^0), sum^0 -> undef2836}> 11.29/11.30 undef356}> 11.29/11.30 (1 + i^0), sum^0 -> undef387}> 11.29/11.30 0}> 11.29/11.30 (1 + i^0)}> 11.29/11.30 1}> 11.29/11.30 1}> 11.29/11.30 (1 + i^0), sum^0 -> ((0 + sum^0) + undef984)}> 11.29/11.30 (1 + i^0), sum^0 -> ((0 + sum^0) + undef984)}> 11.29/11.30 (1 + i^0), sum^0 -> ((0 + sum^0) + 0)}> 11.29/11.30 0, test^0 -> 0}> 11.29/11.30 11.29/11.30 11.29/11.30 (1 + i^0)}> 11.29/11.30 (1 + i^0), test^0 -> (0 + undef2416)}> 11.29/11.30 11.29/11.30 11.29/11.30 (1 + i^0)}> 11.29/11.30 (1 + i^0), test^0 -> (0 + undef1382)}> 11.29/11.30 (1 + its^0)}> 11.29/11.30 (1 + its^0)}> 11.29/11.30 (1 + its^0)}> 11.29/11.30 (1 + its^0)}> 11.29/11.30 (1 + i^0)}> 11.29/11.30 (1 + its^0)}> 11.29/11.30 (1 + its^0)}> 11.29/11.30 (1 + its^0)}> 11.29/11.30 (1 + its^0)}> 11.29/11.30 11.29/11.30 (1 + i^0)}> 11.29/11.30 (1 + i^0), test^0 -> (0 + undef1938)}> 11.29/11.30 (1 + i^0)}> 11.29/11.30 (1 + i^0), test^0 -> (0 + undef1938)}> 11.29/11.30 11.29/11.30 Fresh variables: 11.29/11.30 undef356, undef387, undef644, undef984, undef1192, undef1382, undef1445, undef1938, undef2097, undef2108, undef2416, undef2440, undef2479, undef2588, undef2836, undef2991, undef3283, undef3455, undef3549, undef3900, undef3901, undef3902, undef3921, undef4076, 11.29/11.30 11.29/11.30 Undef variables: 11.29/11.30 undef356, undef387, undef644, undef984, undef1192, undef1382, undef1445, undef1938, undef2097, undef2108, undef2416, undef2440, undef2479, undef2588, undef2836, undef2991, undef3283, undef3455, undef3549, undef3900, undef3901, undef3902, undef3921, undef4076, 11.29/11.30 11.29/11.30 Abstraction variables: 11.29/11.30 11.29/11.30 Exit nodes: 11.29/11.30 11.29/11.30 Accepting locations: 11.29/11.30 11.29/11.30 Asserts: 11.29/11.30 11.29/11.30 ************************************************************* 11.29/11.30 ******************************************************************************************* 11.29/11.30 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 11.29/11.30 ******************************************************************************************* 11.29/11.30 11.29/11.30 Init Location: 0 11.29/11.30 Graph 0: 11.29/11.30 Transitions: 11.29/11.30 Variables: 11.29/11.30 11.29/11.30 Graph 1: 11.29/11.30 Transitions: 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 1 + i^0, test^0 -> undef1382, rest remain the same}> 11.29/11.30 Variables: 11.29/11.30 i^0, n^0, test^0 11.29/11.30 11.29/11.30 Graph 2: 11.29/11.30 Transitions: 11.29/11.30 1 + i^0, sum^0 -> sum^0 + undef984, rest remain the same}> 11.29/11.30 1 + i^0, sum^0 -> sum^0 + undef984, rest remain the same}> 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 Variables: 11.29/11.30 i^0, n^0, sum^0 11.29/11.30 11.29/11.30 Graph 3: 11.29/11.30 Transitions: 11.29/11.30 1, rest remain the same}> 11.29/11.30 1, rest remain the same}> 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 1 + j^0, rest remain the same}> 11.29/11.30 11.29/11.30 11.29/11.30 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 0, rest remain the same}> 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 0, rest remain the same}> 11.29/11.30 1 + j^0, k^0 -> 1 + k^0, rest remain the same}> 11.29/11.30 1 + j^0, sum^0 -> 0, rest remain the same}> 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 -1 + i^0, rest remain the same}> 11.29/11.30 -1 + i^0, rest remain the same}> 11.29/11.30 1 + j^0, sum^0 -> undef2836, rest remain the same}> 11.29/11.30 undef356, rest remain the same}> 11.29/11.30 1 + i^0, sum^0 -> undef387, rest remain the same}> 11.29/11.30 0, rest remain the same}> 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 0, test^0 -> 0, rest remain the same}> 11.29/11.30 11.29/11.30 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 1 + i^0, test^0 -> undef2416, rest remain the same}> 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 1 + i^0, test^0 -> undef1938, rest remain the same}> 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 1 + i^0, test^0 -> undef1938, rest remain the same}> 11.29/11.30 Variables: 11.29/11.30 i^0, n^0, j^0, k^0, sum^0, test^0, __const_200^0, its^0, restrt^0 11.29/11.30 11.29/11.30 Graph 4: 11.29/11.30 Transitions: 11.29/11.30 Variables: 11.29/11.30 11.29/11.30 Precedence: 11.29/11.30 Graph 0 11.29/11.30 11.29/11.30 Graph 1 11.29/11.30 11.29/11.30 11.29/11.30 Graph 2 11.29/11.30 11.29/11.30 11.29/11.30 Graph 3 11.29/11.30 1, rest remain the same}> 11.29/11.30 11.29/11.30 Graph 4 11.29/11.30 1, rest remain the same}> 11.29/11.30 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 11.29/11.30 Map Locations to Subgraph: 11.29/11.30 ( 0 , 0 ) 11.29/11.30 ( 3 , 3 ) 11.29/11.30 ( 6 , 3 ) 11.29/11.30 ( 12 , 3 ) 11.29/11.30 ( 15 , 3 ) 11.29/11.30 ( 16 , 3 ) 11.29/11.30 ( 19 , 3 ) 11.29/11.30 ( 22 , 3 ) 11.29/11.30 ( 33 , 4 ) 11.29/11.30 ( 38 , 2 ) 11.29/11.30 ( 42 , 3 ) 11.29/11.30 ( 46 , 1 ) 11.29/11.30 ( 49 , 3 ) 11.29/11.30 ( 54 , 3 ) 11.29/11.30 11.29/11.30 ******************************************************************************************* 11.29/11.30 ******************************** CHECKING ASSERTIONS ******************************** 11.29/11.30 ******************************************************************************************* 11.29/11.30 11.29/11.30 Proving termination of subgraph 0 11.29/11.30 Proving termination of subgraph 1 11.29/11.30 Checking unfeasibility... 11.29/11.30 Time used: 0.00385 11.29/11.30 11.29/11.30 Checking conditional termination of SCC {l46}... 11.29/11.30 11.29/11.30 LOG: CALL solveLinear 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear - Elapsed time: 0.003633s 11.29/11.30 Ranking function: -i^0 + n^0 11.29/11.30 New Graphs: 11.29/11.30 Proving termination of subgraph 2 11.29/11.30 Checking unfeasibility... 11.29/11.30 Time used: 0.009014 11.29/11.30 Some transition disabled by a set of invariant(s): 11.29/11.30 Invariant at l38: 1 + n^0 <= i^0 11.29/11.30 11.29/11.30 Strengthening and disabling transitions... 11.29/11.30 > It's unfeasible. Removing transition: 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 It's unfeasible. Removing transition: 11.29/11.30 1 + i^0, sum^0 -> sum^0 + undef984, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 It's unfeasible. Removing transition: 11.29/11.30 1 + i^0, sum^0 -> sum^0 + undef984, rest remain the same}> 11.29/11.30 Checking unfeasibility... 11.29/11.30 Time used: 0.000133 11.29/11.30 11.29/11.30 Analyzing SCC {l38}... 11.29/11.30 No cycles found. 11.29/11.30 11.29/11.30 Proving termination of subgraph 3 11.29/11.30 Checking unfeasibility... 11.29/11.30 Time used: 0.69095 11.29/11.30 Some transition disabled by a set of invariant(s): 11.29/11.30 Invariant at l6: n^0 <= 1 + k^0 11.29/11.30 Invariant at l12: n^0 <= i^0 11.29/11.30 Invariant at l16: 1 <= i^0 11.29/11.30 Invariant at l42: n^0 <= 1 + i^0 11.29/11.30 Invariant at l49: 1 + n^0 <= i^0 11.29/11.30 Invariant at l54: restrt^0 <= test^0 11.29/11.30 11.29/11.30 Strengthening and disabling transitions... 11.29/11.30 > It's unfeasible. Removing transition: 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 -1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 -1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, sum^0 -> undef2836, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, test^0 -> 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, test^0 -> undef2416, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, test^0 -> undef1938, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, test^0 -> undef1938, rest remain the same}> 11.29/11.30 Checking unfeasibility... 11.29/11.30 Time used: 0.991471 11.29/11.30 Some transition disabled by a set of invariant(s): 11.29/11.30 Invariant at l6: j^0 <= 1 + i^0 11.29/11.30 Invariant at l12: 1 + n^0 <= i^0 11.29/11.30 Invariant at l16: 1 <= i^0 11.29/11.30 Invariant at l19: j^0 <= 1 + i^0 11.29/11.30 Invariant at l42: n^0 <= 1 + i^0 11.29/11.30 Invariant at l49: 1 + n^0 <= i^0 11.29/11.30 Invariant at l54: restrt^0 <= 1 11.29/11.30 11.29/11.30 Strengthening and disabling transitions... 11.29/11.30 > It's unfeasible. Removing transition: 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 -1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 -1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, sum^0 -> undef2836, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 undef356, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, sum^0 -> undef387, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, test^0 -> 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, test^0 -> undef2416, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, test^0 -> undef1938, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, test^0 -> undef1938, rest remain the same}> 11.29/11.30 Checking unfeasibility... 11.29/11.30 Time used: 0.990284 11.29/11.30 Some transition disabled by a set of invariant(s): 11.29/11.30 Invariant at l3: restrt^0 <= 0 11.29/11.30 Invariant at l6: 1 <= 0 11.29/11.30 Invariant at l12: restrt^0 <= 1 11.29/11.30 Invariant at l15: restrt^0 <= 1 11.29/11.30 Invariant at l16: restrt^0 <= 1 11.29/11.30 Invariant at l19: restrt^0 <= 1 11.29/11.30 Invariant at l22: restrt^0 <= 1 11.29/11.30 Invariant at l42: restrt^0 <= 1 11.29/11.30 Invariant at l49: restrt^0 <= 1 11.29/11.30 Invariant at l54: 0 <= restrt^0 11.29/11.30 11.29/11.30 Strengthening and disabling transitions... 11.29/11.30 > It's unfeasible. Removing transition: 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 > It's unfeasible. Removing transition: 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 > It's unfeasible. Removing transition: 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 > It's unfeasible. Removing transition: 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 It's unfeasible. Removing transition: 11.29/11.30 1 + j^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, k^0 -> 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, sum^0 -> 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 -1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 -1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, sum^0 -> undef2836, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 undef356, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, sum^0 -> undef387, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, test^0 -> 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, test^0 -> undef2416, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, test^0 -> undef1938, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, test^0 -> undef1938, rest remain the same}> 11.29/11.30 Checking unfeasibility... 11.29/11.30 Time used: 1.03085 11.29/11.30 Some transition disabled by a set of invariant(s): 11.29/11.30 Invariant at l3: its^0 + n^0 <= 1 + __const_200^0 + i^0 + restrt^0 11.29/11.30 Invariant at l12: n^0 <= 1 + i^0 11.29/11.30 Invariant at l15: 1 + k^0 <= n^0 11.29/11.30 Invariant at l16: restrt^0 <= 1 11.29/11.30 Invariant at l19: 1 + k^0 <= n^0 11.29/11.30 Invariant at l42: 1 + n^0 <= i^0 11.29/11.30 Invariant at l49: 1 + n^0 <= i^0 11.29/11.30 Invariant at l54: 1 + n^0 <= i^0 11.29/11.30 11.29/11.30 Strengthening and disabling transitions... 11.29/11.30 > It's unfeasible. Removing transition: 11.29/11.30 1 + i^0, test^0 -> undef1938, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, k^0 -> 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, sum^0 -> 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 -1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 -1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, sum^0 -> undef2836, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 undef356, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, sum^0 -> undef387, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, test^0 -> 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 It's unfeasible. Removing transition: 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 It's unfeasible. Removing transition: 11.29/11.30 1 + i^0, test^0 -> undef2416, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 It's unfeasible. Removing transition: 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 It's unfeasible. Removing transition: 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 It's unfeasible. Removing transition: 11.29/11.30 1 + i^0, test^0 -> undef1938, rest remain the same}> 11.29/11.30 Checking unfeasibility... 11.29/11.30 Time used: 0.495258 11.29/11.30 Some transition disabled by a set of invariant(s): 11.29/11.30 Invariant at l3: 1 + n^0 <= i^0 + restrt^0 11.29/11.30 Invariant at l15: k^0 <= 1 + n^0 11.29/11.30 Invariant at l19: 1 + k^0 <= n^0 11.29/11.30 Invariant at l42: n^0 <= 1 + i^0 11.29/11.30 Invariant at l49: n^0 <= 1 + i^0 11.29/11.30 Invariant at l54: restrt^0 <= 0 11.29/11.30 11.29/11.30 Strengthening and disabling transitions... 11.29/11.30 > It's unfeasible. Removing transition: 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 It's unfeasible. Removing transition: 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, k^0 -> 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, sum^0 -> 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 undef356, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, sum^0 -> undef387, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, test^0 -> 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 Checking unfeasibility... 11.29/11.30 Time used: 0.514408 11.29/11.30 Some transition disabled by a set of invariant(s): 11.29/11.30 Invariant at l3: 0 <= restrt^0 11.29/11.30 Invariant at l12: 1 <= restrt^0 11.29/11.30 Invariant at l15: 1 <= restrt^0 11.29/11.30 Invariant at l16: 0 <= restrt^0 11.29/11.30 Invariant at l19: 1 <= restrt^0 11.29/11.30 Invariant at l22: 0 <= restrt^0 11.29/11.30 Invariant at l42: 0 <= restrt^0 11.29/11.30 Invariant at l49: 0 <= restrt^0 11.29/11.30 11.29/11.30 Strengthening and disabling transitions... 11.29/11.30 > It's unfeasible. Removing transition: 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, k^0 -> 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, sum^0 -> 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 -1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 -1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, sum^0 -> undef2836, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 undef356, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, sum^0 -> undef387, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, test^0 -> 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Checking unfeasibility... 11.29/11.30 Time used: 0.770547 11.29/11.30 Some transition disabled by a set of invariant(s): 11.29/11.30 Invariant at l3: its^0 + n^0 <= 1 + __const_200^0 + i^0 + restrt^0 11.29/11.30 Invariant at l12: n^0 <= i^0 11.29/11.30 Invariant at l15: 1 + k^0 + restrt^0 <= i^0 11.29/11.30 Invariant at l16: 0 <= 1 + i^0 + restrt^0 11.29/11.30 Invariant at l19: n^0 + restrt^0 <= i^0 11.29/11.30 Invariant at l42: n^0 <= i^0 11.29/11.30 Invariant at l49: 0 <= restrt^0 11.29/11.30 Invariant at l54: n^0 <= i^0 11.29/11.30 11.29/11.30 Strengthening and disabling transitions... 11.29/11.30 > It's unfeasible. Removing transition: 11.29/11.30 1 + i^0, sum^0 -> undef387, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, k^0 -> 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, sum^0 -> 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 -1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 -1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, sum^0 -> undef2836, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 undef356, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, test^0 -> 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + its^0, rest remain the same}> 11.29/11.30 Checking unfeasibility... 11.29/11.30 Time used: 0.624851 11.29/11.30 Some transition disabled by a set of invariant(s): 11.29/11.30 Invariant at l3: 0 <= restrt^0 11.29/11.30 Invariant at l15: 1 + n^0 <= i^0 11.29/11.30 Invariant at l16: 0 <= 1 + restrt^0 11.29/11.30 Invariant at l19: 1 + j^0 + k^0 + restrt^0 <= i^0 + n^0 11.29/11.30 Invariant at l42: 1 + n^0 <= i^0 + restrt^0 11.29/11.30 Invariant at l49: 0 <= restrt^0 11.29/11.30 Invariant at l54: test^0 <= 0 11.29/11.30 11.29/11.30 Strengthening and disabling transitions... 11.29/11.30 > It's unfeasible. Removing transition: 11.29/11.30 1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, k^0 -> 1 + k^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, sum^0 -> 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 -1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 -1 + i^0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 1 + j^0, sum^0 -> undef2836, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 undef356, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 0, test^0 -> 0, rest remain the same}> 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.30 Strengthening transition (result): 11.29/11.30 11.29/11.30 11.29/11.30 LOG: CALL solverLinear in Graph for feasibility 11.29/11.30 11.29/11.30 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.31 Strengthening transition (result): 11.29/11.31 1 + its^0, rest remain the same}> 11.29/11.31 11.29/11.31 LOG: CALL solverLinear in Graph for feasibility 11.29/11.31 11.29/11.31 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.31 Strengthening transition (result): 11.29/11.31 1 + its^0, rest remain the same}> 11.29/11.31 11.29/11.31 LOG: CALL solverLinear in Graph for feasibility 11.29/11.31 11.29/11.31 LOG: RETURN solveLinear in Graph for feasibility 11.29/11.31 Strengthening transition (result): 11.29/11.31 1 + its^0, rest remain the same}> 11.29/11.31 Checking unfeasibility... 11.29/11.31 Time used: 3.74966 11.29/11.31 11.29/11.31 Location 6 unreachable! 11.29/11.31 Checking conditional termination of SCC {l3, l12, l15, l16, l19, l22, l42, l49, l54}... 11.29/11.31 11.29/11.31 LOG: CALL solveLinear 11.29/11.31 11.29/11.31 LOG: RETURN solveLinear - Elapsed time: 0.033290s 11.29/11.31 Ranking function: -9 - 9*k^0 + 9*n^0 11.29/11.31 New Graphs: 11.29/11.31 Transitions: 11.29/11.31 1, rest remain the same}> 11.29/11.31 1, rest remain the same}> 11.29/11.31 -1 + i^0, rest remain the same}> 11.29/11.31 -1 + i^0, rest remain the same}> 11.29/11.31 1 + j^0, sum^0 -> undef2836, rest remain the same}> 11.29/11.31 1 + its^0, restrt^0 -> 0, test^0 -> 0, rest remain the same}> 11.29/11.31 1 + its^0, test^0 -> 0, rest remain the same}> 11.29/11.31 1 + its^0, test^0 -> 0, rest remain the same}> 11.29/11.31 1 + its^0, test^0 -> 0, rest remain the same}> 11.29/11.31 1 + its^0, test^0 -> 0, rest remain the same}> 11.29/11.31 1 + its^0, test^0 -> 0, rest remain the same}> 11.29/11.31 1 + its^0, test^0 -> 0, rest remain the same}> 11.29/11.31 1 + i^0, rest remain the same}> 11.29/11.31 Variables: 11.29/11.31 __const_200^0, i^0, its^0, j^0, k^0, n^0, restrt^0, sum^0, test^0 11.29/11.31 Transitions: 11.29/11.31 ((0 + 1) + 0) + j^0, sum^0 -> undef356, rest remain the same}> 11.29/11.31 Variables: 11.29/11.31 i^0, j^0, k^0, n^0, restrt^0, sum^0 11.29/11.31 Checking conditional termination of SCC {l3, l16, l22}... 11.29/11.31 11.29/11.31 LOG: CALL solveLinear 11.29/11.31 11.29/11.31 LOG: RETURN solveLinear - Elapsed time: 0.019586s 11.29/11.31 Ranking function: -2 + 3*__const_200^0 - 3*its^0 - restrt^0 11.29/11.31 New Graphs: 11.29/11.31 Transitions: 11.29/11.31 ((0 + 1) + 0) + j^0, sum^0 -> undef356, rest remain the same}> 11.29/11.31 Variables: 11.29/11.31 i^0, j^0, k^0, n^0, restrt^0, sum^0 11.29/11.31 Transitions: 11.29/11.31 -1 + i^0, rest remain the same}> 11.29/11.31 1 + j^0, sum^0 -> undef2836, rest remain the same}> 11.29/11.31 Variables: 11.29/11.31 i^0, j^0, restrt^0, sum^0 11.29/11.31 Transitions: 11.29/11.31 1 + i^0, rest remain the same}> 11.29/11.31 Variables: 11.29/11.31 i^0, n^0, restrt^0 11.29/11.31 Checking conditional termination of SCC {l15}... 11.29/11.31 11.29/11.31 LOG: CALL solveLinear 11.29/11.31 11.29/11.31 LOG: RETURN solveLinear - Elapsed time: 0.005050s 11.29/11.31 Ranking function: -1 - j^0 + n^0 11.29/11.31 New Graphs: 11.29/11.31 Transitions: 11.29/11.31 -1 + i^0, rest remain the same}> 11.29/11.31 1 + j^0, sum^0 -> undef2836, rest remain the same}> 11.29/11.31 Variables: 11.29/11.31 i^0, j^0, restrt^0, sum^0 11.29/11.31 Transitions: 11.29/11.31 1 + i^0, rest remain the same}> 11.29/11.31 Variables: 11.29/11.31 i^0, n^0, restrt^0 11.29/11.31 Checking conditional termination of SCC {l16}... 11.29/11.31 11.29/11.31 LOG: CALL solveLinear 11.29/11.31 11.29/11.31 LOG: RETURN solveLinear - Elapsed time: 0.005454s 11.29/11.31 Ranking function: 2*i^0 - 2*j^0 11.29/11.31 New Graphs: 11.29/11.31 Transitions: 11.29/11.31 1 + i^0, rest remain the same}> 11.29/11.31 Variables: 11.29/11.31 i^0, n^0, restrt^0 11.29/11.31 Transitions: 11.29/11.31 -1 + i^0, rest remain the same}> 11.29/11.31 Variables: 11.29/11.31 i^0, j^0, restrt^0 11.29/11.31 Checking conditional termination of SCC {l22}... 11.29/11.31 11.29/11.31 LOG: CALL solveLinear 11.29/11.31 11.29/11.31 LOG: RETURN solveLinear - Elapsed time: 0.004069s 11.29/11.31 Ranking function: -i^0 + n^0 11.29/11.31 New Graphs: 11.29/11.31 Transitions: 11.29/11.31 -1 + i^0, rest remain the same}> 11.29/11.31 Variables: 11.29/11.31 i^0, j^0, restrt^0 11.29/11.31 Checking conditional termination of SCC {l16}... 11.29/11.31 11.29/11.31 LOG: CALL solveLinear 11.29/11.31 11.29/11.31 LOG: RETURN solveLinear - Elapsed time: 0.004250s 11.29/11.31 Ranking function: 1 + i^0 + restrt^0 11.29/11.31 New Graphs: 11.29/11.31 Proving termination of subgraph 4 11.29/11.31 Analyzing SCC {l33}... 11.29/11.31 No cycles found. 11.29/11.31 11.29/11.31 Program Terminates 11.29/11.31 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 11.29/11.31 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 11.29/11.31 EOF