NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: arg2) /\ (arg2 > ~(1)) /\ (arg1 > 0), par{arg1 -> (arg2 + 20), arg2 -> undef2}> 10), par{arg1 -> (arg1 - 1), arg2 -> undef4}> 25) /\ (arg1 < 31), par{arg1 -> (arg1 - 1), arg2 -> undef6}> 30), par{arg1 -> 20, arg2 -> undef8}> 29, arg2 -> undef10}> undef11, arg2 -> undef12}> Fresh variables: undef2, undef4, undef6, undef8, undef10, undef11, undef12, Undef variables: undef2, undef4, undef6, undef8, undef10, undef11, undef12, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef12) /\ (undef12 > ~(1)) /\ (undef11 > 0)> 10), par{arg1 -> (arg1 - 1)}> 25) /\ (arg1 < 31), par{arg1 -> (arg1 - 1)}> 30), par{arg1 -> 20}> 29}> Fresh variables: undef2, undef4, undef6, undef8, undef10, undef11, undef12, Undef variables: undef2, undef4, undef6, undef8, undef10, undef11, undef12, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg1, rest remain the same}> -1 + arg1, rest remain the same}> 20, rest remain the same}> 29, 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: 4.00122 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006025s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003652s Piecewise ranking function: min(-418 + 38*arg1,532) New Graphs: Transitions: -1 + arg1, rest remain the same}> 29, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000348s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004968s Trying to remove transition: 29, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001492s Time used: 4.0011 Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004190s Time used: 4.00164 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.374868s Time used: 0.371523 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000520s Time used: 1.00049 LOG: SAT solveNonLinear - Elapsed time: 1.375388s Cost: 1; Total time: 1.37201 Failed at location 2: arg1 <= 22 Before Improving: Quasi-invariant at l2: arg1 <= 22 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.017373s Remaining time after improvement: 0.998769 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 22 [ 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: -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: 20, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 29, 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: -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: 29, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 22 and entry LOG: CALL check - Post:arg1 <= 22 - Process 1 * Exit transition: * Postcondition : arg1 <= 22 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000283s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000323s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 22 , Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: 20, rest remain the same}> Narrowing transition: 29, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> -1 + arg1, rest remain the same}> 29, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000508s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003139s Piecewise ranking function: min(31,-713 + 31*arg1) New Graphs: Transitions: -1 + arg1, rest remain the same}> 29, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000386s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005019s Trying to remove transition: 29, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002363s Time used: 4.00197 Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.035562s Time used: 4.03257 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.536165s Time used: 0.532821 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000930s Time used: 1.0009 LOG: SAT solveNonLinear - Elapsed time: 1.537095s Cost: 1; Total time: 1.53373 Failed at location 2: arg1 <= 24 Before Improving: Quasi-invariant at l2: arg1 <= 24 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.026811s Remaining time after improvement: 0.99862 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 24 [ 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: -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: 29, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 29, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 24 and entry LOG: CALL check - Post:arg1 <= 24 - Process 2 * Exit transition: * Postcondition : arg1 <= 24 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000338s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000382s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 24 , It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 29, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> 29, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000426s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005176s Trying to remove transition: 29, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002000s Time used: 4.00161 Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.017603s Time used: 4.01451 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.509524s Time used: 0.505925 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000680s Time used: 1.00062 LOG: SAT solveNonLinear - Elapsed time: 1.510204s Cost: 1; Total time: 1.50654 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.019122s Remaining time after improvement: 0.998047 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 31 <= 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: -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: 29, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 29, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> New Graphs: Calling Safety with literal 31 <= arg1 and entry LOG: CALL check - Post:31 <= arg1 - Process 3 * Exit transition: * Postcondition : 31 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000767s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000811s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 31 <= arg1 , Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 29, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> 29, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000455s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005207s Trying to remove transition: 29, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001968s Time used: 4.00159 Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.014627s Time used: 4.0115 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005985s Time used: 4.00234 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005782s Time used: 4.00218 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.019328s Time used: 1.00115 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008515s Time used: 4.00253 Proving non-termination of subgraph 1 Transitions: -1 + arg1, rest remain the same}> 29, 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.035781s Time used: 0.035664 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001650s Time used: 1.00161 LOG: SAT solveNonLinear - Elapsed time: 1.037430s Cost: 2; Total time: 1.03728 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.023538s Remaining time after improvement: 0.998408 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 30 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): -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 29, 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.013538s Time used: 0.013435 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001630s Time used: 1.00151 LOG: SAT solveNonLinear - Elapsed time: 1.015168s Cost: 1; Total time: 1.01494 Failed at location 2: 25 <= arg1 Before Improving: Quasi-invariant at l2: 25 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.020061s Remaining time after improvement: 0.999007 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 25 <= 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): -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 29, rest remain the same}> Calling reachability with... Transition: Conditions: arg1 <= 30, 25 <= arg1, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 25 <= arg1, arg1 <= 30, OPEN EXITS: > Conditions are reachable! Program does NOT terminate