/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: (1 + i^0), j^0 -> (2 + j^0), ret_pair5^0 -> undef3}> 0, j^0 -> 0}> Fresh variables: undef3, Undef variables: undef3, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (1 + i^0), j^0 -> (2 + j^0)}> Fresh variables: undef3, Undef variables: undef3, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> Variables: i^0, j^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002067 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000402s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000979s [26206 : 26207] [26206 : 26208] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009425s Time used: 0.009143 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002552s Time used: 1.00253 LOG: SAT solveNonLinear - Elapsed time: 1.011977s Cost: 1; Total time: 1.01168 Quasi-ranking function: 50000 - i^0 New Graphs: Transitions: 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> Variables: i^0, j^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000465s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001500s [26206 : 26212] [26206 : 26213] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009388s Time used: 0.008993 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000323s Time used: 1.00029 LOG: SAT solveNonLinear - Elapsed time: 1.009711s Cost: 1; Total time: 1.00928 Termination implied by a set of invariant(s): Invariant at l2: 0 <= 1 + i^0 + j^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, j^0 -> 2 + j^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): 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> Quasi-ranking function: 50000 - j^0 New Graphs: Transitions: 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> Variables: i^0, j^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000642s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003462s [26206 : 26226] [26206 : 26227] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011916s Time used: 0.011355 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000667s Time used: 1.00064 LOG: SAT solveNonLinear - Elapsed time: 1.012582s Cost: 1; Total time: 1.01199 Termination implied by a set of invariant(s): Invariant at l2: i^0 <= 1 + j^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, j^0 -> 2 + j^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): 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> Quasi-ranking function: 50000 + i^0 - j^0 New Graphs: Transitions: 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> Variables: i^0, j^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000742s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005182s [26206 : 26231] [26206 : 26232] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013080s Time used: 0.012435 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000395s Time used: 1.00038 LOG: SAT solveNonLinear - Elapsed time: 1.013476s Cost: 1; Total time: 1.01281 Termination implied by a set of invariant(s): Invariant at l2: i^0 <= 1 + j^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, j^0 -> 2 + j^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): 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> Quasi-ranking function: 50000 - i^0 - j^0 New Graphs: Transitions: 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> Variables: i^0, j^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000744s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003469s [26206 : 26236] [26206 : 26237] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012939s Time used: 0.012216 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000418s Time used: 1.00039 LOG: SAT solveNonLinear - Elapsed time: 1.013358s Cost: 1; Total time: 1.0126 Quasi-ranking function: 50000 - 3*i^0 + j^0 New Graphs: Transitions: 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> Variables: i^0, j^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000833s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003593s [26206 : 26350] [26206 : 26351] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.101226s Time used: 4.10048 Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006208s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.006318s Cannot prove unreachability [26206 : 26355] [26206 : 26356] Successful child: 26355 Program does NOT terminate