NO Solver Timeout: 4 Global Timeout: 300 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.004613 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000816s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008896s 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.000238s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000722s Trying to remove transition: 35, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001120s Time used: 4.00089 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007179s Time used: 0.004264 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014944s Time used: 0.014942 LOG: SAT solveNonLinear - Elapsed time: 0.022123s Cost: 1; Total time: 0.019206 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.003668s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000938s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000828s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000795s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000767s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000751s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000770s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000571s Remaining time after improvement: 0.994126 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.000251s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000293s 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.000384s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001602s 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.000242s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000728s Trying to remove transition: 35, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001270s Time used: 4.00112 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038588s Time used: 0.035567 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000461s Time used: 1.00043 LOG: SAT solveNonLinear - Elapsed time: 1.039050s Cost: 1; Total time: 1.036 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.007821s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001162s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000898s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000852s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000835s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000811s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000792s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000772s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000790s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000774s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000760s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000767s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000755s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000790s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000786s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000792s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000810s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000794s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000787s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000779s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000579s Remaining time after improvement: 0.984129 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.000296s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000336s 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.000238s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000743s Trying to remove transition: 35, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001560s Time used: 4.00142 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.058041s Time used: 0.054863 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.013719s Time used: 1.0137 LOG: SAT solveNonLinear - Elapsed time: 1.071759s Cost: 1; Total time: 1.06856 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.008353s Remaining time after improvement: 0.998938 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.000677s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000718s 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.000257s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000815s Trying to remove transition: 35, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001656s Time used: 4.00152 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.148873s Time used: 0.145547 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000693s Time used: 1.00067 LOG: SAT solveNonLinear - Elapsed time: 1.149566s Cost: 1; Total time: 1.14622 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.012881s Remaining time after improvement: 0.998892 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.000663s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000705s 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.000260s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000829s Trying to remove transition: 35, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001781s Time used: 4.00164 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004743s Time used: 4.00136 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004365s Time used: 4.00146 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.018761s Time used: 1.00104 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006947s Time used: 4.00278 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.014699s Time used: 0.014605 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009393s Time used: 0.00939 LOG: SAT solveNonLinear - Elapsed time: 0.024093s Cost: 2; Total time: 0.023995 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.002483s Remaining time after improvement: 0.999354 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.084471s Time used: 0.084368 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.005341s Time used: 0.005336 LOG: SAT solveNonLinear - Elapsed time: 0.089813s Cost: 1; Total time: 0.089704 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.001671s Remaining time after improvement: 0.999519 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