3.60/3.62 YES 3.60/3.62 3.60/3.62 Solver Timeout: 4 3.60/3.62 Global Timeout: 300 3.60/3.62 No parsing errors! 3.60/3.62 Init Location: 0 3.60/3.62 Transitions: 3.60/3.62 3.60/3.62 3.60/3.62 0}> 3.60/3.62 1}> 3.60/3.62 3.60/3.62 3.60/3.62 1}> 3.60/3.62 3.60/3.62 3.60/3.62 (1 + nj^0)}> 3.60/3.62 (0 + tmp___2^0)}> 3.60/3.62 3.60/3.62 1}> 3.60/3.62 0}> 3.60/3.62 3.60/3.62 3.60/3.62 0}> 3.60/3.62 3.60/3.62 3.60/3.62 0}> 3.60/3.62 3.60/3.62 3.60/3.62 (0 + tmp___1^0)}> 3.60/3.62 1}> 3.60/3.62 3.60/3.62 0}> 3.60/3.62 3.60/3.62 0}> 3.60/3.62 3.60/3.62 3.60/3.62 3.60/3.62 3.60/3.62 3.60/3.62 3.60/3.62 (1 + ni^0)}> 3.60/3.62 3.60/3.62 (0 + tmp___0^0), nj^0 -> 0}> 3.60/3.62 1}> 3.60/3.62 0}> 3.60/3.62 3.60/3.62 0}> 3.60/3.62 3.60/3.62 0}> 3.60/3.62 3.60/3.62 3.60/3.62 3.60/3.62 3.60/3.62 0}> 3.60/3.62 (1 + ni^0)}> 3.60/3.62 1, bNoCapture^0 -> 1, nDim^0 -> (0 + __const_9^0), ni^0 -> 0, tmp^0 -> undef535}> 3.60/3.62 3.60/3.62 3.60/3.62 Fresh variables: 3.60/3.62 undef535, 3.60/3.62 3.60/3.62 Undef variables: 3.60/3.62 undef535, 3.60/3.62 3.60/3.62 Abstraction variables: 3.60/3.62 3.60/3.62 Exit nodes: 3.60/3.62 3.60/3.62 Accepting locations: 3.60/3.62 3.60/3.62 Asserts: 3.60/3.62 3.60/3.62 Preprocessed LLVMGraph 3.60/3.62 Init Location: 0 3.60/3.62 Transitions: 3.60/3.62 3.60/3.62 (1 + ni^0)}> 3.60/3.62 (1 + ni^0)}> 3.60/3.62 (1 + ni^0)}> 3.60/3.62 (1 + ni^0)}> 3.60/3.62 (1 + ni^0)}> 3.60/3.62 (1 + ni^0)}> 3.60/3.62 (1 + ni^0)}> 3.60/3.62 (0 + 0), ni^0 -> (1 + ni^0), nj^0 -> 0}> 3.60/3.62 (0 + 0), ni^0 -> (1 + ni^0), nj^0 -> 0}> 3.60/3.62 (0 + 1), ni^0 -> (1 + ni^0), nj^0 -> 0}> 3.60/3.62 (0 + 0), ni^0 -> (1 + ni^0), nj^0 -> 0}> 3.60/3.62 (0 + 0), ni^0 -> (1 + ni^0), nj^0 -> 0}> 3.60/3.62 (0 + 1), ni^0 -> (1 + ni^0), nj^0 -> 0}> 3.60/3.62 (0 + 0), ni^0 -> (1 + ni^0), nj^0 -> 0}> 3.60/3.62 (1 + nj^0)}> 3.60/3.62 (0 + 0)}> 3.60/3.62 3.60/3.62 3.60/3.62 (0 + 0)}> 3.60/3.62 3.60/3.62 3.60/3.62 0}> 3.60/3.62 0}> 3.60/3.62 0}> 3.60/3.62 0}> 3.60/3.62 0}> 3.60/3.62 0}> 3.60/3.62 0}> 3.60/3.62 (0 + 0), ni^0 -> 0, nj^0 -> 0}> 3.60/3.62 (0 + 0), ni^0 -> 0, nj^0 -> 0}> 3.60/3.62 (0 + 1), ni^0 -> 0, nj^0 -> 0}> 3.60/3.62 (0 + 0), ni^0 -> 0, nj^0 -> 0}> 3.60/3.62 (0 + 0), ni^0 -> 0, nj^0 -> 0}> 3.60/3.62 (0 + 1), ni^0 -> 0, nj^0 -> 0}> 3.60/3.62 (0 + 0), ni^0 -> 0, nj^0 -> 0}> 3.60/3.62 (1 + ni^0)}> 3.60/3.62 (0 + 0), nj^0 -> (1 + nj^0)}> 3.60/3.62 (0 + 0), nj^0 -> (1 + nj^0)}> 3.60/3.62 (0 + 0), nj^0 -> (1 + nj^0)}> 3.60/3.62 (0 + 1), nj^0 -> (1 + nj^0)}> 3.60/3.62 (0 + 1), nj^0 -> (1 + nj^0)}> 3.60/3.62 (0 + 0), nj^0 -> (1 + nj^0)}> 3.60/3.62 (0 + 1), nj^0 -> (1 + nj^0)}> 3.60/3.62 (0 + 1), nj^0 -> (1 + nj^0)}> 3.60/3.62 (0 + 0), nj^0 -> (1 + nj^0)}> 3.60/3.62 (0 + 0), nj^0 -> (1 + nj^0)}> 3.60/3.62 (0 + 1), nj^0 -> (1 + nj^0)}> 3.60/3.62 (0 + 1), nj^0 -> (1 + nj^0)}> 3.60/3.62 (0 + 0), nj^0 -> (1 + nj^0)}> 3.60/3.62 (0 + 1), nj^0 -> (1 + nj^0)}> 3.60/3.62 (0 + 1), nj^0 -> (1 + nj^0)}> 3.60/3.62 (0 + 1)}> 3.60/3.62 (0 + 0)}> 3.60/3.62 (0 + 1)}> 3.60/3.62 3.60/3.62 Fresh variables: 3.60/3.62 undef535, 3.60/3.62 3.60/3.62 Undef variables: 3.60/3.62 undef535, 3.60/3.62 3.60/3.62 Abstraction variables: 3.60/3.62 3.60/3.62 Exit nodes: 3.60/3.62 3.60/3.62 Accepting locations: 3.60/3.62 3.60/3.62 Asserts: 3.60/3.62 3.60/3.62 ************************************************************* 3.60/3.62 ******************************************************************************************* 3.60/3.62 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 3.60/3.62 ******************************************************************************************* 3.60/3.62 3.60/3.62 Init Location: 0 3.60/3.62 Graph 0: 3.60/3.62 Transitions: 3.60/3.62 Variables: 3.60/3.62 3.60/3.62 Graph 1: 3.60/3.62 Transitions: 3.60/3.62 1 + ni^0, rest remain the same}> 3.60/3.62 Variables: 3.60/3.62 nDim^0, ni^0 3.60/3.62 3.60/3.62 Graph 2: 3.60/3.62 Transitions: 3.60/3.62 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 3.60/3.62 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 3.60/3.62 1, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 3.60/3.62 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 3.60/3.62 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 3.60/3.62 1, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 3.60/3.62 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 3.60/3.62 1 + nj^0, rest remain the same}> 3.60/3.62 0, rest remain the same}> 3.60/3.62 3.60/3.62 3.60/3.62 0, rest remain the same}> 3.60/3.62 3.60/3.62 3.60/3.62 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 1, rest remain the same}> 3.60/3.62 0, rest remain the same}> 3.60/3.62 1, rest remain the same}> 3.60/3.62 Variables: 3.60/3.62 bDomain^0, nDim^0, ni^0, nj^0, bNoCapture^0 3.60/3.62 3.60/3.62 Graph 3: 3.60/3.62 Transitions: 3.60/3.62 Variables: 3.60/3.62 3.60/3.62 Precedence: 3.60/3.62 Graph 0 3.60/3.62 3.60/3.62 Graph 1 3.60/3.62 3.60/3.62 3.60/3.62 Graph 2 3.60/3.62 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 3.60/3.62 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 3.60/3.62 1, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 3.60/3.62 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 3.60/3.62 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 3.60/3.62 1, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 3.60/3.62 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 3.60/3.62 3.60/3.62 Graph 3 3.60/3.62 1 + ni^0, rest remain the same}> 3.60/3.62 1 + ni^0, rest remain the same}> 3.60/3.62 1 + ni^0, rest remain the same}> 3.60/3.62 1 + ni^0, rest remain the same}> 3.60/3.62 1 + ni^0, rest remain the same}> 3.60/3.62 1 + ni^0, rest remain the same}> 3.60/3.62 1 + ni^0, rest remain the same}> 3.60/3.62 0, rest remain the same}> 3.60/3.62 0, rest remain the same}> 3.60/3.62 0, rest remain the same}> 3.60/3.62 0, rest remain the same}> 3.60/3.62 0, rest remain the same}> 3.60/3.62 0, rest remain the same}> 3.60/3.62 0, rest remain the same}> 3.60/3.62 3.60/3.62 Map Locations to Subgraph: 3.60/3.62 ( 0 , 0 ) 3.60/3.62 ( 2 , 3 ) 3.60/3.62 ( 7 , 2 ) 3.60/3.62 ( 9 , 1 ) 3.60/3.62 ( 14 , 2 ) 3.60/3.62 ( 17 , 2 ) 3.60/3.62 3.60/3.62 ******************************************************************************************* 3.60/3.62 ******************************** CHECKING ASSERTIONS ******************************** 3.60/3.62 ******************************************************************************************* 3.60/3.62 3.60/3.62 Proving termination of subgraph 0 3.60/3.62 Proving termination of subgraph 1 3.60/3.62 Checking unfeasibility... 3.60/3.62 Time used: 0.001893 3.60/3.62 3.60/3.62 Checking conditional termination of SCC {l9}... 3.60/3.62 3.60/3.62 LOG: CALL solveLinear 3.60/3.62 3.60/3.62 LOG: RETURN solveLinear - Elapsed time: 0.001038s 3.60/3.62 Ranking function: -1 + nDim^0 - ni^0 3.60/3.62 New Graphs: 3.60/3.62 Proving termination of subgraph 2 3.60/3.62 Checking unfeasibility... 3.60/3.62 Time used: 0.446934 3.60/3.62 Some transition disabled by a set of invariant(s): 3.60/3.62 Invariant at l14: 0 <= bNoCapture^0 3.60/3.62 Invariant at l17: nj^0 <= nDim^0 3.60/3.62 3.60/3.62 Strengthening and disabling transitions... 3.60/3.62 > It's unfeasible. Removing transition: 3.60/3.62 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 3.60/3.62 LOG: CALL solverLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: CALL solverLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: CALL solverLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: CALL solverLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: CALL solverLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: CALL solverLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: CALL solverLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.62 Strengthening transition (result): 3.60/3.62 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 3.60/3.62 LOG: CALL solverLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.62 Strengthening transition (result): 3.60/3.62 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 3.60/3.62 LOG: CALL solverLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.62 Strengthening transition (result): 3.60/3.62 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 3.60/3.62 LOG: CALL solverLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.62 Strengthening transition (result): 3.60/3.62 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 3.60/3.62 LOG: CALL solverLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.62 Strengthening transition (result): 3.60/3.62 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 3.60/3.62 LOG: CALL solverLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.62 Strengthening transition (result): 3.60/3.62 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 3.60/3.62 LOG: CALL solverLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.62 Strengthening transition (result): 3.60/3.62 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 3.60/3.62 LOG: CALL solverLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.62 Strengthening transition (result): 3.60/3.62 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.62 3.60/3.62 LOG: CALL solverLinear in Graph for feasibility 3.60/3.62 3.60/3.62 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.62 It's unfeasible. Removing transition: 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 It's unfeasible. Removing transition: 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 It's unfeasible. Removing transition: 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 It's unfeasible. Removing transition: 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 It's unfeasible. Removing transition: 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 It's unfeasible. Removing transition: 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 1, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 1, rest remain the same}> 3.60/3.63 Checking unfeasibility... 3.60/3.63 Time used: 0.413069 3.60/3.63 Some transition disabled by a set of invariant(s): 3.60/3.63 Invariant at l7: 0 <= bDomain^0 3.60/3.63 Invariant at l14: 0 <= bDomain^0 3.60/3.63 Invariant at l17: 0 <= bDomain^0 3.60/3.63 3.60/3.63 Strengthening and disabling transitions... 3.60/3.63 > It's unfeasible. Removing transition: 3.60/3.63 1, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 1, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 It's unfeasible. Removing transition: 3.60/3.63 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 It's unfeasible. Removing transition: 3.60/3.63 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 1 + nj^0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 1, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 0, rest remain the same}> 3.60/3.63 3.60/3.63 LOG: CALL solverLinear in Graph for feasibility 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear in Graph for feasibility 3.60/3.63 Strengthening transition (result): 3.60/3.63 1, rest remain the same}> 3.60/3.63 Checking unfeasibility... 3.60/3.63 Time used: 0.399752 3.60/3.63 3.60/3.63 Checking conditional termination of SCC {l7, l14, l17}... 3.60/3.63 3.60/3.63 LOG: CALL solveLinear 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear - Elapsed time: 0.028975s 3.60/3.63 Ranking function: -4 + 2*nDim^0 - 2*ni^0 3.60/3.63 New Graphs: 3.60/3.63 Transitions: 3.60/3.63 1 + nj^0, rest remain the same}> 3.60/3.63 0, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 0, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 0, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 0, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 0, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 0, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 Variables: 3.60/3.63 bDomain^0, bNoCapture^0, nDim^0, ni^0, nj^0 3.60/3.63 Checking conditional termination of SCC {l7, l14}... 3.60/3.63 3.60/3.63 LOG: CALL solveLinear 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear - Elapsed time: 0.018314s 3.60/3.63 Ranking function: -3 + 3*nDim^0 - 2*ni^0 - nj^0 3.60/3.63 New Graphs: 3.60/3.63 Transitions: 3.60/3.63 0, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 0, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 0, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 0, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 0, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 0, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 Variables: 3.60/3.63 bDomain^0, bNoCapture^0, nDim^0, ni^0, nj^0 3.60/3.63 Checking conditional termination of SCC {l7, l14}... 3.60/3.63 3.60/3.63 LOG: CALL solveLinear 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear - Elapsed time: 0.014283s 3.60/3.63 3.60/3.63 LOG: CALL solveLinear 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear - Elapsed time: 0.409387s 3.60/3.63 Trying to remove transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 Solving with 1 template(s). 3.60/3.63 3.60/3.63 LOG: CALL solveNonLinearGetFirstSolution 3.60/3.63 3.60/3.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.131901s 3.60/3.63 Time used: 0.095604 3.60/3.63 Trying to remove transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 Solving with 1 template(s). 3.60/3.63 3.60/3.63 LOG: CALL solveNonLinearGetFirstSolution 3.60/3.63 3.60/3.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.095815s 3.60/3.63 Time used: 0.076779 3.60/3.63 Trying to remove transition: 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 Solving with 1 template(s). 3.60/3.63 3.60/3.63 LOG: CALL solveNonLinearGetFirstSolution 3.60/3.63 3.60/3.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.173102s 3.60/3.63 Time used: 0.154047 3.60/3.63 3.60/3.63 LOG: SAT solveNonLinear - Elapsed time: 0.173102s 3.60/3.63 Cost: 0; Total time: 0.154047 3.60/3.63 Termination implied by a set of quasi-invariant(s): 3.60/3.63 Quasi-invariant at l7: 0 <= bNoCapture^0 3.60/3.63 Quasi-invariant at l14: 0 <= bNoCapture^0 3.60/3.63 Ranking function: bNoCapture^0 3.60/3.63 Ranking function and negation of Quasi-Invariant applied 3.60/3.63 New Graphs: 3.60/3.63 Transitions: 3.60/3.63 0, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 0, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 0, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 0, rest remain the same}> 3.60/3.63 1, rest remain the same}> 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 Variables: 3.60/3.63 bDomain^0, bNoCapture^0, nDim^0, ni^0, nj^0 3.60/3.63 Checking conditional termination of SCC {l7, l14}... 3.60/3.63 3.60/3.63 LOG: CALL solveLinear 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear - Elapsed time: 0.011246s 3.60/3.63 3.60/3.63 LOG: CALL solveLinear 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear - Elapsed time: 0.200664s 3.60/3.63 Trying to remove transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 Solving with 1 template(s). 3.60/3.63 3.60/3.63 LOG: CALL solveNonLinearGetFirstSolution 3.60/3.63 3.60/3.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.067597s 3.60/3.63 Time used: 0.057687 3.60/3.63 Trying to remove transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 Solving with 1 template(s). 3.60/3.63 3.60/3.63 LOG: CALL solveNonLinearGetFirstSolution 3.60/3.63 3.60/3.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.070929s 3.60/3.63 Time used: 0.058522 3.60/3.63 Trying to remove transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 Solving with 1 template(s). 3.60/3.63 3.60/3.63 LOG: CALL solveNonLinearGetFirstSolution 3.60/3.63 3.60/3.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.069760s 3.60/3.63 Time used: 0.057373 3.60/3.63 Trying to remove transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 Solving with 1 template(s). 3.60/3.63 3.60/3.63 LOG: CALL solveNonLinearGetFirstSolution 3.60/3.63 3.60/3.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.071075s 3.60/3.63 Time used: 0.058671 3.60/3.63 Trying to remove transition: 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 Solving with 1 template(s). 3.60/3.63 3.60/3.63 LOG: CALL solveNonLinearGetFirstSolution 3.60/3.63 3.60/3.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.071519s 3.60/3.63 Time used: 0.058857 3.60/3.63 Trying to remove transition: 1, rest remain the same}> 3.60/3.63 Solving with 1 template(s). 3.60/3.63 3.60/3.63 LOG: CALL solveNonLinearGetFirstSolution 3.60/3.63 3.60/3.63 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.249600s 3.60/3.63 Time used: 0.237213 3.60/3.63 3.60/3.63 LOG: SAT solveNonLinear - Elapsed time: 0.249600s 3.60/3.63 Cost: 0; Total time: 0.237213 3.60/3.63 Termination implied by a set of quasi-invariant(s): 3.60/3.63 Quasi-invariant at l7: bNoCapture^0 <= 1 3.60/3.63 Quasi-invariant at l14: bNoCapture^0 <= 1 3.60/3.63 Ranking function: -bNoCapture^0 3.60/3.63 Ranking function and negation of Quasi-Invariant applied 3.60/3.63 It's unfeasible after collapsing. Removing transition: 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 It's unfeasible after collapsing. Removing transition: 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 It's unfeasible after collapsing. Removing transition: 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 It's unfeasible after collapsing. Removing transition: 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 It's unfeasible after collapsing. Removing transition: 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 It's unfeasible after collapsing. Removing transition: 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 It's unfeasible after collapsing. Removing transition: 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 It's unfeasible after collapsing. Removing transition: 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 It's unfeasible after collapsing. Removing transition: 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 It's unfeasible after collapsing. Removing transition: 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 It's unfeasible after collapsing. Removing transition: 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 It's unfeasible after collapsing. Removing transition: 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 New Graphs: 3.60/3.63 Transitions: 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 0, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 1, nj^0 -> 1 + nj^0, rest remain the same}> 3.60/3.63 Variables: 3.60/3.63 bDomain^0, bNoCapture^0, nDim^0, ni^0, nj^0 3.60/3.63 Checking conditional termination of SCC {l7}... 3.60/3.63 3.60/3.63 LOG: CALL solveLinear 3.60/3.63 3.60/3.63 LOG: RETURN solveLinear - Elapsed time: 0.018664s 3.60/3.63 Ranking function: -1 + nDim^0 - nj^0 3.60/3.63 New Graphs: 3.60/3.63 Proving termination of subgraph 3 3.60/3.63 Analyzing SCC {l2}... 3.60/3.63 No cycles found. 3.60/3.63 3.60/3.63 Program Terminates 3.60/3.63 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 3.60/3.63 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 3.60/3.63 EOF