5.13/5.14 NO 5.13/5.14 5.13/5.14 Solver Timeout: 4 5.13/5.14 Global Timeout: 300 5.13/5.14 No parsing errors! 5.13/5.14 Init Location: 0 5.13/5.14 Transitions: 5.13/5.14 5.13/5.14 5.13/5.14 5.13/5.14 5.13/5.14 5.13/5.14 5.13/5.14 5.13/5.14 0, __rho_1_^0 -> undef39, dobreak^0 -> (0 + undef39)}> 5.13/5.14 0, __rho_2_^0 -> undef47, n^0 -> (0 + undef47)}> 5.13/5.14 5.13/5.14 0, R^0 -> 0, __rho_1_^0 -> undef59, dobreak^0 -> (0 + undef59)}> 5.13/5.14 5.13/5.14 5.13/5.14 Fresh variables: 5.13/5.14 undef39, undef43, undef47, undef50, undef59, 5.13/5.14 5.13/5.14 Undef variables: 5.13/5.14 undef39, undef43, undef47, undef50, undef59, 5.13/5.14 5.13/5.14 Abstraction variables: 5.13/5.14 5.13/5.14 Exit nodes: 5.13/5.14 5.13/5.14 Accepting locations: 5.13/5.14 5.13/5.14 Asserts: 5.13/5.14 5.13/5.14 Preprocessed LLVMGraph 5.13/5.14 Init Location: 0 5.13/5.14 Transitions: 5.13/5.14 (0 + undef47)}> 5.13/5.14 5.13/5.14 5.13/5.14 (0 + undef47)}> 5.13/5.14 5.13/5.14 5.13/5.14 5.13/5.14 Fresh variables: 5.13/5.14 undef39, undef43, undef47, undef50, undef59, 5.13/5.14 5.13/5.14 Undef variables: 5.13/5.14 undef39, undef43, undef47, undef50, undef59, 5.13/5.14 5.13/5.14 Abstraction variables: 5.13/5.14 5.13/5.14 Exit nodes: 5.13/5.14 5.13/5.14 Accepting locations: 5.13/5.14 5.13/5.14 Asserts: 5.13/5.14 5.13/5.14 ************************************************************* 5.13/5.14 ******************************************************************************************* 5.13/5.14 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.13/5.14 ******************************************************************************************* 5.13/5.14 5.13/5.14 Init Location: 0 5.13/5.14 Graph 0: 5.13/5.14 Transitions: 5.13/5.14 Variables: 5.13/5.14 5.13/5.14 Graph 1: 5.13/5.14 Transitions: 5.13/5.14 5.13/5.14 undef47, rest remain the same}> 5.13/5.14 Variables: 5.13/5.14 n^0 5.13/5.14 5.13/5.14 Graph 2: 5.13/5.14 Transitions: 5.13/5.14 5.13/5.14 Variables: 5.13/5.14 5.13/5.14 Precedence: 5.13/5.14 Graph 0 5.13/5.14 5.13/5.14 Graph 1 5.13/5.14 undef47, rest remain the same}> 5.13/5.14 5.13/5.14 Graph 2 5.13/5.14 5.13/5.14 5.13/5.14 5.13/5.14 Map Locations to Subgraph: 5.13/5.14 ( 0 , 0 ) 5.13/5.14 ( 3 , 1 ) 5.13/5.14 ( 7 , 2 ) 5.13/5.14 5.13/5.14 ******************************************************************************************* 5.13/5.14 ******************************** CHECKING ASSERTIONS ******************************** 5.13/5.14 ******************************************************************************************* 5.13/5.14 5.13/5.14 Proving termination of subgraph 0 5.13/5.14 Proving termination of subgraph 1 5.13/5.14 Checking unfeasibility... 5.13/5.14 Time used: 0.002671 5.13/5.14 5.13/5.14 Checking conditional termination of SCC {l3}... 5.13/5.14 5.13/5.14 LOG: CALL solveLinear 5.13/5.14 5.13/5.14 LOG: RETURN solveLinear - Elapsed time: 0.000638s 5.13/5.14 5.13/5.14 LOG: CALL solveLinear 5.13/5.14 5.13/5.14 LOG: RETURN solveLinear - Elapsed time: 0.001944s 5.13/5.14 Trying to remove transition: undef47, rest remain the same}> 5.13/5.14 Solving with 1 template(s). 5.13/5.14 5.13/5.14 LOG: CALL solveNonLinearGetFirstSolution 5.13/5.14 5.13/5.14 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004283s 5.13/5.14 Time used: 0.004116 5.13/5.14 Solving with 1 template(s). 5.13/5.14 5.13/5.14 LOG: CALL solveNonLinearGetFirstSolution 5.13/5.14 5.13/5.14 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007365s 5.13/5.14 Time used: 0.006991 5.13/5.14 Improving Solution with cost 1 ... 5.13/5.14 5.13/5.14 LOG: CALL solveNonLinearGetNextSolution 5.13/5.14 5.13/5.14 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017288s 5.13/5.14 Time used: 0.017282 5.13/5.14 5.13/5.14 LOG: SAT solveNonLinear - Elapsed time: 0.024652s 5.13/5.14 Cost: 1; Total time: 0.024273 5.13/5.14 Failed at location 3: 1 <= n^0 5.13/5.14 Before Improving: 5.13/5.14 Quasi-invariant at l3: 1 <= n^0 5.13/5.14 Optimizing invariants... 5.13/5.14 5.13/5.14 LOG: CALL solveLinear 5.13/5.14 5.13/5.14 LOG: RETURN solveLinear - Elapsed time: 0.003068s 5.13/5.14 Remaining time after improvement: 0.99855 5.13/5.14 Termination implied by a set of quasi-invariant(s): 5.13/5.14 Quasi-invariant at l3: 1 <= n^0 5.13/5.14 [ Invariant Graph ] 5.13/5.14 Strengthening and disabling transitions... 5.13/5.14 5.13/5.14 LOG: CALL solverLinear in Graph for feasibility 5.13/5.14 5.13/5.14 LOG: RETURN solveLinear in Graph for feasibility 5.13/5.14 Strengthening transition (result): 5.13/5.14 5.13/5.14 5.13/5.14 LOG: CALL solverLinear in Graph for feasibility 5.13/5.14 5.13/5.14 LOG: RETURN solveLinear in Graph for feasibility 5.13/5.14 It's unfeasible. Removing transition: 5.13/5.14 undef47, rest remain the same}> 5.13/5.14 [ Termination Graph ] 5.13/5.14 Strengthening and disabling transitions... 5.13/5.14 5.13/5.14 LOG: CALL solverLinear in Graph for feasibility 5.13/5.14 5.13/5.14 LOG: RETURN solveLinear in Graph for feasibility 5.13/5.14 Strengthening transition (result): 5.13/5.14 5.13/5.14 5.13/5.14 LOG: CALL solverLinear in Graph for feasibility 5.13/5.14 5.13/5.14 LOG: RETURN solveLinear in Graph for feasibility 5.13/5.14 It's unfeasible. Removing transition: 5.13/5.14 undef47, rest remain the same}> 5.13/5.14 New Graphs: 5.13/5.14 Transitions: 5.13/5.14 5.13/5.14 Variables: 5.13/5.14 n^0 5.13/5.14 > No variable changes in termination graph. 5.13/5.14 Checking conditional unfeasibility... 5.13/5.14 Calling Safety with literal n^0 <= 0 and entry 5.13/5.14 5.13/5.14 LOG: CALL check - Post:n^0 <= 0 - Process 1 5.13/5.14 * Exit transition: 5.13/5.14 * Postcondition : n^0 <= 0 5.13/5.14 Quasi-invariants: 5.13/5.14 Location 3: n^0 <= 0 ; undef47 <= 0 ; 5.13/5.14 Postcondition: n^0 <= 0 5.13/5.14 5.13/5.14 LOG: CALL check - Post:n^0 <= 0 - Process 2 5.13/5.14 * Exit transition: undef47, rest remain the same}> 5.13/5.14 * Postcondition : n^0 <= 0 5.13/5.14 5.13/5.14 LOG: CALL solveLinear 5.13/5.14 5.13/5.14 LOG: RETURN solveLinear - Elapsed time: 0.000366s 5.13/5.14 > Postcondition is not implied! 5.13/5.14 5.13/5.14 LOG: RETURN check - Elapsed time: 0.000451s 5.13/5.14 Postcondition: undef47 <= 0 5.13/5.14 5.13/5.14 LOG: CALL check - Post:undef47 <= 0 - Process 3 5.13/5.14 * Exit transition: undef47, rest remain the same}> 5.13/5.14 * Postcondition : undef47 <= 0 5.13/5.14 5.13/5.14 LOG: CALL solveLinear 5.13/5.14 5.13/5.14 LOG: RETURN solveLinear - Elapsed time: 0.000357s 5.13/5.14 > Postcondition is not implied! 5.13/5.14 5.13/5.14 LOG: RETURN check - Elapsed time: 0.000434s 5.13/5.14 5.13/5.14 LOG: NarrowEntry size 2 5.13/5.14 Narrowing transition: 5.13/5.14 5.13/5.14 5.13/5.14 LOG: Narrow transition size 2 5.13/5.14 Narrowing transition: 5.13/5.14 undef47, rest remain the same}> 5.13/5.14 5.13/5.14 LOG: Narrow transition size 2 5.13/5.14 ENTRIES: 5.13/5.14 undef47, rest remain the same}> 5.13/5.14 END ENTRIES: 5.13/5.14 GRAPH: 5.13/5.14 5.13/5.14 undef47, rest remain the same}> 5.13/5.14 END GRAPH: 5.13/5.14 EXIT: 5.13/5.14 POST: n^0 <= 0 5.13/5.14 5.13/5.14 5.13/5.14 LOG: Try proving POST 5.13/5.14 Solving with 1 template(s). 5.13/5.14 5.13/5.14 LOG: CALL solveNonLinearGetFirstSolution 5.13/5.14 5.13/5.14 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004167s 5.13/5.14 Time used: 0.003999 5.13/5.14 Improving Solution with cost 50 ... 5.13/5.14 5.13/5.14 LOG: CALL solveNonLinearGetNextSolution 5.13/5.14 5.13/5.14 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.008641s 5.13/5.14 Time used: 0.008635 5.13/5.14 5.13/5.14 LOG: SAT solveNonLinear - Elapsed time: 0.012808s 5.13/5.14 Cost: 50; Total time: 0.012634 5.13/5.14 Some transition disabled by a set of invariant(s): 5.13/5.14 Invariant at l3: 1 <= n^0 5.13/5.14 Strengthening and disabling transitions... 5.13/5.14 > It's unfeasible. Removing transition: 5.13/5.14 undef47, rest remain the same}> 5.13/5.14 5.13/5.14 LOG: CALL solverLinear in Graph for feasibility 5.13/5.14 5.13/5.14 LOG: RETURN solveLinear in Graph for feasibility 5.13/5.14 Strengthening transition (result): 5.13/5.14 5.13/5.14 Solving with 1 template(s). 5.13/5.14 5.13/5.14 LOG: CALL solveNonLinearGetFirstSolution 5.13/5.14 5.13/5.14 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004013s 5.13/5.14 Time used: 0.003904 5.13/5.14 Solving with 2 template(s). 5.13/5.14 5.13/5.14 LOG: CALL solveNonLinearGetFirstSolution 5.13/5.14 5.13/5.14 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001159s 5.13/5.14 Time used: 4.00052 5.13/5.14 Solving with 3 template(s). 5.13/5.14 5.13/5.14 LOG: CALL solveNonLinearGetFirstSolution 5.13/5.14 5.13/5.14 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.021396s 5.13/5.14 Time used: 1.00044 5.13/5.14 5.13/5.14 LOG: Postcondition is not implied - no solution 5.13/5.14 > Postcondition is not implied! 5.13/5.14 5.13/5.14 LOG: RETURN check - Elapsed time: 5.049538s 5.13/5.14 5.13/5.14 Proving non-termination of subgraph 1 5.13/5.14 Transitions: 5.13/5.14 5.13/5.14 undef47, rest remain the same}> 5.13/5.14 Variables: 5.13/5.14 n^0 5.13/5.14 5.13/5.14 Checking conditional non-termination of SCC {l3}... 5.13/5.14 > No exit transition to close. 5.13/5.14 Calling reachability with... 5.13/5.14 Transition: 5.13/5.14 Conditions: 5.13/5.14 OPEN EXITS: 5.13/5.14 5.13/5.14 5.13/5.14 --- Reachability graph --- 5.13/5.14 > Graph without transitions. 5.13/5.14 5.13/5.14 Calling reachability with... 5.13/5.14 Transition: undef47, rest remain the same}> 5.13/5.14 Conditions: 5.13/5.14 OPEN EXITS: 5.13/5.14 undef47, rest remain the same}> 5.13/5.14 5.13/5.14 > Conditions are reachable! 5.13/5.14 5.13/5.14 Program does NOT terminate 5.13/5.14 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 5.13/5.14 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 5.13/5.14 EOF