5.33/5.37 NO 5.33/5.37 5.33/5.37 Solver Timeout: 4 5.33/5.37 Global Timeout: 300 5.33/5.37 No parsing errors! 5.33/5.37 Init Location: 0 5.33/5.37 Transitions: 5.33/5.37 5.33/5.37 5.33/5.37 undef3}> 5.33/5.37 (2 + undef7)}> 5.33/5.37 5.33/5.37 (~(2) + undef12)}> 5.33/5.37 5.33/5.37 5.33/5.37 5.33/5.37 Fresh variables: 5.33/5.37 undef3, undef7, undef12, 5.33/5.37 5.33/5.37 Undef variables: 5.33/5.37 undef3, undef7, undef12, 5.33/5.37 5.33/5.37 Abstraction variables: 5.33/5.37 5.33/5.37 Exit nodes: 5.33/5.37 5.33/5.37 Accepting locations: 5.33/5.37 5.33/5.37 Asserts: 5.33/5.37 5.33/5.37 Preprocessed LLVMGraph 5.33/5.37 Init Location: 0 5.33/5.37 Transitions: 5.33/5.37 5.33/5.37 5.33/5.37 (2 + undef7)}> 5.33/5.37 (~(2) + undef12)}> 5.33/5.37 5.33/5.37 Fresh variables: 5.33/5.37 undef3, undef7, undef12, 5.33/5.37 5.33/5.37 Undef variables: 5.33/5.37 undef3, undef7, undef12, 5.33/5.37 5.33/5.37 Abstraction variables: 5.33/5.37 5.33/5.37 Exit nodes: 5.33/5.37 5.33/5.37 Accepting locations: 5.33/5.37 5.33/5.37 Asserts: 5.33/5.37 5.33/5.37 ************************************************************* 5.33/5.37 ******************************************************************************************* 5.33/5.37 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.33/5.37 ******************************************************************************************* 5.33/5.37 5.33/5.37 Init Location: 0 5.33/5.37 Graph 0: 5.33/5.37 Transitions: 5.33/5.37 Variables: 5.33/5.37 5.33/5.37 Graph 1: 5.33/5.37 Transitions: 5.33/5.37 2 + undef7, rest remain the same}> 5.33/5.37 -2 + undef12, rest remain the same}> 5.33/5.37 Variables: 5.33/5.37 x_5^0 5.33/5.37 5.33/5.37 Graph 2: 5.33/5.37 Transitions: 5.33/5.37 Variables: 5.33/5.37 5.33/5.37 Precedence: 5.33/5.37 Graph 0 5.33/5.37 5.33/5.37 Graph 1 5.33/5.37 5.33/5.37 5.33/5.37 Graph 2 5.33/5.37 5.33/5.37 5.33/5.37 Map Locations to Subgraph: 5.33/5.37 ( 0 , 0 ) 5.33/5.37 ( 2 , 1 ) 5.33/5.37 ( 3 , 2 ) 5.33/5.37 5.33/5.37 ******************************************************************************************* 5.33/5.37 ******************************** CHECKING ASSERTIONS ******************************** 5.33/5.37 ******************************************************************************************* 5.33/5.37 5.33/5.37 Proving termination of subgraph 0 5.33/5.37 Proving termination of subgraph 1 5.33/5.37 Checking unfeasibility... 5.33/5.37 Time used: 0.002439 5.33/5.37 5.33/5.37 Checking conditional termination of SCC {l2}... 5.33/5.37 5.33/5.37 LOG: CALL solveLinear 5.33/5.37 5.33/5.37 LOG: RETURN solveLinear - Elapsed time: 0.000717s 5.33/5.37 5.33/5.37 LOG: CALL solveLinear 5.33/5.37 5.33/5.37 LOG: RETURN solveLinear - Elapsed time: 0.002714s 5.33/5.37 Trying to remove transition: -2 + undef12, rest remain the same}> 5.33/5.37 Solving with 1 template(s). 5.33/5.37 5.33/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.33/5.37 5.33/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006604s 5.33/5.37 Time used: 0.006423 5.33/5.37 Trying to remove transition: 2 + undef7, rest remain the same}> 5.33/5.37 Solving with 1 template(s). 5.33/5.37 5.33/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.33/5.37 5.33/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005952s 5.33/5.37 Time used: 0.005579 5.33/5.37 Solving with 1 template(s). 5.33/5.37 5.33/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.33/5.37 5.33/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009312s 5.33/5.37 Time used: 0.008929 5.33/5.37 Solving with 2 template(s). 5.33/5.37 5.33/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.33/5.37 5.33/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.036194s 5.33/5.37 Time used: 0.035549 5.33/5.37 Improving Solution with cost 2 ... 5.33/5.37 5.33/5.37 LOG: CALL solveNonLinearGetNextSolution 5.33/5.37 5.33/5.37 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.139976s 5.33/5.37 Time used: 0.139947 5.33/5.37 5.33/5.37 LOG: SAT solveNonLinear - Elapsed time: 0.176171s 5.33/5.37 Cost: 2; Total time: 0.175496 5.33/5.37 Failed at location 2: 0 <= x_5^0 5.33/5.37 Failed at location 2: x_5^0 <= 0 5.33/5.37 Before Improving: 5.33/5.37 Quasi-invariant at l2: 0 <= x_5^0 5.33/5.37 Quasi-invariant at l2: x_5^0 <= 0 5.33/5.37 Optimizing invariants... 5.33/5.37 5.33/5.37 LOG: CALL solveLinear 5.33/5.37 5.33/5.37 LOG: RETURN solveLinear - Elapsed time: 0.011567s 5.33/5.37 Remaining time after improvement: 0.99866 5.33/5.37 Termination implied by a set of quasi-invariant(s): 5.33/5.37 Quasi-invariant at l2: 0 <= x_5^0 5.33/5.37 Quasi-invariant at l2: x_5^0 <= 0 5.33/5.37 [ Invariant Graph ] 5.33/5.37 Strengthening and disabling transitions... 5.33/5.37 5.33/5.37 LOG: CALL solverLinear in Graph for feasibility 5.33/5.37 5.33/5.37 LOG: RETURN solveLinear in Graph for feasibility 5.33/5.37 It's unfeasible. Removing transition: 5.33/5.37 2 + undef7, rest remain the same}> 5.33/5.37 5.33/5.37 LOG: CALL solverLinear in Graph for feasibility 5.33/5.37 5.33/5.37 LOG: RETURN solveLinear in Graph for feasibility 5.33/5.37 It's unfeasible. Removing transition: 5.33/5.37 -2 + undef12, rest remain the same}> 5.33/5.37 [ Termination Graph ] 5.33/5.37 Strengthening and disabling transitions... 5.33/5.37 5.33/5.37 LOG: CALL solverLinear in Graph for feasibility 5.33/5.37 5.33/5.37 LOG: RETURN solveLinear in Graph for feasibility 5.33/5.37 It's unfeasible. Removing transition: 5.33/5.37 2 + undef7, rest remain the same}> 5.33/5.37 5.33/5.37 LOG: CALL solverLinear in Graph for feasibility 5.33/5.37 5.33/5.37 LOG: RETURN solveLinear in Graph for feasibility 5.33/5.37 It's unfeasible. Removing transition: 5.33/5.37 -2 + undef12, rest remain the same}> 5.33/5.37 New Graphs: 5.33/5.37 Calling Safety with literal 0 <= x_5^0 and entry 5.33/5.37 5.33/5.37 LOG: CALL check - Post:0 <= x_5^0 - Process 1 5.33/5.37 * Exit transition: 5.33/5.37 * Postcondition : 0 <= x_5^0 5.33/5.37 5.33/5.37 LOG: CALL solveLinear 5.33/5.37 5.33/5.37 LOG: RETURN solveLinear - Elapsed time: 0.000443s 5.33/5.37 > Postcondition is not implied! 5.33/5.37 5.33/5.37 LOG: RETURN check - Elapsed time: 0.000506s 5.33/5.37 Calling Safety with literal x_5^0 <= 0 and entry 5.33/5.37 5.33/5.37 LOG: CALL check - Post:x_5^0 <= 0 - Process 2 5.33/5.37 * Exit transition: 5.33/5.37 * Postcondition : x_5^0 <= 0 5.33/5.37 5.33/5.37 LOG: CALL solveLinear 5.33/5.37 5.33/5.37 LOG: RETURN solveLinear - Elapsed time: 0.000344s 5.33/5.37 > Postcondition is not implied! 5.33/5.37 5.33/5.37 LOG: RETURN check - Elapsed time: 0.000399s 5.33/5.37 INVARIANTS: 5.33/5.37 2: 5.33/5.37 Quasi-INVARIANTS to narrow Graph: 5.33/5.37 2: x_5^0 <= 0 , 0 <= x_5^0 , 5.33/5.37 Narrowing transition: 5.33/5.37 2 + undef7, rest remain the same}> 5.33/5.37 5.33/5.37 LOG: Narrow transition size 2 5.33/5.37 Narrowing transition: 5.33/5.37 -2 + undef12, rest remain the same}> 5.33/5.37 5.33/5.37 LOG: Narrow transition size 2 5.33/5.37 invGraph after Narrowing: 5.33/5.37 Transitions: 5.33/5.37 2 + undef7, rest remain the same}> 5.33/5.37 -2 + undef12, rest remain the same}> 5.33/5.37 Variables: 5.33/5.37 x_5^0 5.33/5.37 Checking conditional termination of SCC {l2}... 5.33/5.37 5.33/5.37 LOG: CALL solveLinear 5.33/5.37 5.33/5.37 LOG: RETURN solveLinear - Elapsed time: 0.000660s 5.33/5.37 5.33/5.37 LOG: CALL solveLinear 5.33/5.37 5.33/5.37 LOG: RETURN solveLinear - Elapsed time: 0.002722s 5.33/5.37 Trying to remove transition: -2 + undef12, rest remain the same}> 5.33/5.37 Solving with 1 template(s). 5.33/5.37 5.33/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.33/5.37 5.33/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005778s 5.33/5.37 Time used: 0.005625 5.33/5.37 Trying to remove transition: 2 + undef7, rest remain the same}> 5.33/5.37 Solving with 1 template(s). 5.33/5.37 5.33/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.33/5.37 5.33/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005999s 5.33/5.37 Time used: 0.00562 5.33/5.37 Solving with 1 template(s). 5.33/5.37 5.33/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.33/5.37 5.33/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009436s 5.33/5.37 Time used: 0.009017 5.33/5.37 Solving with 2 template(s). 5.33/5.37 5.33/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.33/5.37 5.33/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001480s 5.33/5.37 Time used: 4.0007 5.33/5.37 Solving with 3 template(s). 5.33/5.37 5.33/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.33/5.37 5.33/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.012462s 5.33/5.37 Time used: 1.00059 5.33/5.37 Solving with 1 template(s). 5.33/5.37 5.33/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.33/5.37 5.33/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015854s 5.33/5.37 Time used: 0.008932 5.33/5.37 5.33/5.37 Proving non-termination of subgraph 1 5.33/5.37 Transitions: 5.33/5.37 2 + undef7, rest remain the same}> 5.33/5.37 -2 + undef12, rest remain the same}> 5.33/5.37 Variables: 5.33/5.37 x_5^0 5.33/5.37 5.33/5.37 Checking conditional non-termination of SCC {l2}... 5.33/5.37 EXIT TRANSITIONS: 5.33/5.37 5.33/5.37 5.33/5.37 Solving with 1 template(s). 5.33/5.37 5.33/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.33/5.37 5.33/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012684s 5.33/5.37 Time used: 0.012501 5.33/5.37 Improving Solution with cost 1 ... 5.33/5.37 5.33/5.37 LOG: CALL solveNonLinearGetNextSolution 5.33/5.37 5.33/5.37 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017375s 5.33/5.37 Time used: 0.017368 5.33/5.37 5.33/5.37 LOG: SAT solveNonLinear - Elapsed time: 0.030059s 5.33/5.37 Cost: 1; Total time: 0.029869 5.33/5.37 Failed at location 2: 1 + x_5^0 <= 0 5.33/5.37 Before Improving: 5.33/5.37 Quasi-invariant at l2: 1 + x_5^0 <= 0 5.33/5.37 Optimizing invariants... 5.33/5.37 5.33/5.37 LOG: CALL solveLinear 5.33/5.37 5.33/5.37 LOG: RETURN solveLinear - Elapsed time: 0.005352s 5.33/5.37 Remaining time after improvement: 0.998877 5.33/5.37 Minimizing number of undef constraints... 5.33/5.37 5.33/5.37 LOG: CALL solveNonLinear 5.33/5.37 5.33/5.37 LOG: RETURN solveNonLinear - Elapsed time: 0.002254s 5.33/5.37 Number of undef constraints reduced! 5.33/5.37 5.33/5.37 Non-termination implied by a set of quasi-invariant(s): 5.33/5.37 Quasi-invariant at l2: 1 + x_5^0 <= 0 5.33/5.37 Constraint over undef 'undef12 <= 0' in transition: 5.33/5.37 -2 + undef12, rest remain the same}> 5.33/5.37 5.33/5.37 Strengthening and disabling EXIT transitions... 5.33/5.37 Closed exits from l2: 1 5.33/5.37 5.33/5.37 Strengthening and disabling transitions... 5.33/5.37 5.33/5.37 LOG: CALL solverLinear in Graph for feasibility 5.33/5.37 5.33/5.37 LOG: RETURN solveLinear in Graph for feasibility 5.33/5.37 It's unfeasible. Removing transition: 5.33/5.37 2 + undef7, rest remain the same}> 5.33/5.37 5.33/5.37 LOG: CALL solverLinear in Graph for feasibility 5.33/5.37 5.33/5.37 LOG: RETURN solveLinear in Graph for feasibility 5.33/5.37 Strengthening transition (result): 5.33/5.37 -2 + undef12, rest remain the same}> 5.33/5.37 5.33/5.37 Calling reachability with... 5.33/5.37 Transition: 5.33/5.37 Conditions: 1 + x_5^0 <= 0, 5.33/5.37 OPEN EXITS: 5.33/5.37 5.33/5.37 5.33/5.37 --- Reachability graph --- 5.33/5.37 > Graph without transitions. 5.33/5.37 5.33/5.37 Calling reachability with... 5.33/5.37 Transition: 5.33/5.37 Conditions: 1 + x_5^0 <= 0, 5.33/5.37 OPEN EXITS: 5.33/5.37 5.33/5.37 5.33/5.37 > Conditions are reachable! 5.33/5.37 5.33/5.37 Program does NOT terminate 5.33/5.37 /export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 5.33/5.37 /export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 5.33/5.37 EOF