/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: undef1}> 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.001407 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000531s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001772s [7835 : 7836] [7835 : 7837] Successful child: 7836 [ 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: LOG: CALL check - Post:x^0 <= 1 - Process 1 * Exit transition: * Postcondition : x^0 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000253s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000311s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: x^0 <= 1 , 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.000590s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002115s [7835 : 7841] [7835 : 7842] Successful child: 7841 [ 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... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef1, rest remain the same}> New Graphs: LOG: CALL check - Post:x^0 <= 3 - Process 2 * Exit transition: * Postcondition : x^0 <= 3 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000351s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000433s INVARIANTS: 1: 1 <= x^0 , Quasi-INVARIANTS to narrow Graph: 1: x^0 <= 3 , 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.000598s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002103s [7835 : 7846] [7835 : 7847] Successful child: 7846 [ 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... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef1, rest remain the same}> New Graphs: LOG: CALL check - Post:x^0 <= 101 - Process 3 * Exit transition: * Postcondition : x^0 <= 101 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000392s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000462s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: x^0 <= 101 , 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.000599s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002088s [7835 : 7851] [7835 : 7852] Successful child: 7851 [ 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... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef1, rest remain the same}> New Graphs: LOG: CALL check - Post:x^0 <= 199 - Process 4 * Exit transition: * Postcondition : x^0 <= 199 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000403s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000472s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: x^0 <= 199 , 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.000590s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001945s [7835 : 7856] [7835 : 7857] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005631s Time used: 0.005223 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015720s Time used: 0.015716 LOG: SAT solveNonLinear - Elapsed time: 0.021351s Cost: 1; Total time: 0.020939 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.000581s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001992s [7835 : 7870] [7835 : 7871] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004733s Time used: 0.004393 [7835 : 7884] [7835 : 7888] Successful child: 7884 Program does NOT terminate