11.27/11.31 NO 11.27/11.31 11.27/11.31 Solver Timeout: 4 11.27/11.31 Global Timeout: 300 11.27/11.31 No parsing errors! 11.27/11.31 Init Location: 0 11.27/11.31 Transitions: 11.27/11.31 11.27/11.31 ~(1)) /\ (arg2 > 0) /\ (undef2 <= arg1) /\ (arg1 > 0) /\ (undef1 > 2) /\ (undef2 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> arg2, arg4 -> undef4, arg5 -> undef5}> 11.27/11.31 0) /\ (undef8 <= arg1) /\ (arg1 > 0) /\ (undef7 > 1) /\ (undef8 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> arg2, arg4 -> undef10, arg5 -> undef11}> 11.27/11.31 = undef12) /\ (arg3 > 1) /\ (undef12 <= arg2) /\ (arg1 >= undef13) /\ (arg1 >= (undef14 - 1)) /\ ((undef14 - 1) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef12 > 0) /\ (undef13 > 0) /\ (undef14 > 1) /\ (arg1 >= (undef16 + 2)), par{arg1 -> undef12, arg2 -> undef13, arg3 -> undef14, arg4 -> arg3, arg5 -> undef16}> 11.27/11.31 ~(1)) /\ (arg3 > 1) /\ (undef17 <= arg1) /\ (undef17 <= arg2) /\ (undef18 <= arg1) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef17 > 0) /\ (undef18 > 0) /\ (undef19 > 2) /\ ((undef21 + 2) <= arg1), par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> arg3, arg5 -> undef21}> 11.27/11.31 ~(1)) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> undef23, arg2 -> undef24, arg3 -> undef25, arg4 -> undef26, arg5 -> undef27}> 11.27/11.31 ~(1)) /\ (arg3 > 1) /\ (arg1 > 0) /\ (arg2 > 0), par{arg1 -> undef28, arg2 -> undef29, arg3 -> undef30, arg4 -> undef31, arg5 -> undef32}> 11.27/11.31 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, arg5 -> undef37}> 11.27/11.31 1) /\ (undef39 <= arg3) /\ (undef40 <= arg3) /\ ((undef41 + 1) <= arg3) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef38 > 0) /\ (undef39 > 0) /\ (undef40 > 0) /\ (undef41 > ~(1)) /\ ((arg5 + 2) <= arg2), par{arg1 -> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, arg5 -> undef42}> 11.27/11.31 0) /\ (arg2 > 1) /\ (arg3 > 2) /\ (arg4 > 0) /\ (undef43 > 0) /\ (undef44 > 2) /\ (undef45 > 2) /\ (undef46 > 0), par{arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, arg5 -> undef47}> 11.27/11.31 2) /\ (arg2 > 2) /\ (arg3 > 2) /\ (arg4 > 0) /\ (undef48 > 0) /\ (undef49 > 0) /\ (undef50 > 2) /\ (undef51 > 0), par{arg1 -> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, arg5 -> undef52}> 11.27/11.31 undef53, arg2 -> undef54, arg3 -> undef55, arg4 -> undef56, arg5 -> undef57}> 11.27/11.31 11.27/11.31 Fresh variables: 11.27/11.31 undef1, undef2, undef4, undef5, undef6, undef7, undef8, undef10, undef11, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, 11.27/11.31 11.27/11.31 Undef variables: 11.27/11.31 undef1, undef2, undef4, undef5, undef6, undef7, undef8, undef10, undef11, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, 11.27/11.31 11.27/11.31 Abstraction variables: 11.27/11.31 11.27/11.31 Exit nodes: 11.27/11.31 11.27/11.31 Accepting locations: 11.27/11.31 11.27/11.31 Asserts: 11.27/11.31 11.27/11.31 Preprocessed LLVMGraph 11.27/11.31 Init Location: 0 11.27/11.31 Transitions: 11.27/11.31 ~(1)) /\ (undef54 > 0) /\ (undef2 <= undef53) /\ (undef53 > 0) /\ (undef1 > 2) /\ (undef2 > 0) /\ (undef1 >= undef12) /\ (undef54 > 1) /\ (undef12 <= undef2) /\ (undef1 >= undef13) /\ (undef1 >= (undef14 - 1)) /\ ((undef14 - 1) <= undef2) /\ (undef1 > 0) /\ (undef2 > 0) /\ (undef12 > 0) /\ (undef13 > 0) /\ (undef14 > 1) /\ (undef1 >= (undef16 + 2)) /\ (undef38 <= undef13) /\ (undef54 > 1) /\ (undef39 <= undef14) /\ (undef40 <= undef14) /\ ((undef41 + 1) <= undef14) /\ (undef12 > 0) /\ (undef13 > 0) /\ (undef14 > 0) /\ (undef38 > 0) /\ (undef39 > 0) /\ (undef40 > 0) /\ (undef41 > ~(1)) /\ ((undef16 + 2) <= undef13), par{arg1 -> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41}> 11.27/11.31 ~(1)) /\ (undef54 > 0) /\ (undef2 <= undef53) /\ (undef53 > 0) /\ (undef1 > 2) /\ (undef2 > 0) /\ (undef22 > ~(1)) /\ (undef54 > 1) /\ (undef17 <= undef1) /\ (undef17 <= undef2) /\ (undef18 <= undef1) /\ (undef1 > 0) /\ (undef2 > 0) /\ (undef17 > 0) /\ (undef18 > 0) /\ (undef19 > 2) /\ ((undef21 + 2) <= undef1) /\ (undef38 <= undef18) /\ (undef54 > 1) /\ (undef39 <= undef19) /\ (undef40 <= undef19) /\ ((undef41 + 1) <= undef19) /\ (undef17 > 0) /\ (undef18 > 0) /\ (undef19 > 0) /\ (undef38 > 0) /\ (undef39 > 0) /\ (undef40 > 0) /\ (undef41 > ~(1)) /\ ((undef21 + 2) <= undef18), par{arg1 -> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41}> 11.27/11.31 ~(1)) /\ (undef54 > 0) /\ (undef2 <= undef53) /\ (undef53 > 0) /\ (undef1 > 2) /\ (undef2 > 0) /\ (undef28 > ~(1)) /\ (undef54 > 1) /\ (undef1 > 0) /\ (undef2 > 0), par{arg1 -> undef28, arg2 -> undef29, arg3 -> undef30, arg4 -> undef31}> 11.27/11.31 0) /\ (undef8 <= undef53) /\ (undef53 > 0) /\ (undef7 > 1) /\ (undef8 > 0) /\ (undef7 >= undef12) /\ (undef54 > 1) /\ (undef12 <= undef8) /\ (undef7 >= undef13) /\ (undef7 >= (undef14 - 1)) /\ ((undef14 - 1) <= undef8) /\ (undef7 > 0) /\ (undef8 > 0) /\ (undef12 > 0) /\ (undef13 > 0) /\ (undef14 > 1) /\ (undef7 >= (undef16 + 2)) /\ (undef38 <= undef13) /\ (undef54 > 1) /\ (undef39 <= undef14) /\ (undef40 <= undef14) /\ ((undef41 + 1) <= undef14) /\ (undef12 > 0) /\ (undef13 > 0) /\ (undef14 > 0) /\ (undef38 > 0) /\ (undef39 > 0) /\ (undef40 > 0) /\ (undef41 > ~(1)) /\ ((undef16 + 2) <= undef13), par{arg1 -> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41}> 11.27/11.31 0) /\ (undef8 <= undef53) /\ (undef53 > 0) /\ (undef7 > 1) /\ (undef8 > 0) /\ (undef22 > ~(1)) /\ (undef54 > 1) /\ (undef17 <= undef7) /\ (undef17 <= undef8) /\ (undef18 <= undef7) /\ (undef7 > 0) /\ (undef8 > 0) /\ (undef17 > 0) /\ (undef18 > 0) /\ (undef19 > 2) /\ ((undef21 + 2) <= undef7) /\ (undef38 <= undef18) /\ (undef54 > 1) /\ (undef39 <= undef19) /\ (undef40 <= undef19) /\ ((undef41 + 1) <= undef19) /\ (undef17 > 0) /\ (undef18 > 0) /\ (undef19 > 0) /\ (undef38 > 0) /\ (undef39 > 0) /\ (undef40 > 0) /\ (undef41 > ~(1)) /\ ((undef21 + 2) <= undef18), par{arg1 -> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41}> 11.27/11.31 0) /\ (undef8 <= undef53) /\ (undef53 > 0) /\ (undef7 > 1) /\ (undef8 > 0) /\ (undef28 > ~(1)) /\ (undef54 > 1) /\ (undef7 > 0) /\ (undef8 > 0), par{arg1 -> undef28, arg2 -> undef29, arg3 -> undef30, arg4 -> undef31}> 11.27/11.31 ~(1)) /\ (undef54 > 0) /\ (undef53 > 0), par{arg1 -> undef23, arg2 -> undef24, arg3 -> undef25, arg4 -> undef26}> 11.27/11.31 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef34, arg3 -> undef35, arg4 -> undef36}> 11.27/11.31 0) /\ (arg2 > 1) /\ (arg3 > 2) /\ (arg4 > 0) /\ (undef43 > 0) /\ (undef44 > 2) /\ (undef45 > 2) /\ (undef46 > 0), par{arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46}> 11.27/11.31 2) /\ (arg2 > 2) /\ (arg3 > 2) /\ (arg4 > 0) /\ (undef48 > 0) /\ (undef49 > 0) /\ (undef50 > 2) /\ (undef51 > 0), par{arg1 -> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51}> 11.27/11.31 11.27/11.31 Fresh variables: 11.27/11.31 undef1, undef2, undef4, undef5, undef6, undef7, undef8, undef10, undef11, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, 11.27/11.31 11.27/11.31 Undef variables: 11.27/11.31 undef1, undef2, undef4, undef5, undef6, undef7, undef8, undef10, undef11, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, 11.27/11.31 11.27/11.31 Abstraction variables: 11.27/11.31 11.27/11.31 Exit nodes: 11.27/11.31 11.27/11.31 Accepting locations: 11.27/11.31 11.27/11.31 Asserts: 11.27/11.31 11.27/11.31 ************************************************************* 11.27/11.31 ******************************************************************************************* 11.27/11.31 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 11.27/11.31 ******************************************************************************************* 11.27/11.31 11.27/11.31 Init Location: 0 11.27/11.31 Graph 0: 11.27/11.31 Transitions: 11.27/11.31 Variables: 11.27/11.31 11.27/11.31 Graph 1: 11.27/11.31 Transitions: 11.27/11.31 -1 + arg1, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}> 11.27/11.31 Variables: 11.27/11.31 arg1, arg2, arg3, arg4 11.27/11.31 11.27/11.31 Graph 2: 11.27/11.31 Transitions: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> 11.27/11.31 Variables: 11.27/11.31 arg1, arg2, arg3, arg4 11.27/11.31 11.27/11.31 Precedence: 11.27/11.31 Graph 0 11.27/11.31 11.27/11.31 Graph 1 11.27/11.31 undef28, arg2 -> undef29, arg3 -> undef30, arg4 -> undef31, rest remain the same}> 11.27/11.31 undef28, arg2 -> undef29, arg3 -> undef30, arg4 -> undef31, rest remain the same}> 11.27/11.31 undef23, arg2 -> undef24, arg3 -> undef25, arg4 -> undef26, rest remain the same}> 11.27/11.31 11.27/11.31 Graph 2 11.27/11.31 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 11.27/11.31 Map Locations to Subgraph: 11.27/11.31 ( 0 , 0 ) 11.27/11.31 ( 4 , 1 ) 11.27/11.31 ( 5 , 2 ) 11.27/11.31 11.27/11.31 ******************************************************************************************* 11.27/11.31 ******************************** CHECKING ASSERTIONS ******************************** 11.27/11.31 ******************************************************************************************* 11.27/11.31 11.27/11.31 Proving termination of subgraph 0 11.27/11.31 Proving termination of subgraph 1 11.27/11.31 Checking unfeasibility... 11.27/11.31 Time used: 0.003848 11.27/11.31 11.27/11.31 Checking conditional termination of SCC {l4}... 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.000845s 11.27/11.31 Ranking function: -1 + arg1 11.27/11.31 New Graphs: 11.27/11.31 Proving termination of subgraph 2 11.27/11.31 Checking unfeasibility... 11.27/11.31 Time used: 0.019401 11.27/11.31 11.27/11.31 Checking conditional termination of SCC {l5}... 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.005576s 11.27/11.31 Ranking function: -24 + 8*arg1 11.27/11.31 New Graphs: 11.27/11.31 Transitions: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 Variables: 11.27/11.31 arg1, arg2, arg3, arg4 11.27/11.31 Checking conditional termination of SCC {l5}... 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001758s 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.009859s 11.27/11.31 Trying to remove transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 Solving with 1 template(s). 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetFirstSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016531s 11.27/11.31 Time used: 0.015977 11.27/11.31 Solving with 1 template(s). 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetFirstSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045270s 11.27/11.31 Time used: 0.044071 11.27/11.31 Improving Solution with cost 4 ... 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetNextSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.055543s 11.27/11.31 Time used: 0.055534 11.27/11.31 11.27/11.31 LOG: SAT solveNonLinear - Elapsed time: 0.100814s 11.27/11.31 Cost: 4; Total time: 0.099605 11.27/11.31 Failed at location 5: arg4 <= 0 11.27/11.31 Failed at location 5: arg4 <= 0 11.27/11.31 Failed at location 5: arg4 <= 0 11.27/11.31 Failed at location 5: arg4 <= 0 11.27/11.31 Before Improving: 11.27/11.31 Quasi-invariant at l5: arg4 <= 0 11.27/11.31 Optimizing invariants... 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.010130s 11.27/11.31 Remaining time after improvement: 0.994342 11.27/11.31 Termination implied by a set of quasi-invariant(s): 11.27/11.31 Quasi-invariant at l5: arg4 <= 0 11.27/11.31 [ Invariant Graph ] 11.27/11.31 Strengthening and disabling transitions... 11.27/11.31 11.27/11.31 LOG: CALL solverLinear in Graph for feasibility 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear in Graph for feasibility 11.27/11.31 It's unfeasible. Removing transition: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL solverLinear in Graph for feasibility 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear in Graph for feasibility 11.27/11.31 It's unfeasible. Removing transition: 11.27/11.31 undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> 11.27/11.31 [ Termination Graph ] 11.27/11.31 Strengthening and disabling transitions... 11.27/11.31 11.27/11.31 LOG: CALL solverLinear in Graph for feasibility 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear in Graph for feasibility 11.27/11.31 It's unfeasible. Removing transition: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 New Graphs: 11.27/11.31 Calling Safety with literal arg4 <= 0 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL check - Post:arg4 <= 0 - Process 1 11.27/11.31 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 * Postcondition : arg4 <= 0 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001684s 11.27/11.31 > Postcondition is not implied! 11.27/11.31 11.27/11.31 LOG: RETURN check - Elapsed time: 0.001989s 11.27/11.31 Calling Safety with literal arg4 <= 0 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL check - Post:arg4 <= 0 - Process 2 11.27/11.31 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 * Postcondition : arg4 <= 0 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001551s 11.27/11.31 > Postcondition is not implied! 11.27/11.31 11.27/11.31 LOG: RETURN check - Elapsed time: 0.001842s 11.27/11.31 Calling Safety with literal arg4 <= 0 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL check - Post:arg4 <= 0 - Process 3 11.27/11.31 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 * Postcondition : arg4 <= 0 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001511s 11.27/11.31 > Postcondition is not implied! 11.27/11.31 11.27/11.31 LOG: RETURN check - Elapsed time: 0.001818s 11.27/11.31 Calling Safety with literal arg4 <= 0 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL check - Post:arg4 <= 0 - Process 4 11.27/11.31 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 * Postcondition : arg4 <= 0 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001469s 11.27/11.31 > Postcondition is not implied! 11.27/11.31 11.27/11.31 LOG: RETURN check - Elapsed time: 0.001762s 11.27/11.31 INVARIANTS: 11.27/11.31 5: 11.27/11.31 Quasi-INVARIANTS to narrow Graph: 11.27/11.31 5: arg4 <= 0 , 11.27/11.31 Narrowing transition: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: Narrow transition size 1 11.27/11.31 Narrowing transition: 11.27/11.31 undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: Narrow transition size 1 11.27/11.31 invGraph after Narrowing: 11.27/11.31 Transitions: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> 11.27/11.31 Variables: 11.27/11.31 arg1, arg2, arg3, arg4 11.27/11.31 Checking conditional termination of SCC {l5}... 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.005203s 11.27/11.31 Ranking function: -24 + 8*arg1 11.27/11.31 New Graphs: 11.27/11.31 Transitions: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 Variables: 11.27/11.31 arg1, arg2, arg3, arg4 11.27/11.31 Checking conditional termination of SCC {l5}... 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001797s 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.010169s 11.27/11.31 Trying to remove transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 Solving with 1 template(s). 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetFirstSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016553s 11.27/11.31 Time used: 0.015981 11.27/11.31 Solving with 1 template(s). 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetFirstSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038149s 11.27/11.31 Time used: 0.037091 11.27/11.31 Improving Solution with cost 4 ... 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetNextSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.061247s 11.27/11.31 Time used: 0.061238 11.27/11.31 11.27/11.31 LOG: SAT solveNonLinear - Elapsed time: 0.099396s 11.27/11.31 Cost: 4; Total time: 0.098329 11.27/11.31 Failed at location 5: arg3 <= 1 11.27/11.31 Failed at location 5: arg3 <= 1 11.27/11.31 Failed at location 5: arg3 <= 1 11.27/11.31 Failed at location 5: arg3 <= 1 11.27/11.31 Before Improving: 11.27/11.31 Quasi-invariant at l5: arg3 <= 1 11.27/11.31 Optimizing invariants... 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.010094s 11.27/11.31 Remaining time after improvement: 0.994245 11.27/11.31 Termination implied by a set of quasi-invariant(s): 11.27/11.31 Quasi-invariant at l5: arg3 <= 1 11.27/11.31 [ Invariant Graph ] 11.27/11.31 Strengthening and disabling transitions... 11.27/11.31 11.27/11.31 LOG: CALL solverLinear in Graph for feasibility 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear in Graph for feasibility 11.27/11.31 It's unfeasible. Removing transition: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL solverLinear in Graph for feasibility 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear in Graph for feasibility 11.27/11.31 It's unfeasible. Removing transition: 11.27/11.31 undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> 11.27/11.31 [ Termination Graph ] 11.27/11.31 Strengthening and disabling transitions... 11.27/11.31 > It's unfeasible. Removing transition: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 New Graphs: 11.27/11.31 Calling Safety with literal arg3 <= 1 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL check - Post:arg3 <= 1 - Process 5 11.27/11.31 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 * Postcondition : arg3 <= 1 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001703s 11.27/11.31 > Postcondition is not implied! 11.27/11.31 11.27/11.31 LOG: RETURN check - Elapsed time: 0.001997s 11.27/11.31 Calling Safety with literal arg3 <= 1 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL check - Post:arg3 <= 1 - Process 6 11.27/11.31 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 * Postcondition : arg3 <= 1 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001583s 11.27/11.31 > Postcondition is not implied! 11.27/11.31 11.27/11.31 LOG: RETURN check - Elapsed time: 0.001863s 11.27/11.31 Calling Safety with literal arg3 <= 1 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL check - Post:arg3 <= 1 - Process 7 11.27/11.31 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 * Postcondition : arg3 <= 1 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001538s 11.27/11.31 > Postcondition is not implied! 11.27/11.31 11.27/11.31 LOG: RETURN check - Elapsed time: 0.001855s 11.27/11.31 Calling Safety with literal arg3 <= 1 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL check - Post:arg3 <= 1 - Process 8 11.27/11.31 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 * Postcondition : arg3 <= 1 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001485s 11.27/11.31 > Postcondition is not implied! 11.27/11.31 11.27/11.31 LOG: RETURN check - Elapsed time: 0.001777s 11.27/11.31 INVARIANTS: 11.27/11.31 5: 11.27/11.31 Quasi-INVARIANTS to narrow Graph: 11.27/11.31 5: arg3 <= 1 , 11.27/11.31 Narrowing transition: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: Narrow transition size 1 11.27/11.31 Narrowing transition: 11.27/11.31 undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: Narrow transition size 1 11.27/11.31 invGraph after Narrowing: 11.27/11.31 Transitions: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> 11.27/11.31 Variables: 11.27/11.31 arg1, arg2, arg3, arg4 11.27/11.31 Checking conditional termination of SCC {l5}... 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.005256s 11.27/11.31 Ranking function: -24 + 8*arg1 11.27/11.31 New Graphs: 11.27/11.31 Transitions: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 Variables: 11.27/11.31 arg1, arg2, arg3, arg4 11.27/11.31 Checking conditional termination of SCC {l5}... 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001801s 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.010089s 11.27/11.31 Trying to remove transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 Solving with 1 template(s). 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetFirstSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016637s 11.27/11.31 Time used: 0.016039 11.27/11.31 Solving with 1 template(s). 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetFirstSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.044849s 11.27/11.31 Time used: 0.04366 11.27/11.31 Improving Solution with cost 4 ... 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetNextSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.050513s 11.27/11.31 Time used: 0.050505 11.27/11.31 11.27/11.31 LOG: SAT solveNonLinear - Elapsed time: 0.095361s 11.27/11.31 Cost: 4; Total time: 0.094165 11.27/11.31 Failed at location 5: arg2 <= 1 11.27/11.31 Failed at location 5: arg2 <= 1 11.27/11.31 Failed at location 5: arg2 <= 1 11.27/11.31 Failed at location 5: arg2 <= 1 11.27/11.31 Before Improving: 11.27/11.31 Quasi-invariant at l5: arg2 <= 1 11.27/11.31 Optimizing invariants... 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.010148s 11.27/11.31 Remaining time after improvement: 0.994181 11.27/11.31 Termination implied by a set of quasi-invariant(s): 11.27/11.31 Quasi-invariant at l5: arg2 <= 1 11.27/11.31 [ Invariant Graph ] 11.27/11.31 Strengthening and disabling transitions... 11.27/11.31 11.27/11.31 LOG: CALL solverLinear in Graph for feasibility 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear in Graph for feasibility 11.27/11.31 It's unfeasible. Removing transition: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL solverLinear in Graph for feasibility 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear in Graph for feasibility 11.27/11.31 It's unfeasible. Removing transition: 11.27/11.31 undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> 11.27/11.31 [ Termination Graph ] 11.27/11.31 Strengthening and disabling transitions... 11.27/11.31 > It's unfeasible. Removing transition: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 New Graphs: 11.27/11.31 Calling Safety with literal arg2 <= 1 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL check - Post:arg2 <= 1 - Process 9 11.27/11.31 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 * Postcondition : arg2 <= 1 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001715s 11.27/11.31 > Postcondition is not implied! 11.27/11.31 11.27/11.31 LOG: RETURN check - Elapsed time: 0.002038s 11.27/11.31 Calling Safety with literal arg2 <= 1 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL check - Post:arg2 <= 1 - Process 10 11.27/11.31 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 * Postcondition : arg2 <= 1 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001603s 11.27/11.31 > Postcondition is not implied! 11.27/11.31 11.27/11.31 LOG: RETURN check - Elapsed time: 0.001884s 11.27/11.31 Calling Safety with literal arg2 <= 1 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL check - Post:arg2 <= 1 - Process 11 11.27/11.31 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 * Postcondition : arg2 <= 1 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001564s 11.27/11.31 > Postcondition is not implied! 11.27/11.31 11.27/11.31 LOG: RETURN check - Elapsed time: 0.001859s 11.27/11.31 Calling Safety with literal arg2 <= 1 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL check - Post:arg2 <= 1 - Process 12 11.27/11.31 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 * Postcondition : arg2 <= 1 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001509s 11.27/11.31 > Postcondition is not implied! 11.27/11.31 11.27/11.31 LOG: RETURN check - Elapsed time: 0.001800s 11.27/11.31 INVARIANTS: 11.27/11.31 5: 11.27/11.31 Quasi-INVARIANTS to narrow Graph: 11.27/11.31 5: arg2 <= 1 , 11.27/11.31 Narrowing transition: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: Narrow transition size 1 11.27/11.31 Narrowing transition: 11.27/11.31 undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: Narrow transition size 1 11.27/11.31 invGraph after Narrowing: 11.27/11.31 Transitions: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> 11.27/11.31 Variables: 11.27/11.31 arg1, arg2, arg3, arg4 11.27/11.31 Checking conditional termination of SCC {l5}... 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.005263s 11.27/11.31 Ranking function: -24 + 8*arg1 11.27/11.31 New Graphs: 11.27/11.31 Transitions: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 Variables: 11.27/11.31 arg1, arg2, arg3, arg4 11.27/11.31 Checking conditional termination of SCC {l5}... 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001846s 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.010274s 11.27/11.31 Trying to remove transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 Solving with 1 template(s). 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetFirstSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016773s 11.27/11.31 Time used: 0.01617 11.27/11.31 Solving with 1 template(s). 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetFirstSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.104270s 11.27/11.31 Time used: 0.103171 11.27/11.31 Improving Solution with cost 4 ... 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetNextSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.069234s 11.27/11.31 Time used: 0.069225 11.27/11.31 11.27/11.31 LOG: SAT solveNonLinear - Elapsed time: 0.173504s 11.27/11.31 Cost: 4; Total time: 0.172396 11.27/11.31 Failed at location 5: arg3 <= 2 11.27/11.31 Failed at location 5: arg3 <= 2 11.27/11.31 Failed at location 5: arg3 <= 2 11.27/11.31 Failed at location 5: arg3 <= 2 11.27/11.31 Before Improving: 11.27/11.31 Quasi-invariant at l5: arg3 <= 2 11.27/11.31 Optimizing invariants... 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.011163s 11.27/11.31 Remaining time after improvement: 0.994189 11.27/11.31 Termination implied by a set of quasi-invariant(s): 11.27/11.31 Quasi-invariant at l5: arg3 <= 2 11.27/11.31 [ Invariant Graph ] 11.27/11.31 Strengthening and disabling transitions... 11.27/11.31 11.27/11.31 LOG: CALL solverLinear in Graph for feasibility 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear in Graph for feasibility 11.27/11.31 It's unfeasible. Removing transition: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL solverLinear in Graph for feasibility 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear in Graph for feasibility 11.27/11.31 It's unfeasible. Removing transition: 11.27/11.31 undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> 11.27/11.31 [ Termination Graph ] 11.27/11.31 Strengthening and disabling transitions... 11.27/11.31 > It's unfeasible. Removing transition: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 New Graphs: 11.27/11.31 Calling Safety with literal arg3 <= 2 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL check - Post:arg3 <= 2 - Process 13 11.27/11.31 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 * Postcondition : arg3 <= 2 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001754s 11.27/11.31 > Postcondition is not implied! 11.27/11.31 11.27/11.31 LOG: RETURN check - Elapsed time: 0.002057s 11.27/11.31 Calling Safety with literal arg3 <= 2 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL check - Post:arg3 <= 2 - Process 14 11.27/11.31 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 * Postcondition : arg3 <= 2 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001627s 11.27/11.31 > Postcondition is not implied! 11.27/11.31 11.27/11.31 LOG: RETURN check - Elapsed time: 0.001929s 11.27/11.31 Calling Safety with literal arg3 <= 2 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL check - Post:arg3 <= 2 - Process 15 11.27/11.31 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 * Postcondition : arg3 <= 2 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001580s 11.27/11.31 > Postcondition is not implied! 11.27/11.31 11.27/11.31 LOG: RETURN check - Elapsed time: 0.001875s 11.27/11.31 Calling Safety with literal arg3 <= 2 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL check - Post:arg3 <= 2 - Process 16 11.27/11.31 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 * Postcondition : arg3 <= 2 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001520s 11.27/11.31 > Postcondition is not implied! 11.27/11.31 11.27/11.31 LOG: RETURN check - Elapsed time: 0.001802s 11.27/11.31 INVARIANTS: 11.27/11.31 5: 11.27/11.31 Quasi-INVARIANTS to narrow Graph: 11.27/11.31 5: arg3 <= 2 , 11.27/11.31 Narrowing transition: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: Narrow transition size 1 11.27/11.31 Narrowing transition: 11.27/11.31 undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: Narrow transition size 1 11.27/11.31 invGraph after Narrowing: 11.27/11.31 Transitions: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> 11.27/11.31 Variables: 11.27/11.31 arg1, arg2, arg3, arg4 11.27/11.31 Checking conditional termination of SCC {l5}... 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.005316s 11.27/11.31 Ranking function: -24 + 8*arg1 11.27/11.31 New Graphs: 11.27/11.31 Transitions: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 Variables: 11.27/11.31 arg1, arg2, arg3, arg4 11.27/11.31 Checking conditional termination of SCC {l5}... 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.001818s 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.010167s 11.27/11.31 Trying to remove transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 Solving with 1 template(s). 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetFirstSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016672s 11.27/11.31 Time used: 0.016062 11.27/11.31 Solving with 1 template(s). 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetFirstSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.146506s 11.27/11.31 Time used: 0.145717 11.27/11.31 Solving with 2 template(s). 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetFirstSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004570s 11.27/11.31 Time used: 4.00153 11.27/11.31 Solving with 3 template(s). 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetFirstSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.014632s 11.27/11.31 Time used: 1.00004 11.27/11.31 Solving with 1 template(s). 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetFirstSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041042s 11.27/11.31 Time used: 0.02671 11.27/11.31 11.27/11.31 Proving non-termination of subgraph 2 11.27/11.31 Transitions: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> 11.27/11.31 Variables: 11.27/11.31 arg1, arg2, arg3, arg4 11.27/11.31 11.27/11.31 Checking that every undef value has an assignment... 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.009006s 11.27/11.31 Checking conditional non-termination of SCC {l5}... 11.27/11.31 EXIT TRANSITIONS: 11.27/11.31 11.27/11.31 11.27/11.31 11.27/11.31 11.27/11.31 11.27/11.31 11.27/11.31 11.27/11.31 Solving with 1 template(s). 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetFirstSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.257688s 11.27/11.31 Time used: 0.255847 11.27/11.31 Improving Solution with cost 7 ... 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetNextSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.302912s 11.27/11.31 Time used: 0.302892 11.27/11.31 11.27/11.31 LOG: SAT solveNonLinear - Elapsed time: 0.560600s 11.27/11.31 Cost: 7; Total time: 0.558739 11.27/11.31 Minimizing number of undef constraints... 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinear - Elapsed time: 0.034490s 11.27/11.31 Number of undef constraints reduced! 11.27/11.31 11.27/11.31 Non-termination implied by a set of quasi-invariant(s): 11.27/11.31 Quasi-invariant at l5: 1 <= arg1 11.27/11.31 11.27/11.31 Strengthening and disabling EXIT transitions... 11.27/11.31 Closed exits from l5: 2 11.27/11.31 Strengthening exit transition (result): 11.27/11.31 11.27/11.31 Strengthening exit transition (result): 11.27/11.31 11.27/11.31 Strengthening exit transition (result): 11.27/11.31 11.27/11.31 Strengthening exit transition (result): 11.27/11.31 11.27/11.31 11.27/11.31 Strengthening and disabling transitions... 11.27/11.31 11.27/11.31 LOG: CALL solverLinear in Graph for feasibility 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear in Graph for feasibility 11.27/11.31 Strengthening transition (result): 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL solverLinear in Graph for feasibility 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear in Graph for feasibility 11.27/11.31 Strengthening transition (result): 11.27/11.31 undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> 11.27/11.31 11.27/11.31 Checking conditional non-termination of SCC {l5}... 11.27/11.31 EXIT TRANSITIONS: 11.27/11.31 11.27/11.31 11.27/11.31 11.27/11.31 11.27/11.31 11.27/11.31 Solving with 1 template(s). 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetFirstSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.581479s 11.27/11.31 Time used: 0.58011 11.27/11.31 Improving Solution with cost 7 ... 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetNextSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.326568s 11.27/11.31 Time used: 0.326547 11.27/11.31 11.27/11.31 LOG: SAT solveNonLinear - Elapsed time: 0.908047s 11.27/11.31 Cost: 7; Total time: 0.906657 11.27/11.31 Failed at location 5: 1 + arg1 <= arg2 11.27/11.31 Failed at location 5: 1 + arg1 <= arg2 11.27/11.31 Failed at location 5: 1 + arg1 <= arg2 11.27/11.31 Failed at location 5: 1 + arg1 <= arg2 11.27/11.31 Before Improving: 11.27/11.31 Quasi-invariant at l5: 1 + arg1 <= arg2 11.27/11.31 Optimizing invariants... 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.019064s 11.27/11.31 Remaining time after improvement: 0.988359 11.27/11.31 Minimizing number of undef constraints... 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinear - Elapsed time: 0.023063s 11.27/11.31 Non-termination implied by a set of quasi-invariant(s): 11.27/11.31 Quasi-invariant at l5: 1 + arg1 <= arg2 11.27/11.31 Constraint over undef 'undef43 <= 1' in transition: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 Constraint over undef '1 + undef48 <= undef49' in transition: 11.27/11.31 undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> 11.27/11.31 11.27/11.31 Strengthening and disabling EXIT transitions... 11.27/11.31 Closed exits from l5: 2 11.27/11.31 Strengthening exit transition (result): 11.27/11.31 11.27/11.31 Strengthening exit transition (result): 11.27/11.31 11.27/11.31 11.27/11.31 Strengthening and disabling transitions... 11.27/11.31 11.27/11.31 LOG: CALL solverLinear in Graph for feasibility 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear in Graph for feasibility 11.27/11.31 Strengthening transition (result): 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL solverLinear in Graph for feasibility 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear in Graph for feasibility 11.27/11.31 Strengthening transition (result): 11.27/11.31 undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> 11.27/11.31 11.27/11.31 Checking conditional non-termination of SCC {l5}... 11.27/11.31 EXIT TRANSITIONS: 11.27/11.31 11.27/11.31 11.27/11.31 11.27/11.31 Solving with 1 template(s). 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetFirstSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.905316s 11.27/11.31 Time used: 1.90342 11.27/11.31 Improving Solution with cost 5 ... 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetNextSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.383967s 11.27/11.31 Time used: 0.383936 11.27/11.31 11.27/11.31 LOG: SAT solveNonLinear - Elapsed time: 2.289283s 11.27/11.31 Cost: 5; Total time: 2.28736 11.27/11.31 Failed at location 5: 1 <= arg4 11.27/11.31 Failed at location 5: 1 <= arg4 11.27/11.31 Failed at location 5: 1 <= arg4 11.27/11.31 Failed at location 5: 1 <= arg4 11.27/11.31 Before Improving: 11.27/11.31 Quasi-invariant at l5: 1 <= arg4 11.27/11.31 Optimizing invariants... 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.021353s 11.27/11.31 Remaining time after improvement: 0.986008 11.27/11.31 Minimizing number of undef constraints... 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinear - Elapsed time: 0.027118s 11.27/11.31 Number of undef constraints reduced! 11.27/11.31 11.27/11.31 Non-termination implied by a set of quasi-invariant(s): 11.27/11.31 Quasi-invariant at l5: 1 <= arg4 11.27/11.31 11.27/11.31 Strengthening and disabling EXIT transitions... 11.27/11.31 Closed exits from l5: 1 11.27/11.31 Strengthening exit transition (result): 11.27/11.31 11.27/11.31 11.27/11.31 Strengthening and disabling transitions... 11.27/11.31 11.27/11.31 LOG: CALL solverLinear in Graph for feasibility 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear in Graph for feasibility 11.27/11.31 Strengthening transition (result): 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL solverLinear in Graph for feasibility 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear in Graph for feasibility 11.27/11.31 Strengthening transition (result): 11.27/11.31 undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> 11.27/11.31 11.27/11.31 Checking conditional non-termination of SCC {l5}... 11.27/11.31 EXIT TRANSITIONS: 11.27/11.31 11.27/11.31 11.27/11.31 Solving with 1 template(s). 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetFirstSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.656317s 11.27/11.31 Time used: 0.654779 11.27/11.31 Improving Solution with cost 4 ... 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinearGetNextSolution 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.302999s 11.27/11.31 Time used: 0.302973 11.27/11.31 11.27/11.31 LOG: SAT solveNonLinear - Elapsed time: 0.959316s 11.27/11.31 Cost: 4; Total time: 0.957752 11.27/11.31 Failed at location 5: 1 + arg1 + arg4 <= arg3 11.27/11.31 Failed at location 5: 1 + arg1 + arg4 <= arg3 11.27/11.31 Failed at location 5: 1 + arg1 + arg4 <= arg3 11.27/11.31 Failed at location 5: 1 + arg1 + arg4 <= arg3 11.27/11.31 Before Improving: 11.27/11.31 Quasi-invariant at l5: 1 + arg1 + arg4 <= arg3 11.27/11.31 Optimizing invariants... 11.27/11.31 11.27/11.31 LOG: CALL solveLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear - Elapsed time: 0.022543s 11.27/11.31 Remaining time after improvement: 0.985629 11.27/11.31 Minimizing number of undef constraints... 11.27/11.31 11.27/11.31 LOG: CALL solveNonLinear 11.27/11.31 11.27/11.31 LOG: RETURN solveNonLinear - Elapsed time: 0.035074s 11.27/11.31 Non-termination implied by a set of quasi-invariant(s): 11.27/11.31 Quasi-invariant at l5: 1 + arg1 + arg4 <= arg3 11.27/11.31 Constraint over undef 'arg4 + undef44 + undef46 <= 1 + undef43 + undef45' in transition: 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 Constraint over undef 'undef48 + undef49 + undef51 <= 1 + undef50' in transition: 11.27/11.31 undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> 11.27/11.31 11.27/11.31 Strengthening and disabling EXIT transitions... 11.27/11.31 Closed exits from l5: 1 11.27/11.31 11.27/11.31 Strengthening and disabling transitions... 11.27/11.31 11.27/11.31 LOG: CALL solverLinear in Graph for feasibility 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear in Graph for feasibility 11.27/11.31 Strengthening transition (result): 11.27/11.31 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> 11.27/11.31 11.27/11.31 LOG: CALL solverLinear in Graph for feasibility 11.27/11.31 11.27/11.31 LOG: RETURN solveLinear in Graph for feasibility 11.27/11.31 Strengthening transition (result): 11.27/11.31 undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> 11.27/11.31 11.27/11.31 Calling reachability with... 11.27/11.31 Transition: 11.27/11.31 Conditions: 1 <= arg1, 1 + arg1 <= arg2, 1 <= arg4, 1 + arg1 + arg4 <= arg3, 11.27/11.31 Transition: 11.27/11.31 Conditions: 1 <= arg1, 1 + arg1 <= arg2, 1 <= arg4, 1 + arg1 + arg4 <= arg3, 11.27/11.31 Transition: 11.27/11.31 Conditions: 1 <= arg1, 1 + arg1 <= arg2, 1 <= arg4, 1 + arg1 + arg4 <= arg3, 11.27/11.31 Transition: 11.27/11.31 Conditions: 1 <= arg1, 1 + arg1 <= arg2, 1 <= arg4, 1 + arg1 + arg4 <= arg3, 11.27/11.31 OPEN EXITS: 11.27/11.31 11.27/11.31 11.27/11.31 11.27/11.31 11.27/11.31 11.27/11.31 --- Reachability graph --- 11.27/11.31 > Graph without transitions. 11.27/11.31 11.27/11.31 Calling reachability with... 11.27/11.31 Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, 11.27/11.31 Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, 11.27/11.31 Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, 11.27/11.31 Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, 11.27/11.31 Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, 11.27/11.31 Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, 11.27/11.31 Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, 11.27/11.31 Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, 11.27/11.31 Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, 11.27/11.31 Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, 11.27/11.31 Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, 11.27/11.31 Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, 11.27/11.31 Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, 11.27/11.31 Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, 11.27/11.31 Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, 11.27/11.31 Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, 11.27/11.31 OPEN EXITS: 11.27/11.31 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> 11.27/11.31 11.27/11.31 > Conditions are reachable! 11.27/11.31 11.27/11.31 Program does NOT terminate 11.27/11.31 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 11.27/11.31 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 11.27/11.31 EOF