33.21/33.26 YES 33.21/33.26 33.21/33.26 Solver Timeout: 4 33.21/33.26 Global Timeout: 300 33.21/33.26 No parsing errors! 33.21/33.26 Init Location: 0 33.21/33.26 Transitions: 33.21/33.26 33.21/33.26 ~(1)) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> 0, arg3 -> arg2, arg4 -> undef4, arg5 -> undef5, arg6 -> undef6, arg7 -> undef7, arg8 -> undef8, arg9 -> undef9}> 33.21/33.26 arg2) /\ (arg1 > 0) /\ (undef10 > 0), par{arg1 -> undef10, arg3 -> 0, arg4 -> (2 * arg2), arg5 -> arg3, arg6 -> undef15, arg7 -> undef16, arg8 -> undef17, arg9 -> undef18}> 33.21/33.26 = arg4) /\ (arg5 > ~(1)) /\ (arg1 >= undef19) /\ (arg1 > 0) /\ (undef19 > 0), par{arg1 -> undef19, arg2 -> (arg2 + 1), arg3 -> arg5, arg4 -> undef22, arg5 -> undef23, arg6 -> undef24, arg7 -> undef25, arg8 -> undef26, arg9 -> undef27}> 33.21/33.26 arg3) /\ (arg3 > ~(1)) /\ (arg2 > ~(1)) /\ (undef28 <= arg1) /\ (arg1 > 0) /\ (undef28 > 0), par{arg1 -> undef28, arg3 -> arg4, arg4 -> arg3, arg5 -> (arg2 + arg3), arg6 -> arg5, arg7 -> undef34, arg8 -> undef35, arg9 -> undef36}> 33.21/33.26 0) /\ (undef37 > 0), par{arg1 -> undef37, arg3 -> (arg4 + 1), arg4 -> arg3, arg5 -> arg6, arg6 -> undef42, arg7 -> undef43, arg8 -> undef44, arg9 -> undef45}> 33.21/33.26 = 0) /\ (arg5 > ~(1)) /\ ((2 * arg2) >= 0) /\ (((2 * arg2) + (3 * arg4)) >= 0) /\ ((4 * arg5) >= 0) /\ (undef46 <= arg1) /\ (arg1 > 0) /\ (undef46 > 0), par{arg1 -> undef46, arg6 -> 0, arg7 -> (((2 * arg2) + (3 * arg4)) + (4 * arg5)), arg8 -> arg6, arg9 -> undef54}> 33.21/33.26 0) /\ (undef55 > 0), par{arg1 -> undef55, arg5 -> (arg5 - 1), arg6 -> arg8, arg7 -> undef61, arg8 -> undef62, arg9 -> undef63}> 33.21/33.26 = 0) /\ (arg7 > arg6) /\ ((1000 * arg2) >= 0) /\ ((10 * arg5) >= 0) /\ (((1000 * arg2) + (100 * arg4)) >= 0) /\ ((((1000 * arg2) + (100 * arg4)) + (10 * arg5)) >= 0) /\ (arg6 > ~(1)) /\ (undef64 <= arg1) /\ (arg1 > 0) /\ (undef64 > 0), par{arg1 -> undef64, arg6 -> arg7, arg7 -> arg6, arg8 -> ((((1000 * arg2) + (100 * arg4)) + (10 * arg5)) + arg6), arg9 -> arg8}> 33.21/33.26 0) /\ (undef73 > 0), par{arg1 -> undef73, arg6 -> (arg7 + 1), arg7 -> arg6, arg8 -> arg9, arg9 -> undef81}> 33.21/33.26 ~(1)) /\ (arg1 > 0) /\ (undef82 > 0), par{arg1 -> undef82, arg8 -> (arg8 - 1)}> 33.21/33.26 undef91, arg2 -> undef92, arg3 -> undef93, arg4 -> undef94, arg5 -> undef95, arg6 -> undef96, arg7 -> undef97, arg8 -> undef98, arg9 -> undef99}> 33.21/33.26 33.21/33.26 Fresh variables: 33.21/33.26 undef1, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef15, undef16, undef17, undef18, undef19, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef34, undef35, undef36, undef37, undef42, undef43, undef44, undef45, undef46, undef54, undef55, undef61, undef62, undef63, undef64, undef73, undef81, undef82, undef91, undef92, undef93, undef94, undef95, undef96, undef97, undef98, undef99, 33.21/33.26 33.21/33.26 Undef variables: 33.21/33.26 undef1, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef15, undef16, undef17, undef18, undef19, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef34, undef35, undef36, undef37, undef42, undef43, undef44, undef45, undef46, undef54, undef55, undef61, undef62, undef63, undef64, undef73, undef81, undef82, undef91, undef92, undef93, undef94, undef95, undef96, undef97, undef98, undef99, 33.21/33.26 33.21/33.26 Abstraction variables: 33.21/33.26 33.21/33.26 Exit nodes: 33.21/33.26 33.21/33.26 Accepting locations: 33.21/33.26 33.21/33.26 Asserts: 33.21/33.26 33.21/33.26 Preprocessed LLVMGraph 33.21/33.26 Init Location: 0 33.21/33.26 Transitions: 33.21/33.26 ~(1)) /\ (undef91 > 0) /\ (undef1 > 0) /\ (undef10 <= undef1) /\ (undef92 > 0) /\ (undef1 > 0) /\ (undef10 > 0)> 33.21/33.26 = arg4) /\ (arg5 > ~(1)) /\ (arg1 >= undef19) /\ (arg1 > 0) /\ (undef19 > 0) /\ (undef10 <= undef19) /\ (arg5 > (arg2 + 1)) /\ (undef19 > 0) /\ (undef10 > 0), par{arg1 -> undef10, arg2 -> (arg2 + 1), arg3 -> 0, arg4 -> (2 * (arg2 + 1)), arg5 -> arg5, arg6 -> undef15, arg7 -> undef16, arg8 -> undef17, arg9 -> undef18}> 33.21/33.26 arg3) /\ (arg3 > ~(1)) /\ (arg2 > ~(1)) /\ (undef28 <= arg1) /\ (arg1 > 0) /\ (undef28 > 0) /\ ((3 * arg3) >= 0) /\ ((arg2 + arg3) > ~(1)) /\ ((2 * arg2) >= 0) /\ (((2 * arg2) + (3 * arg3)) >= 0) /\ ((4 * (arg2 + arg3)) >= 0) /\ (undef46 <= undef28) /\ (undef28 > 0) /\ (undef46 > 0), par{arg1 -> undef46, arg3 -> arg4, arg4 -> arg3, arg5 -> (arg2 + arg3), arg6 -> 0, arg7 -> (((2 * arg2) + (3 * arg3)) + (4 * (arg2 + arg3))), arg8 -> arg5, arg9 -> undef54}> 33.21/33.26 0) /\ (undef55 > 0) /\ (undef37 <= undef55) /\ ((arg5 - 1) < 0) /\ (undef55 > 0) /\ (undef37 > 0), par{arg1 -> undef37, arg3 -> (arg4 + 1), arg4 -> arg3, arg5 -> arg8, arg6 -> undef42, arg7 -> undef43, arg8 -> undef44, arg9 -> undef45}> 33.21/33.26 0) /\ (undef55 > 0) /\ ((3 * arg4) >= 0) /\ ((arg5 - 1) > ~(1)) /\ ((2 * arg2) >= 0) /\ (((2 * arg2) + (3 * arg4)) >= 0) /\ ((4 * (arg5 - 1)) >= 0) /\ (undef46 <= undef55) /\ (undef55 > 0) /\ (undef46 > 0), par{arg1 -> undef46, arg5 -> (arg5 - 1), arg6 -> 0, arg7 -> (((2 * arg2) + (3 * arg4)) + (4 * (arg5 - 1))), arg8 -> arg8, arg9 -> undef54}> 33.21/33.26 = 0) /\ (arg7 > arg6) /\ ((1000 * arg2) >= 0) /\ ((10 * arg5) >= 0) /\ (((1000 * arg2) + (100 * arg4)) >= 0) /\ ((((1000 * arg2) + (100 * arg4)) + (10 * arg5)) >= 0) /\ (arg6 > ~(1)) /\ (undef64 <= arg1) /\ (arg1 > 0) /\ (undef64 > 0), par{arg1 -> undef64, arg6 -> arg7, arg7 -> arg6, arg8 -> ((((1000 * arg2) + (100 * arg4)) + (10 * arg5)) + arg6), arg9 -> arg8}> 33.21/33.26 0) /\ (undef73 > 0), par{arg1 -> undef73, arg6 -> (arg7 + 1), arg7 -> arg6, arg8 -> arg9, arg9 -> undef81}> 33.21/33.26 ~(1)) /\ (arg1 > 0) /\ (undef82 > 0), par{arg1 -> undef82, arg8 -> (arg8 - 1)}> 33.21/33.26 33.21/33.26 Fresh variables: 33.21/33.26 undef1, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef15, undef16, undef17, undef18, undef19, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef34, undef35, undef36, undef37, undef42, undef43, undef44, undef45, undef46, undef54, undef55, undef61, undef62, undef63, undef64, undef73, undef81, undef82, undef91, undef92, undef93, undef94, undef95, undef96, undef97, undef98, undef99, 33.21/33.26 33.21/33.26 Undef variables: 33.21/33.26 undef1, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef15, undef16, undef17, undef18, undef19, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef34, undef35, undef36, undef37, undef42, undef43, undef44, undef45, undef46, undef54, undef55, undef61, undef62, undef63, undef64, undef73, undef81, undef82, undef91, undef92, undef93, undef94, undef95, undef96, undef97, undef98, undef99, 33.21/33.26 33.21/33.26 Abstraction variables: 33.21/33.26 33.21/33.26 Exit nodes: 33.21/33.26 33.21/33.26 Accepting locations: 33.21/33.26 33.21/33.26 Asserts: 33.21/33.26 33.21/33.26 ************************************************************* 33.21/33.26 ******************************************************************************************* 33.21/33.26 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 33.21/33.26 ******************************************************************************************* 33.21/33.26 33.21/33.26 Init Location: 0 33.21/33.26 Graph 0: 33.21/33.26 Transitions: 33.21/33.26 Variables: 33.21/33.26 33.21/33.26 Graph 1: 33.21/33.26 Transitions: 33.21/33.26 undef10, arg2 -> 1 + arg2, arg3 -> 0, arg4 -> 2 + 2*arg2, arg6 -> undef15, arg7 -> undef16, arg8 -> undef17, arg9 -> undef18, rest remain the same}> 33.21/33.26 undef46, arg3 -> arg4, arg4 -> arg3, arg5 -> arg2 + arg3, arg6 -> 0, arg7 -> 6*arg2 + 7*arg3, arg8 -> arg5, arg9 -> undef54, rest remain the same}> 33.21/33.26 undef37, arg3 -> 1 + arg4, arg4 -> arg3, arg5 -> arg8, arg6 -> undef42, arg7 -> undef43, arg8 -> undef44, arg9 -> undef45, rest remain the same}> 33.21/33.26 undef46, arg5 -> -1 + arg5, arg6 -> 0, arg7 -> -4 + 2*arg2 + 3*arg4 + 4*arg5, arg9 -> undef54, rest remain the same}> 33.21/33.26 undef64, arg6 -> arg7, arg7 -> arg6, arg8 -> 1000*arg2 + 100*arg4 + 10*arg5 + arg6, arg9 -> arg8, rest remain the same}> 33.21/33.26 undef73, arg6 -> 1 + arg7, arg7 -> arg6, arg8 -> arg9, arg9 -> undef81, rest remain the same}> 33.21/33.26 undef82, arg8 -> -1 + arg8, rest remain the same}> 33.21/33.26 Variables: 33.21/33.26 arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9 33.21/33.26 33.21/33.26 Precedence: 33.21/33.26 Graph 0 33.21/33.26 33.21/33.26 Graph 1 33.21/33.26 33.21/33.26 33.21/33.26 Map Locations to Subgraph: 33.21/33.26 ( 0 , 0 ) 33.21/33.26 ( 3 , 1 ) 33.21/33.26 ( 5 , 1 ) 33.21/33.26 ( 6 , 1 ) 33.21/33.26 33.21/33.26 ******************************************************************************************* 33.21/33.26 ******************************** CHECKING ASSERTIONS ******************************** 33.21/33.26 ******************************************************************************************* 33.21/33.26 33.21/33.26 Proving termination of subgraph 0 33.21/33.26 Proving termination of subgraph 1 33.21/33.26 Checking unfeasibility... 33.21/33.26 Time used: 4.0013 33.21/33.26 33.21/33.26 Checking conditional termination of SCC {l3, l5, l6}... 33.21/33.26 33.21/33.26 LOG: CALL solveLinear 33.21/33.26 33.21/33.26 LOG: RETURN solveLinear - Elapsed time: 0.019539s 33.21/33.26 33.21/33.26 LOG: CALL solveLinear 33.21/33.26 33.21/33.26 LOG: RETURN solveLinear - Elapsed time: 0.101794s 33.21/33.27 Trying to remove transition: undef82, arg8 -> -1 + arg8, rest remain the same}> 33.21/33.27 Solving with 1 template(s). 33.21/33.27 33.21/33.27 LOG: CALL solveNonLinearGetFirstSolution 33.21/33.27 33.21/33.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008941s 33.21/33.27 Time used: 4.00136 33.21/33.27 Trying to remove transition: undef73, arg6 -> 1 + arg7, arg7 -> arg6, arg8 -> arg9, arg9 -> undef81, rest remain the same}> 33.21/33.27 Solving with 1 template(s). 33.21/33.27 33.21/33.27 LOG: CALL solveNonLinearGetFirstSolution 33.21/33.27 33.21/33.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.104292s 33.21/33.27 Time used: 0.065589 33.21/33.27 Trying to remove transition: undef64, arg6 -> arg7, arg7 -> arg6, arg8 -> 1000*arg2 + 100*arg4 + 10*arg5 + arg6, arg9 -> arg8, rest remain the same}> 33.21/33.27 Solving with 1 template(s). 33.21/33.27 33.21/33.27 LOG: CALL solveNonLinearGetFirstSolution 33.21/33.27 33.21/33.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.013127s 33.21/33.27 Time used: 4.00152 33.21/33.27 Trying to remove transition: undef46, arg5 -> -1 + arg5, arg6 -> 0, arg7 -> -4 + 2*arg2 + 3*arg4 + 4*arg5, arg9 -> undef54, rest remain the same}> 33.21/33.27 Solving with 1 template(s). 33.21/33.27 33.21/33.27 LOG: CALL solveNonLinearGetFirstSolution 33.21/33.27 33.21/33.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.029695s 33.21/33.27 Time used: 4.00129 33.21/33.27 Trying to remove transition: undef37, arg3 -> 1 + arg4, arg4 -> arg3, arg5 -> arg8, arg6 -> undef42, arg7 -> undef43, arg8 -> undef44, arg9 -> undef45, rest remain the same}> 33.21/33.27 Solving with 1 template(s). 33.21/33.27 33.21/33.27 LOG: CALL solveNonLinearGetFirstSolution 33.21/33.27 33.21/33.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.131153s 33.21/33.27 Time used: 0.099719 33.21/33.27 Trying to remove transition: undef46, arg3 -> arg4, arg4 -> arg3, arg5 -> arg2 + arg3, arg6 -> 0, arg7 -> 6*arg2 + 7*arg3, arg8 -> arg5, arg9 -> undef54, rest remain the same}> 33.21/33.27 Solving with 1 template(s). 33.21/33.27 33.21/33.27 LOG: CALL solveNonLinearGetFirstSolution 33.21/33.27 33.21/33.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.236685s 33.21/33.27 Time used: 0.213517 33.21/33.27 Trying to remove transition: undef10, arg2 -> 1 + arg2, arg3 -> 0, arg4 -> 2 + 2*arg2, arg6 -> undef15, arg7 -> undef16, arg8 -> undef17, arg9 -> undef18, rest remain the same}> 33.21/33.27 Solving with 1 template(s). 33.21/33.27 33.21/33.27 LOG: CALL solveNonLinearGetFirstSolution 33.21/33.27 33.21/33.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.256292s 33.21/33.27 Time used: 0.229321 33.21/33.27 Solving with 1 template(s). 33.21/33.27 33.21/33.27 LOG: CALL solveNonLinearGetFirstSolution 33.21/33.27 33.21/33.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.094394s 33.21/33.27 Time used: 2.06524 33.21/33.27 Improving Solution with cost 1 ... 33.21/33.27 33.21/33.27 LOG: CALL solveNonLinearGetNextSolution 33.21/33.27 33.21/33.27 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.011352s 33.21/33.27 Time used: 1.0114 33.21/33.27 33.21/33.27 LOG: SAT solveNonLinear - Elapsed time: 3.105746s 33.21/33.27 Cost: 1; Total time: 3.07664 33.21/33.27 Failed at location 3: arg5 <= 1 + arg2 33.21/33.27 Before Improving: 33.21/33.27 Quasi-invariant at l3: arg5 <= 1 + arg2 33.21/33.27 Quasi-invariant at l5: arg8 <= 1 + arg2 33.21/33.27 Quasi-invariant at l6: arg9 <= 1 + arg2 33.21/33.27 Optimizing invariants... 33.21/33.27 33.21/33.27 LOG: CALL solveLinear 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear - Elapsed time: 0.053863s 33.21/33.27 Remaining time after improvement: 0.977354 33.21/33.27 Termination implied by a set of quasi-invariant(s): 33.21/33.27 Quasi-invariant at l3: arg5 <= 1 + arg2 33.21/33.27 Quasi-invariant at l5: arg8 <= 1 + arg2 33.21/33.27 Quasi-invariant at l6: arg9 <= 1 + arg2 33.21/33.27 [ Invariant Graph ] 33.21/33.27 Strengthening and disabling transitions... 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 It's unfeasible. Removing transition: 33.21/33.27 undef10, arg2 -> 1 + arg2, arg3 -> 0, arg4 -> 2 + 2*arg2, arg6 -> undef15, arg7 -> undef16, arg8 -> undef17, arg9 -> undef18, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 Strengthening transition (result): 33.21/33.27 undef46, arg3 -> arg4, arg4 -> arg3, arg5 -> arg2 + arg3, arg6 -> 0, arg7 -> 6*arg2 + 7*arg3, arg8 -> arg5, arg9 -> undef54, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 Strengthening transition (result): 33.21/33.27 undef37, arg3 -> 1 + arg4, arg4 -> arg3, arg5 -> arg8, arg6 -> undef42, arg7 -> undef43, arg8 -> undef44, arg9 -> undef45, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 Strengthening transition (result): 33.21/33.27 undef46, arg5 -> -1 + arg5, arg6 -> 0, arg7 -> -4 + 2*arg2 + 3*arg4 + 4*arg5, arg9 -> undef54, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 Strengthening transition (result): 33.21/33.27 undef64, arg6 -> arg7, arg7 -> arg6, arg8 -> 1000*arg2 + 100*arg4 + 10*arg5 + arg6, arg9 -> arg8, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 Strengthening transition (result): 33.21/33.27 undef73, arg6 -> 1 + arg7, arg7 -> arg6, arg8 -> arg9, arg9 -> undef81, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 Strengthening transition (result): 33.21/33.27 undef82, arg8 -> -1 + arg8, rest remain the same}> 33.21/33.27 [ Termination Graph ] 33.21/33.27 Strengthening and disabling transitions... 33.21/33.27 > It's unfeasible. Removing transition: 33.21/33.27 undef10, arg2 -> 1 + arg2, arg3 -> 0, arg4 -> 2 + 2*arg2, arg6 -> undef15, arg7 -> undef16, arg8 -> undef17, arg9 -> undef18, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 Strengthening transition (result): 33.21/33.27 undef46, arg3 -> arg4, arg4 -> arg3, arg5 -> arg2 + arg3, arg6 -> 0, arg7 -> 6*arg2 + 7*arg3, arg8 -> arg5, arg9 -> undef54, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 Strengthening transition (result): 33.21/33.27 undef37, arg3 -> 1 + arg4, arg4 -> arg3, arg5 -> arg8, arg6 -> undef42, arg7 -> undef43, arg8 -> undef44, arg9 -> undef45, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 Strengthening transition (result): 33.21/33.27 undef46, arg5 -> -1 + arg5, arg6 -> 0, arg7 -> -4 + 2*arg2 + 3*arg4 + 4*arg5, arg9 -> undef54, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 Strengthening transition (result): 33.21/33.27 undef64, arg6 -> arg7, arg7 -> arg6, arg8 -> 1000*arg2 + 100*arg4 + 10*arg5 + arg6, arg9 -> arg8, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 Strengthening transition (result): 33.21/33.27 undef73, arg6 -> 1 + arg7, arg7 -> arg6, arg8 -> arg9, arg9 -> undef81, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 Strengthening transition (result): 33.21/33.27 undef82, arg8 -> -1 + arg8, rest remain the same}> 33.21/33.27 New Graphs: 33.21/33.27 Transitions: 33.21/33.27 undef46, arg3 -> arg4, arg4 -> arg3, arg5 -> arg2 + arg3, arg6 -> 0, arg7 -> 6*arg2 + 7*arg3, arg8 -> arg5, arg9 -> undef54, rest remain the same}> 33.21/33.27 undef37, arg3 -> 1 + arg4, arg4 -> arg3, arg5 -> arg8, arg6 -> undef42, arg7 -> undef43, arg8 -> undef44, arg9 -> undef45, rest remain the same}> 33.21/33.27 undef46, arg5 -> -1 + arg5, arg6 -> 0, arg7 -> -4 + 2*arg2 + 3*arg4 + 4*arg5, arg9 -> undef54, rest remain the same}> 33.21/33.27 undef64, arg6 -> arg7, arg7 -> arg6, arg8 -> 1000*arg2 + 100*arg4 + 10*arg5 + arg6, arg9 -> arg8, rest remain the same}> 33.21/33.27 undef73, arg6 -> 1 + arg7, arg7 -> arg6, arg8 -> arg9, arg9 -> undef81, rest remain the same}> 33.21/33.27 undef82, arg8 -> -1 + arg8, rest remain the same}> 33.21/33.27 Variables: 33.21/33.27 arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9 33.21/33.27 Checking conditional termination of SCC {l3, l5, l6}... 33.21/33.27 33.21/33.27 LOG: CALL solveLinear 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear - Elapsed time: 0.009834s 33.21/33.27 33.21/33.27 LOG: CALL solveLinear 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear - Elapsed time: 0.078284s 33.21/33.27 Trying to remove transition: undef82, arg8 -> -1 + arg8, rest remain the same}> 33.21/33.27 Solving with 1 template(s). 33.21/33.27 33.21/33.27 LOG: CALL solveNonLinearGetFirstSolution 33.21/33.27 33.21/33.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010779s 33.21/33.27 Time used: 4.0039 33.21/33.27 Trying to remove transition: undef73, arg6 -> 1 + arg7, arg7 -> arg6, arg8 -> arg9, arg9 -> undef81, rest remain the same}> 33.21/33.27 Solving with 1 template(s). 33.21/33.27 33.21/33.27 LOG: CALL solveNonLinearGetFirstSolution 33.21/33.27 33.21/33.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.089135s 33.21/33.27 Time used: 0.072016 33.21/33.27 Trying to remove transition: undef64, arg6 -> arg7, arg7 -> arg6, arg8 -> 1000*arg2 + 100*arg4 + 10*arg5 + arg6, arg9 -> arg8, rest remain the same}> 33.21/33.27 Solving with 1 template(s). 33.21/33.27 33.21/33.27 LOG: CALL solveNonLinearGetFirstSolution 33.21/33.27 33.21/33.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.015962s 33.21/33.27 Time used: 4.00295 33.21/33.27 Trying to remove transition: undef46, arg5 -> -1 + arg5, arg6 -> 0, arg7 -> -4 + 2*arg2 + 3*arg4 + 4*arg5, arg9 -> undef54, rest remain the same}> 33.21/33.27 Solving with 1 template(s). 33.21/33.27 33.21/33.27 LOG: CALL solveNonLinearGetFirstSolution 33.21/33.27 33.21/33.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.026393s 33.21/33.27 Time used: 4.00251 33.21/33.27 Trying to remove transition: undef37, arg3 -> 1 + arg4, arg4 -> arg3, arg5 -> arg8, arg6 -> undef42, arg7 -> undef43, arg8 -> undef44, arg9 -> undef45, rest remain the same}> 33.21/33.27 Solving with 1 template(s). 33.21/33.27 33.21/33.27 LOG: CALL solveNonLinearGetFirstSolution 33.21/33.27 33.21/33.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.132809s 33.21/33.27 Time used: 0.103026 33.21/33.27 Trying to remove transition: undef46, arg3 -> arg4, arg4 -> arg3, arg5 -> arg2 + arg3, arg6 -> 0, arg7 -> 6*arg2 + 7*arg3, arg8 -> arg5, arg9 -> undef54, rest remain the same}> 33.21/33.27 Solving with 1 template(s). 33.21/33.27 33.21/33.27 LOG: CALL solveNonLinearGetFirstSolution 33.21/33.27 33.21/33.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.187514s 33.21/33.27 Time used: 0.165711 33.21/33.27 Solving with 1 template(s). 33.21/33.27 33.21/33.27 LOG: CALL solveNonLinearGetFirstSolution 33.21/33.27 33.21/33.27 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.326067s 33.21/33.27 Time used: 0.304173 33.21/33.27 33.21/33.27 LOG: SAT solveNonLinear - Elapsed time: 0.326067s 33.21/33.27 Cost: 0; Total time: 0.304173 33.21/33.27 Termination implied by a set of invariant(s): 33.21/33.27 Invariant at l3: 1 + arg2 + arg4 <= arg5 33.21/33.27 Invariant at l5: 1 <= 0 33.21/33.27 Invariant at l6: 1 + arg1 <= 0 33.21/33.27 [ Invariant Graph ] 33.21/33.27 Strengthening and disabling transitions... 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 It's unfeasible. Removing transition: 33.21/33.27 undef46, arg3 -> arg4, arg4 -> arg3, arg5 -> arg2 + arg3, arg6 -> 0, arg7 -> 6*arg2 + 7*arg3, arg8 -> arg5, arg9 -> undef54, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 It's unfeasible. Removing transition: 33.21/33.27 undef37, arg3 -> 1 + arg4, arg4 -> arg3, arg5 -> arg8, arg6 -> undef42, arg7 -> undef43, arg8 -> undef44, arg9 -> undef45, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 It's unfeasible. Removing transition: 33.21/33.27 undef46, arg5 -> -1 + arg5, arg6 -> 0, arg7 -> -4 + 2*arg2 + 3*arg4 + 4*arg5, arg9 -> undef54, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 It's unfeasible. Removing transition: 33.21/33.27 undef64, arg6 -> arg7, arg7 -> arg6, arg8 -> 1000*arg2 + 100*arg4 + 10*arg5 + arg6, arg9 -> arg8, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 It's unfeasible. Removing transition: 33.21/33.27 undef73, arg6 -> 1 + arg7, arg7 -> arg6, arg8 -> arg9, arg9 -> undef81, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 It's unfeasible. Removing transition: 33.21/33.27 undef82, arg8 -> -1 + arg8, rest remain the same}> 33.21/33.27 [ Termination Graph ] 33.21/33.27 Strengthening and disabling transitions... 33.21/33.27 > It's unfeasible. Removing transition: 33.21/33.27 undef64, arg6 -> arg7, arg7 -> arg6, arg8 -> 1000*arg2 + 100*arg4 + 10*arg5 + arg6, arg9 -> arg8, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 It's unfeasible. Removing transition: 33.21/33.27 undef46, arg3 -> arg4, arg4 -> arg3, arg5 -> arg2 + arg3, arg6 -> 0, arg7 -> 6*arg2 + 7*arg3, arg8 -> arg5, arg9 -> undef54, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 It's unfeasible. Removing transition: 33.21/33.27 undef37, arg3 -> 1 + arg4, arg4 -> arg3, arg5 -> arg8, arg6 -> undef42, arg7 -> undef43, arg8 -> undef44, arg9 -> undef45, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 It's unfeasible. Removing transition: 33.21/33.27 undef46, arg5 -> -1 + arg5, arg6 -> 0, arg7 -> -4 + 2*arg2 + 3*arg4 + 4*arg5, arg9 -> undef54, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 It's unfeasible. Removing transition: 33.21/33.27 undef73, arg6 -> 1 + arg7, arg7 -> arg6, arg8 -> arg9, arg9 -> undef81, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: CALL solverLinear in Graph for feasibility 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear in Graph for feasibility 33.21/33.27 It's unfeasible. Removing transition: 33.21/33.27 undef82, arg8 -> -1 + arg8, rest remain the same}> 33.21/33.27 New Graphs: 33.21/33.27 Calling Safety with literal arg5 <= 1 + arg2 and entry 33.21/33.27 33.21/33.27 LOG: CALL check - Post:arg5 <= 1 + arg2 - Process 1 33.21/33.27 * Exit transition: 33.21/33.27 * Postcondition : arg5 <= 1 + arg2 33.21/33.27 33.21/33.27 LOG: CALL solveLinear 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear - Elapsed time: 0.003596s 33.21/33.27 > Postcondition is not implied! 33.21/33.27 33.21/33.27 LOG: RETURN check - Elapsed time: 0.003825s 33.21/33.27 INVARIANTS: 33.21/33.27 3: 33.21/33.27 5: 33.21/33.27 6: 33.21/33.27 Quasi-INVARIANTS to narrow Graph: 33.21/33.27 3: arg5 <= 1 + arg2 , 33.21/33.27 5: arg8 <= 1 + arg2 , 33.21/33.27 6: arg9 <= 1 + arg2 , 33.21/33.27 INVARIANTS: 33.21/33.27 3: 1 + arg2 + arg4 <= arg5 , 33.21/33.27 5: 1 <= 0 , 33.21/33.27 6: 1 + arg1 <= 0 , 33.21/33.27 Quasi-INVARIANTS to narrow Graph: 33.21/33.27 3: 33.21/33.27 5: 33.21/33.27 6: 33.21/33.27 Narrowing transition: 33.21/33.27 undef10, arg2 -> 1 + arg2, arg3 -> 0, arg4 -> 2 + 2*arg2, arg6 -> undef15, arg7 -> undef16, arg8 -> undef17, arg9 -> undef18, rest remain the same}> 33.21/33.27 33.21/33.27 LOG: Narrow transition size 1 33.21/33.27 It's unfeasible. Removing transition: 33.21/33.27 undef46, arg3 -> arg4, arg4 -> arg3, arg5 -> arg2 + arg3, arg6 -> 0, arg7 -> 6*arg2 + 7*arg3, arg8 -> arg5, arg9 -> undef54, rest remain the same}> 33.21/33.27 It's unfeasible. Removing transition: 33.21/33.27 undef37, arg3 -> 1 + arg4, arg4 -> arg3, arg5 -> arg8, arg6 -> undef42, arg7 -> undef43, arg8 -> undef44, arg9 -> undef45, rest remain the same}> 33.21/33.27 It's unfeasible. Removing transition: 33.21/33.27 undef46, arg5 -> -1 + arg5, arg6 -> 0, arg7 -> -4 + 2*arg2 + 3*arg4 + 4*arg5, arg9 -> undef54, rest remain the same}> 33.21/33.27 It's unfeasible. Removing transition: 33.21/33.27 undef64, arg6 -> arg7, arg7 -> arg6, arg8 -> 1000*arg2 + 100*arg4 + 10*arg5 + arg6, arg9 -> arg8, rest remain the same}> 33.21/33.27 It's unfeasible. Removing transition: 33.21/33.27 undef73, arg6 -> 1 + arg7, arg7 -> arg6, arg8 -> arg9, arg9 -> undef81, rest remain the same}> 33.21/33.27 It's unfeasible. Removing transition: 33.21/33.27 undef82, arg8 -> -1 + arg8, rest remain the same}> 33.21/33.27 invGraph after Narrowing: 33.21/33.27 Transitions: 33.21/33.27 undef10, arg2 -> 1 + arg2, arg3 -> 0, arg4 -> 2 + 2*arg2, arg6 -> undef15, arg7 -> undef16, arg8 -> undef17, arg9 -> undef18, rest remain the same}> 33.21/33.27 Variables: 33.21/33.27 arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9 33.21/33.27 Checking conditional termination of SCC {l3}... 33.21/33.27 33.21/33.27 LOG: CALL solveLinear 33.21/33.27 33.21/33.27 LOG: RETURN solveLinear - Elapsed time: 0.003549s 33.21/33.27 Ranking function: -2 - arg2 + arg5 33.21/33.27 New Graphs: 33.21/33.27 Program Terminates 33.21/33.27 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 33.21/33.27 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 33.21/33.27 EOF