/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> 0, arg3 -> 1, arg4 -> arg2}> arg3) /\ (arg2 > ~(1)) /\ (arg3 > 0) /\ (undef5 <= arg1) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> arg3, arg3 -> (arg3 + arg2)}> ~(1)) /\ (arg3 > 0) /\ (undef9 <= arg1) /\ (arg1 > 0) /\ (undef9 > 0), par{arg1 -> undef9, arg2 -> arg3, arg3 -> (arg3 + arg2)}> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16}> Fresh variables: undef1, undef5, undef9, undef13, undef14, undef15, undef16, Undef variables: undef1, undef5, undef9, undef13, undef14, undef15, undef16, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef13 > 0) /\ (undef1 > 0)> arg3) /\ (arg2 > ~(1)) /\ (arg3 > 0) /\ (undef5 <= arg1) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> arg3, arg3 -> (arg3 + arg2)}> ~(1)) /\ (arg3 > 0) /\ (undef9 <= arg1) /\ (arg1 > 0) /\ (undef9 > 0), par{arg1 -> undef9, arg2 -> arg3, arg3 -> (arg3 + arg2)}> Fresh variables: undef1, undef5, undef9, undef13, undef14, undef15, undef16, Undef variables: undef1, undef5, undef9, undef13, undef14, undef15, undef16, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Precedence: Graph 0 Graph 1 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.010104 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001846s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011907s [37398 : 37399] [37398 : 37400] Successful child: 37399 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef9, arg2 -> arg3, arg3 -> arg2 + arg3, 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): undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Ranking function: -arg2 - 2*arg3 + 3*arg4 New Graphs: Transitions: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001073s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004832s [37398 : 37404] [37398 : 37405] Successful child: 37404 [ 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: undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, 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: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> New Graphs: INVARIANTS: 2: arg2 <= 1 + arg3 , Quasi-INVARIANTS to narrow Graph: 2: [37398 : 37409] [37398 : 37410] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 + arg3 <= 1 + arg4 , arg4 <= 1 , Narrowing transition: undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004832s Ranking function: -43 + 14*arg1 - arg2 - arg3 + 2*arg4 New Graphs: Transitions: undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003032s Ranking function: -3 - arg2 - 3*arg3 + 4*arg4 New Graphs: Transitions: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001156s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005329s [37398 : 37411] [37398 : 37412] Successful child: 37411 [ 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: undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> New Graphs: [37398 : 37416] [37398 : 37417] [37398 : 37418] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg2 + arg4 <= 1 , arg2 + arg3 <= arg4 , Narrowing transition: undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008015s Ranking function: -6 - arg2 - 6*arg3 + 7*arg4 New Graphs: Transitions: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002515s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.025634s [37398 : 37419] [37398 : 37420] Successful child: 37419 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef9, arg2 -> arg3, arg3 -> arg2 + arg3, 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: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> New Graphs: Transitions: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001387s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009019s [37398 : 37424] [37398 : 37425] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.044343s Time used: 0.043248 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000821s Time used: 1.00081 LOG: SAT solveNonLinear - Elapsed time: 1.045165s Cost: 1; Total time: 1.04406 Termination implied by a set of invariant(s): Invariant at l2: 1 <= arg1 + arg2 + arg4 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef9, arg2 -> arg3, arg3 -> arg2 + arg3, 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): undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Quasi-ranking function: 50000 - arg2 - arg3 New Graphs: Transitions: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001582s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.048221s [37398 : 37429] [37398 : 37430] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.044689s Time used: 0.043452 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002608s Time used: 1.00262 LOG: SAT solveNonLinear - Elapsed time: 1.047297s Cost: 1; Total time: 1.04607 Termination implied by a set of invariant(s): Invariant at l2: arg2 <= arg1 + arg3 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef9, arg2 -> arg3, arg3 -> arg2 + arg3, 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): undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Quasi-ranking function: 50000 + arg1 - arg2 - arg3 + arg4 New Graphs: Transitions: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 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.026648s [37398 : 37434] [37398 : 37435] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.046715s Time used: 0.044984 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000802s Time used: 1.00081 LOG: SAT solveNonLinear - Elapsed time: 1.047517s Cost: 1; Total time: 1.04579 Termination implied by a set of invariant(s): Invariant at l2: 1 <= arg1 + arg2 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef9, arg2 -> arg3, arg3 -> arg2 + arg3, 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): undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Quasi-ranking function: 50000 - arg1 - arg2 - 2*arg3 + arg4 New Graphs: Transitions: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001994s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.041065s [37398 : 37439] [37398 : 37440] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.063917s Time used: 0.061895 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001104s Time used: 1.00113 LOG: SAT solveNonLinear - Elapsed time: 1.065021s Cost: 1; Total time: 1.06303 Termination implied by a set of invariant(s): Invariant at l2: 0 <= 1 + arg2 + arg4 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef9, arg2 -> arg3, arg3 -> arg2 + arg3, 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): undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Quasi-ranking function: 50000 + arg1 - arg2 - arg3 - 2*arg4 New Graphs: Transitions: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002131s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.185978s [37398 : 37444] [37398 : 37445] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.065319s Time used: 0.063095 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000824s Time used: 1.00085 LOG: SAT solveNonLinear - Elapsed time: 1.066143s Cost: 1; Total time: 1.06394 Termination implied by a set of invariant(s): Invariant at l2: 1 <= arg1 + arg2 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef9, arg2 -> arg3, arg3 -> arg2 + arg3, 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): undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Quasi-ranking function: 50000 - arg1 - arg2 - 2*arg3 - arg4 New Graphs: Transitions: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002243s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.030565s [37398 : 37449] [37398 : 37450] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.070118s Time used: 0.067793 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.007122s Time used: 1.00713 LOG: SAT solveNonLinear - Elapsed time: 1.077240s Cost: 1; Total time: 1.07492 Quasi-ranking function: 50000 - arg2 - arg3 + arg4 New Graphs: Transitions: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002335s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.054950s [37398 : 37454] [37398 : 37455] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.075541s Time used: 0.07303 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000876s Time used: 1.0009 LOG: SAT solveNonLinear - Elapsed time: 1.076418s Cost: 1; Total time: 1.07393 Termination implied by a set of invariant(s): Invariant at l2: 0 <= arg1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef9, arg2 -> arg3, arg3 -> arg2 + arg3, 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): undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Quasi-ranking function: 50000 - arg2 - arg3 - arg4 New Graphs: Transitions: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002458s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.033188s [37398 : 37459] [37398 : 37460] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.070245s Time used: 0.067598 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001139s Time used: 1.00117 LOG: SAT solveNonLinear - Elapsed time: 1.071384s Cost: 1; Total time: 1.06877 Termination implied by a set of invariant(s): Invariant at l2: 1 <= arg1 + arg2 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef9, arg2 -> arg3, arg3 -> arg2 + arg3, 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): undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Quasi-ranking function: 50000 + arg1 - arg2 - arg3 New Graphs: Transitions: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003438s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.072837s [37398 : 37464] [37398 : 37465] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.072594s Time used: 0.069816 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001037s Time used: 1.00105 LOG: SAT solveNonLinear - Elapsed time: 1.073631s Cost: 1; Total time: 1.07086 Termination implied by a set of invariant(s): Invariant at l2: 1 <= arg1 + arg2 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef5, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef9, arg2 -> arg3, arg3 -> arg2 + arg3, 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): undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Quasi-ranking function: 50000 - arg1 - arg2 - 2*arg3 New Graphs: Transitions: undef9, arg2 -> arg3, arg3 -> arg2 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003582s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.095672s [37398 : 37469] [37398 : 37470] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.106199s Time used: 4.10208 [37398 : 37590] [37398 : 37594] Successful child: 37594 Program does NOT terminate