5.27/5.30 NO 5.27/5.30 5.27/5.30 Solver Timeout: 4 5.27/5.30 Global Timeout: 300 5.27/5.30 No parsing errors! 5.27/5.30 Init Location: 0 5.27/5.30 Transitions: 5.27/5.30 5.27/5.30 undef2}> 5.27/5.30 5.27/5.30 5.27/5.30 5.27/5.30 5.27/5.30 Fresh variables: 5.27/5.30 undef2, 5.27/5.30 5.27/5.30 Undef variables: 5.27/5.30 undef2, 5.27/5.30 5.27/5.30 Abstraction variables: 5.27/5.30 5.27/5.30 Exit nodes: 5.27/5.30 5.27/5.30 Accepting locations: 5.27/5.30 5.27/5.30 Asserts: 5.27/5.30 5.27/5.30 Preprocessed LLVMGraph 5.27/5.30 Init Location: 0 5.27/5.30 Transitions: 5.27/5.30 5.27/5.30 undef2}> 5.27/5.30 5.27/5.30 Fresh variables: 5.27/5.30 undef2, 5.27/5.30 5.27/5.30 Undef variables: 5.27/5.30 undef2, 5.27/5.30 5.27/5.30 Abstraction variables: 5.27/5.30 5.27/5.30 Exit nodes: 5.27/5.30 5.27/5.30 Accepting locations: 5.27/5.30 5.27/5.30 Asserts: 5.27/5.30 5.27/5.30 ************************************************************* 5.27/5.30 ******************************************************************************************* 5.27/5.30 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.27/5.30 ******************************************************************************************* 5.27/5.30 5.27/5.30 Init Location: 0 5.27/5.30 Graph 0: 5.27/5.30 Transitions: 5.27/5.30 Variables: 5.27/5.30 5.27/5.30 Graph 1: 5.27/5.30 Transitions: 5.27/5.30 undef2, rest remain the same}> 5.27/5.30 Variables: 5.27/5.30 __const_1000^0, x^0 5.27/5.30 5.27/5.30 Precedence: 5.27/5.30 Graph 0 5.27/5.30 5.27/5.30 Graph 1 5.27/5.30 5.27/5.30 5.27/5.30 Map Locations to Subgraph: 5.27/5.30 ( 0 , 0 ) 5.27/5.30 ( 1 , 1 ) 5.27/5.30 5.27/5.30 ******************************************************************************************* 5.27/5.30 ******************************** CHECKING ASSERTIONS ******************************** 5.27/5.30 ******************************************************************************************* 5.27/5.30 5.27/5.30 Proving termination of subgraph 0 5.27/5.30 Proving termination of subgraph 1 5.27/5.30 Checking unfeasibility... 5.27/5.30 Time used: 0.001888 5.27/5.30 5.27/5.30 Checking conditional termination of SCC {l1}... 5.27/5.30 5.27/5.30 LOG: CALL solveLinear 5.27/5.30 5.27/5.30 LOG: RETURN solveLinear - Elapsed time: 0.000745s 5.27/5.30 5.27/5.30 LOG: CALL solveLinear 5.27/5.30 5.27/5.30 LOG: RETURN solveLinear - Elapsed time: 0.002235s 5.27/5.30 Trying to remove transition: undef2, rest remain the same}> 5.27/5.30 Solving with 1 template(s). 5.27/5.30 5.27/5.30 LOG: CALL solveNonLinearGetFirstSolution 5.27/5.30 5.27/5.30 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004743s 5.27/5.30 Time used: 0.004593 5.27/5.30 Solving with 1 template(s). 5.27/5.30 5.27/5.30 LOG: CALL solveNonLinearGetFirstSolution 5.27/5.30 5.27/5.30 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007168s 5.27/5.30 Time used: 0.006811 5.27/5.30 Improving Solution with cost 1 ... 5.27/5.30 5.27/5.30 LOG: CALL solveNonLinearGetNextSolution 5.27/5.30 5.27/5.30 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013856s 5.27/5.30 Time used: 0.01385 5.27/5.30 5.27/5.30 LOG: SAT solveNonLinear - Elapsed time: 0.021024s 5.27/5.30 Cost: 1; Total time: 0.020661 5.27/5.30 Failed at location 1: 1 + x^0 <= __const_1000^0 5.27/5.30 Before Improving: 5.27/5.30 Quasi-invariant at l1: 1 + x^0 <= __const_1000^0 5.27/5.30 Optimizing invariants... 5.27/5.30 5.27/5.30 LOG: CALL solveLinear 5.27/5.30 5.27/5.30 LOG: RETURN solveLinear - Elapsed time: 0.001890s 5.27/5.30 Remaining time after improvement: 0.999095 5.27/5.30 Termination implied by a set of quasi-invariant(s): 5.27/5.30 Quasi-invariant at l1: 1 + x^0 <= __const_1000^0 5.27/5.30 [ Invariant Graph ] 5.27/5.30 Strengthening and disabling transitions... 5.27/5.30 5.27/5.30 LOG: CALL solverLinear in Graph for feasibility 5.27/5.30 5.27/5.30 LOG: RETURN solveLinear in Graph for feasibility 5.27/5.30 It's unfeasible. Removing transition: 5.27/5.30 undef2, rest remain the same}> 5.27/5.30 [ Termination Graph ] 5.27/5.30 Strengthening and disabling transitions... 5.27/5.30 5.27/5.30 LOG: CALL solverLinear in Graph for feasibility 5.27/5.30 5.27/5.30 LOG: RETURN solveLinear in Graph for feasibility 5.27/5.30 It's unfeasible. Removing transition: 5.27/5.30 undef2, rest remain the same}> 5.27/5.30 New Graphs: 5.27/5.30 Calling Safety with literal 1 + x^0 <= __const_1000^0 and entry 5.27/5.30 5.27/5.30 LOG: CALL check - Post:1 + x^0 <= __const_1000^0 - Process 1 5.27/5.30 * Exit transition: 5.27/5.30 * Postcondition : 1 + x^0 <= __const_1000^0 5.27/5.30 5.27/5.30 LOG: CALL solveLinear 5.27/5.30 5.27/5.30 LOG: RETURN solveLinear - Elapsed time: 0.000347s 5.27/5.30 > Postcondition is not implied! 5.27/5.30 5.27/5.30 LOG: RETURN check - Elapsed time: 0.000418s 5.27/5.30 INVARIANTS: 5.27/5.30 1: 5.27/5.30 Quasi-INVARIANTS to narrow Graph: 5.27/5.30 1: 1 + x^0 <= __const_1000^0 , 5.27/5.30 Narrowing transition: 5.27/5.30 undef2, rest remain the same}> 5.27/5.30 5.27/5.30 LOG: Narrow transition size 1 5.27/5.30 invGraph after Narrowing: 5.27/5.30 Transitions: 5.27/5.30 undef2, rest remain the same}> 5.27/5.30 Variables: 5.27/5.30 __const_1000^0, x^0 5.27/5.30 Checking conditional termination of SCC {l1}... 5.27/5.30 5.27/5.30 LOG: CALL solveLinear 5.27/5.30 5.27/5.30 LOG: RETURN solveLinear - Elapsed time: 0.000617s 5.27/5.30 5.27/5.30 LOG: CALL solveLinear 5.27/5.30 5.27/5.30 LOG: RETURN solveLinear - Elapsed time: 0.002307s 5.27/5.30 Trying to remove transition: undef2, rest remain the same}> 5.27/5.30 Solving with 1 template(s). 5.27/5.30 5.27/5.30 LOG: CALL solveNonLinearGetFirstSolution 5.27/5.30 5.27/5.30 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004168s 5.27/5.30 Time used: 0.004015 5.27/5.30 Solving with 1 template(s). 5.27/5.30 5.27/5.30 LOG: CALL solveNonLinearGetFirstSolution 5.27/5.30 5.27/5.30 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007111s 5.27/5.30 Time used: 0.00676 5.27/5.30 Improving Solution with cost 1 ... 5.27/5.30 5.27/5.30 LOG: CALL solveNonLinearGetNextSolution 5.27/5.30 5.27/5.30 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012360s 5.27/5.30 Time used: 0.012356 5.27/5.30 5.27/5.30 LOG: SAT solveNonLinear - Elapsed time: 0.019471s 5.27/5.30 Cost: 1; Total time: 0.019116 5.27/5.30 Failed at location 1: x^0 <= __const_1000^0 5.27/5.30 Before Improving: 5.27/5.30 Quasi-invariant at l1: x^0 <= __const_1000^0 5.27/5.30 Optimizing invariants... 5.27/5.30 5.27/5.30 LOG: CALL solveLinear 5.27/5.30 5.27/5.30 LOG: RETURN solveLinear - Elapsed time: 0.002026s 5.27/5.30 Remaining time after improvement: 0.998957 5.27/5.30 Termination implied by a set of quasi-invariant(s): 5.27/5.30 Quasi-invariant at l1: x^0 <= __const_1000^0 5.27/5.30 [ Invariant Graph ] 5.27/5.30 Strengthening and disabling transitions... 5.27/5.30 5.27/5.30 LOG: CALL solverLinear in Graph for feasibility 5.27/5.30 5.27/5.30 LOG: RETURN solveLinear in Graph for feasibility 5.27/5.30 It's unfeasible. Removing transition: 5.27/5.30 undef2, rest remain the same}> 5.27/5.30 [ Termination Graph ] 5.27/5.30 Strengthening and disabling transitions... 5.27/5.31 > It's unfeasible. Removing transition: 5.27/5.31 undef2, rest remain the same}> 5.27/5.31 New Graphs: 5.27/5.31 Calling Safety with literal x^0 <= __const_1000^0 and entry 5.27/5.31 5.27/5.31 LOG: CALL check - Post:x^0 <= __const_1000^0 - Process 2 5.27/5.31 * Exit transition: 5.27/5.31 * Postcondition : x^0 <= __const_1000^0 5.27/5.31 5.27/5.31 LOG: CALL solveLinear 5.27/5.31 5.27/5.31 LOG: RETURN solveLinear - Elapsed time: 0.000430s 5.27/5.31 > Postcondition is not implied! 5.27/5.31 5.27/5.31 LOG: RETURN check - Elapsed time: 0.000508s 5.27/5.31 INVARIANTS: 5.27/5.31 1: 5.27/5.31 Quasi-INVARIANTS to narrow Graph: 5.27/5.31 1: x^0 <= __const_1000^0 , 5.27/5.31 Narrowing transition: 5.27/5.31 undef2, rest remain the same}> 5.27/5.31 5.27/5.31 LOG: Narrow transition size 1 5.27/5.31 invGraph after Narrowing: 5.27/5.31 Transitions: 5.27/5.31 undef2, rest remain the same}> 5.27/5.31 Variables: 5.27/5.31 __const_1000^0, x^0 5.27/5.31 Checking conditional termination of SCC {l1}... 5.27/5.31 5.27/5.31 LOG: CALL solveLinear 5.27/5.31 5.27/5.31 LOG: RETURN solveLinear - Elapsed time: 0.000603s 5.27/5.31 5.27/5.31 LOG: CALL solveLinear 5.27/5.31 5.27/5.31 LOG: RETURN solveLinear - Elapsed time: 0.002195s 5.27/5.31 Trying to remove transition: undef2, rest remain the same}> 5.27/5.31 Solving with 1 template(s). 5.27/5.31 5.27/5.31 LOG: CALL solveNonLinearGetFirstSolution 5.27/5.31 5.27/5.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004484s 5.27/5.31 Time used: 0.004327 5.27/5.31 Solving with 1 template(s). 5.27/5.31 5.27/5.31 LOG: CALL solveNonLinearGetFirstSolution 5.27/5.31 5.27/5.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008225s 5.27/5.31 Time used: 0.007818 5.27/5.31 Improving Solution with cost 1 ... 5.27/5.31 5.27/5.31 LOG: CALL solveNonLinearGetNextSolution 5.27/5.31 5.27/5.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009756s 5.27/5.31 Time used: 0.009752 5.27/5.31 5.27/5.31 LOG: SAT solveNonLinear - Elapsed time: 0.017981s 5.27/5.31 Cost: 1; Total time: 0.01757 5.27/5.31 Failed at location 1: 1 <= __const_1000^0 5.27/5.31 Before Improving: 5.27/5.31 Quasi-invariant at l1: 1 <= __const_1000^0 5.27/5.31 Optimizing invariants... 5.27/5.31 5.27/5.31 LOG: CALL solveLinear 5.27/5.31 5.27/5.31 LOG: RETURN solveLinear - Elapsed time: 0.002027s 5.27/5.31 Remaining time after improvement: 0.998917 5.27/5.31 Termination implied by a set of quasi-invariant(s): 5.27/5.31 Quasi-invariant at l1: 1 <= __const_1000^0 5.27/5.31 [ Invariant Graph ] 5.27/5.31 Strengthening and disabling transitions... 5.27/5.31 5.27/5.31 LOG: CALL solverLinear in Graph for feasibility 5.27/5.31 5.27/5.31 LOG: RETURN solveLinear in Graph for feasibility 5.27/5.31 Strengthening transition (result): 5.27/5.31 undef2, rest remain the same}> 5.27/5.31 [ Termination Graph ] 5.27/5.31 Strengthening and disabling transitions... 5.27/5.31 5.27/5.31 LOG: CALL solverLinear in Graph for feasibility 5.27/5.31 5.27/5.31 LOG: RETURN solveLinear in Graph for feasibility 5.27/5.31 Strengthening transition (result): 5.27/5.31 undef2, rest remain the same}> 5.27/5.31 Ranking function: -__const_1000^0 + x^0 5.27/5.31 New Graphs: 5.27/5.31 Calling Safety with literal 1 <= __const_1000^0 and entry 5.27/5.31 5.27/5.31 LOG: CALL check - Post:1 <= __const_1000^0 - Process 3 5.27/5.31 * Exit transition: 5.27/5.31 * Postcondition : 1 <= __const_1000^0 5.27/5.31 5.27/5.31 LOG: CALL solveLinear 5.27/5.31 5.27/5.31 LOG: RETURN solveLinear - Elapsed time: 0.000391s 5.27/5.31 > Postcondition is not implied! 5.27/5.31 5.27/5.31 LOG: RETURN check - Elapsed time: 0.000462s 5.27/5.31 INVARIANTS: 5.27/5.31 1: 5.27/5.31 Quasi-INVARIANTS to narrow Graph: 5.27/5.31 1: 1 <= __const_1000^0 , 5.27/5.31 Narrowing transition: 5.27/5.31 undef2, rest remain the same}> 5.27/5.31 5.27/5.31 LOG: Narrow transition size 1 5.27/5.31 invGraph after Narrowing: 5.27/5.31 Transitions: 5.27/5.31 undef2, rest remain the same}> 5.27/5.31 Variables: 5.27/5.31 __const_1000^0, x^0 5.27/5.31 Checking conditional termination of SCC {l1}... 5.27/5.31 5.27/5.31 LOG: CALL solveLinear 5.27/5.31 5.27/5.31 LOG: RETURN solveLinear - Elapsed time: 0.000656s 5.27/5.31 5.27/5.31 LOG: CALL solveLinear 5.27/5.31 5.27/5.31 LOG: RETURN solveLinear - Elapsed time: 0.002334s 5.27/5.31 Trying to remove transition: undef2, rest remain the same}> 5.27/5.31 Solving with 1 template(s). 5.27/5.31 5.27/5.31 LOG: CALL solveNonLinearGetFirstSolution 5.27/5.31 5.27/5.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004613s 5.27/5.31 Time used: 0.004447 5.27/5.31 Solving with 1 template(s). 5.27/5.31 5.27/5.31 LOG: CALL solveNonLinearGetFirstSolution 5.27/5.31 5.27/5.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008427s 5.27/5.31 Time used: 0.008121 5.27/5.31 Solving with 2 template(s). 5.27/5.31 5.27/5.31 LOG: CALL solveNonLinearGetFirstSolution 5.27/5.31 5.27/5.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001245s 5.27/5.31 Time used: 4.00047 5.27/5.31 Solving with 3 template(s). 5.27/5.31 5.27/5.31 LOG: CALL solveNonLinearGetFirstSolution 5.27/5.31 5.27/5.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003648s 5.27/5.31 Time used: 1.00041 5.27/5.31 Solving with 1 template(s). 5.27/5.31 5.27/5.31 LOG: CALL solveNonLinearGetFirstSolution 5.27/5.31 5.27/5.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009334s 5.27/5.31 Time used: 0.006169 5.27/5.31 5.27/5.31 Proving non-termination of subgraph 1 5.27/5.31 Transitions: 5.27/5.31 undef2, rest remain the same}> 5.27/5.31 Variables: 5.27/5.31 __const_1000^0, x^0 5.27/5.31 5.27/5.31 Checking that every undef value has an assignment... 5.27/5.31 5.27/5.31 LOG: CALL solveLinear 5.27/5.31 5.27/5.31 LOG: RETURN solveLinear - Elapsed time: 0.001137s 5.27/5.31 Checking conditional non-termination of SCC {l1}... 5.27/5.31 EXIT TRANSITIONS: 5.27/5.31 5.27/5.31 5.27/5.31 5.27/5.31 Solving with 1 template(s). 5.27/5.31 5.27/5.31 LOG: CALL solveNonLinearGetFirstSolution 5.27/5.31 5.27/5.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020737s 5.27/5.31 Time used: 0.020465 5.27/5.31 Improving Solution with cost 2 ... 5.27/5.31 5.27/5.31 LOG: CALL solveNonLinearGetNextSolution 5.27/5.31 5.27/5.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.045235s 5.27/5.31 Time used: 0.045229 5.27/5.31 5.27/5.31 LOG: SAT solveNonLinear - Elapsed time: 0.065973s 5.27/5.31 Cost: 2; Total time: 0.065694 5.27/5.31 Failed at location 1: 1 + __const_1000^0 <= 0 5.27/5.31 Before Improving: 5.27/5.31 Quasi-invariant at l1: 1 + __const_1000^0 <= 0 5.27/5.31 Optimizing invariants... 5.27/5.31 5.27/5.31 LOG: CALL solveLinear 5.27/5.31 5.27/5.31 LOG: RETURN solveLinear - Elapsed time: 0.007926s 5.27/5.31 Remaining time after improvement: 0.998193 5.27/5.31 Minimizing number of undef constraints... 5.27/5.31 5.27/5.31 LOG: CALL solveNonLinear 5.27/5.31 5.27/5.31 LOG: RETURN solveNonLinear - Elapsed time: 0.003244s 5.27/5.31 Number of undef constraints reduced! 5.27/5.31 5.27/5.31 Non-termination implied by a set of quasi-invariant(s): 5.27/5.31 Quasi-invariant at l1: 1 + __const_1000^0 <= 0 5.27/5.31 5.27/5.31 Strengthening and disabling EXIT transitions... 5.27/5.31 Closed exits from l1: 1 5.27/5.31 Strengthening exit transition (result): 5.27/5.31 5.27/5.31 5.27/5.31 Strengthening and disabling transitions... 5.27/5.31 5.27/5.31 LOG: CALL solverLinear in Graph for feasibility 5.27/5.31 5.27/5.31 LOG: RETURN solveLinear in Graph for feasibility 5.27/5.31 Strengthening transition (result): 5.27/5.31 undef2, rest remain the same}> 5.27/5.31 5.27/5.31 Checking conditional non-termination of SCC {l1}... 5.27/5.31 EXIT TRANSITIONS: 5.27/5.31 5.27/5.31 5.27/5.31 Solving with 1 template(s). 5.27/5.31 5.27/5.31 LOG: CALL solveNonLinearGetFirstSolution 5.27/5.31 5.27/5.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013269s 5.27/5.31 Time used: 0.013008 5.27/5.31 Improving Solution with cost 1 ... 5.27/5.31 5.27/5.31 LOG: CALL solveNonLinearGetNextSolution 5.27/5.31 5.27/5.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021909s 5.27/5.31 Time used: 0.021902 5.27/5.31 5.27/5.31 LOG: SAT solveNonLinear - Elapsed time: 0.035177s 5.27/5.31 Cost: 1; Total time: 0.03491 5.27/5.31 Failed at location 1: 0 <= x^0 5.27/5.31 Before Improving: 5.27/5.31 Quasi-invariant at l1: 0 <= x^0 5.27/5.31 Optimizing invariants... 5.27/5.31 5.27/5.31 LOG: CALL solveLinear 5.27/5.31 5.27/5.31 LOG: RETURN solveLinear - Elapsed time: 0.007508s 5.27/5.31 Remaining time after improvement: 0.998197 5.27/5.31 Minimizing number of undef constraints... 5.27/5.31 5.27/5.31 LOG: CALL solveNonLinear 5.27/5.31 5.27/5.31 LOG: RETURN solveNonLinear - Elapsed time: 0.003020s 5.27/5.31 Number of undef constraints reduced! 5.27/5.31 5.27/5.31 Non-termination implied by a set of quasi-invariant(s): 5.27/5.31 Quasi-invariant at l1: 0 <= x^0 5.27/5.31 5.27/5.31 Strengthening and disabling EXIT transitions... 5.27/5.31 Closed exits from l1: 1 5.27/5.31 5.27/5.31 Strengthening and disabling transitions... 5.27/5.31 5.27/5.31 LOG: CALL solverLinear in Graph for feasibility 5.27/5.31 5.27/5.31 LOG: RETURN solveLinear in Graph for feasibility 5.27/5.31 Strengthening transition (result): 5.27/5.31 undef2, rest remain the same}> 5.27/5.31 5.27/5.31 Calling reachability with... 5.27/5.31 Transition: 5.27/5.31 Conditions: 1 + __const_1000^0 <= 0, 0 <= x^0, 5.27/5.31 OPEN EXITS: 5.27/5.31 (condsUp: 1 + __const_1000^0 <= 0) 5.27/5.31 5.27/5.31 --- Reachability graph --- 5.27/5.31 > Graph without transitions. 5.27/5.31 5.27/5.31 Calling reachability with... 5.27/5.31 Transition: 5.27/5.31 Conditions: 0 <= x^0, 1 + __const_1000^0 <= 0, 5.27/5.31 OPEN EXITS: 5.27/5.31 5.27/5.31 5.27/5.31 > Conditions are reachable! 5.27/5.31 5.27/5.31 Program does NOT terminate 5.27/5.31 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 5.27/5.31 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 5.27/5.31 EOF