NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: undef1}> 3000}> Fresh variables: undef1, Undef variables: undef1, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef1}> Fresh variables: undef1, Undef variables: undef1, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef1, rest remain the same}> Variables: x^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.000901 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000362s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001220s Trying to remove transition: undef1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002158s Time used: 0.002059 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.167320s Time used: 3.16712 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.235595s Time used: 0.235591 LOG: SAT solveNonLinear - Elapsed time: 3.402915s Cost: 1; Total time: 3.40271 Failed at location 1: 891 + x^0 <= 0 Before Improving: Quasi-invariant at l1: 891 + x^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008142s Remaining time after improvement: 0.998555 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 891 + 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: undef1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef1, rest remain the same}> New Graphs: Calling Safety with literal 891 + x^0 <= 0 and entry LOG: CALL check - Post:891 + x^0 <= 0 - Process 1 * Exit transition: * Postcondition : 891 + x^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000933s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000960s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 891 + x^0 <= 0 , Narrowing transition: undef1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef1, rest remain the same}> Variables: x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000295s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001075s Trying to remove transition: undef1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.001762s Time used: 0.001679 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001848s Time used: 4.00169 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.025731s Time used: 4.02106 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.013473s Time used: 1.00603 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004480s Time used: 0.002632 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.004559s Time used: 0.004558 LOG: SAT solveNonLinear - Elapsed time: 0.009039s Cost: 1; Total time: 0.00719 Quasi-ranking function: 50000 - x^0 New Graphs: Transitions: undef1, rest remain the same}> Variables: x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000303s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001118s Trying to remove transition: undef1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.001919s Time used: 0.001838 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.052000s Time used: 2.05182 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.152051s Time used: 0.152048 LOG: SAT solveNonLinear - Elapsed time: 2.204050s Cost: 1; Total time: 2.20387 Failed at location 1: 890 + x^0 <= 0 Before Improving: Quasi-invariant at l1: 890 + x^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007529s Remaining time after improvement: 0.998442 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 890 + 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: undef1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef1, rest remain the same}> New Graphs: Calling Safety with literal 890 + x^0 <= 0 and entry LOG: CALL check - Post:890 + x^0 <= 0 - Process 2 * Exit transition: * Postcondition : 890 + x^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001124s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001154s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 890 + x^0 <= 0 , Narrowing transition: undef1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef1, rest remain the same}> Variables: x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000321s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001072s Trying to remove transition: undef1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.001961s Time used: 0.001879 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.079352s Time used: 4.0792 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.034737s Time used: 4.02425 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008235s Time used: 1.00066 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004920s Time used: 0.002856 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.004763s Time used: 0.004762 LOG: SAT solveNonLinear - Elapsed time: 0.009683s Cost: 1; Total time: 0.007618 Quasi-ranking function: 50000 - x^0 New Graphs: Transitions: undef1, rest remain the same}> Variables: x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000310s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001145s Trying to remove transition: undef1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002107s Time used: 0.002024 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005711s Time used: 4.00557 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.043836s Time used: 4.03818 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.015589s Time used: 1.00072 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004164s Time used: 0.002314 Proving non-termination of subgraph 1 Transitions: undef1, rest remain the same}> Variables: x^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000523s Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006013s Time used: 0.005878 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.007944s Time used: 0.007942 LOG: SAT solveNonLinear - Elapsed time: 0.013956s Cost: 1; Total time: 0.01382 Failed at location 1: 1 <= x^0 Before Improving: Quasi-invariant at l1: 1 <= x^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003386s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001167s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000669s Remaining time after improvement: 0.997274 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.001278s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 0 <= 444 + x^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): undef1, rest remain the same}> Calling reachability with... Transition: Conditions: 0 <= 444 + x^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 0 <= 444 + x^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate