user: 请从给定的汇编指令推导出C源代码：

```asm
<is_predicate>:
  endbr64
  push   %r15
  push   %r14
  mov    %edi,%r14d
  push   %r13
  mov    $0x7d,%r13d
  push   %r12
  push   %rbp
  push   %rbx
  sub    $0x228,%rsp
  mov    %edi,0x8(%rsp)
  mov    %fs:0x28,%rax
  mov    %rax,0x218(%rsp)
  xor    %eax,%eax
  mov    %edi,%eax
  cmp    $0x7b,%eax
  mov    $0x29,%eax
  cmove  %r13d,%eax
  xor    %edi,%edi
  mov    %eax,%ebx
  mov    %al,0x7(%rsp)
  call   <tl_peek@plt>
  cmp    %al,%bl
  je     L223
  cmp    $0xff,%al
  je     L223
  mov    %eax,%r15d
  xor    %r12d,%r12d
  mov    $0x1,%ebx
  jmp    L30
L203:
  mov    %ebx,%edi
  call   <tl_peek@plt>
  mov    %rax,%r13
  mov    %eax,%r8d
  lea    -0x55(%r15),%eax
  cmp    $0x1,%al
  jbe    L228
  cmp    $0x58,%r15b
  je     L228
L28:
  cmp    $0x3e,%r13d
  sete   %sil
  cmp    $0x2d,%r13d
  sete   %al
  or     %sil,%al
  je     L75
  cmp    $0x3c,%r15b
  je     L72
L75:
  cmp    $0x2d,%r15b
  jne    L161
  test   %sil,%sil
  jne    L72
L161:
  cmp    $0x5b,%r15b
  jne    L41
  cmp    $0x5d,%r13d
  je     L72
L41:
  mov    %ebx,%r13d
  mov    %r15d,%r14d
  cmp    0x8(%rsp),%ebp
  je     L48
L143:
  xor    %eax,%eax
  cmp    %r15b,0x7(%rsp)
  sete   %al
  sub    %eax,%r12d
L132:
  mov    %r13d,%edi
  lea    0x1(%r13),%ebx
  call   <tl_peek@plt>
  mov    %eax,%r15d
  cmp    %al,0x7(%rsp)
  jne    L256
  test   %r12d,%r12d
  jle    L223
L256:
  cmp    $0xff,%al
  je     L223
  cmp    $0x7fe,%ebx
  jg     L223
L30:
  movsbl %r15b,%ebp
  mov    %ebp,%edi
  call   <islower@plt>
  test   %rax,%rax
  je     L203
  mov    %r15b,0x10(%rsp)
  mov    %ebx,%r13d
  lea    0x10(%rsp),%rbp
  mov    $0x1,%r15d
  jmp    L29
  nopl   0x0(%rax,%rax,1)
L278:
  mov    %r14b,0x0(%rbp,%r15,1)
  add    $0x1,%r15
  add    $0x1,%r13d
  cmp    $0x200,%r15
  je     L142
L29:
  mov    %r13d,%edi
  movslq %r15d,%rbx
  call   <tl_peek@plt>
  movsbl %al,%edi
  mov    %rax,%r14
  call   <isalnum@plt>
  test   %rax,%rax
  jne    L278
L266:
  lea    D49(%rip),%rsi
  mov    %rbp,%rdi
  movb   $0x0,0x10(%rsp,%rbx,1)
  call   <strcmp@plt>
  test   %rax,%rax
  je     L72
  lea    D23(%rip),%rsi
  mov    %rbp,%rdi
  call   <strcmp@plt>
  test   %rax,%rax
  je     L72
  lea    D13(%rip),%rsi
  mov    %rbp,%rdi
  call   <strcmp@plt>
  test   %rax,%rax
  je     L72
  lea    D17(%rip),%rsi
  mov    %rbp,%rdi
  call   <strcmp@plt>
  test   %rax,%rax
  je     L72
  lea    D29(%rip),%rsi
  mov    %rbp,%rdi
  call   <strcmp@plt>
  test   %rax,%rax
  je     L72
  mov    0x8(%rsp),%eax
  xor    %r14d,%r14d
  test   %eax,%eax
  jne    L132
  mov    %r13d,%ebx
  xor    %r15d,%r15d
L48:
  add    $0x1,%r12d
  mov    %ebx,%r13d
  mov    %r15d,%r14d
  jmp    L143
  xchg   %ax,%ax
L228:
  movsbl %r14b,%edi
  mov    %r8d,0xc(%rsp)
  call   <isalnum_@plt>
  test   %eax,%eax
  jne    L28
  cmp    $0xffffffff,%r13d
  je     L72
  mov    0xc(%rsp),%edi
  call   <isalnum_@plt>
  test   %eax,%eax
  jne    L28
  nopl   (%rax)
L72:
  xor    %eax,%eax
L35:
  mov    0x218(%rsp),%rdx
  sub    %fs:0x28,%rdx
  jne    L285
  add    $0x228,%rsp
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  ret
  nopw   0x0(%rax,%rax,1)
L142:
  mov    %rbp,%rsi
  lea    D27(%rip),%rdi
  mov    $0x200,%ebx
  movb   $0x0,0x20f(%rsp)
  call   <fatal@plt>
  jmp    L266
L223:
  mov    $0x1,%eax
  jmp    L35
L285:
  call   <__stack_chk_fail@plt>
```

tool_calls: name: parse_data
arguments: label: D49
datatype: string
name: parse_data
arguments: label: D23
datatype: string
name: parse_data
arguments: label: D13
datatype: string
name: parse_data
arguments: label: D17
datatype: string
name: parse_data
arguments: label: D29
datatype: string
name: parse_data
arguments: label: D27
datatype: string

tool: D49: always

tool: D23: equivalent

tool: D13: eventually

tool: D17: until

tool: D29: next

tool: D27: name '%s' in ltl formula too long

assistant: ```c
int is_predicate(int z) {
  char c, c_prev = z;
  char want = (z == '{') ? '}' : ')';
  int i = 0, j, nesting = 0;
  char peek_buf[512];
  c = tl_peek(i++);
  while ((c != want || nesting > 0) && c != -1 && i < 2047) {
    if (islower((int)c)) {
      peek_buf[0] = c;
      j = 1;
      while (j < (int)sizeof(peek_buf) && isalnum((int)(c = tl_peek(i)))) {
        peek_buf[j++] = c;
        i++;
      }
      c = 0;
      if (j >= (int)sizeof(peek_buf)) {
        peek_buf[j - 1] = '\0';
        fatal("name '%s' in ltl formula too long", peek_buf);
      }
      peek_buf[j] = '\0';
      if (strcmp(peek_buf, "always") == 0 || strcmp(peek_buf, "equivalent") == 0 || strcmp(peek_buf, "eventually") == 0 || strcmp(peek_buf, "until") == 0 || strcmp(peek_buf, "next") == 0) {
        return 0;
      }
    } else {
      int c_nxt = tl_peek(i);
      if (((c == 'U' || c == 'V' || c == 'X') && !isalnum_(c_prev) && (c_nxt == -1 || !isalnum_(c_nxt))) || (c == '<' && c_nxt == '>') || (c == '<' && c_nxt == '-') || (c == '-' && c_nxt == '>') || (c == '[' && c_nxt == ']')) {
        return 0;
      }
    }
    if (c == z) {
      nesting++;
    }
    if (c == want) {
      nesting--;
    }
    c_prev = c;
    c = tl_peek(i++);
  }
  return 1;
}
```