N5folly13BrokenPromiseE: Broken promise for type name nebula::Status

[masteryyh]

Please check the FAQ documentation before raising an issue
I already checked FAQ and nothing found :(

Describe the bug (required)
An error raised when executing statement like this:

MATCH p=(n: `tag_a`)-[*..2]->(m) RETURN length(p) AS length

and it goes

[ERROR (-1005)]: N5folly13BrokenPromiseE: Broken promise for type name `nebula::Status`

I have totally no idea what it is...graph structure:
tag_a-[edge_a]->tag_b-[edge_a]->tag_c

(root@nebula) [neo4j]> MATCH (n: `tag_a`) RETURN count(n);
+----------+
| count(n) |
+----------+
| 11392    |
+----------+

(root@nebula) [neo4j]> MATCH (n: `tag_b`) RETURN count(n);
+----------+
| count(n) |
+----------+
| 48       |
+----------+

(root@nebula) [neo4j]> MATCH (n: `tag_c`) RETURN count(n);
+----------+
| count(n) |
+----------+
| 3        |
+----------+

(root@nebula) [neo4j]> MATCH ()-[r: `edge_a`]->() RETURN count(r);
+----------+
| count(r) |
+----------+
| 22880    |
+----------+

Your Environments (required)

• OS: uname -a

Linux localhost.localdomain 3.10.0-1160.45.1.el7.x86_64 #1 SMP Wed Oct 13 17:20:51 UTC 2021 x86_64 x86_64 x86_64 GNU/Linux

• Compiler: g++ --version or clang++ --version
  This nebula graph is downloaded from github releases
• CPU: lscpu

Architecture:          x86_64
CPU op-mode(s):        32-bit, 64-bit
Byte Order:            Little Endian
CPU(s):                2
On-line CPU(s) list:   0,1
Thread(s) per core:    1
Core(s) per socket:    1
Socket(s):             2
NUMA node(s):          1
Vendor ID:             GenuineIntel
CPU family:            6
Model:                 63
Model name:            Intel(R) Xeon(R) CPU E5-2680 v3 @ 2.50GHz
Stepping:              2
CPU MHz:               2499.998
BogoMIPS:              4999.99
Hypervisor vendor:     VMware
Virtualization type:   full
L1d cache:             32K
L1i cache:             32K
L2 cache:              256K
L3 cache:              30720K
NUMA node0 CPU(s):     0,1
Flags:                 fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush mmx fxsr sse sse2 ss syscall nx pdpe1gb rdtscp lm constant_tsc arch_perfmon nopl xtopology tsc_reliable nonstop_tsc eagerfpu pni pclmulqdq ssse3 fma cx16 pcid sse4_1 sse4_2 x2apic movbe popcnt tsc_deadline_timer aes xsave avx f16c rdrand hypervisor lahf_lm abm invpcid_single ibrs ibpb stibp fsgsbase tsc_adjust bmi1 avx2 smep bmi2 invpcid xsaveopt arat spec_ctrl intel_stibp arch_capabilities

• Commit id (e.g. a3ffc7d8)

How To Reproduce(required)

Steps to reproduce the behavior:

1. Step 1
   Create 3 tags with 5 string properties and 1 edge type with no property
2. Step 2
   Insert some vertex and edges like I said above
3. Step 3

MATCH p=(n: `tag_a`)-[*..2]->(m) RETURN length(p) AS length

Expected behavior
Return the step count from n to m

Additional context

[masteryyh]

and btw it's v2.6.1

[wey-gu]

Could you please check dmesg ? It looks like the graphD OOM.

[masteryyh]

Could you please check dmesg ? It looks like the graphD OOM.

nothing related to nebula...or the command is wrong? i typed dmesg | grep nebula
and btw the memory used by graphd is significantly increased when this statement executed

[jievince]

It's a bug and has been fixed in the master.
See #3598