7.06/7.15 NO 7.06/7.15 7.06/7.15 Solver Timeout: 4 7.06/7.15 Global Timeout: 300 7.06/7.15 No parsing errors! 7.06/7.15 Init Location: 0 7.06/7.15 Transitions: 7.06/7.15 7.06/7.15 0) /\ (undef1 > 0) /\ (undef2 > ~(1)), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4, arg5 -> undef5, arg6 -> undef6}> 7.06/7.15 0) /\ (undef7 > 0) /\ (undef8 > ~(1)), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9, arg4 -> undef10, arg5 -> undef11, arg6 -> undef12}> 7.06/7.15 0) /\ (undef13 > ~(1)) /\ (0 = arg2), par{arg1 -> undef13, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> undef18}> 7.06/7.15 0) /\ (arg1 > 0) /\ (undef19 > ~(1)), par{arg1 -> undef19, arg2 -> 0, arg3 -> 0, arg4 -> arg2, arg5 -> 1, arg6 -> undef24}> 7.06/7.15 ~(1)) /\ (arg2 > 0) /\ ((undef25 + 1) <= arg1) /\ (arg1 > 0) /\ (undef25 > ~(1)), par{arg1 -> undef25, arg2 -> 0, arg3 -> undef27, arg4 -> arg2, arg5 -> 1, arg6 -> undef30}> 7.06/7.15 = arg4) /\ (arg3 > arg2) /\ (arg4 > ~(1)) /\ ((undef31 - 2) <= arg1) /\ (arg1 > ~(1)) /\ (undef31 > 1), par{arg1 -> undef31, arg2 -> (arg2 + 1), arg6 -> undef36}> 7.06/7.15 = arg4) /\ (arg3 > arg2) /\ (arg4 > ~(1)) /\ (arg1 > 0) /\ (undef37 > 4), par{arg1 -> undef37, arg2 -> (arg2 + 1), arg6 -> undef42}> 7.06/7.15 ~(1)) /\ (arg3 > arg2) /\ (arg5 < arg4) /\ (arg5 > ~(1)) /\ (undef46 <= arg1) /\ (arg1 > ~(1)) /\ (undef44 > 1) /\ (undef46 > ~(1)), par{arg1 -> arg3, arg2 -> undef44, arg3 -> arg2, arg4 -> undef46, arg5 -> arg4, arg6 -> (arg5 + 1)}> 7.06/7.15 ~(1)) /\ (arg3 > arg2) /\ (arg5 < arg4) /\ (undef55 > ~(1)) /\ (arg5 > ~(1)) /\ (undef52 <= arg1) /\ (arg1 > ~(1)) /\ (undef50 > 1) /\ (undef52 > ~(1)), par{arg1 -> arg3, arg2 -> undef50, arg3 -> arg2, arg4 -> undef52, arg5 -> arg4, arg6 -> (arg5 + 1)}> 7.06/7.15 1) /\ (arg4 > ~(1)) /\ (undef56 > 1), par{arg1 -> undef56, arg2 -> (arg3 + 1), arg3 -> arg1, arg4 -> arg5, arg5 -> arg6, arg6 -> undef61}> 7.06/7.15 2) /\ (arg4 > 0) /\ (undef62 > 4), par{arg1 -> undef62, arg2 -> (arg3 + 1), arg3 -> arg1, arg4 -> arg5, arg5 -> arg6, arg6 -> undef67}> 7.06/7.15 0) /\ (arg2 > 0) /\ (undef68 > 0) /\ (undef69 > ~(1)) /\ ((undef70 + 2) <= arg2), par{arg1 -> undef68, arg2 -> undef69, arg3 -> undef70, arg4 -> undef71, arg5 -> undef72, arg6 -> undef73}> 7.06/7.15 2) /\ (arg2 > 0) /\ (undef74 > 0) /\ (undef75 > ~(1)) /\ ((arg3 + 2) <= arg1), par{arg1 -> undef74, arg2 -> undef75, arg3 -> undef76, arg4 -> undef77, arg5 -> undef78, arg6 -> undef79}> 7.06/7.15 0) /\ (arg2 > 0) /\ (undef80 > 1) /\ (undef81 > 1) /\ (undef82 > ~(1)), par{arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, arg5 -> undef84, arg6 -> undef85}> 7.06/7.15 2) /\ (arg2 > 1) /\ (arg3 > ~(1)) /\ (undef86 > 0) /\ (undef87 > 1) /\ (undef88 > 1), par{arg1 -> undef86, arg2 -> undef87, arg3 -> undef88, arg4 -> undef89, arg5 -> undef90, arg6 -> undef91}> 7.06/7.15 2) /\ (arg2 > 2) /\ (arg3 > 0) /\ (undef92 > 0) /\ (undef93 > 1) /\ (undef94 > 4), par{arg1 -> undef92, arg2 -> undef93, arg3 -> undef94, arg4 -> undef95, arg5 -> undef96, arg6 -> undef97}> 7.06/7.15 undef98, arg2 -> undef99, arg3 -> undef100, arg4 -> undef101, arg5 -> undef102, arg6 -> undef103}> 7.06/7.15 7.06/7.15 Fresh variables: 7.06/7.15 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef18, undef19, undef24, undef25, undef27, undef30, undef31, undef36, undef37, undef42, undef44, undef46, undef50, undef52, undef55, undef56, undef61, undef62, undef67, undef68, undef69, undef70, undef71, undef72, undef73, undef74, undef75, undef76, undef77, undef78, undef79, undef80, undef81, undef82, undef83, undef84, undef85, undef86, undef87, undef88, undef89, undef90, undef91, undef92, undef93, undef94, undef95, undef96, undef97, undef98, undef99, undef100, undef101, undef102, undef103, 7.06/7.15 7.06/7.15 Undef variables: 7.06/7.15 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef18, undef19, undef24, undef25, undef27, undef30, undef31, undef36, undef37, undef42, undef44, undef46, undef50, undef52, undef55, undef56, undef61, undef62, undef67, undef68, undef69, undef70, undef71, undef72, undef73, undef74, undef75, undef76, undef77, undef78, undef79, undef80, undef81, undef82, undef83, undef84, undef85, undef86, undef87, undef88, undef89, undef90, undef91, undef92, undef93, undef94, undef95, undef96, undef97, undef98, undef99, undef100, undef101, undef102, undef103, 7.06/7.15 7.06/7.15 Abstraction variables: 7.06/7.15 7.06/7.15 Exit nodes: 7.06/7.15 7.06/7.15 Accepting locations: 7.06/7.15 7.06/7.15 Asserts: 7.06/7.15 7.06/7.15 Preprocessed LLVMGraph 7.06/7.15 Init Location: 0 7.06/7.15 Transitions: 7.06/7.15 0) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ (undef68 <= undef2) /\ (undef1 > 0) /\ (undef2 > 0) /\ (undef68 > 0) /\ (undef69 > ~(1)) /\ ((undef70 + 2) <= undef2), par{arg1 -> undef68, arg2 -> undef69, arg3 -> undef70, arg4 -> undef71, arg5 -> undef72}> 7.06/7.15 0) /\ (undef1 > 0) /\ (undef2 > ~(1)) /\ ((undef82 + 1) <= undef1) /\ ((undef82 + 1) <= undef2) /\ (undef1 > 0) /\ (undef2 > 0) /\ (undef80 > 1) /\ (undef81 > 1) /\ (undef82 > ~(1)), par{arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, arg5 -> undef84}> 7.06/7.15 0) /\ (undef13 > ~(1)) /\ (0 = undef99), par{arg1 -> undef13, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0}> 7.06/7.15 0) /\ (undef98 > 0) /\ (undef19 > ~(1)), par{arg1 -> undef19, arg2 -> 0, arg3 -> 0, arg4 -> undef99, arg5 -> 1}> 7.06/7.15 ~(1)) /\ (undef99 > 0) /\ ((undef25 + 1) <= undef98) /\ (undef98 > 0) /\ (undef25 > ~(1)), par{arg1 -> undef25, arg2 -> 0, arg3 -> undef27, arg4 -> undef99, arg5 -> 1}> 7.06/7.15 = arg4) /\ (arg3 > arg2) /\ (arg4 > ~(1)) /\ ((undef31 - 2) <= arg1) /\ (arg1 > ~(1)) /\ (undef31 > 1), par{arg1 -> undef31, arg2 -> (arg2 + 1)}> 7.06/7.15 = arg4) /\ (arg3 > arg2) /\ (arg4 > ~(1)) /\ (arg1 > 0) /\ (undef37 > 4), par{arg1 -> undef37, arg2 -> (arg2 + 1)}> 7.06/7.15 ~(1)) /\ (arg3 > arg2) /\ (arg5 < arg4) /\ (arg5 > ~(1)) /\ (undef46 <= arg1) /\ (arg1 > ~(1)) /\ (undef44 > 1) /\ (undef46 > ~(1)) /\ (undef56 <= undef44) /\ ((undef56 - 2) <= undef46) /\ (undef44 > 1) /\ (undef46 > ~(1)) /\ (undef56 > 1), par{arg1 -> undef56, arg2 -> (arg2 + 1), arg3 -> arg3, arg4 -> arg4, arg5 -> (arg5 + 1)}> 7.06/7.15 ~(1)) /\ (arg3 > arg2) /\ (arg5 < arg4) /\ (arg5 > ~(1)) /\ (undef46 <= arg1) /\ (arg1 > ~(1)) /\ (undef44 > 1) /\ (undef46 > ~(1)) /\ (undef44 > 2) /\ (undef46 > 0) /\ (undef62 > 4), par{arg1 -> undef62, arg2 -> (arg2 + 1), arg3 -> arg3, arg4 -> arg4, arg5 -> (arg5 + 1)}> 7.06/7.15 ~(1)) /\ (arg3 > arg2) /\ (arg5 < arg4) /\ (undef55 > ~(1)) /\ (arg5 > ~(1)) /\ (undef52 <= arg1) /\ (arg1 > ~(1)) /\ (undef50 > 1) /\ (undef52 > ~(1)) /\ (undef56 <= undef50) /\ ((undef56 - 2) <= undef52) /\ (undef50 > 1) /\ (undef52 > ~(1)) /\ (undef56 > 1), par{arg1 -> undef56, arg2 -> (arg2 + 1), arg3 -> arg3, arg4 -> arg4, arg5 -> (arg5 + 1)}> 7.06/7.15 ~(1)) /\ (arg3 > arg2) /\ (arg5 < arg4) /\ (undef55 > ~(1)) /\ (arg5 > ~(1)) /\ (undef52 <= arg1) /\ (arg1 > ~(1)) /\ (undef50 > 1) /\ (undef52 > ~(1)) /\ (undef50 > 2) /\ (undef52 > 0) /\ (undef62 > 4), par{arg1 -> undef62, arg2 -> (arg2 + 1), arg3 -> arg3, arg4 -> arg4, arg5 -> (arg5 + 1)}> 7.06/7.15 2) /\ (arg2 > 0) /\ (undef74 > 0) /\ (undef75 > ~(1)) /\ ((arg3 + 2) <= arg1), par{arg1 -> undef74, arg2 -> undef75, arg3 -> undef76, arg4 -> undef77, arg5 -> undef78}> 7.06/7.15 2) /\ (arg2 > 1) /\ (arg3 > ~(1)) /\ (undef86 > 0) /\ (undef87 > 1) /\ (undef88 > 1), par{arg1 -> undef86, arg2 -> undef87, arg3 -> undef88, arg4 -> undef89, arg5 -> undef90}> 7.06/7.15 2) /\ (arg2 > 2) /\ (arg3 > 0) /\ (undef92 > 0) /\ (undef93 > 1) /\ (undef94 > 4), par{arg1 -> undef92, arg2 -> undef93, arg3 -> undef94, arg4 -> undef95, arg5 -> undef96}> 7.06/7.15 7.06/7.15 Fresh variables: 7.06/7.15 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef18, undef19, undef24, undef25, undef27, undef30, undef31, undef36, undef37, undef42, undef44, undef46, undef50, undef52, undef55, undef56, undef61, undef62, undef67, undef68, undef69, undef70, undef71, undef72, undef73, undef74, undef75, undef76, undef77, undef78, undef79, undef80, undef81, undef82, undef83, undef84, undef85, undef86, undef87, undef88, undef89, undef90, undef91, undef92, undef93, undef94, undef95, undef96, undef97, undef98, undef99, undef100, undef101, undef102, undef103, 7.06/7.15 7.06/7.15 Undef variables: 7.06/7.15 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef18, undef19, undef24, undef25, undef27, undef30, undef31, undef36, undef37, undef42, undef44, undef46, undef50, undef52, undef55, undef56, undef61, undef62, undef67, undef68, undef69, undef70, undef71, undef72, undef73, undef74, undef75, undef76, undef77, undef78, undef79, undef80, undef81, undef82, undef83, undef84, undef85, undef86, undef87, undef88, undef89, undef90, undef91, undef92, undef93, undef94, undef95, undef96, undef97, undef98, undef99, undef100, undef101, undef102, undef103, 7.06/7.15 7.06/7.15 Abstraction variables: 7.06/7.15 7.06/7.15 Exit nodes: 7.06/7.15 7.06/7.15 Accepting locations: 7.06/7.15 7.06/7.15 Asserts: 7.06/7.15 7.06/7.15 ************************************************************* 7.06/7.15 ******************************************************************************************* 7.06/7.15 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 7.06/7.15 ******************************************************************************************* 7.06/7.15 7.06/7.15 Init Location: 0 7.06/7.15 Graph 0: 7.06/7.15 Transitions: 7.06/7.15 Variables: 7.06/7.15 7.06/7.15 Graph 1: 7.06/7.15 Transitions: 7.06/7.15 undef31, arg2 -> 1 + arg2, rest remain the same}> 7.06/7.15 undef37, arg2 -> 1 + arg2, rest remain the same}> 7.06/7.15 undef56, arg2 -> 1 + arg2, arg5 -> 1 + arg5, rest remain the same}> 7.06/7.15 undef62, arg2 -> 1 + arg2, arg5 -> 1 + arg5, rest remain the same}> 7.06/7.15 undef56, arg2 -> 1 + arg2, arg5 -> 1 + arg5, rest remain the same}> 7.06/7.15 undef62, arg2 -> 1 + arg2, arg5 -> 1 + arg5, rest remain the same}> 7.06/7.15 Variables: 7.06/7.15 arg1, arg2, arg3, arg4, arg5 7.06/7.15 7.06/7.15 Graph 2: 7.06/7.15 Transitions: 7.06/7.15 undef86, arg2 -> undef87, arg3 -> undef88, arg4 -> undef89, arg5 -> undef90, rest remain the same}> 7.06/7.15 undef92, arg2 -> undef93, arg3 -> undef94, arg4 -> undef95, arg5 -> undef96, rest remain the same}> 7.06/7.15 Variables: 7.06/7.15 arg1, arg2, arg3, arg4, arg5 7.06/7.15 7.06/7.15 Graph 3: 7.06/7.15 Transitions: 7.06/7.15 undef74, arg2 -> undef75, arg3 -> undef76, arg4 -> undef77, arg5 -> undef78, rest remain the same}> 7.06/7.15 Variables: 7.06/7.15 arg1, arg2, arg3, arg4, arg5 7.06/7.15 7.06/7.15 Precedence: 7.06/7.15 Graph 0 7.06/7.15 7.06/7.15 Graph 1 7.06/7.15 undef13, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, rest remain the same}> 7.06/7.15 undef19, arg2 -> 0, arg3 -> 0, arg4 -> undef99, arg5 -> 1, rest remain the same}> 7.06/7.15 undef25, arg2 -> 0, arg3 -> undef27, arg4 -> undef99, arg5 -> 1, rest remain the same}> 7.06/7.15 7.06/7.15 Graph 2 7.06/7.15 undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, arg5 -> undef84, rest remain the same}> 7.06/7.15 7.06/7.15 Graph 3 7.06/7.15 undef68, arg2 -> undef69, arg3 -> undef70, arg4 -> undef71, arg5 -> undef72, rest remain the same}> 7.06/7.15 7.06/7.15 Map Locations to Subgraph: 7.06/7.15 ( 0 , 0 ) 7.06/7.15 ( 4 , 1 ) 7.06/7.15 ( 6 , 3 ) 7.06/7.15 ( 7 , 2 ) 7.06/7.15 7.06/7.15 ******************************************************************************************* 7.06/7.15 ******************************** CHECKING ASSERTIONS ******************************** 7.06/7.15 ******************************************************************************************* 7.06/7.15 7.06/7.15 Proving termination of subgraph 0 7.06/7.15 Proving termination of subgraph 1 7.06/7.15 Checking unfeasibility... 7.06/7.15 Time used: 0.037164 7.06/7.15 7.06/7.15 Checking conditional termination of SCC {l4}... 7.06/7.15 7.06/7.15 LOG: CALL solveLinear 7.06/7.15 7.06/7.15 LOG: RETURN solveLinear - Elapsed time: 0.012288s 7.06/7.15 Ranking function: -1 - arg2 + arg3 7.06/7.15 New Graphs: 7.06/7.15 Proving termination of subgraph 2 7.06/7.15 Checking unfeasibility... 7.06/7.15 Time used: 0.008729 7.06/7.15 7.06/7.15 Checking conditional termination of SCC {l7}... 7.06/7.15 7.06/7.15 LOG: CALL solveLinear 7.06/7.15 7.06/7.15 LOG: RETURN solveLinear - Elapsed time: 0.002451s 7.06/7.15 7.06/7.15 LOG: CALL solveLinear 7.06/7.15 7.06/7.15 LOG: RETURN solveLinear - Elapsed time: 0.015938s 7.06/7.15 Trying to remove transition: undef92, arg2 -> undef93, arg3 -> undef94, arg4 -> undef95, arg5 -> undef96, rest remain the same}> 7.06/7.15 Solving with 1 template(s). 7.06/7.15 7.06/7.15 LOG: CALL solveNonLinearGetFirstSolution 7.06/7.15 7.06/7.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020691s 7.06/7.15 Time used: 0.019978 7.06/7.15 Trying to remove transition: undef86, arg2 -> undef87, arg3 -> undef88, arg4 -> undef89, arg5 -> undef90, rest remain the same}> 7.06/7.15 Solving with 1 template(s). 7.06/7.15 7.06/7.15 LOG: CALL solveNonLinearGetFirstSolution 7.06/7.15 7.06/7.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023827s 7.06/7.15 Time used: 0.022579 7.06/7.15 Solving with 1 template(s). 7.06/7.15 7.06/7.15 LOG: CALL solveNonLinearGetFirstSolution 7.06/7.15 7.06/7.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.128725s 7.06/7.15 Time used: 0.127107 7.06/7.15 Improving Solution with cost 1 ... 7.06/7.15 7.06/7.15 LOG: CALL solveNonLinearGetNextSolution 7.06/7.15 7.06/7.15 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.085961s 7.06/7.15 Time used: 0.085949 7.06/7.15 7.06/7.15 LOG: SAT solveNonLinear - Elapsed time: 0.214686s 7.06/7.15 Cost: 1; Total time: 0.213056 7.06/7.15 Failed at location 7: arg1 <= 2 7.06/7.15 Before Improving: 7.06/7.15 Quasi-invariant at l7: arg1 <= 2 7.06/7.15 Optimizing invariants... 7.06/7.15 7.06/7.15 LOG: CALL solveLinear 7.06/7.15 7.06/7.15 LOG: RETURN solveLinear - Elapsed time: 0.011143s 7.06/7.15 Remaining time after improvement: 0.996027 7.06/7.15 Termination implied by a set of quasi-invariant(s): 7.06/7.15 Quasi-invariant at l7: arg1 <= 2 7.06/7.15 [ Invariant Graph ] 7.06/7.15 Strengthening and disabling transitions... 7.06/7.15 7.06/7.15 LOG: CALL solverLinear in Graph for feasibility 7.06/7.15 7.06/7.15 LOG: RETURN solveLinear in Graph for feasibility 7.06/7.15 It's unfeasible. Removing transition: 7.06/7.15 undef86, arg2 -> undef87, arg3 -> undef88, arg4 -> undef89, arg5 -> undef90, rest remain the same}> 7.06/7.15 7.06/7.15 LOG: CALL solverLinear in Graph for feasibility 7.06/7.15 7.06/7.15 LOG: RETURN solveLinear in Graph for feasibility 7.06/7.15 It's unfeasible. Removing transition: 7.06/7.15 undef92, arg2 -> undef93, arg3 -> undef94, arg4 -> undef95, arg5 -> undef96, rest remain the same}> 7.06/7.15 [ Termination Graph ] 7.06/7.15 Strengthening and disabling transitions... 7.06/7.15 7.06/7.15 LOG: CALL solverLinear in Graph for feasibility 7.06/7.15 7.06/7.15 LOG: RETURN solveLinear in Graph for feasibility 7.06/7.15 It's unfeasible. Removing transition: 7.06/7.15 undef86, arg2 -> undef87, arg3 -> undef88, arg4 -> undef89, arg5 -> undef90, rest remain the same}> 7.06/7.15 7.06/7.15 LOG: CALL solverLinear in Graph for feasibility 7.06/7.15 7.06/7.15 LOG: RETURN solveLinear in Graph for feasibility 7.06/7.15 It's unfeasible. Removing transition: 7.06/7.15 undef92, arg2 -> undef93, arg3 -> undef94, arg4 -> undef95, arg5 -> undef96, rest remain the same}> 7.06/7.15 New Graphs: 7.06/7.15 Calling Safety with literal arg1 <= 2 and entry undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, arg5 -> undef84, rest remain the same}> 7.06/7.15 7.06/7.15 LOG: CALL check - Post:arg1 <= 2 - Process 1 7.06/7.15 * Exit transition: undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, arg5 -> undef84, rest remain the same}> 7.06/7.15 * Postcondition : arg1 <= 2 7.06/7.15 7.06/7.15 LOG: CALL solveLinear 7.06/7.15 7.06/7.15 LOG: RETURN solveLinear - Elapsed time: 0.001218s 7.06/7.15 > Postcondition is not implied! 7.06/7.15 7.06/7.15 LOG: RETURN check - Elapsed time: 0.001382s 7.06/7.15 INVARIANTS: 7.06/7.15 7: 7.06/7.15 Quasi-INVARIANTS to narrow Graph: 7.06/7.15 7: arg1 <= 2 , 7.06/7.15 Narrowing transition: 7.06/7.15 undef86, arg2 -> undef87, arg3 -> undef88, arg4 -> undef89, arg5 -> undef90, rest remain the same}> 7.06/7.15 7.06/7.15 LOG: Narrow transition size 1 7.06/7.15 Narrowing transition: 7.06/7.15 undef92, arg2 -> undef93, arg3 -> undef94, arg4 -> undef95, arg5 -> undef96, rest remain the same}> 7.06/7.15 7.06/7.15 LOG: Narrow transition size 1 7.06/7.15 invGraph after Narrowing: 7.06/7.15 Transitions: 7.06/7.15 undef86, arg2 -> undef87, arg3 -> undef88, arg4 -> undef89, arg5 -> undef90, rest remain the same}> 7.06/7.15 undef92, arg2 -> undef93, arg3 -> undef94, arg4 -> undef95, arg5 -> undef96, rest remain the same}> 7.06/7.15 Variables: 7.06/7.15 arg1, arg2, arg3, arg4, arg5 7.06/7.15 Checking conditional termination of SCC {l7}... 7.06/7.15 7.06/7.15 LOG: CALL solveLinear 7.06/7.15 7.06/7.15 LOG: RETURN solveLinear - Elapsed time: 0.002231s 7.06/7.15 7.06/7.15 LOG: CALL solveLinear 7.06/7.15 7.06/7.15 LOG: RETURN solveLinear - Elapsed time: 0.016494s 7.06/7.15 Trying to remove transition: undef92, arg2 -> undef93, arg3 -> undef94, arg4 -> undef95, arg5 -> undef96, rest remain the same}> 7.06/7.15 Solving with 1 template(s). 7.06/7.15 7.06/7.15 LOG: CALL solveNonLinearGetFirstSolution 7.06/7.15 7.06/7.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021012s 7.06/7.15 Time used: 0.020152 7.06/7.15 Trying to remove transition: undef86, arg2 -> undef87, arg3 -> undef88, arg4 -> undef89, arg5 -> undef90, rest remain the same}> 7.06/7.15 Solving with 1 template(s). 7.06/7.15 7.06/7.15 LOG: CALL solveNonLinearGetFirstSolution 7.06/7.15 7.06/7.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024198s 7.06/7.15 Time used: 0.022769 7.06/7.15 Solving with 1 template(s). 7.06/7.15 7.06/7.15 LOG: CALL solveNonLinearGetFirstSolution 7.06/7.15 7.06/7.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.142814s 7.06/7.15 Time used: 0.141317 7.06/7.15 Solving with 2 template(s). 7.06/7.15 7.06/7.15 LOG: CALL solveNonLinearGetFirstSolution 7.06/7.15 7.06/7.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005018s 7.06/7.15 Time used: 4.00091 7.06/7.15 Solving with 3 template(s). 7.06/7.15 7.06/7.15 LOG: CALL solveNonLinearGetFirstSolution 7.06/7.15 7.06/7.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.010658s 7.06/7.15 Time used: 1.0007 7.06/7.15 Solving with 1 template(s). 7.06/7.15 7.06/7.15 LOG: CALL solveNonLinearGetFirstSolution 7.06/7.15 7.06/7.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.076181s 7.06/7.15 Time used: 0.037547 7.06/7.15 7.06/7.15 Proving non-termination of subgraph 2 7.06/7.15 Transitions: 7.06/7.15 undef86, arg2 -> undef87, arg3 -> undef88, arg4 -> undef89, arg5 -> undef90, rest remain the same}> 7.06/7.15 undef92, arg2 -> undef93, arg3 -> undef94, arg4 -> undef95, arg5 -> undef96, rest remain the same}> 7.06/7.15 Variables: 7.06/7.15 arg1, arg2, arg3, arg4, arg5 7.06/7.15 7.06/7.15 Checking that every undef value has an assignment... 7.06/7.15 7.06/7.15 LOG: CALL solveLinear 7.06/7.15 7.06/7.15 LOG: RETURN solveLinear - Elapsed time: 0.002469s 7.06/7.15 Checking conditional non-termination of SCC {l7}... 7.06/7.15 EXIT TRANSITIONS: 7.06/7.15 7.06/7.15 7.06/7.15 7.06/7.15 7.06/7.15 7.06/7.15 Solving with 1 template(s). 7.06/7.15 7.06/7.15 LOG: CALL solveNonLinearGetFirstSolution 7.06/7.15 7.06/7.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.080147s 7.06/7.15 Time used: 0.079428 7.06/7.15 Improving Solution with cost 3 ... 7.06/7.15 7.06/7.15 LOG: CALL solveNonLinearGetNextSolution 7.06/7.15 7.06/7.15 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.129991s 7.06/7.15 Time used: 0.129977 7.06/7.15 7.06/7.15 LOG: SAT solveNonLinear - Elapsed time: 0.210139s 7.06/7.15 Cost: 3; Total time: 0.209405 7.06/7.15 Minimizing number of undef constraints... 7.06/7.15 7.06/7.15 LOG: CALL solveNonLinear 7.06/7.15 7.06/7.15 LOG: RETURN solveNonLinear - Elapsed time: 0.014046s 7.06/7.15 Number of undef constraints reduced! 7.06/7.15 7.06/7.15 Non-termination implied by a set of quasi-invariant(s): 7.06/7.15 Quasi-invariant at l7: 0 <= arg3 7.06/7.15 7.06/7.15 Strengthening and disabling EXIT transitions... 7.06/7.15 Closed exits from l7: 2 7.06/7.15 Strengthening exit transition (result): 7.06/7.15 7.06/7.15 Strengthening exit transition (result): 7.06/7.15 7.06/7.15 7.06/7.15 Strengthening and disabling transitions... 7.06/7.15 7.06/7.15 LOG: CALL solverLinear in Graph for feasibility 7.06/7.15 7.06/7.15 LOG: RETURN solveLinear in Graph for feasibility 7.06/7.15 Strengthening transition (result): 7.06/7.15 undef86, arg2 -> undef87, arg3 -> undef88, arg4 -> undef89, arg5 -> undef90, rest remain the same}> 7.06/7.15 7.06/7.15 LOG: CALL solverLinear in Graph for feasibility 7.06/7.15 7.06/7.15 LOG: RETURN solveLinear in Graph for feasibility 7.06/7.15 Strengthening transition (result): 7.06/7.15 undef92, arg2 -> undef93, arg3 -> undef94, arg4 -> undef95, arg5 -> undef96, rest remain the same}> 7.06/7.15 7.06/7.15 Checking conditional non-termination of SCC {l7}... 7.06/7.15 EXIT TRANSITIONS: 7.06/7.15 7.06/7.15 7.06/7.15 7.06/7.15 Solving with 1 template(s). 7.06/7.15 7.06/7.15 LOG: CALL solveNonLinearGetFirstSolution 7.06/7.15 7.06/7.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.193658s 7.06/7.15 Time used: 0.193034 7.06/7.15 Improving Solution with cost 1 ... 7.06/7.15 7.06/7.15 LOG: CALL solveNonLinearGetNextSolution 7.06/7.15 7.06/7.15 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.097508s 7.06/7.15 Time used: 0.097496 7.06/7.15 7.06/7.15 LOG: SAT solveNonLinear - Elapsed time: 0.291167s 7.06/7.15 Cost: 1; Total time: 0.29053 7.06/7.15 Minimizing number of undef constraints... 7.06/7.15 7.06/7.15 LOG: CALL solveNonLinear 7.06/7.15 7.06/7.15 LOG: RETURN solveNonLinear - Elapsed time: 0.014665s 7.06/7.15 Number of undef constraints reduced! 7.06/7.15 7.06/7.15 Non-termination implied by a set of quasi-invariant(s): 7.06/7.15 Quasi-invariant at l7: 2 <= arg2 7.06/7.15 7.06/7.15 Strengthening and disabling EXIT transitions... 7.06/7.15 Closed exits from l7: 1 7.06/7.15 Strengthening exit transition (result): 7.06/7.15 7.06/7.15 7.06/7.15 Strengthening and disabling transitions... 7.06/7.15 7.06/7.15 LOG: CALL solverLinear in Graph for feasibility 7.06/7.15 7.06/7.15 LOG: RETURN solveLinear in Graph for feasibility 7.06/7.15 Strengthening transition (result): 7.06/7.15 undef86, arg2 -> undef87, arg3 -> undef88, arg4 -> undef89, arg5 -> undef90, rest remain the same}> 7.06/7.15 7.06/7.15 LOG: CALL solverLinear in Graph for feasibility 7.06/7.15 7.06/7.15 LOG: RETURN solveLinear in Graph for feasibility 7.06/7.15 Strengthening transition (result): 7.06/7.15 undef92, arg2 -> undef93, arg3 -> undef94, arg4 -> undef95, arg5 -> undef96, rest remain the same}> 7.06/7.15 7.06/7.15 Checking conditional non-termination of SCC {l7}... 7.06/7.15 EXIT TRANSITIONS: 7.06/7.15 7.06/7.15 7.06/7.15 Solving with 1 template(s). 7.06/7.15 7.06/7.15 LOG: CALL solveNonLinearGetFirstSolution 7.06/7.15 7.06/7.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.684477s 7.06/7.15 Time used: 0.683791 7.06/7.15 Improving Solution with cost 1 ... 7.06/7.15 7.06/7.15 LOG: CALL solveNonLinearGetNextSolution 7.06/7.15 7.06/7.15 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.091470s 7.06/7.15 Time used: 0.091457 7.06/7.15 7.06/7.15 LOG: SAT solveNonLinear - Elapsed time: 0.775947s 7.06/7.15 Cost: 1; Total time: 0.775248 7.06/7.15 Failed at location 7: 3 <= arg1 7.06/7.15 Before Improving: 7.06/7.15 Quasi-invariant at l7: 3 <= arg1 7.06/7.15 Optimizing invariants... 7.06/7.15 7.06/7.15 LOG: CALL solveLinear 7.06/7.15 7.06/7.15 LOG: RETURN solveLinear - Elapsed time: 0.009345s 7.06/7.15 Remaining time after improvement: 0.995557 7.06/7.15 Minimizing number of undef constraints... 7.06/7.15 7.06/7.15 LOG: CALL solveNonLinear 7.06/7.15 7.06/7.15 LOG: RETURN solveNonLinear - Elapsed time: 0.008709s 7.06/7.15 Non-termination implied by a set of quasi-invariant(s): 7.06/7.15 Quasi-invariant at l7: 3 <= arg1 7.06/7.15 Constraint over undef '3 <= undef86' in transition: 7.06/7.15 undef86, arg2 -> undef87, arg3 -> undef88, arg4 -> undef89, arg5 -> undef90, rest remain the same}> 7.06/7.15 Constraint over undef '3 <= undef92' in transition: 7.06/7.15 undef92, arg2 -> undef93, arg3 -> undef94, arg4 -> undef95, arg5 -> undef96, rest remain the same}> 7.06/7.15 7.06/7.15 Strengthening and disabling EXIT transitions... 7.06/7.15 Closed exits from l7: 1 7.06/7.15 7.06/7.15 Strengthening and disabling transitions... 7.06/7.15 7.06/7.15 LOG: CALL solverLinear in Graph for feasibility 7.06/7.15 7.06/7.15 LOG: RETURN solveLinear in Graph for feasibility 7.06/7.15 Strengthening transition (result): 7.06/7.15 undef86, arg2 -> undef87, arg3 -> undef88, arg4 -> undef89, arg5 -> undef90, rest remain the same}> 7.06/7.15 7.06/7.15 LOG: CALL solverLinear in Graph for feasibility 7.06/7.15 7.06/7.15 LOG: RETURN solveLinear in Graph for feasibility 7.06/7.15 Strengthening transition (result): 7.06/7.15 undef92, arg2 -> undef93, arg3 -> undef94, arg4 -> undef95, arg5 -> undef96, rest remain the same}> 7.06/7.15 7.06/7.15 Calling reachability with... 7.06/7.15 Transition: 7.06/7.15 Conditions: 0 <= arg3, 2 <= arg2, 3 <= arg1, 7.06/7.15 OPEN EXITS: 7.06/7.15 7.06/7.15 7.06/7.15 --- Reachability graph --- 7.06/7.15 > Graph without transitions. 7.06/7.15 7.06/7.15 Calling reachability with... 7.06/7.15 Transition: undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, arg5 -> undef84, rest remain the same}> 7.06/7.15 Conditions: 0 <= arg3, 2 <= arg2, 3 <= arg1, 7.06/7.15 OPEN EXITS: 7.06/7.15 undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, arg5 -> undef84, rest remain the same}> 7.06/7.15 7.06/7.15 > Conditions are reachable! 7.06/7.15 7.06/7.15 Program does NOT terminate 7.06/7.15 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 7.06/7.15 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 7.06/7.15 EOF