/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: 0) /\ (0 = arg2), par{arg1 -> ~(1), arg2 -> 0, arg3 -> 0, arg4 -> 0}> 0) /\ (undef9 > ~(1)) /\ (1 = arg2), par{arg1 -> ~(1), arg2 -> 0, arg3 -> 1, arg4 -> 1}> ~(1)) /\ (arg2 > 1) /\ (undef15 > ~(1)) /\ (arg1 > 0), par{arg1 -> ((undef15 * undef14) - 1), arg2 -> (undef15 * undef14), arg3 -> arg2, arg4 -> 2}> 0) /\ (arg4 >= arg3) /\ (arg3 > ~(1)), par{arg1 -> (arg1 - 1), arg2 -> arg1}> 0) /\ (arg3 > ~(1)) /\ (arg4 > ~(1)) /\ (arg4 < arg3), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg4 -> (arg4 + 1)}> undef24, arg2 -> undef25, arg3 -> undef26, arg4 -> undef27}> Fresh variables: undef9, undef14, undef15, undef24, undef25, undef26, undef27, Undef variables: undef9, undef14, undef15, undef24, undef25, undef26, undef27, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (0 = undef25), par{arg1 -> ~(1), arg2 -> 0, arg3 -> 0, arg4 -> 0}> 0) /\ (undef9 > ~(1)) /\ (1 = undef25), par{arg1 -> ~(1), arg2 -> 0, arg3 -> 1, arg4 -> 1}> ~(1)) /\ (undef25 > 1) /\ (undef15 > ~(1)) /\ (undef24 > 0), par{arg1 -> abstract_28, arg2 -> abstract_29, arg3 -> undef25, arg4 -> 2}> 0) /\ (arg4 >= arg3) /\ (arg3 > ~(1)), par{arg1 -> (arg1 - 1), arg2 -> arg1}> 0) /\ (arg3 > ~(1)) /\ (arg4 > ~(1)) /\ (arg4 < arg3), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg4 -> (arg4 + 1)}> Fresh variables: undef9, undef14, undef15, undef24, undef25, undef26, undef27, abstract_28, abstract_29, Undef variables: undef9, undef14, undef15, undef24, undef25, undef26, undef27, Abstraction variables: abstract_29 --> ( * undef15 undef14 ) abstract_28 --> ( - ( * undef15 undef14 ) 1 ) Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg1, arg2 -> arg1, rest remain the same}> -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Precedence: Graph 0 Graph 1 -1, arg2 -> 0, arg3 -> 0, arg4 -> 0, rest remain the same}> -1, arg2 -> 0, arg3 -> 1, arg4 -> 1, rest remain the same}> abstract_28, arg2 -> abstract_29, arg3 -> undef25, arg4 -> 2, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Detected abstraction incompatible with non-termination check. Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.006245 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001642s Ranking function: arg3 - arg4 New Graphs: Transitions: -1 + arg1, arg2 -> arg1, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000619s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002388s [17035 : 17036] [17035 : 17037] Successful child: 17036 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, 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 + arg1, arg2 -> arg1, rest remain the same}> Ranking function: arg2 New Graphs: LOG: CALL check - Post:arg1 + arg2 <= 1 - Process 1 * Exit transition: abstract_28, arg2 -> abstract_29, arg3 -> undef25, arg4 -> 2, rest remain the same}> * Postcondition : arg1 + arg2 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000574s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000698s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 + arg2 <= 1 , Narrowing transition: -1 + arg1, arg2 -> arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, arg2 -> arg1, rest remain the same}> -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001911s Ranking function: -1 + 2*arg3 - 2*arg4 New Graphs: Transitions: -1 + arg1, arg2 -> arg1, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000753s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003192s [17035 : 17045] [17035 : 17046] Successful child: 17045 [ 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 + arg1, arg2 -> arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + arg1, arg2 -> arg1, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + arg2 + arg4 <= 0 - Process 2 * Exit transition: abstract_28, arg2 -> abstract_29, arg3 -> undef25, arg4 -> 2, rest remain the same}> * Postcondition : 1 + arg2 + arg4 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000590s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000723s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg2 + arg4 <= 0 , Narrowing transition: -1 + arg1, arg2 -> arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, arg2 -> arg1, rest remain the same}> -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002155s Ranking function: -6 + 6*arg3 - 6*arg4 New Graphs: Transitions: -1 + arg1, arg2 -> arg1, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000836s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003549s [17035 : 17074] [17035 : 17075] Successful child: 17074 [ 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 + arg1, arg2 -> arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + arg1, arg2 -> arg1, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + arg2 <= 0 - Process 3 * Exit transition: abstract_28, arg2 -> abstract_29, arg3 -> undef25, arg4 -> 2, rest remain the same}> * Postcondition : 1 + arg2 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000638s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000769s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg2 <= 0 , Narrowing transition: -1 + arg1, arg2 -> arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, arg2 -> arg1, rest remain the same}> -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002175s Ranking function: -6 + 6*arg3 - 6*arg4 New Graphs: Transitions: -1 + arg1, arg2 -> arg1, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000837s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003531s [17035 : 17111] [17035 : 17112] Successful child: 17111 [ 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 + arg1, arg2 -> arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, 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: -1 + arg1, arg2 -> arg1, rest remain the same}> New Graphs: LOG: CALL check - Post:arg2 <= 0 - Process 4 * Exit transition: abstract_28, arg2 -> abstract_29, arg3 -> undef25, arg4 -> 2, rest remain the same}> * Postcondition : arg2 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000639s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000768s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg2 <= 0 , Narrowing transition: -1 + arg1, arg2 -> arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, arg2 -> arg1, rest remain the same}> -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002195s Ranking function: -6 + 6*arg3 - 6*arg4 New Graphs: Transitions: -1 + arg1, arg2 -> arg1, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000841s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003508s [17035 : 17144] [17035 : 17145] Successful child: 17144 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, 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 + arg1, arg2 -> arg1, rest remain the same}> Ranking function: -2*arg1 + arg2 New Graphs: LOG: CALL check - Post:1 + arg1 <= 0 - Process 5 * Exit transition: abstract_28, arg2 -> abstract_29, arg3 -> undef25, arg4 -> 2, rest remain the same}> * Postcondition : 1 + arg1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000597s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000727s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg1 <= 0 , Narrowing transition: -1 + arg1, arg2 -> arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, arg2 -> arg1, rest remain the same}> -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002398s Ranking function: 3*arg1 - 3*arg3 + 3*arg4 New Graphs: Transitions: -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001296s Ranking function: arg1 New Graphs: Program Terminates