/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: ((0 + x^0) + (~(1) * y^0))}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ((0 + x^0) + (~(1) * y^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: x^0 - y^0, rest remain the same}> Variables: 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.00178 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000544s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001809s [63486 : 63487] [63486 : 63488] Successful child: 63487 [ 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: LOG: CALL check - Post:x^0 <= 0 - Process 1 * Exit transition: * Postcondition : x^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000247s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000306s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 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: x^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000532s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001878s [63486 : 63492] [63486 : 63493] Successful child: 63492 [ 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... 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}> New Graphs: LOG: CALL check - Post:x^0 <= 1 + y^0 - Process 2 * Exit transition: * Postcondition : x^0 <= 1 + y^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000355s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000451s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: x^0 <= 1 + y^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: x^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000626s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002195s [63486 : 63497] [63486 : 63498] Successful child: 63497 [ 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... 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}> New Graphs: LOG: CALL check - Post:0 <= y^0 - Process 3 * Exit transition: * Postcondition : 0 <= y^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000430s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000507s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 0 <= y^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: x^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000618s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002230s [63486 : 63502] [63486 : 63503] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007855s Time used: 0.007435 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017677s Time used: 0.017685 LOG: SAT solveNonLinear - Elapsed time: 0.025532s Cost: 1; Total time: 0.02512 Termination implied by a set of invariant(s): 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}> Quasi-ranking function: 50000 - x^0 New Graphs: Transitions: x^0 - y^0, rest remain the same}> Variables: x^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000642s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002617s [63486 : 63523] [63486 : 63524] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007886s Time used: 0.007432 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015602s Time used: 0.015607 LOG: SAT solveNonLinear - Elapsed time: 0.023487s Cost: 1; Total time: 0.023039 Termination implied by a set of invariant(s): Invariant at l1: 0 <= x^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}> Quasi-ranking function: 50000 - x^0 + y^0 New Graphs: Transitions: x^0 - y^0, rest remain the same}> Variables: x^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000613s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002300s [63486 : 63542] [63486 : 63543] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007901s Time used: 0.007436 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019096s Time used: 0.019103 LOG: SAT solveNonLinear - Elapsed time: 0.026997s Cost: 1; Total time: 0.026539 Termination implied by a set of invariant(s): Invariant at l1: y^0 <= x^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}> Quasi-ranking function: 50000 - x^0 - y^0 New Graphs: Transitions: x^0 - y^0, rest remain the same}> Variables: x^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000701s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002845s [63486 : 63562] [63486 : 63563] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008282s Time used: 0.007912 [63486 : 63576] [63486 : 63580] Successful child: 63576 Program does NOT terminate