NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg2 > 0) /\ (undef2 <= arg1) /\ (arg1 > 0) /\ (undef1 > 2) /\ (undef2 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> arg2, arg4 -> undef4, arg5 -> undef5}> 0) /\ (undef8 <= arg1) /\ (arg1 > 0) /\ (undef7 > 1) /\ (undef8 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> arg2, arg4 -> undef10, arg5 -> undef11}> = 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}> ~(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}> ~(1)) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> undef23, arg2 -> undef24, arg3 -> undef25, arg4 -> undef26, arg5 -> undef27}> ~(1)) /\ (arg3 > 1) /\ (arg1 > 0) /\ (arg2 > 0), par{arg1 -> undef28, arg2 -> undef29, arg3 -> undef30, arg4 -> undef31, arg5 -> undef32}> 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, arg5 -> undef37}> 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}> 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}> 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}> undef53, arg2 -> undef54, arg3 -> undef55, arg4 -> undef56, arg5 -> undef57}> Fresh variables: 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, Undef variables: 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, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(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}> ~(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}> ~(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}> 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}> 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}> 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}> ~(1)) /\ (undef54 > 0) /\ (undef53 > 0), par{arg1 -> undef23, arg2 -> undef24, arg3 -> undef25, arg4 -> undef26}> 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef34, arg3 -> undef35, arg4 -> undef36}> 0) /\ (arg2 > 1) /\ (arg3 > 2) /\ (arg4 > 0) /\ (undef43 > 0) /\ (undef44 > 2) /\ (undef45 > 2) /\ (undef46 > 0), par{arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46}> 2) /\ (arg2 > 2) /\ (arg3 > 2) /\ (arg4 > 0) /\ (undef48 > 0) /\ (undef49 > 0) /\ (undef50 > 2) /\ (undef51 > 0), par{arg1 -> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51}> Fresh variables: 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, Undef variables: 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, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg1, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Graph 2: Transitions: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Precedence: Graph 0 Graph 1 undef28, arg2 -> undef29, arg3 -> undef30, arg4 -> undef31, rest remain the same}> undef28, arg2 -> undef29, arg3 -> undef30, arg4 -> undef31, rest remain the same}> undef23, arg2 -> undef24, arg3 -> undef25, arg4 -> undef26, rest remain the same}> Graph 2 undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 4 , 1 ) ( 5 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.00386 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000845s Ranking function: -1 + arg1 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.019333 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005574s Ranking function: -24 + 8*arg1 New Graphs: Transitions: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001773s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009927s Trying to remove transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016533s Time used: 0.015972 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045389s Time used: 0.044204 Improving Solution with cost 4 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.055826s Time used: 0.055822 LOG: SAT solveNonLinear - Elapsed time: 0.101215s Cost: 4; Total time: 0.100026 Failed at location 5: arg4 <= 0 Failed at location 5: arg4 <= 0 Failed at location 5: arg4 <= 0 Failed at location 5: arg4 <= 0 Before Improving: Quasi-invariant at l5: arg4 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010240s Remaining time after improvement: 0.994328 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l5: arg4 <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> New Graphs: Calling Safety with literal arg4 <= 0 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> LOG: CALL check - Post:arg4 <= 0 - Process 1 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> * Postcondition : arg4 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001683s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001985s Calling Safety with literal arg4 <= 0 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> LOG: CALL check - Post:arg4 <= 0 - Process 2 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> * Postcondition : arg4 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001552s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001840s Calling Safety with literal arg4 <= 0 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> LOG: CALL check - Post:arg4 <= 0 - Process 3 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> * Postcondition : arg4 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001516s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001819s Calling Safety with literal arg4 <= 0 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> LOG: CALL check - Post:arg4 <= 0 - Process 4 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> * Postcondition : arg4 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001464s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001744s INVARIANTS: 5: Quasi-INVARIANTS to narrow Graph: 5: arg4 <= 0 , Narrowing transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005194s Ranking function: -24 + 8*arg1 New Graphs: Transitions: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001788s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010134s Trying to remove transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016662s Time used: 0.01609 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038214s Time used: 0.037147 Improving Solution with cost 4 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.061584s Time used: 0.061582 LOG: SAT solveNonLinear - Elapsed time: 0.099798s Cost: 4; Total time: 0.098729 Failed at location 5: arg3 <= 1 Failed at location 5: arg3 <= 1 Failed at location 5: arg3 <= 1 Failed at location 5: arg3 <= 1 Before Improving: Quasi-invariant at l5: arg3 <= 1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010209s Remaining time after improvement: 0.994181 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l5: arg3 <= 1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> New Graphs: Calling Safety with literal arg3 <= 1 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> LOG: CALL check - Post:arg3 <= 1 - Process 5 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> * Postcondition : arg3 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001705s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.002010s Calling Safety with literal arg3 <= 1 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> LOG: CALL check - Post:arg3 <= 1 - Process 6 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> * Postcondition : arg3 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001582s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001863s Calling Safety with literal arg3 <= 1 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> LOG: CALL check - Post:arg3 <= 1 - Process 7 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> * Postcondition : arg3 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001541s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001845s Calling Safety with literal arg3 <= 1 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> LOG: CALL check - Post:arg3 <= 1 - Process 8 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> * Postcondition : arg3 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001498s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001780s INVARIANTS: 5: Quasi-INVARIANTS to narrow Graph: 5: arg3 <= 1 , Narrowing transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005224s Ranking function: -24 + 8*arg1 New Graphs: Transitions: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001803s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010112s Trying to remove transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016742s Time used: 0.016157 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045145s Time used: 0.043934 Improving Solution with cost 4 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.050333s Time used: 0.050329 LOG: SAT solveNonLinear - Elapsed time: 0.095478s Cost: 4; Total time: 0.094263 Failed at location 5: arg2 <= 1 Failed at location 5: arg2 <= 1 Failed at location 5: arg2 <= 1 Failed at location 5: arg2 <= 1 Before Improving: Quasi-invariant at l5: arg2 <= 1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010251s Remaining time after improvement: 0.994144 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l5: arg2 <= 1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> New Graphs: Calling Safety with literal arg2 <= 1 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> LOG: CALL check - Post:arg2 <= 1 - Process 9 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> * Postcondition : arg2 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001735s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.002060s Calling Safety with literal arg2 <= 1 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> LOG: CALL check - Post:arg2 <= 1 - Process 10 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> * Postcondition : arg2 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001607s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001889s Calling Safety with literal arg2 <= 1 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> LOG: CALL check - Post:arg2 <= 1 - Process 11 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> * Postcondition : arg2 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001563s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001859s Calling Safety with literal arg2 <= 1 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> LOG: CALL check - Post:arg2 <= 1 - Process 12 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> * Postcondition : arg2 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001508s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001810s INVARIANTS: 5: Quasi-INVARIANTS to narrow Graph: 5: arg2 <= 1 , Narrowing transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005306s Ranking function: -24 + 8*arg1 New Graphs: Transitions: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001814s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010154s Trying to remove transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016732s Time used: 0.016131 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.104553s Time used: 0.10346 Improving Solution with cost 4 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.069133s Time used: 0.06913 LOG: SAT solveNonLinear - Elapsed time: 0.173686s Cost: 4; Total time: 0.17259 Failed at location 5: arg3 <= 2 Failed at location 5: arg3 <= 2 Failed at location 5: arg3 <= 2 Failed at location 5: arg3 <= 2 Before Improving: Quasi-invariant at l5: arg3 <= 2 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011186s Remaining time after improvement: 0.994174 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l5: arg3 <= 2 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> New Graphs: Calling Safety with literal arg3 <= 2 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> LOG: CALL check - Post:arg3 <= 2 - Process 13 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> * Postcondition : arg3 <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001764s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.002070s Calling Safety with literal arg3 <= 2 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> LOG: CALL check - Post:arg3 <= 2 - Process 14 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> * Postcondition : arg3 <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001626s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001927s Calling Safety with literal arg3 <= 2 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> LOG: CALL check - Post:arg3 <= 2 - Process 15 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> * Postcondition : arg3 <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001583s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001877s Calling Safety with literal arg3 <= 2 and entry undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> LOG: CALL check - Post:arg3 <= 2 - Process 16 * Exit transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> * Postcondition : arg3 <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001521s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001803s INVARIANTS: 5: Quasi-INVARIANTS to narrow Graph: 5: arg3 <= 2 , Narrowing transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005320s Ranking function: -24 + 8*arg1 New Graphs: Transitions: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001824s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010111s Trying to remove transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016642s Time used: 0.016044 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.146047s Time used: 0.145298 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004072s Time used: 4.00134 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.014542s Time used: 1.00008 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041079s Time used: 0.026815 Proving non-termination of subgraph 2 Transitions: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009033s Checking conditional non-termination of SCC {l5}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.256471s Time used: 0.254678 Improving Solution with cost 7 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.301831s Time used: 0.301829 LOG: SAT solveNonLinear - Elapsed time: 0.558302s Cost: 7; Total time: 0.556507 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.034455s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l5: 1 <= arg1 Strengthening and disabling EXIT transitions... Closed exits from l5: 2 Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> Checking conditional non-termination of SCC {l5}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.578631s Time used: 0.577173 Improving Solution with cost 7 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.326238s Time used: 0.32625 LOG: SAT solveNonLinear - Elapsed time: 0.904869s Cost: 7; Total time: 0.903423 Failed at location 5: 1 + arg1 <= arg2 Failed at location 5: 1 + arg1 <= arg2 Failed at location 5: 1 + arg1 <= arg2 Failed at location 5: 1 + arg1 <= arg2 Before Improving: Quasi-invariant at l5: 1 + arg1 <= arg2 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.018889s Remaining time after improvement: 0.988428 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.022962s Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l5: 1 + arg1 <= arg2 Constraint over undef 'undef43 <= 1' in transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> Constraint over undef '1 + undef48 <= undef49' in transition: undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> Strengthening and disabling EXIT transitions... Closed exits from l5: 2 Strengthening exit transition (result): Strengthening exit transition (result): Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> Checking conditional non-termination of SCC {l5}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.900930s Time used: 1.89912 Improving Solution with cost 5 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.383724s Time used: 0.383738 LOG: SAT solveNonLinear - Elapsed time: 2.284654s Cost: 5; Total time: 2.28286 Failed at location 5: 1 <= arg4 Failed at location 5: 1 <= arg4 Failed at location 5: 1 <= arg4 Failed at location 5: 1 <= arg4 Before Improving: Quasi-invariant at l5: 1 <= arg4 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.021818s Remaining time after improvement: 0.985922 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.026726s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l5: 1 <= arg4 Strengthening and disabling EXIT transitions... Closed exits from l5: 1 Strengthening exit transition (result): Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> Checking conditional non-termination of SCC {l5}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.653243s Time used: 0.651772 Improving Solution with cost 4 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.302568s Time used: 0.302577 LOG: SAT solveNonLinear - Elapsed time: 0.955811s Cost: 4; Total time: 0.954349 Failed at location 5: 1 + arg1 + arg4 <= arg3 Failed at location 5: 1 + arg1 + arg4 <= arg3 Failed at location 5: 1 + arg1 + arg4 <= arg3 Failed at location 5: 1 + arg1 + arg4 <= arg3 Before Improving: Quasi-invariant at l5: 1 + arg1 + arg4 <= arg3 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.022123s Remaining time after improvement: 0.985866 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.034796s Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l5: 1 + arg1 + arg4 <= arg3 Constraint over undef 'arg4 + undef44 + undef46 <= 1 + undef43 + undef45' in transition: undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> Constraint over undef 'undef48 + undef49 + undef51 <= 1 + undef50' in transition: undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> Strengthening and disabling EXIT transitions... Closed exits from l5: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}> Calling reachability with... Transition: Conditions: 1 <= arg1, 1 + arg1 <= arg2, 1 <= arg4, 1 + arg1 + arg4 <= arg3, Transition: Conditions: 1 <= arg1, 1 + arg1 <= arg2, 1 <= arg4, 1 + arg1 + arg4 <= arg3, Transition: Conditions: 1 <= arg1, 1 + arg1 <= arg2, 1 <= arg4, 1 + arg1 + arg4 <= arg3, Transition: Conditions: 1 <= arg1, 1 + arg1 <= arg2, 1 <= arg4, 1 + arg1 + arg4 <= arg3, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, Transition: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> Conditions: 1 + arg1 <= arg2, 1 + arg1 + arg4 <= arg3, 1 <= arg1, 1 <= arg4, OPEN EXITS: undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}> > Conditions are reachable! Program does NOT terminate