NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 10), par{arg1 -> (arg1 - 1), arg2 -> undef4}> 25), par{arg1 -> (arg1 - 1), arg2 -> undef6}> 29, arg2 -> undef8}> 30), par{arg1 -> 20, 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: 0) /\ (undef12 > ~(1))> 10), par{arg1 -> (arg1 - 1)}> 25), par{arg1 -> (arg1 - 1)}> 29}> 30), par{arg1 -> 20}> 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}> 29, rest remain the same}> 20, 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.007555 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001476s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007581s 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.000710s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010372s Trying to remove transition: 29, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001470s Time used: 4.0009 Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.048717s Time used: 4.00262 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023988s Time used: 0.019518 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.091813s Time used: 0.091798 LOG: SAT solveNonLinear - Elapsed time: 0.115801s Cost: 1; Total time: 0.111316 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.013745s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002511s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002407s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002385s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002373s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002450s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002372s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002355s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002368s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002357s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002359s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002361s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002348s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002367s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001848s Remaining time after improvement: 0.967121 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 15 [ 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}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 20, 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 <= 15 and entry LOG: CALL check - Post:arg1 <= 15 - Process 1 * Exit transition: * Postcondition : arg1 <= 15 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000595s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000691s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 15 , 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 Narrowing transition: 29, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 20, 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}> 20, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001362s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008681s Piecewise ranking function: min(-528 + 33*arg1,297) 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.000789s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010550s Trying to remove transition: 29, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002513s Time used: 4.00198 Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.048054s Time used: 4.00227 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.793811s Time used: 0.788824 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.030008s Time used: 1.02991 LOG: SAT solveNonLinear - Elapsed time: 1.823818s Cost: 1; Total time: 1.81873 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.031431s Remaining time after improvement: 0.997797 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}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 20, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > 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 <= 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.000622s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000722s 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 It's unfeasible. Removing transition: 20, rest remain the same}> 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.000825s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010654s Trying to remove transition: 29, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005376s Time used: 4.00482 Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.098827s Time used: 4.00282 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.740102s Time used: 0.734917 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.041508s Time used: 1.04141 LOG: SAT solveNonLinear - Elapsed time: 1.781610s Cost: 1; Total time: 1.77632 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.025767s Remaining time after improvement: 0.9979 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... 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 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.001526s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001627s 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.000883s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010807s Trying to remove transition: 29, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.829862s Time used: 1.82952 Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.017669s Time used: 0.997036 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.984585s Time used: 0.964222 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003792s Time used: 0.994558 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.975332s Time used: 0.96971 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.001775s Time used: 0.993919 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.033832s Time used: 0.033637 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.025947s Time used: 0.025935 LOG: SAT solveNonLinear - Elapsed time: 0.059779s Cost: 2; Total time: 0.059572 Failed at location 2: arg1 <= 29 Before Improving: Quasi-invariant at l2: arg1 <= 29 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006530s Remaining time after improvement: 0.998807 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 29 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.026605s Time used: 0.026415 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015906s Time used: 0.015899 LOG: SAT solveNonLinear - Elapsed time: 0.042511s Cost: 1; Total time: 0.042314 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.004991s Remaining time after improvement: 0.998899 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 <= 29, 25 <= arg1, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 25 <= arg1, arg1 <= 29, OPEN EXITS: > Conditions are reachable! Program does NOT terminate