/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: 2, arg2 -> 2, arg3 -> 2, arg4 -> 0}> arg2) /\ (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 + 4), arg3 -> arg4, arg4 -> undef8}> 0) /\ (arg4 > ~(1)) /\ (arg2 = arg3), par{arg2 -> (arg2 + 2), arg3 -> (arg4 + 1), arg4 -> undef12}> 0) /\ (arg1 > 1) /\ (arg2 > 1), par{arg1 -> arg2, arg3 -> arg2, arg4 -> arg3}> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20}> Fresh variables: undef8, undef12, undef17, undef18, undef19, undef20, Undef variables: undef8, undef12, undef17, undef18, undef19, undef20, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: arg2) /\ (arg2 > 0) /\ (arg2 = arg3) /\ (arg4 > 0) /\ (arg1 > 1) /\ ((arg2 + 4) > 1), par{arg1 -> (arg2 + 4), arg2 -> (arg2 + 4), arg3 -> (arg2 + 4), arg4 -> arg4}> 0) /\ (arg4 > ~(1)) /\ (arg2 = arg3) /\ ((arg4 + 1) > 0) /\ (arg1 > 1) /\ ((arg2 + 2) > 1), par{arg1 -> (arg2 + 2), arg2 -> (arg2 + 2), arg3 -> (arg2 + 2), arg4 -> (arg4 + 1)}> Fresh variables: undef8, undef12, undef17, undef18, undef19, undef20, Undef variables: undef8, undef12, undef17, undef18, undef19, undef20, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 4 + arg2, arg2 -> 4 + arg2, arg3 -> 4 + arg2, rest remain the same}> 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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.013841 Some transition disabled by a set of invariant(s): Invariant at l2: arg4 <= arg2 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 4 + arg2, arg2 -> 4 + arg2, arg3 -> 4 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Checking unfeasibility... Time used: 0.05298 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001051s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003484s [18690 : 18691] [18690 : 18692] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.034675s Time used: 0.034028 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.999771s Time used: 1.00032 LOG: SAT solveNonLinear - Elapsed time: 1.034446s Cost: 1; Total time: 1.03435 Termination implied by a set of invariant(s): Invariant at l2: arg3 <= 1 + arg2 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 - arg3 + arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000937s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005039s [18690 : 18696] [18690 : 18697] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.037548s Time used: 0.036807 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.999841s Time used: 1.0004 LOG: SAT solveNonLinear - Elapsed time: 1.037389s Cost: 1; Total time: 1.0372 Termination implied by a set of invariant(s): Invariant at l2: 0 <= 1 + arg3 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 + arg2 - 3*arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001126s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.016284s [18690 : 18701] [18690 : 18702] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.054493s Time used: 0.053623 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.999886s Time used: 1.00045 LOG: SAT solveNonLinear - Elapsed time: 1.054378s Cost: 1; Total time: 1.05407 Termination implied by a set of invariant(s): Invariant at l2: arg4 <= 1 + arg1 + arg2 + arg3 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 - 2*arg2 + arg3 + arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001327s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010236s [18690 : 18822] [18690 : 18823] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.076677s Time used: 0.075804 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.999788s Time used: 1.00035 LOG: SAT solveNonLinear - Elapsed time: 1.076465s Cost: 1; Total time: 1.07616 Termination implied by a set of invariant(s): Invariant at l2: arg3 <= arg1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 + arg1 - 3*arg2 + arg3 + arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001604s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.024070s [18690 : 18827] [18690 : 18828] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.068495s Time used: 0.067547 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.999819s Time used: 1.00038 LOG: SAT solveNonLinear - Elapsed time: 1.068314s Cost: 1; Total time: 1.06792 Termination implied by a set of invariant(s): Invariant at l2: arg2 <= arg3 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 - 2*arg2 + arg3 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001713s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015040s [18690 : 18833] [18690 : 18834] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.069592s Time used: 0.068516 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.999857s Time used: 1.0004 LOG: SAT solveNonLinear - Elapsed time: 1.069449s Cost: 1; Total time: 1.06892 Termination implied by a set of invariant(s): Invariant at l2: arg3 <= 1 + arg1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 + arg1 + arg2 - 3*arg3 + arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001839s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011982s [18690 : 18838] [18690 : 18839] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.071946s Time used: 0.070445 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.999872s Time used: 1.00043 LOG: SAT solveNonLinear - Elapsed time: 1.071818s Cost: 1; Total time: 1.07088 Termination implied by a set of invariant(s): Invariant at l2: 1 + arg1 + arg4 <= arg2 + arg3 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 + arg1 - arg2 - arg3 + arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001946s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.021551s [18690 : 18843] [18690 : 18844] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.091727s Time used: 0.089875 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.999893s Time used: 1.00045 LOG: SAT solveNonLinear - Elapsed time: 1.091620s Cost: 1; Total time: 1.09032 Termination implied by a set of invariant(s): Invariant at l2: arg4 <= arg3 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 - arg2 + arg3 - arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002060s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.026535s [18690 : 18848] [18690 : 18849] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.071831s Time used: 0.070071 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.999909s Time used: 1.00047 LOG: SAT solveNonLinear - Elapsed time: 1.071740s Cost: 1; Total time: 1.07054 Quasi-ranking function: 50000 + arg2 - 2*arg3 + arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002206s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.074795s [18690 : 18856] [18690 : 18857] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.089881s Time used: 0.087764 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.999944s Time used: 1.00051 LOG: SAT solveNonLinear - Elapsed time: 1.089825s Cost: 1; Total time: 1.08827 Termination implied by a set of invariant(s): Invariant at l2: arg4 <= 1 + arg1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 + arg1 - 2*arg2 + arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002340s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019743s [18690 : 18871] [18690 : 18872] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.087206s Time used: 0.085268 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.999983s Time used: 1.00054 LOG: SAT solveNonLinear - Elapsed time: 1.087189s Cost: 1; Total time: 1.08581 Termination implied by a set of invariant(s): Invariant at l2: 0 <= 1 + 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 + arg1 + arg2 - 2*arg3 - 2*arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002704s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014913s [18690 : 18882] [18690 : 18883] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.105856s Time used: 0.103536 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000096s Time used: 1.00066 LOG: SAT solveNonLinear - Elapsed time: 1.105952s Cost: 1; Total time: 1.1042 Termination implied by a set of invariant(s): Invariant at l2: arg1 <= arg2 + arg3 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 + arg1 - arg2 - arg3 - arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002852s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.017988s [18690 : 18887] [18690 : 18888] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.117770s Time used: 0.115678 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.999981s Time used: 1.00054 LOG: SAT solveNonLinear - Elapsed time: 1.117751s Cost: 1; Total time: 1.11622 Termination implied by a set of invariant(s): Invariant at l2: 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 + 3*arg2 - arg3 - 5*arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003059s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.042901s [18690 : 18892] [18690 : 18893] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.123471s Time used: 0.121013 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000268s Time used: 1.00068 LOG: SAT solveNonLinear - Elapsed time: 1.123739s Cost: 1; Total time: 1.12169 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 + arg2 + arg3 - 5*arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003486s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.052935s [18690 : 18897] [18690 : 18898] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.106769s Time used: 0.10452 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.003794s Time used: 1.00437 LOG: SAT solveNonLinear - Elapsed time: 1.110562s Cost: 1; Total time: 1.10889 Quasi-ranking function: 50000 + arg1 + arg2 + arg3 - 7*arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003282s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.044965s [18690 : 19042] [18690 : 19043] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.089951s Time used: 0.087172 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000481s Time used: 1.00105 LOG: SAT solveNonLinear - Elapsed time: 1.090432s Cost: 1; Total time: 1.08823 Termination implied by a set of invariant(s): Invariant at l2: arg2 + arg4 <= 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 - arg2 - arg3 + 2*arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003650s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.147227s [18690 : 19048] [18690 : 19049] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.102470s Time used: 0.100048 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000037s Time used: 1.00058 LOG: SAT solveNonLinear - Elapsed time: 1.102508s Cost: 1; Total time: 1.10063 Termination implied by a set of invariant(s): Invariant at l2: 0 <= arg4 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 - arg2 + arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003732s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.042402s [18690 : 19053] [18690 : 19054] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.141957s Time used: 0.139202 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000156s Time used: 1.00072 LOG: SAT solveNonLinear - Elapsed time: 1.142113s Cost: 1; Total time: 1.13992 Termination implied by a set of invariant(s): Invariant at l2: 1 + arg1 <= arg2 + arg3 + arg4 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 + arg1 - 2*arg2 + arg3 - arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003793s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.049207s [18690 : 19058] [18690 : 19059] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.101855s Time used: 0.099362 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000074s Time used: 1.00064 LOG: SAT solveNonLinear - Elapsed time: 1.101930s Cost: 1; Total time: 1.1 Termination implied by a set of invariant(s): Invariant at l2: arg3 <= 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 - arg2 - arg3 - arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003900s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.031792s [18690 : 19063] [18690 : 19064] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.125946s Time used: 0.123109 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000184s Time used: 1.00073 LOG: SAT solveNonLinear - Elapsed time: 1.126130s Cost: 1; Total time: 1.12384 Termination implied by a set of invariant(s): Invariant at l2: arg3 <= 1 + arg1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 + arg1 + arg2 - 3*arg3 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004030s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.241156s [18690 : 19068] [18690 : 19069] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.138223s Time used: 0.135688 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.003494s Time used: 1.00406 LOG: SAT solveNonLinear - Elapsed time: 1.141718s Cost: 1; Total time: 1.13975 Termination implied by a set of invariant(s): Invariant at l2: 1 + arg3 + arg4 <= 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 + arg1 - 2*arg3 + arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004332s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.032176s [18690 : 19073] [18690 : 19074] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.168029s Time used: 0.164906 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000682s Time used: 1.00125 LOG: SAT solveNonLinear - Elapsed time: 1.168711s Cost: 1; Total time: 1.16615 Termination implied by a set of invariant(s): Invariant at l2: arg2 <= 1 + 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 - arg2 - arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004544s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.052655s [18690 : 19078] [18690 : 19079] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.133004s Time used: 0.13074 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000343s Time used: 1.0009 LOG: SAT solveNonLinear - Elapsed time: 1.133347s Cost: 1; Total time: 1.13164 Termination implied by a set of invariant(s): Invariant at l2: 1 + arg4 <= 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 - arg2 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004816s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.086589s [18690 : 19083] [18690 : 19084] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.113653s Time used: 0.111455 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000639s Time used: 1.0012 LOG: SAT solveNonLinear - Elapsed time: 1.114292s Cost: 1; Total time: 1.11266 Termination implied by a set of invariant(s): Invariant at l2: arg3 <= arg1 + arg4 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 + arg1 - 2*arg2 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005042s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.098521s [18690 : 19088] [18690 : 19089] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.152120s Time used: 0.149575 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000515s Time used: 1.00108 LOG: SAT solveNonLinear - Elapsed time: 1.152635s Cost: 1; Total time: 1.15065 Termination implied by a set of invariant(s): Invariant at l2: arg3 <= 1 + arg1 + arg4 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 + arg3 - 3*arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005133s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.101744s [18690 : 19093] [18690 : 19094] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.151448s Time used: 0.14848 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000763s Time used: 1.00132 LOG: SAT solveNonLinear - Elapsed time: 1.152211s Cost: 1; Total time: 1.1498 Termination implied by a set of invariant(s): Invariant at l2: arg1 <= arg2 + arg3 + arg4 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 + arg1 - arg3 - arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005301s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.161914s [18690 : 19206] [18690 : 19207] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.157795s Time used: 0.155066 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000319s Time used: 1.00089 LOG: SAT solveNonLinear - Elapsed time: 1.158114s Cost: 1; Total time: 1.15595 Termination implied by a set of invariant(s): Invariant at l2: 0 <= arg1 + arg2 + arg3 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 - arg3 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005191s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.136522s [18690 : 19211] [18690 : 19212] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.157851s Time used: 0.154785 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000635s Time used: 1.0012 LOG: SAT solveNonLinear - Elapsed time: 1.158486s Cost: 1; Total time: 1.15599 Termination implied by a set of invariant(s): Invariant at l2: 1 + arg2 <= arg1 + arg3 + arg4 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, 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): 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Quasi-ranking function: 50000 + arg1 + arg3 - 5*arg4 New Graphs: Transitions: 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005537s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.244396s [18690 : 19216] [18690 : 19217] Timeout expired! Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003533s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.003645s Cannot prove unreachability [18690 : 19221] [18690 : 20110] Successful child: 19221 Program does NOT terminate