NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 5, arg2 -> undef4}> 0), par{arg1 -> (arg1 - 1), arg2 -> undef6}> 5), par{arg1 -> (arg1 - 1), 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))> 5}> 0), par{arg1 -> (arg1 - 1)}> 5), par{arg1 -> (arg1 - 1)}> 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: 5, rest remain the same}> -1 + arg1, rest remain the same}> -1 + arg1, 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.004918 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001166s Ranking function: -1 + arg1 New Graphs: Transitions: 5, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000368s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001009s Trying to remove transition: 5, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.616247s Time used: 0.616071 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011381s Time used: 0.008547 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.022615s Time used: 0.022607 LOG: SAT solveNonLinear - Elapsed time: 0.033997s Cost: 1; Total time: 0.031154 Failed at location 2: arg1 <= 0 Before Improving: Quasi-invariant at l2: arg1 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004133s Remaining time after improvement: 0.998872 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 0 [ 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: 5, 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: -1 + arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 5, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 0 and entry LOG: CALL check - Post:arg1 <= 0 - Process 1 * Exit transition: * Postcondition : arg1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000532s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000625s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 0 , Narrowing transition: 5, rest remain the same}> LOG: Narrow transition size 1 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 invGraph after Narrowing: Transitions: 5, rest remain the same}> -1 + arg1, rest remain the same}> -1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001071s Ranking function: -1 + arg1 New Graphs: Transitions: 5, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000365s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001042s Trying to remove transition: 5, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.611767s Time used: 0.611587 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013009s Time used: 0.01012 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.025902s Time used: 0.025894 LOG: SAT solveNonLinear - Elapsed time: 0.038911s Cost: 1; Total time: 0.036014 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.004724s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001188s Remaining time after improvement: 0.997097 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 2 [ 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: 5, 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: -1 + arg1, 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: 5, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 2 and entry LOG: CALL check - Post:arg1 <= 2 - Process 2 * Exit transition: * Postcondition : arg1 <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000478s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000576s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 2 , Narrowing transition: 5, rest remain the same}> LOG: Narrow transition size 1 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 invGraph after Narrowing: Transitions: 5, rest remain the same}> -1 + arg1, rest remain the same}> -1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001108s Ranking function: -1 + arg1 New Graphs: Transitions: 5, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000369s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001057s Trying to remove transition: 5, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.613911s Time used: 0.613737 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.055438s Time used: 0.05255 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.059465s Time used: 0.059455 LOG: SAT solveNonLinear - Elapsed time: 0.114904s Cost: 1; Total time: 0.112005 Failed at location 2: arg1 <= 4 Before Improving: Quasi-invariant at l2: arg1 <= 4 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005221s Remaining time after improvement: 0.998759 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 4 [ 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: 5, 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: -1 + arg1, 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: 5, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 4 and entry LOG: CALL check - Post:arg1 <= 4 - Process 3 * Exit transition: * Postcondition : arg1 <= 4 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000495s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000592s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 4 , Narrowing transition: 5, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 5, rest remain the same}> -1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000835s Ranking function: -5 + arg1 New Graphs: Transitions: 5, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000366s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001059s Trying to remove transition: 5, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.617857s Time used: 0.617682 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004793s Time used: 4.00159 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006048s Time used: 4.00089 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.010102s Time used: 1.00052 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.421175s Time used: 0.414572 Proving non-termination of subgraph 1 Transitions: 5, rest remain the same}> -1 + arg1, 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.026008s Time used: 0.025828 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.008556s Time used: 0.00855 LOG: SAT solveNonLinear - Elapsed time: 0.034564s Cost: 1; Total time: 0.034378 Failed at location 2: 5 <= arg1 Before Improving: Quasi-invariant at l2: 5 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002305s Remaining time after improvement: 0.999013 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 5 <= 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): 5, 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}> Calling reachability with... Transition: Conditions: 5 <= arg1, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 5 <= arg1, OPEN EXITS: > Conditions are reachable! Program does NOT terminate