# Common pitfall ### What is an infinite loop of the prover? For instance, consider applying the rule: ``` a * a == a * a * a / a ``` on the following goal ``` cc(v) = vv * vv ``` We will obtain successively the following goals: ``` cc(v) = vv * vv * vv / vv cc(v) = (vv * vv * vv / vv) * vv / vv ... ``` The kernel of the prover then produces the following messageskrt: sequence memory short ``` krt: asking for 1500000 int, waiting for system reply... krt: OK, memory obtained, we continue. krt: sequence memory short krt: asking for 2249997 int, waiting for system reply... krt: OK, memory obtained, we continue. krt: sequence memory short krt: asking for 3374992 int, waiting for system reply... krt: OK, memory obtained, we continue. ... ``` The messages krt: sequence memory short are generated by the kernel when it dynamically claims additional memory. This example is simple. Infinite loops may be caused by combination of rule applications and be more difficult to detect a priori. --- # Agent Instructions: Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter: ``` GET https://b-method.gitbook.io/training-resources-for-atelier-b/guides-and-tutorials/applying-the-b-method/mathematical-proof/writing-mathematical-rules/common-pitfall.md?ask= ``` The question should be specific, self-contained, and written in natural language. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.