NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 35), par{arg1 -> 0, arg2 -> undef4}> 0), par{arg1 -> (arg1 - 1), arg2 -> undef6}> 30) /\ (arg1 < 36), par{arg1 -> 35, arg2 -> undef8}> undef9, arg2 -> undef10}> Fresh variables: undef2, undef4, undef6, undef8, undef9, undef10, Undef variables: undef2, undef4, undef6, undef8, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef10 > ~(1))> 35), par{arg1 -> 0}> 0), par{arg1 -> (arg1 - 1)}> 30) /\ (arg1 < 36), par{arg1 -> 35}> Fresh variables: undef2, undef4, undef6, undef8, undef9, undef10, Undef variables: undef2, undef4, undef6, undef8, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 0, rest remain the same}> -1 + arg1, rest remain the same}> 35, rest remain the same}> Variables: arg1 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.005142 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001189s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014650s Piecewise ranking function: min(60,-2 + 2*arg1) New Graphs: Transitions: 35, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000474s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001508s Trying to remove transition: 35, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003009s Time used: 4.00242 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012655s Time used: 0.008689 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.028435s Time used: 0.028429 LOG: SAT solveNonLinear - Elapsed time: 0.041089s Cost: 1; Total time: 0.037118 Failed at location 2: arg1 <= 1 Before Improving: Quasi-invariant at l2: arg1 <= 1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007406s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001832s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001743s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001722s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001724s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001700s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001706s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001275s Remaining time after improvement: 0.987469 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 8 [ 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: 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 35, 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: 35, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 8 and entry LOG: CALL check - Post:arg1 <= 8 - Process 1 * Exit transition: * Postcondition : arg1 <= 8 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000533s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000627s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 8 , It's unfeasible. Removing transition: 0, rest remain the same}> Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 35, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> 35, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000806s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003507s Piecewise ranking function: min(-9 + arg1,3343 - 109*arg1) New Graphs: Transitions: 35, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000488s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001585s Trying to remove transition: 35, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001804s Time used: 4.00121 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.079684s Time used: 0.075702 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000614s Time used: 1.00056 LOG: SAT solveNonLinear - Elapsed time: 1.080299s Cost: 1; Total time: 1.07626 Failed at location 2: arg1 <= 9 Before Improving: Quasi-invariant at l2: arg1 <= 9 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012967s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001971s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001782s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001778s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001761s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001742s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001771s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001780s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001743s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001728s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001717s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001729s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001753s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001763s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001761s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001763s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001781s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001775s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001760s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001750s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001244s Remaining time after improvement: 0.966048 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 29 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 35, 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: 35, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 29 and entry LOG: CALL check - Post:arg1 <= 29 - Process 2 * Exit transition: * Postcondition : arg1 <= 29 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000632s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000737s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 29 , It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> Narrowing transition: 35, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 35, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000486s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001615s Trying to remove transition: 35, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004099s Time used: 4.00351 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.128854s Time used: 0.124693 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.004001s Time used: 1.00381 LOG: SAT solveNonLinear - Elapsed time: 1.132854s Cost: 1; Total time: 1.1285 Failed at location 2: arg1 <= 30 Before Improving: Quasi-invariant at l2: arg1 <= 30 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014687s Remaining time after improvement: 0.998508 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 30 [ 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: 35, 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: 35, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 30 and entry LOG: CALL check - Post:arg1 <= 30 - Process 3 * Exit transition: * Postcondition : arg1 <= 30 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001505s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001603s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 30 , Narrowing transition: 35, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 35, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000509s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001702s Trying to remove transition: 35, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002433s Time used: 4.00181 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.335006s Time used: 0.330887 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.051935s Time used: 1.05175 LOG: SAT solveNonLinear - Elapsed time: 1.386941s Cost: 1; Total time: 1.38263 Failed at location 2: 36 <= arg1 Before Improving: Quasi-invariant at l2: 36 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.023653s Remaining time after improvement: 0.997849 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 36 <= arg1 [ 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: 35, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 35, rest remain the same}> New Graphs: Calling Safety with literal 36 <= arg1 and entry LOG: CALL check - Post:36 <= arg1 - Process 4 * Exit transition: * Postcondition : 36 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001647s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001754s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 36 <= arg1 , Narrowing transition: 35, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 35, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000518s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001711s Trying to remove transition: 35, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002863s Time used: 4.00228 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.115490s Time used: 4.11071 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.071945s Time used: 2.02305 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.962646s Time used: 0.956457 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.990010s Time used: 0.983885 Proving non-termination of subgraph 1 Transitions: 35, rest remain the same}> Variables: arg1 Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.030635s Time used: 0.030469 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018889s Time used: 0.018882 LOG: SAT solveNonLinear - Elapsed time: 0.049524s Cost: 2; Total time: 0.049351 Failed at location 2: arg1 <= 35 Before Improving: Quasi-invariant at l2: arg1 <= 35 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004821s Remaining time after improvement: 0.998566 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 35 Strengthening and disabling EXIT transitions... Closed exits from l2: 1 Strengthening exit transition (result): Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 35, rest remain the same}> Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.181637s Time used: 0.181465 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011695s Time used: 0.011689 LOG: SAT solveNonLinear - Elapsed time: 0.193332s Cost: 1; Total time: 0.193154 Failed at location 2: 31 <= arg1 Before Improving: Quasi-invariant at l2: 31 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003392s Remaining time after improvement: 0.999091 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 31 <= arg1 Strengthening and disabling EXIT transitions... Closed exits from l2: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 35, rest remain the same}> Calling reachability with... Transition: Conditions: arg1 <= 35, 31 <= arg1, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 31 <= arg1, arg1 <= 35, OPEN EXITS: > Conditions are reachable! Program does NOT terminate