/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: (~(1) + x^0)}> (~(1) + a^0), x^0 -> ((0 + x^0) + y^0), y^0 -> ((0 + y^0) + z^0), z^0 -> ((0 + a^0) + z^0)}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (~(1) + x^0)}> (~(1) + a^0), x^0 -> ((0 + x^0) + y^0), y^0 -> ((0 + y^0) + z^0), z^0 -> ((0 + a^0) + z^0)}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + x^0, rest remain the same}> -1 + a^0, x^0 -> x^0 + y^0, y^0 -> y^0 + z^0, z^0 -> a^0 + z^0, rest remain the same}> Variables: x^0, a^0, y^0, z^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.004556 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000942s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003386s [48175 : 48182] [48175 : 48183] Successful child: 48182 [ 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 + x^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + a^0, x^0 -> x^0 + y^0, y^0 -> y^0 + z^0, z^0 -> a^0 + z^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + x^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + a^0, x^0 -> x^0 + y^0, y^0 -> y^0 + z^0, z^0 -> a^0 + z^0, rest remain the same}> New Graphs: LOG: CALL check - Post:x^0 <= 0 - Process 1 * Exit transition: * Postcondition : x^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000303s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000370s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: x^0 <= 0 , Narrowing transition: -1 + x^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + a^0, x^0 -> x^0 + y^0, y^0 -> y^0 + z^0, z^0 -> a^0 + z^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + x^0, rest remain the same}> -1 + a^0, x^0 -> x^0 + y^0, y^0 -> y^0 + z^0, z^0 -> a^0 + z^0, rest remain the same}> Variables: x^0, a^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000865s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003508s [48175 : 48230] [48175 : 48231] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021869s Time used: 0.021308 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.042890s Time used: 0.042882 LOG: SAT solveNonLinear - Elapsed time: 0.064759s Cost: 1; Total time: 0.06419 Quasi-ranking function: 50000 + a^0 New Graphs: Transitions: -1 + x^0, rest remain the same}> -1 + a^0, x^0 -> x^0 + y^0, y^0 -> y^0 + z^0, z^0 -> a^0 + z^0, rest remain the same}> Variables: a^0, x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000938s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004461s [48175 : 48446] [48175 : 48447] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019545s Time used: 0.018885 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.030151s Time used: 0.030145 LOG: SAT solveNonLinear - Elapsed time: 0.049696s Cost: 1; Total time: 0.04903 Quasi-ranking function: 50000 + z^0 New Graphs: Transitions: -1 + x^0, rest remain the same}> -1 + a^0, x^0 -> x^0 + y^0, y^0 -> y^0 + z^0, z^0 -> a^0 + z^0, rest remain the same}> Variables: a^0, x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001108s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005578s [48175 : 48546] [48175 : 48547] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022882s Time used: 0.02218 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.039155s Time used: 0.039147 LOG: SAT solveNonLinear - Elapsed time: 0.062037s Cost: 1; Total time: 0.061327 Quasi-ranking function: 50000 + a^0 + z^0 New Graphs: Transitions: -1 + x^0, rest remain the same}> -1 + a^0, x^0 -> x^0 + y^0, y^0 -> y^0 + z^0, z^0 -> a^0 + z^0, rest remain the same}> Variables: a^0, x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001164s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008152s [48175 : 48618] [48175 : 48619] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021775s Time used: 0.021021 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.035951s Time used: 0.035944 LOG: SAT solveNonLinear - Elapsed time: 0.057726s Cost: 1; Total time: 0.056965 Quasi-ranking function: 50000 - a^0 + z^0 New Graphs: Transitions: -1 + x^0, rest remain the same}> -1 + a^0, x^0 -> x^0 + y^0, y^0 -> y^0 + z^0, z^0 -> a^0 + z^0, rest remain the same}> Variables: a^0, x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001351s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006205s [48175 : 48674] [48175 : 48675] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021794s Time used: 0.020995 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.042769s Time used: 0.042762 LOG: SAT solveNonLinear - Elapsed time: 0.064563s Cost: 1; Total time: 0.063757 Quasi-ranking function: 50000 + y^0 + z^0 New Graphs: Transitions: -1 + x^0, rest remain the same}> -1 + a^0, x^0 -> x^0 + y^0, y^0 -> y^0 + z^0, z^0 -> a^0 + z^0, rest remain the same}> Variables: a^0, x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001511s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019496s [48175 : 48682] [48175 : 48683] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022908s Time used: 0.022016 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.047981s Time used: 0.047974 LOG: SAT solveNonLinear - Elapsed time: 0.070889s Cost: 1; Total time: 0.06999 Quasi-ranking function: 50000 - a^0 + y^0 New Graphs: Transitions: -1 + x^0, rest remain the same}> -1 + a^0, x^0 -> x^0 + y^0, y^0 -> y^0 + z^0, z^0 -> a^0 + z^0, rest remain the same}> Variables: a^0, x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001992s Ranking function: -1 + x^0 New Graphs: Program Terminates