{'fraction_non_alphanumeric': 0.017142857142857144, 'fraction_numerical': 0.0, 'mean_word_length': 5.575, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Eventual linear ranking functions for multi-path linear loops

Termination of linear loop programs has received extensive attention in these years. In this paper, we focus on the termination of multi-path linear constraint loops. For a multi-path linear constraint loop which has no global linear ranking functions or lexicographic linear ranking functions, we present two complete methods to synthesize global eventual linear ranking functions and lexicographic eventual linear ranking functions of such loops, respectively.