5.70/5.73 NO 5.70/5.73 5.70/5.73 Solver Timeout: 4 5.70/5.73 Global Timeout: 300 5.70/5.73 No parsing errors! 5.70/5.73 Init Location: 0 5.70/5.73 Transitions: 5.70/5.73 5.70/5.73 ~(1)) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> 0, arg3 -> arg2}> 5.70/5.73 ~(1)) /\ (arg3 > arg2) /\ (arg2 > ~(1)) /\ (undef4 <= arg1) /\ (arg1 > 0) /\ (undef4 > 0), par{arg1 -> undef4, arg2 -> (arg2 + undef7)}> 5.70/5.73 undef8, arg2 -> undef9, arg3 -> undef10}> 5.70/5.73 5.70/5.73 Fresh variables: 5.70/5.73 undef1, undef4, undef7, undef8, undef9, undef10, 5.70/5.73 5.70/5.73 Undef variables: 5.70/5.73 undef1, undef4, undef7, undef8, undef9, undef10, 5.70/5.73 5.70/5.73 Abstraction variables: 5.70/5.73 5.70/5.73 Exit nodes: 5.70/5.73 5.70/5.73 Accepting locations: 5.70/5.73 5.70/5.73 Asserts: 5.70/5.73 5.70/5.73 Preprocessed LLVMGraph 5.70/5.73 Init Location: 0 5.70/5.73 Transitions: 5.70/5.73 ~(1)) /\ (undef8 > 0) /\ (undef1 > 0)> 5.70/5.73 ~(1)) /\ (arg3 > arg2) /\ (arg2 > ~(1)) /\ (undef4 <= arg1) /\ (arg1 > 0) /\ (undef4 > 0), par{arg1 -> undef4, arg2 -> (arg2 + undef7)}> 5.70/5.73 5.70/5.73 Fresh variables: 5.70/5.73 undef1, undef4, undef7, undef8, undef9, undef10, 5.70/5.73 5.70/5.73 Undef variables: 5.70/5.73 undef1, undef4, undef7, undef8, undef9, undef10, 5.70/5.73 5.70/5.73 Abstraction variables: 5.70/5.73 5.70/5.73 Exit nodes: 5.70/5.73 5.70/5.73 Accepting locations: 5.70/5.73 5.70/5.73 Asserts: 5.70/5.73 5.70/5.73 ************************************************************* 5.70/5.73 ******************************************************************************************* 5.70/5.73 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.70/5.73 ******************************************************************************************* 5.70/5.73 5.70/5.73 Init Location: 0 5.70/5.73 Graph 0: 5.70/5.73 Transitions: 5.70/5.73 Variables: 5.70/5.73 5.70/5.73 Graph 1: 5.70/5.73 Transitions: 5.70/5.73 undef4, arg2 -> arg2 + undef7, rest remain the same}> 5.70/5.73 Variables: 5.70/5.73 arg1, arg2, arg3 5.70/5.73 5.70/5.73 Precedence: 5.70/5.73 Graph 0 5.70/5.73 5.70/5.73 Graph 1 5.70/5.73 5.70/5.73 5.70/5.73 Map Locations to Subgraph: 5.70/5.73 ( 0 , 0 ) 5.70/5.73 ( 2 , 1 ) 5.70/5.73 5.70/5.73 ******************************************************************************************* 5.70/5.73 ******************************** CHECKING ASSERTIONS ******************************** 5.70/5.73 ******************************************************************************************* 5.70/5.73 5.70/5.73 Proving termination of subgraph 0 5.70/5.73 Proving termination of subgraph 1 5.70/5.73 Checking unfeasibility... 5.70/5.73 Time used: 0.003681 5.70/5.73 5.70/5.73 Checking conditional termination of SCC {l2}... 5.70/5.73 5.70/5.73 LOG: CALL solveLinear 5.70/5.73 5.70/5.73 LOG: RETURN solveLinear - Elapsed time: 0.000958s 5.70/5.73 5.70/5.73 LOG: CALL solveLinear 5.70/5.73 5.70/5.73 LOG: RETURN solveLinear - Elapsed time: 0.003730s 5.70/5.73 Trying to remove transition: undef4, arg2 -> arg2 + undef7, rest remain the same}> 5.70/5.73 Solving with 1 template(s). 5.70/5.73 5.70/5.73 LOG: CALL solveNonLinearGetFirstSolution 5.70/5.73 5.70/5.73 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009779s 5.70/5.73 Time used: 0.009539 5.70/5.73 Solving with 1 template(s). 5.70/5.73 5.70/5.73 LOG: CALL solveNonLinearGetFirstSolution 5.70/5.73 5.70/5.73 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012499s 5.70/5.73 Time used: 0.01195 5.70/5.73 Improving Solution with cost 1 ... 5.70/5.73 5.70/5.73 LOG: CALL solveNonLinearGetNextSolution 5.70/5.73 5.70/5.73 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018926s 5.70/5.73 Time used: 0.018919 5.70/5.73 5.70/5.73 LOG: SAT solveNonLinear - Elapsed time: 0.031425s 5.70/5.73 Cost: 1; Total time: 0.030869 5.70/5.73 Failed at location 2: arg1 + arg3 <= 1 5.70/5.73 Before Improving: 5.70/5.73 Quasi-invariant at l2: arg1 + arg3 <= 1 5.70/5.73 Optimizing invariants... 5.70/5.73 5.70/5.73 LOG: CALL solveLinear 5.70/5.73 5.70/5.73 LOG: RETURN solveLinear - Elapsed time: 0.003257s 5.70/5.73 Remaining time after improvement: 0.998262 5.70/5.73 Termination implied by a set of quasi-invariant(s): 5.70/5.73 Quasi-invariant at l2: arg1 + arg3 <= 1 5.70/5.73 [ Invariant Graph ] 5.70/5.73 Strengthening and disabling transitions... 5.70/5.73 5.70/5.73 LOG: CALL solverLinear in Graph for feasibility 5.70/5.73 5.70/5.73 LOG: RETURN solveLinear in Graph for feasibility 5.70/5.73 It's unfeasible. Removing transition: 5.70/5.73 undef4, arg2 -> arg2 + undef7, rest remain the same}> 5.70/5.73 [ Termination Graph ] 5.70/5.73 Strengthening and disabling transitions... 5.70/5.73 > It's unfeasible. Removing transition: 5.70/5.73 undef4, arg2 -> arg2 + undef7, rest remain the same}> 5.70/5.73 New Graphs: 5.70/5.73 Calling Safety with literal arg1 + arg3 <= 1 and entry 5.70/5.73 5.70/5.73 LOG: CALL check - Post:arg1 + arg3 <= 1 - Process 1 5.70/5.73 * Exit transition: 5.70/5.73 * Postcondition : arg1 + arg3 <= 1 5.70/5.73 5.70/5.73 LOG: CALL solveLinear 5.70/5.73 5.70/5.73 LOG: RETURN solveLinear - Elapsed time: 0.000765s 5.70/5.73 > Postcondition is not implied! 5.70/5.73 5.70/5.73 LOG: RETURN check - Elapsed time: 0.000903s 5.70/5.73 INVARIANTS: 5.70/5.73 2: 5.70/5.73 Quasi-INVARIANTS to narrow Graph: 5.70/5.73 2: arg1 + arg3 <= 1 , 5.70/5.73 Narrowing transition: 5.70/5.73 undef4, arg2 -> arg2 + undef7, rest remain the same}> 5.70/5.73 5.70/5.73 LOG: Narrow transition size 1 5.70/5.73 invGraph after Narrowing: 5.70/5.73 Transitions: 5.70/5.73 undef4, arg2 -> arg2 + undef7, rest remain the same}> 5.70/5.73 Variables: 5.70/5.73 arg1, arg2, arg3 5.70/5.73 Checking conditional termination of SCC {l2}... 5.70/5.73 5.70/5.73 LOG: CALL solveLinear 5.70/5.73 5.70/5.73 LOG: RETURN solveLinear - Elapsed time: 0.000940s 5.70/5.73 5.70/5.73 LOG: CALL solveLinear 5.70/5.73 5.70/5.73 LOG: RETURN solveLinear - Elapsed time: 0.003679s 5.70/5.73 Trying to remove transition: undef4, arg2 -> arg2 + undef7, rest remain the same}> 5.70/5.73 Solving with 1 template(s). 5.70/5.73 5.70/5.73 LOG: CALL solveNonLinearGetFirstSolution 5.70/5.73 5.70/5.73 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009073s 5.70/5.73 Time used: 0.008764 5.70/5.73 Solving with 1 template(s). 5.70/5.73 5.70/5.73 LOG: CALL solveNonLinearGetFirstSolution 5.70/5.73 5.70/5.73 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012701s 5.70/5.73 Time used: 0.012047 5.70/5.73 Improving Solution with cost 1 ... 5.70/5.73 5.70/5.73 LOG: CALL solveNonLinearGetNextSolution 5.70/5.73 5.70/5.73 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017240s 5.70/5.73 Time used: 0.017234 5.70/5.73 5.70/5.73 LOG: SAT solveNonLinear - Elapsed time: 0.029941s 5.70/5.73 Cost: 1; Total time: 0.029281 5.70/5.73 Failed at location 2: arg2 + arg3 <= 0 5.70/5.73 Before Improving: 5.70/5.73 Quasi-invariant at l2: arg2 + arg3 <= 0 5.70/5.73 Optimizing invariants... 5.70/5.73 5.70/5.73 LOG: CALL solveLinear 5.70/5.73 5.70/5.73 LOG: RETURN solveLinear - Elapsed time: 0.003316s 5.70/5.73 Remaining time after improvement: 0.998107 5.70/5.73 Termination implied by a set of quasi-invariant(s): 5.70/5.73 Quasi-invariant at l2: arg2 + arg3 <= 0 5.70/5.73 [ Invariant Graph ] 5.70/5.73 Strengthening and disabling transitions... 5.70/5.73 5.70/5.73 LOG: CALL solverLinear in Graph for feasibility 5.70/5.73 5.70/5.73 LOG: RETURN solveLinear in Graph for feasibility 5.70/5.73 It's unfeasible. Removing transition: 5.70/5.73 undef4, arg2 -> arg2 + undef7, rest remain the same}> 5.70/5.73 [ Termination Graph ] 5.70/5.73 Strengthening and disabling transitions... 5.70/5.73 > It's unfeasible. Removing transition: 5.70/5.73 undef4, arg2 -> arg2 + undef7, rest remain the same}> 5.70/5.73 New Graphs: 5.70/5.73 Calling Safety with literal arg2 + arg3 <= 0 and entry 5.70/5.73 5.70/5.73 LOG: CALL check - Post:arg2 + arg3 <= 0 - Process 2 5.70/5.73 * Exit transition: 5.70/5.73 * Postcondition : arg2 + arg3 <= 0 5.70/5.73 5.70/5.73 LOG: CALL solveLinear 5.70/5.73 5.70/5.73 LOG: RETURN solveLinear - Elapsed time: 0.000710s 5.70/5.73 > Postcondition is not implied! 5.70/5.73 5.70/5.73 LOG: RETURN check - Elapsed time: 0.000868s 5.70/5.73 INVARIANTS: 5.70/5.73 2: 5.70/5.73 Quasi-INVARIANTS to narrow Graph: 5.70/5.73 2: arg2 + arg3 <= 0 , 5.70/5.73 Narrowing transition: 5.70/5.73 undef4, arg2 -> arg2 + undef7, rest remain the same}> 5.70/5.73 5.70/5.73 LOG: Narrow transition size 1 5.70/5.73 invGraph after Narrowing: 5.70/5.73 Transitions: 5.70/5.73 undef4, arg2 -> arg2 + undef7, rest remain the same}> 5.70/5.73 Variables: 5.70/5.73 arg1, arg2, arg3 5.70/5.73 Checking conditional termination of SCC {l2}... 5.70/5.73 5.70/5.73 LOG: CALL solveLinear 5.70/5.73 5.70/5.73 LOG: RETURN solveLinear - Elapsed time: 0.001032s 5.70/5.73 5.70/5.73 LOG: CALL solveLinear 5.70/5.73 5.70/5.73 LOG: RETURN solveLinear - Elapsed time: 0.004084s 5.70/5.73 Trying to remove transition: undef4, arg2 -> arg2 + undef7, rest remain the same}> 5.70/5.73 Solving with 1 template(s). 5.70/5.73 5.70/5.73 LOG: CALL solveNonLinearGetFirstSolution 5.70/5.73 5.70/5.73 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009121s 5.70/5.73 Time used: 0.008807 5.70/5.73 Solving with 1 template(s). 5.70/5.73 5.70/5.73 LOG: CALL solveNonLinearGetFirstSolution 5.70/5.73 5.70/5.73 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012691s 5.70/5.73 Time used: 0.012211 5.70/5.73 Solving with 2 template(s). 5.70/5.73 5.70/5.73 LOG: CALL solveNonLinearGetFirstSolution 5.70/5.73 5.70/5.73 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001557s 5.70/5.73 Time used: 4.00045 5.70/5.73 Solving with 3 template(s). 5.70/5.73 5.70/5.73 LOG: CALL solveNonLinearGetFirstSolution 5.70/5.73 5.70/5.73 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005826s 5.70/5.73 Time used: 1.00056 5.70/5.73 Solving with 1 template(s). 5.70/5.73 5.70/5.73 LOG: CALL solveNonLinearGetFirstSolution 5.70/5.73 5.70/5.73 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014991s 5.70/5.73 Time used: 0.010194 5.70/5.73 5.70/5.73 Proving non-termination of subgraph 1 5.70/5.73 Transitions: 5.70/5.73 undef4, arg2 -> arg2 + undef7, rest remain the same}> 5.70/5.73 Variables: 5.70/5.73 arg1, arg2, arg3 5.70/5.73 5.70/5.73 Checking that every undef value has an assignment... 5.70/5.73 5.70/5.73 LOG: CALL solveLinear 5.70/5.73 5.70/5.73 LOG: RETURN solveLinear - Elapsed time: 0.001644s 5.70/5.73 Checking conditional non-termination of SCC {l2}... 5.70/5.73 EXIT TRANSITIONS: 5.70/5.73 5.70/5.73 5.70/5.73 5.70/5.73 5.70/5.73 5.70/5.73 5.70/5.73 5.70/5.73 5.70/5.73 5.70/5.73 Solving with 1 template(s). 5.70/5.73 5.70/5.73 LOG: CALL solveNonLinearGetFirstSolution 5.70/5.73 5.70/5.73 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.059242s 5.70/5.73 Time used: 0.058725 5.70/5.73 Improving Solution with cost 8 ... 5.70/5.73 5.70/5.73 LOG: CALL solveNonLinearGetNextSolution 5.70/5.73 5.70/5.73 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.161441s 5.70/5.73 Time used: 0.161424 5.70/5.73 5.70/5.73 LOG: SAT solveNonLinear - Elapsed time: 0.220683s 5.70/5.73 Cost: 8; Total time: 0.220149 5.70/5.73 Minimizing number of undef constraints... 5.70/5.73 5.70/5.73 LOG: CALL solveNonLinear 5.70/5.73 5.70/5.73 LOG: RETURN solveNonLinear - Elapsed time: 0.023820s 5.70/5.73 Number of undef constraints reduced! 5.70/5.73 5.70/5.73 Non-termination implied by a set of quasi-invariant(s): 5.70/5.73 Quasi-invariant at l2: 1 <= arg1 5.70/5.73 5.70/5.73 Strengthening and disabling EXIT transitions... 5.70/5.73 Closed exits from l2: 4 5.70/5.73 Strengthening exit transition (result): 5.70/5.73 5.70/5.73 Strengthening exit transition (result): 5.70/5.73 5.70/5.73 Strengthening exit transition (result): 5.70/5.73 5.70/5.73 Strengthening exit transition (result): 5.70/5.73 5.70/5.73 5.70/5.73 Strengthening and disabling transitions... 5.70/5.73 5.70/5.73 LOG: CALL solverLinear in Graph for feasibility 5.70/5.73 5.70/5.73 LOG: RETURN solveLinear in Graph for feasibility 5.70/5.73 Strengthening transition (result): 5.70/5.73 undef4, arg2 -> arg2 + undef7, rest remain the same}> 5.70/5.73 5.70/5.73 Checking conditional non-termination of SCC {l2}... 5.70/5.73 EXIT TRANSITIONS: 5.70/5.73 5.70/5.73 5.70/5.73 5.70/5.73 5.70/5.73 5.70/5.73 Solving with 1 template(s). 5.70/5.73 5.70/5.73 LOG: CALL solveNonLinearGetFirstSolution 5.70/5.73 5.70/5.73 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.037437s 5.70/5.73 Time used: 0.037045 5.70/5.73 Improving Solution with cost 4 ... 5.70/5.73 5.70/5.73 LOG: CALL solveNonLinearGetNextSolution 5.70/5.73 5.70/5.73 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.144436s 5.70/5.73 Time used: 0.14442 5.70/5.73 5.70/5.73 LOG: SAT solveNonLinear - Elapsed time: 0.181872s 5.70/5.73 Cost: 4; Total time: 0.181465 5.70/5.73 Failed at location 2: arg1 + arg2 <= arg3 5.70/5.73 Before Improving: 5.70/5.73 Quasi-invariant at l2: arg1 + arg2 <= arg3 5.70/5.73 Optimizing invariants... 5.70/5.73 5.70/5.73 LOG: CALL solveLinear 5.70/5.73 5.70/5.73 LOG: RETURN solveLinear - Elapsed time: 0.016569s 5.70/5.73 Remaining time after improvement: 0.996699 5.70/5.73 Minimizing number of undef constraints... 5.70/5.73 5.70/5.73 LOG: CALL solveNonLinear 5.70/5.73 5.70/5.73 LOG: RETURN solveNonLinear - Elapsed time: 0.005592s 5.70/5.73 Non-termination implied by a set of quasi-invariant(s): 5.70/5.73 Quasi-invariant at l2: arg1 + arg2 <= arg3 5.70/5.73 Constraint over undef 'undef7 <= 0' in transition: 5.70/5.73 undef4, arg2 -> arg2 + undef7, rest remain the same}> 5.70/5.73 5.70/5.73 Strengthening and disabling EXIT transitions... 5.70/5.73 Closed exits from l2: 2 5.70/5.73 Strengthening exit transition (result): 5.70/5.73 5.70/5.73 Strengthening exit transition (result): 5.70/5.73 5.70/5.73 5.70/5.73 Strengthening and disabling transitions... 5.70/5.73 5.70/5.73 LOG: CALL solverLinear in Graph for feasibility 5.70/5.73 5.70/5.73 LOG: RETURN solveLinear in Graph for feasibility 5.70/5.73 Strengthening transition (result): 5.70/5.73 undef4, arg2 -> arg2 + undef7, rest remain the same}> 5.70/5.73 5.70/5.73 Checking conditional non-termination of SCC {l2}... 5.70/5.73 EXIT TRANSITIONS: 5.70/5.73 5.70/5.73 5.70/5.73 5.70/5.73 Solving with 1 template(s). 5.70/5.73 5.70/5.73 LOG: CALL solveNonLinearGetFirstSolution 5.70/5.73 5.70/5.73 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028273s 5.70/5.73 Time used: 0.028163 5.70/5.73 5.70/5.73 LOG: SAT solveNonLinear - Elapsed time: 0.028273s 5.70/5.73 Cost: 0; Total time: 0.028163 5.70/5.73 Minimizing number of undef constraints... 5.70/5.73 5.70/5.73 LOG: CALL solveNonLinear 5.70/5.73 5.70/5.73 LOG: RETURN solveNonLinear - Elapsed time: 0.008409s 5.70/5.73 Number of undef constraints reduced! 5.70/5.73 5.70/5.73 Non-termination implied by a set of quasi-invariant(s): 5.70/5.73 Quasi-invariant at l2: 0 <= arg2 5.70/5.73 5.70/5.73 Strengthening and disabling EXIT transitions... 5.70/5.73 Closed exits from l2: 2 5.70/5.73 5.70/5.73 Strengthening and disabling transitions... 5.70/5.73 5.70/5.73 LOG: CALL solverLinear in Graph for feasibility 5.70/5.73 5.70/5.73 LOG: RETURN solveLinear in Graph for feasibility 5.70/5.73 Strengthening transition (result): 5.70/5.73 undef4, arg2 -> arg2 + undef7, rest remain the same}> 5.70/5.73 5.70/5.73 Calling reachability with... 5.70/5.73 Transition: 5.70/5.73 Conditions: 1 <= arg1, arg1 + arg2 <= arg3, 0 <= arg2, 5.70/5.73 OPEN EXITS: 5.70/5.73 5.70/5.73 5.70/5.73 --- Reachability graph --- 5.70/5.73 > Graph without transitions. 5.70/5.73 5.70/5.73 Calling reachability with... 5.70/5.73 Transition: 5.70/5.73 Conditions: 1 <= arg1, arg1 + arg2 <= arg3, 0 <= arg2, 5.70/5.73 OPEN EXITS: 5.70/5.73 5.70/5.73 5.70/5.73 > Conditions are reachable! 5.70/5.73 5.70/5.73 Program does NOT terminate 5.70/5.73 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 5.70/5.73 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 5.70/5.73 EOF