/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) /\ (arg2 > ~(1)), par{arg1 -> 5}> (arg1 + 1), arg2 -> ((~(1) * arg2) + 1)}> 0) /\ (arg2 < (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) + 1)}> = (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> 0}> 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> 0}> arg1) /\ (arg2 < 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) - 1)}> arg1) /\ (arg2 > 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) - 1)}> undef15, arg2 -> undef16}> Fresh variables: undef15, undef16, Undef variables: undef15, undef16, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef16 > ~(1))> (arg1 + 1), arg2 -> ((~(1) * arg2) + 1)}> 0) /\ (arg2 < (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) + 1)}> = (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> 0}> 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> 0}> arg1) /\ (arg2 > 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) - 1)}> Fresh variables: undef15, undef16, Undef variables: undef15, undef16, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> 0, rest remain the same}> 1 + arg1, arg2 -> 0, rest remain the same}> 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Variables: arg1, arg2 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.011601 Some transition disabled by a set of invariant(s): Invariant at l2: 0 <= 1 + arg1 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Checking unfeasibility... Time used: 0.009409 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002370s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.290090s [33786 : 33788] [33786 : 33789] Successful child: 33788 [ 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 -> 1 - arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 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 + arg1, arg2 -> 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 + arg1, arg2 -> -1 - arg2, 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 -> 1 - arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 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 + arg1, arg2 -> 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 + arg1, arg2 -> -1 - arg2, rest remain the same}> New Graphs: Transitions: 1 + arg1, arg2 -> 0, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001007s Ranking function: -1 - arg2 New Graphs: LOG: CALL check - Post:arg2 <= 0 - Process 1 * Exit transition: * Postcondition : arg2 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000636s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000733s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg2 <= 0 , 1 <= arg1 , 1 <= arg1 + arg2 , Narrowing transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> LOG: Narrow transition size 3 It's unfeasible. Removing transition: 1 + arg1, arg2 -> 0, rest remain the same}> It's unfeasible. Removing transition: 1 + arg1, arg2 -> 0, rest remain the same}> Narrowing transition: 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002299s Ranking function: -arg1 New Graphs: Transitions: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001138s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.041523s [33786 : 33794] [33786 : 33795] Successful child: 33794 [ 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 -> 1 - arg2, 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 -> 1 - arg2, 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 -> -1 - arg2, 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 -> 1 - arg2, 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 -> -1 - arg2, rest remain the same}> New Graphs: LOG: CALL check - Post:arg2 <= 1 - Process 2 * Exit transition: * Postcondition : arg2 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000814s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000925s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= arg1 + arg2 , 1 <= arg1 , arg2 <= 1 , Narrowing transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002927s Ranking function: -arg1 New Graphs: Transitions: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001172s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.034301s [33786 : 33801] [33786 : 33802] Successful child: 33801 [ 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 -> 1 - arg2, 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 -> 1 - arg2, 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 -> -1 - arg2, 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 -> -1 - arg2, 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 -> 1 - arg2, 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 -> -1 - arg2, rest remain the same}> New Graphs: LOG: CALL check - Post:arg2 <= arg1 - Process 3 * Exit transition: * Postcondition : arg2 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000857s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000976s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg2 <= arg1 , 1 <= arg1 , 1 <= arg1 + arg2 , Narrowing transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003153s Ranking function: -arg1 New Graphs: Transitions: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001324s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.041841s [33786 : 33807] [33786 : 33808] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023856s Time used: 0.023159 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000563s Time used: 1.00059 LOG: SAT solveNonLinear - Elapsed time: 1.024419s Cost: 1; Total time: 1.02375 Quasi-ranking function: 50000 - arg1 New Graphs: Transitions: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001454s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.085351s [33786 : 33816] [33786 : 33817] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.133517s Time used: 4.13296 [33786 : 33918] [33786 : 33922] Successful child: 33918 Program does NOT terminate