NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ((0 + x^0) + y^0)}> undef7}> Fresh variables: undef7, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, Undef variables: undef7, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ((0 + x^0) + y^0)}> Fresh variables: undef7, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, Undef variables: undef7, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: x^0 + y^0, rest remain the same}> Variables: t^0, x^0, y^0 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.003139 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000797s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001962s Trying to remove transition: x^0 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005946s Time used: 0.005765 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010208s Time used: 0.009729 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018700s Time used: 0.018694 LOG: SAT solveNonLinear - Elapsed time: 0.028908s Cost: 1; Total time: 0.028423 Failed at location 1: 1 + x^0 <= 0 Before Improving: Quasi-invariant at l1: 1 + x^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003357s Remaining time after improvement: 0.998159 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + x^0 <= 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: x^0 + y^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: x^0 + y^0, rest remain the same}> New Graphs: Calling Safety with literal 1 + x^0 <= 0 and entry LOG: CALL check - Post:1 + x^0 <= 0 - Process 1 * Exit transition: * Postcondition : 1 + x^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001362s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001560s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + x^0 <= 0 , Narrowing transition: x^0 + y^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: x^0 + y^0, rest remain the same}> Variables: t^0, x^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000692s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001968s Trying to remove transition: x^0 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005116s Time used: 0.004973 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011574s Time used: 0.01103 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016434s Time used: 0.016428 LOG: SAT solveNonLinear - Elapsed time: 0.028008s Cost: 1; Total time: 0.027458 Failed at location 1: 1 + y^0 <= 0 Before Improving: Quasi-invariant at l1: 1 + y^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003135s Remaining time after improvement: 0.998202 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + y^0 <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): x^0 + y^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): x^0 + y^0, rest remain the same}> Ranking function: -t^0 + x^0 New Graphs: Calling Safety with literal 1 + y^0 <= 0 and entry LOG: CALL check - Post:1 + y^0 <= 0 - Process 2 * Exit transition: * Postcondition : 1 + y^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001290s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001481s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + y^0 <= 0 , Narrowing transition: x^0 + y^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: x^0 + y^0, rest remain the same}> Variables: t^0, x^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000749s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002192s Trying to remove transition: x^0 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005292s Time used: 0.005145 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010763s Time used: 0.010359 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001160s Time used: 4.00043 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004968s Time used: 1.00017 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016510s Time used: 0.008042 Proving non-termination of subgraph 1 Transitions: x^0 + y^0, rest remain the same}> Variables: t^0, x^0, y^0 Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012949s Time used: 0.01269 Improving Solution with cost 3 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016343s Time used: 0.016336 LOG: SAT solveNonLinear - Elapsed time: 0.029292s Cost: 3; Total time: 0.029026 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: t^0 <= y^0 Strengthening and disabling EXIT transitions... Closed exits from l1: 1 Strengthening exit transition (result): 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): x^0 + y^0, rest remain the same}> Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010101s Time used: 0.009875 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019998s Time used: 0.01999 LOG: SAT solveNonLinear - Elapsed time: 0.030099s Cost: 2; Total time: 0.029865 Failed at location 1: y^0 <= t^0 + x^0 Before Improving: Quasi-invariant at l1: y^0 <= t^0 + x^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002434s Remaining time after improvement: 0.998657 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: y^0 <= t^0 + x^0 Strengthening and disabling EXIT transitions... Closed exits from l1: 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): x^0 + y^0, rest remain the same}> Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008400s Time used: 0.008152 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009281s Time used: 0.009276 LOG: SAT solveNonLinear - Elapsed time: 0.017680s Cost: 1; Total time: 0.017428 Failed at location 1: 0 <= y^0 Before Improving: Quasi-invariant at l1: 0 <= y^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002157s Remaining time after improvement: 0.998663 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 0 <= y^0 Strengthening and disabling EXIT transitions... Closed exits from l1: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): x^0 + y^0, rest remain the same}> Calling reachability with... Transition: Conditions: t^0 <= y^0, y^0 <= t^0 + x^0, 0 <= y^0, OPEN EXITS: (condsUp: t^0 <= y^0, 0 <= y^0) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: y^0 <= t^0 + x^0, t^0 <= y^0, 0 <= y^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate