/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: 0) /\ (undef1 > 0) /\ (0 = arg2), par{arg1 -> undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0, arg7 -> 0}> ~(1)) /\ (arg1 > 0) /\ (undef8 > 0) /\ (1 = arg2), par{arg1 -> undef8, arg2 -> undef9, arg3 -> 0, arg4 -> 0, arg5 -> 1, arg6 -> 1, arg7 -> 1}> ~(1)) /\ (undef18 > ~(1)) /\ (undef15 <= arg1) /\ (arg1 > 0) /\ (undef15 > 0) /\ (2 = arg2), par{arg1 -> undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2}> ~(1)) /\ (arg2 > 2) /\ (undef29 > ~(1)) /\ (undef24 > ~(1)) /\ (arg1 >= undef22) /\ (arg1 > 0) /\ (undef22 > 0), par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> (undef29 - undef24), arg5 -> arg2, arg6 -> 3, arg7 -> arg2}> 0) /\ (arg2 > ~(1)) /\ (arg6 >= arg5) /\ (arg5 > ~(1)) /\ (undef30 <= arg1) /\ (arg1 > 0) /\ (undef30 > 0) /\ (arg2 = arg3) /\ (arg5 = arg7), par{arg1 -> undef30, arg2 -> (arg2 + 1), arg3 -> (arg2 + 1), arg4 -> (10 - (arg2 + 1)), arg7 -> arg5}> ~(1)) /\ (arg4 > 0) /\ (arg6 > ~(1)) /\ (arg6 < arg5) /\ (undef44 > ~(1)) /\ (arg2 > ~(1)) /\ (((arg2 + 1) + undef44) >= 0) /\ (undef37 <= arg1) /\ (arg1 > 0) /\ (undef37 > 0) /\ (arg2 = arg3) /\ (arg5 = arg7), par{arg1 -> undef37, arg2 -> ((arg2 + 1) + undef44), arg3 -> ((arg2 + 1) + undef44), arg4 -> (10 - ((arg2 + 1) + undef44)), arg6 -> (arg6 + 1), arg7 -> arg5}> undef45, arg2 -> undef46, arg3 -> undef47, arg4 -> undef48, arg5 -> undef49, arg6 -> undef50, arg7 -> undef51}> Fresh variables: undef1, undef8, undef9, undef15, undef16, undef18, undef22, undef23, undef24, undef29, undef30, undef37, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, Undef variables: undef1, undef8, undef9, undef15, undef16, undef18, undef22, undef23, undef24, undef29, undef30, undef37, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef1 > 0) /\ (0 = undef46), par{arg1 -> undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0, arg7 -> 0}> ~(1)) /\ (undef45 > 0) /\ (undef8 > 0) /\ (1 = undef46), par{arg1 -> undef8, arg2 -> undef9, arg3 -> 0, arg4 -> 0, arg5 -> 1, arg6 -> 1, arg7 -> 1}> ~(1)) /\ (undef18 > ~(1)) /\ (undef15 <= undef45) /\ (undef45 > 0) /\ (undef15 > 0) /\ (2 = undef46), par{arg1 -> undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2}> ~(1)) /\ (undef46 > 2) /\ (undef29 > ~(1)) /\ (undef24 > ~(1)) /\ (undef45 >= undef22) /\ (undef45 > 0) /\ (undef22 > 0), par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> (undef29 - undef24), arg5 -> undef46, arg6 -> 3, arg7 -> undef46}> 0) /\ (arg2 > ~(1)) /\ (arg6 >= arg5) /\ (arg5 > ~(1)) /\ (undef30 <= arg1) /\ (arg1 > 0) /\ (undef30 > 0) /\ (arg2 = arg3) /\ (arg5 = arg7), par{arg1 -> undef30, arg2 -> (arg2 + 1), arg3 -> (arg2 + 1), arg4 -> (10 - (arg2 + 1)), arg7 -> arg5}> ~(1)) /\ (arg4 > 0) /\ (arg6 > ~(1)) /\ (arg6 < arg5) /\ (undef44 > ~(1)) /\ (arg2 > ~(1)) /\ (((arg2 + 1) + undef44) >= 0) /\ (undef37 <= arg1) /\ (arg1 > 0) /\ (undef37 > 0) /\ (arg2 = arg3) /\ (arg5 = arg7), par{arg1 -> undef37, arg2 -> ((arg2 + 1) + undef44), arg3 -> ((arg2 + 1) + undef44), arg4 -> (10 - ((arg2 + 1) + undef44)), arg6 -> (arg6 + 1), arg7 -> arg5}> Fresh variables: undef1, undef8, undef9, undef15, undef16, undef18, undef22, undef23, undef24, undef29, undef30, undef37, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, Undef variables: undef1, undef8, undef9, undef15, undef16, undef18, undef22, undef23, undef24, undef29, undef30, undef37, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Precedence: Graph 0 Graph 1 undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0, arg7 -> 0, rest remain the same}> undef8, arg2 -> undef9, arg3 -> 0, arg4 -> 0, arg5 -> 1, arg6 -> 1, arg7 -> 1, rest remain the same}> undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.601241 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005786s Ranking function: -4 + 4*arg5 - 4*arg6 New Graphs: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001227s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006420s [34745 : 34746] [34745 : 34747] Successful child: 34746 [ 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: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, 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: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> New Graphs: [34745 : 34751] [34745 : 34752] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg3 + arg4 <= 0 , Narrowing transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004026s Ranking function: arg5 - arg6 New Graphs: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001357s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007097s [34745 : 34753] [34745 : 34754] Successful child: 34753 [ 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: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, 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: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> New Graphs: [34745 : 34758] [34745 : 34759] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg3 + arg5 + arg6 <= arg2 + arg7 , Narrowing transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004261s Ranking function: arg5 - arg6 New Graphs: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001478s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008192s [34745 : 34760] [34745 : 34761] Successful child: 34760 [ 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: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> New Graphs: [34745 : 34765] [34745 : 34766] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg2 + arg4 + arg5 + arg6 <= 0 , Narrowing transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004630s Ranking function: -5 + 5*arg5 - arg6 New Graphs: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001579s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008658s [34745 : 34767] [34745 : 34768] Successful child: 34767 [ 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: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, 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: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> New Graphs: [34745 : 34772] [34745 : 34773] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg3 + arg5 <= arg2 + arg7 , Narrowing transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004896s Ranking function: arg5 - arg6 New Graphs: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001659s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009111s [34745 : 34774] [34745 : 34775] Successful child: 34774 [ 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: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, 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: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> New Graphs: [34745 : 34779] [34745 : 34780] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg1 + arg3 + arg4 + arg5 <= arg2 + arg7 , Narrowing transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005142s Ranking function: 4 + arg5 - arg6 New Graphs: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001783s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011233s [34745 : 34781] [34745 : 34782] Successful child: 34781 [ 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: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> New Graphs: [34745 : 34786] [34745 : 34787] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg2 + arg4 + arg5 <= arg7 , Narrowing transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006653s Ranking function: -6 + 6*arg5 - 6*arg6 New Graphs: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001895s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010436s [34745 : 34788] [34745 : 34789] Successful child: 34788 [ 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: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> New Graphs: [34745 : 34793] [34745 : 34794] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg2 + arg5 <= arg3 + arg7 , Narrowing transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006161s Ranking function: arg5 - arg6 New Graphs: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001995s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010351s [34745 : 34795] [34745 : 34796] Successful child: 34795 [ 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: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, 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: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> New Graphs: [34745 : 34800] [34745 : 34801] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg2 + arg4 + arg5 + arg6 <= arg3 + arg7 , Narrowing transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006542s Ranking function: arg5 - arg6 New Graphs: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002134s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011513s [34745 : 34802] [34745 : 34803] Successful child: 34802 [ 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: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, 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: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> New Graphs: [34745 : 34807] [34745 : 34808] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg4 + arg7 <= arg5 , Narrowing transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006383s Ranking function: 5 + arg5 - arg6 New Graphs: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002236s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012348s [34745 : 34809] [34745 : 34810] Successful child: 34809 [ 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: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, 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: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> New Graphs: [34745 : 34814] [34745 : 34815] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 + arg3 + arg4 + arg7 <= 1 + arg2 + arg5 , Narrowing transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007086s Ranking function: 1 + arg5 - arg6 New Graphs: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002457s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015346s [34745 : 34816] [34745 : 34817] Successful child: 34816 [ 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: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> New Graphs: [34745 : 34821] [34745 : 34822] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg4 <= 0 , Narrowing transition: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007148s Ranking function: 1 + arg5 - arg6 New Graphs: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002467s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015356s [34745 : 34823] [34745 : 34824] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.065891s Time used: 0.06401 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000789s Time used: 1.00076 LOG: SAT solveNonLinear - Elapsed time: 1.066680s Cost: 1; Total time: 1.06477 Termination implied by a set of invariant(s): Invariant at l2: arg5 <= arg2 + arg3 + arg4 + arg7 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> Quasi-ranking function: 50000 - arg2 - 8*arg3 + arg4 + 10*arg6 New Graphs: Transitions: undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6, arg7 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003686s Ranking function: (9 / 10)*arg1 + (24951 / 5)*arg2 + (9 / 5)*arg3 + (9 / 10)*arg4 + arg5 - arg7 New Graphs: INVARIANTS: 2: arg5 <= arg2 + arg3 + arg4 + arg7 , Quasi-INVARIANTS to narrow Graph: 2: Program Terminates