./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 174cfd8cb6426614b32355f584844d4fc6265ba8fd3c3cda6c788ade64de4fc0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 03:04:55,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 03:04:55,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 03:04:55,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 03:04:55,565 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 03:04:55,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 03:04:55,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 03:04:55,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 03:04:55,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 03:04:55,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 03:04:55,577 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 03:04:55,578 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 03:04:55,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 03:04:55,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 03:04:55,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 03:04:55,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 03:04:55,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 03:04:55,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 03:04:55,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 03:04:55,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 03:04:55,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 03:04:55,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 03:04:55,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 03:04:55,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 03:04:55,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 03:04:55,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 03:04:55,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 03:04:55,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 03:04:55,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 03:04:55,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 03:04:55,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 03:04:55,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 03:04:55,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 03:04:55,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 03:04:55,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 03:04:55,603 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 03:04:55,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 03:04:55,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 03:04:55,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 03:04:55,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 03:04:55,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 03:04:55,606 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 03:04:55,628 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 03:04:55,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 03:04:55,629 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 03:04:55,629 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 03:04:55,629 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 03:04:55,629 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 03:04:55,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 03:04:55,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 03:04:55,630 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 03:04:55,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 03:04:55,631 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 03:04:55,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 03:04:55,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 03:04:55,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 03:04:55,631 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 03:04:55,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 03:04:55,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 03:04:55,632 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 03:04:55,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 03:04:55,632 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 03:04:55,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 03:04:55,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 03:04:55,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 03:04:55,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 03:04:55,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 03:04:55,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 03:04:55,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 03:04:55,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 03:04:55,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 03:04:55,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 03:04:55,634 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 03:04:55,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 03:04:55,634 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 03:04:55,634 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 03:04:55,634 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 03:04:55,634 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 174cfd8cb6426614b32355f584844d4fc6265ba8fd3c3cda6c788ade64de4fc0 [2023-02-18 03:04:55,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 03:04:55,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 03:04:55,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 03:04:55,834 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 03:04:55,834 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 03:04:55,835 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound10.c [2023-02-18 03:04:56,756 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 03:04:56,970 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 03:04:56,971 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound10.c [2023-02-18 03:04:56,976 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33721d7be/cf5d2fade4934d54aece763baab5e21d/FLAG3bd592fc1 [2023-02-18 03:04:57,382 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33721d7be/cf5d2fade4934d54aece763baab5e21d [2023-02-18 03:04:57,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 03:04:57,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 03:04:57,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 03:04:57,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 03:04:57,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 03:04:57,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 03:04:57" (1/1) ... [2023-02-18 03:04:57,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e48ff14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:04:57, skipping insertion in model container [2023-02-18 03:04:57,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 03:04:57" (1/1) ... [2023-02-18 03:04:57,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 03:04:57,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 03:04:57,520 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound10.c[526,539] [2023-02-18 03:04:57,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 03:04:57,536 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 03:04:57,544 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound10.c[526,539] [2023-02-18 03:04:57,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 03:04:57,557 INFO L208 MainTranslator]: Completed translation [2023-02-18 03:04:57,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:04:57 WrapperNode [2023-02-18 03:04:57,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 03:04:57,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 03:04:57,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 03:04:57,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 03:04:57,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:04:57" (1/1) ... [2023-02-18 03:04:57,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:04:57" (1/1) ... [2023-02-18 03:04:57,579 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2023-02-18 03:04:57,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 03:04:57,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 03:04:57,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 03:04:57,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 03:04:57,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:04:57" (1/1) ... [2023-02-18 03:04:57,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:04:57" (1/1) ... [2023-02-18 03:04:57,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:04:57" (1/1) ... [2023-02-18 03:04:57,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:04:57" (1/1) ... [2023-02-18 03:04:57,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:04:57" (1/1) ... [2023-02-18 03:04:57,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:04:57" (1/1) ... [2023-02-18 03:04:57,592 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:04:57" (1/1) ... [2023-02-18 03:04:57,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:04:57" (1/1) ... [2023-02-18 03:04:57,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 03:04:57,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 03:04:57,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 03:04:57,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 03:04:57,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:04:57" (1/1) ... [2023-02-18 03:04:57,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 03:04:57,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:04:57,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 03:04:57,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 03:04:57,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 03:04:57,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 03:04:57,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 03:04:57,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 03:04:57,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 03:04:57,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 03:04:57,711 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 03:04:57,713 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 03:04:57,851 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 03:04:57,855 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 03:04:57,855 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 03:04:57,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 03:04:57 BoogieIcfgContainer [2023-02-18 03:04:57,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 03:04:57,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 03:04:57,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 03:04:57,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 03:04:57,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 03:04:57" (1/3) ... [2023-02-18 03:04:57,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5ec9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 03:04:57, skipping insertion in model container [2023-02-18 03:04:57,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:04:57" (2/3) ... [2023-02-18 03:04:57,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5ec9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 03:04:57, skipping insertion in model container [2023-02-18 03:04:57,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 03:04:57" (3/3) ... [2023-02-18 03:04:57,875 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound10.c [2023-02-18 03:04:57,885 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 03:04:57,886 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 03:04:57,924 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 03:04:57,929 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3f668f8d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 03:04:57,930 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 03:04:57,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 03:04:57,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 03:04:57,938 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:04:57,938 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:04:57,939 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:04:57,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:04:57,942 INFO L85 PathProgramCache]: Analyzing trace with hash -586848446, now seen corresponding path program 1 times [2023-02-18 03:04:57,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:04:57,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579730071] [2023-02-18 03:04:57,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:04:57,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:04:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:04:58,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 03:04:58,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:04:58,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579730071] [2023-02-18 03:04:58,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579730071] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 03:04:58,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 03:04:58,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 03:04:58,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622778788] [2023-02-18 03:04:58,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 03:04:58,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 03:04:58,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:04:58,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 03:04:58,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 03:04:58,066 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 03:04:58,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:04:58,082 INFO L93 Difference]: Finished difference Result 49 states and 83 transitions. [2023-02-18 03:04:58,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 03:04:58,085 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 03:04:58,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:04:58,090 INFO L225 Difference]: With dead ends: 49 [2023-02-18 03:04:58,091 INFO L226 Difference]: Without dead ends: 22 [2023-02-18 03:04:58,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 03:04:58,097 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 03:04:58,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 03:04:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-18 03:04:58,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-18 03:04:58,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 03:04:58,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2023-02-18 03:04:58,124 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 9 [2023-02-18 03:04:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:04:58,124 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-02-18 03:04:58,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 03:04:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2023-02-18 03:04:58,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 03:04:58,125 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:04:58,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:04:58,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 03:04:58,126 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:04:58,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:04:58,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1188158916, now seen corresponding path program 1 times [2023-02-18 03:04:58,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:04:58,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419975753] [2023-02-18 03:04:58,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:04:58,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:04:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:04:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 03:04:58,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:04:58,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419975753] [2023-02-18 03:04:58,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419975753] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 03:04:58,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 03:04:58,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 03:04:58,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049513584] [2023-02-18 03:04:58,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 03:04:58,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 03:04:58,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:04:58,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 03:04:58,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 03:04:58,221 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 03:04:58,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:04:58,258 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2023-02-18 03:04:58,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 03:04:58,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 03:04:58,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:04:58,259 INFO L225 Difference]: With dead ends: 35 [2023-02-18 03:04:58,260 INFO L226 Difference]: Without dead ends: 33 [2023-02-18 03:04:58,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 03:04:58,261 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 03:04:58,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 92 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 03:04:58,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-18 03:04:58,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2023-02-18 03:04:58,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 03:04:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-02-18 03:04:58,268 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2023-02-18 03:04:58,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:04:58,269 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-02-18 03:04:58,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 03:04:58,269 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-02-18 03:04:58,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 03:04:58,269 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:04:58,270 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:04:58,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 03:04:58,270 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:04:58,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:04:58,271 INFO L85 PathProgramCache]: Analyzing trace with hash -697944935, now seen corresponding path program 1 times [2023-02-18 03:04:58,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:04:58,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202259744] [2023-02-18 03:04:58,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:04:58,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:04:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:04:58,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-18 03:04:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:04:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 03:04:58,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:04:58,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202259744] [2023-02-18 03:04:58,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202259744] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 03:04:58,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 03:04:58,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 03:04:58,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024511259] [2023-02-18 03:04:58,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 03:04:58,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 03:04:58,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:04:58,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 03:04:58,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 03:04:58,363 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 03:04:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:04:58,408 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2023-02-18 03:04:58,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 03:04:58,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-02-18 03:04:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:04:58,409 INFO L225 Difference]: With dead ends: 39 [2023-02-18 03:04:58,409 INFO L226 Difference]: Without dead ends: 37 [2023-02-18 03:04:58,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 03:04:58,410 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 03:04:58,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 88 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 03:04:58,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-18 03:04:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2023-02-18 03:04:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 03:04:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-02-18 03:04:58,417 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2023-02-18 03:04:58,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:04:58,417 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-02-18 03:04:58,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 03:04:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-02-18 03:04:58,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 03:04:58,418 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:04:58,418 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:04:58,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 03:04:58,419 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:04:58,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:04:58,419 INFO L85 PathProgramCache]: Analyzing trace with hash 262992548, now seen corresponding path program 1 times [2023-02-18 03:04:58,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:04:58,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689742132] [2023-02-18 03:04:58,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:04:58,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:04:58,450 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:04:58,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [192246662] [2023-02-18 03:04:58,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:04:58,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:04:58,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:04:58,454 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:04:58,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 03:04:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:04:58,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 03:04:58,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:04:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 03:04:58,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:04:58,732 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 03:04:58,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:04:58,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689742132] [2023-02-18 03:04:58,733 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:04:58,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192246662] [2023-02-18 03:04:58,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192246662] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 03:04:58,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 03:04:58,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 03:04:58,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499796733] [2023-02-18 03:04:58,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 03:04:58,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 03:04:58,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:04:58,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 03:04:58,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 03:04:58,736 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 03:04:58,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:04:58,971 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2023-02-18 03:04:58,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 03:04:58,972 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2023-02-18 03:04:58,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:04:58,974 INFO L225 Difference]: With dead ends: 65 [2023-02-18 03:04:58,974 INFO L226 Difference]: Without dead ends: 51 [2023-02-18 03:04:58,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 03:04:58,975 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 03:04:58,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 60 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 03:04:58,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-18 03:04:58,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-18 03:04:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 33 states have internal predecessors, (35), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-18 03:04:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2023-02-18 03:04:58,992 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 19 [2023-02-18 03:04:58,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:04:58,993 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-02-18 03:04:58,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 03:04:58,993 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2023-02-18 03:04:58,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 03:04:58,994 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:04:58,994 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:04:59,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 03:04:59,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:04:59,199 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:04:59,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:04:59,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1807142342, now seen corresponding path program 1 times [2023-02-18 03:04:59,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:04:59,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195806314] [2023-02-18 03:04:59,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:04:59,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:04:59,210 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:04:59,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305498918] [2023-02-18 03:04:59,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:04:59,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:04:59,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:04:59,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:04:59,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 03:04:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:04:59,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 03:04:59,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:04:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 03:04:59,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:04:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 03:04:59,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:04:59,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195806314] [2023-02-18 03:04:59,335 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:04:59,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305498918] [2023-02-18 03:04:59,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305498918] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 03:04:59,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 03:04:59,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-02-18 03:04:59,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936216345] [2023-02-18 03:04:59,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 03:04:59,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 03:04:59,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:04:59,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 03:04:59,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-18 03:04:59,337 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 03:04:59,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:04:59,450 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2023-02-18 03:04:59,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 03:04:59,461 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 26 [2023-02-18 03:04:59,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:04:59,462 INFO L225 Difference]: With dead ends: 66 [2023-02-18 03:04:59,462 INFO L226 Difference]: Without dead ends: 59 [2023-02-18 03:04:59,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-02-18 03:04:59,463 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:04:59,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 80 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 03:04:59,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-18 03:04:59,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2023-02-18 03:04:59,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 39 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-18 03:04:59,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2023-02-18 03:04:59,471 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 26 [2023-02-18 03:04:59,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:04:59,471 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2023-02-18 03:04:59,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 03:04:59,471 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2023-02-18 03:04:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-18 03:04:59,472 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:04:59,475 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:04:59,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 03:04:59,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:04:59,680 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:04:59,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:04:59,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1034157389, now seen corresponding path program 1 times [2023-02-18 03:04:59,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:04:59,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495366735] [2023-02-18 03:04:59,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:04:59,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:04:59,698 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:04:59,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1496112915] [2023-02-18 03:04:59,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:04:59,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:04:59,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:04:59,708 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:04:59,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 03:04:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:04:59,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-18 03:04:59,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:04:59,795 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-18 03:04:59,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:04:59,930 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-18 03:04:59,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:04:59,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495366735] [2023-02-18 03:04:59,930 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:04:59,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496112915] [2023-02-18 03:04:59,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496112915] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 03:04:59,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 03:04:59,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-18 03:04:59,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240309291] [2023-02-18 03:04:59,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 03:04:59,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 03:04:59,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:04:59,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 03:04:59,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-02-18 03:04:59,939 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-02-18 03:05:00,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:05:00,958 INFO L93 Difference]: Finished difference Result 142 states and 193 transitions. [2023-02-18 03:05:00,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 03:05:00,958 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 56 [2023-02-18 03:05:00,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:05:00,959 INFO L225 Difference]: With dead ends: 142 [2023-02-18 03:05:00,959 INFO L226 Difference]: Without dead ends: 111 [2023-02-18 03:05:00,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-02-18 03:05:00,960 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 48 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-18 03:05:00,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 94 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-18 03:05:00,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-18 03:05:00,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2023-02-18 03:05:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 64 states have (on average 1.203125) internal successors, (77), 71 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (30), 24 states have call predecessors, (30), 30 states have call successors, (30) [2023-02-18 03:05:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 138 transitions. [2023-02-18 03:05:00,988 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 138 transitions. Word has length 56 [2023-02-18 03:05:00,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:05:00,989 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 138 transitions. [2023-02-18 03:05:00,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-02-18 03:05:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2023-02-18 03:05:00,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-18 03:05:00,990 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:05:00,991 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:05:00,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 03:05:01,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:05:01,195 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:05:01,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:05:01,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1199454569, now seen corresponding path program 1 times [2023-02-18 03:05:01,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:05:01,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961036358] [2023-02-18 03:05:01,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:05:01,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:05:01,203 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:05:01,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [687516580] [2023-02-18 03:05:01,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:05:01,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:05:01,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:05:01,204 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:05:01,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 03:05:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:05:01,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-18 03:05:01,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:05:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-18 03:05:01,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:05:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-18 03:05:01,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:05:01,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961036358] [2023-02-18 03:05:01,443 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:05:01,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687516580] [2023-02-18 03:05:01,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687516580] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 03:05:01,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 03:05:01,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-18 03:05:01,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404711670] [2023-02-18 03:05:01,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 03:05:01,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 03:05:01,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:05:01,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 03:05:01,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-02-18 03:05:01,446 INFO L87 Difference]: Start difference. First operand 106 states and 138 transitions. Second operand has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2023-02-18 03:05:02,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:05:02,061 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2023-02-18 03:05:02,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 03:05:02,062 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 67 [2023-02-18 03:05:02,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:05:02,063 INFO L225 Difference]: With dead ends: 161 [2023-02-18 03:05:02,063 INFO L226 Difference]: Without dead ends: 123 [2023-02-18 03:05:02,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2023-02-18 03:05:02,064 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 03:05:02,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 87 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 03:05:02,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-18 03:05:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 101. [2023-02-18 03:05:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 66 states have internal predecessors, (72), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2023-02-18 03:05:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2023-02-18 03:05:02,095 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 125 transitions. Word has length 67 [2023-02-18 03:05:02,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:05:02,095 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 125 transitions. [2023-02-18 03:05:02,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2023-02-18 03:05:02,095 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2023-02-18 03:05:02,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-18 03:05:02,096 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:05:02,096 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:05:02,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 03:05:02,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:05:02,300 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:05:02,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:05:02,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1728532070, now seen corresponding path program 1 times [2023-02-18 03:05:02,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:05:02,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200556388] [2023-02-18 03:05:02,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:05:02,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:05:02,318 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:05:02,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [944969007] [2023-02-18 03:05:02,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:05:02,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:05:02,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:05:02,339 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:05:02,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 03:05:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:05:02,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-18 03:05:02,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:05:02,437 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 24 proven. 37 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-18 03:05:02,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:05:02,553 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 24 proven. 37 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-18 03:05:02,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:05:02,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200556388] [2023-02-18 03:05:02,554 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:05:02,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944969007] [2023-02-18 03:05:02,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944969007] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 03:05:02,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 03:05:02,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-18 03:05:02,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679355085] [2023-02-18 03:05:02,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 03:05:02,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 03:05:02,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:05:02,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 03:05:02,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-02-18 03:05:02,557 INFO L87 Difference]: Start difference. First operand 101 states and 125 transitions. Second operand has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2023-02-18 03:05:02,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:05:02,824 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2023-02-18 03:05:02,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 03:05:02,825 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) Word has length 72 [2023-02-18 03:05:02,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:05:02,826 INFO L225 Difference]: With dead ends: 117 [2023-02-18 03:05:02,826 INFO L226 Difference]: Without dead ends: 86 [2023-02-18 03:05:02,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2023-02-18 03:05:02,827 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 03:05:02,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 92 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 03:05:02,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-18 03:05:02,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-02-18 03:05:02,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 21 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 03:05:02,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2023-02-18 03:05:02,839 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 72 [2023-02-18 03:05:02,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:05:02,840 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2023-02-18 03:05:02,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2023-02-18 03:05:02,840 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2023-02-18 03:05:02,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-18 03:05:02,841 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:05:02,841 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:05:02,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-18 03:05:03,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:05:03,046 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:05:03,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:05:03,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1412721000, now seen corresponding path program 1 times [2023-02-18 03:05:03,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:05:03,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599130784] [2023-02-18 03:05:03,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:05:03,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:05:03,053 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:05:03,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2021279970] [2023-02-18 03:05:03,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:05:03,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:05:03,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:05:03,055 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:05:03,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 03:05:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:05:03,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 03:05:03,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:05:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2023-02-18 03:05:03,151 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 03:05:03,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:05:03,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599130784] [2023-02-18 03:05:03,151 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:05:03,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021279970] [2023-02-18 03:05:03,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021279970] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 03:05:03,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 03:05:03,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 03:05:03,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001430638] [2023-02-18 03:05:03,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 03:05:03,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 03:05:03,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:05:03,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 03:05:03,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-18 03:05:03,153 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-02-18 03:05:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:05:03,254 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2023-02-18 03:05:03,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 03:05:03,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 86 [2023-02-18 03:05:03,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:05:03,255 INFO L225 Difference]: With dead ends: 116 [2023-02-18 03:05:03,255 INFO L226 Difference]: Without dead ends: 86 [2023-02-18 03:05:03,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 03:05:03,256 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:05:03,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 95 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 03:05:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-18 03:05:03,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2023-02-18 03:05:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-18 03:05:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2023-02-18 03:05:03,274 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 86 [2023-02-18 03:05:03,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:05:03,275 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2023-02-18 03:05:03,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-02-18 03:05:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2023-02-18 03:05:03,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-18 03:05:03,281 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:05:03,281 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:05:03,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 03:05:03,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:05:03,487 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:05:03,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:05:03,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1193302554, now seen corresponding path program 2 times [2023-02-18 03:05:03,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:05:03,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912865342] [2023-02-18 03:05:03,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:05:03,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:05:03,493 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:05:03,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [242151875] [2023-02-18 03:05:03,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 03:05:03,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:05:03,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:05:03,494 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:05:03,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 03:05:03,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 03:05:03,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 03:05:03,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-18 03:05:03,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:05:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 28 proven. 58 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-18 03:05:03,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:05:05,817 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 28 proven. 58 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-18 03:05:05,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:05:05,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912865342] [2023-02-18 03:05:05,817 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:05:05,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242151875] [2023-02-18 03:05:05,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242151875] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 03:05:05,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 03:05:05,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2023-02-18 03:05:05,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428968918] [2023-02-18 03:05:05,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 03:05:05,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-18 03:05:05,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:05:05,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-18 03:05:05,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2023-02-18 03:05:05,822 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 11 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2023-02-18 03:05:09,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:05:13,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:05:13,750 INFO L93 Difference]: Finished difference Result 154 states and 193 transitions. [2023-02-18 03:05:13,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 03:05:13,750 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 11 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) Word has length 86 [2023-02-18 03:05:13,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:05:13,752 INFO L225 Difference]: With dead ends: 154 [2023-02-18 03:05:13,752 INFO L226 Difference]: Without dead ends: 131 [2023-02-18 03:05:13,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2023-02-18 03:05:13,753 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 82 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-02-18 03:05:13,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 168 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-02-18 03:05:13,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-18 03:05:13,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2023-02-18 03:05:13,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 80 states have (on average 1.1375) internal successors, (91), 86 states have internal predecessors, (91), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (34), 29 states have call predecessors, (34), 34 states have call successors, (34) [2023-02-18 03:05:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 160 transitions. [2023-02-18 03:05:13,804 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 160 transitions. Word has length 86 [2023-02-18 03:05:13,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:05:13,805 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 160 transitions. [2023-02-18 03:05:13,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 11 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2023-02-18 03:05:13,805 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 160 transitions. [2023-02-18 03:05:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-02-18 03:05:13,805 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:05:13,806 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:05:13,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 03:05:14,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:05:14,012 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:05:14,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:05:14,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1474759586, now seen corresponding path program 2 times [2023-02-18 03:05:14,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:05:14,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151883170] [2023-02-18 03:05:14,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:05:14,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:05:14,026 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:05:14,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [577440940] [2023-02-18 03:05:14,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 03:05:14,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:05:14,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:05:14,032 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:05:14,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 03:05:14,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 03:05:14,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 03:05:14,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-18 03:05:14,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:05:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 32 proven. 68 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-02-18 03:05:14,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:05:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 32 proven. 68 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-02-18 03:05:15,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:05:15,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151883170] [2023-02-18 03:05:15,327 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:05:15,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577440940] [2023-02-18 03:05:15,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577440940] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 03:05:15,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 03:05:15,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2023-02-18 03:05:15,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753294632] [2023-02-18 03:05:15,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 03:05:15,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-18 03:05:15,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:05:15,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-18 03:05:15,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2023-02-18 03:05:15,329 INFO L87 Difference]: Start difference. First operand 129 states and 160 transitions. Second operand has 27 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 15 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 13 states have call predecessors, (30), 13 states have call successors, (30) [2023-02-18 03:05:20,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:05:23,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:05:24,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:05:24,093 INFO L93 Difference]: Finished difference Result 188 states and 240 transitions. [2023-02-18 03:05:24,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-18 03:05:24,093 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 15 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 13 states have call predecessors, (30), 13 states have call successors, (30) Word has length 97 [2023-02-18 03:05:24,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:05:24,094 INFO L225 Difference]: With dead ends: 188 [2023-02-18 03:05:24,094 INFO L226 Difference]: Without dead ends: 120 [2023-02-18 03:05:24,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2023-02-18 03:05:24,095 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 61 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 126 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2023-02-18 03:05:24,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 164 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 830 Invalid, 2 Unknown, 0 Unchecked, 7.6s Time] [2023-02-18 03:05:24,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-18 03:05:24,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2023-02-18 03:05:24,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 68 states have internal predecessors, (70), 24 states have call successors, (24), 13 states have call predecessors, (24), 13 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-18 03:05:24,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2023-02-18 03:05:24,132 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 97 [2023-02-18 03:05:24,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:05:24,133 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2023-02-18 03:05:24,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 15 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 13 states have call predecessors, (30), 13 states have call successors, (30) [2023-02-18 03:05:24,133 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2023-02-18 03:05:24,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-02-18 03:05:24,134 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:05:24,134 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:05:24,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 03:05:24,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-18 03:05:24,339 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:05:24,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:05:24,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1779279917, now seen corresponding path program 1 times [2023-02-18 03:05:24,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:05:24,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166182829] [2023-02-18 03:05:24,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:05:24,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:05:24,353 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:05:24,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1522681979] [2023-02-18 03:05:24,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:05:24,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:05:24,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:05:24,355 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:05:24,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 03:05:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:05:24,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 03:05:24,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:05:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 66 proven. 13 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-02-18 03:05:24,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:05:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 66 proven. 13 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-02-18 03:05:24,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:05:24,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166182829] [2023-02-18 03:05:24,472 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:05:24,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522681979] [2023-02-18 03:05:24,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522681979] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 03:05:24,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 03:05:24,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-02-18 03:05:24,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353467834] [2023-02-18 03:05:24,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 03:05:24,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 03:05:24,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:05:24,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 03:05:24,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-18 03:05:24,474 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2023-02-18 03:05:24,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:05:24,547 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2023-02-18 03:05:24,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 03:05:24,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 114 [2023-02-18 03:05:24,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:05:24,549 INFO L225 Difference]: With dead ends: 111 [2023-02-18 03:05:24,549 INFO L226 Difference]: Without dead ends: 104 [2023-02-18 03:05:24,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 214 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-18 03:05:24,550 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 03:05:24,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 03:05:24,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-18 03:05:24,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2023-02-18 03:05:24,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 68 states have internal predecessors, (70), 23 states have call successors, (23), 13 states have call predecessors, (23), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 03:05:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2023-02-18 03:05:24,603 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 114 [2023-02-18 03:05:24,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:05:24,603 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2023-02-18 03:05:24,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2023-02-18 03:05:24,604 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2023-02-18 03:05:24,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-02-18 03:05:24,604 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:05:24,604 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:05:24,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-18 03:05:24,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:05:24,810 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:05:24,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:05:24,810 INFO L85 PathProgramCache]: Analyzing trace with hash 289773103, now seen corresponding path program 2 times [2023-02-18 03:05:24,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:05:24,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338419151] [2023-02-18 03:05:24,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:05:24,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:05:24,817 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:05:24,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1156959380] [2023-02-18 03:05:24,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 03:05:24,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:05:24,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:05:24,822 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:05:24,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-18 03:05:24,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 03:05:24,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 03:05:24,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 55 conjunts are in the unsatisfiable core [2023-02-18 03:05:24,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:05:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 38 proven. 100 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-02-18 03:05:25,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:05:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 38 proven. 100 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-02-18 03:05:35,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:05:35,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338419151] [2023-02-18 03:05:35,134 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:05:35,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156959380] [2023-02-18 03:05:35,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156959380] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 03:05:35,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 03:05:35,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2023-02-18 03:05:35,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442655022] [2023-02-18 03:05:35,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 03:05:35,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-18 03:05:35,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:05:35,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-18 03:05:35,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=642, Unknown=1, NotChecked=0, Total=812 [2023-02-18 03:05:35,136 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 27 states have internal predecessors, (54), 15 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 13 states have call predecessors, (36), 13 states have call successors, (36) [2023-02-18 03:05:40,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:05:43,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:05:44,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:05:46,695 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (div |c_ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse44 (- |c_ULTIMATE.start_main_~d~0#1|)) (.cse61 (+ .cse13 1))) (let ((.cse7 (= (mod |c_ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse56 (< |c_ULTIMATE.start_main_~p~0#1| 0)) (.cse55 (< |c_ULTIMATE.start_main_~d~0#1| 0)) (.cse10 (= (mod |c_ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse14 (div |c_ULTIMATE.start_main_~p~0#1| 2)) (.cse24 (= (mod .cse13 2) 0)) (.cse58 (- (div |c_ULTIMATE.start_main_~d~0#1| 4))) (.cse57 (< .cse13 0)) (.cse30 (= (mod .cse61 2) 0)) (.cse60 (< .cse61 0)) (.cse59 (- (div .cse61 2))) (.cse0 (+ |c_ULTIMATE.start_main_~r~0#1| .cse44))) (let ((.cse27 (>= .cse0 .cse61)) (.cse32 (+ .cse0 (+ (- 1) .cse59))) (.cse31 (not .cse60)) (.cse28 (and (not .cse30) .cse60)) (.cse29 (+ .cse0 .cse59)) (.cse16 (>= .cse0 .cse13)) (.cse17 (not .cse57)) (.cse18 (+ .cse0 (+ (- 1) .cse58))) (.cse26 (+ .cse58 .cse0)) (.cse25 (and (not .cse24) .cse57)) (.cse1 (+ |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~q~0#1|)) (.cse15 (+ .cse14 1)) (.cse9 (and .cse55 (not .cse10))) (.cse2 (and (not .cse7) .cse56)) (.cse5 (not .cse56)) (.cse11 (not .cse55)) (.cse45 (* |c_ULTIMATE.start_main_~p~0#1| 2)) (.cse43 (* 2 |c_ULTIMATE.start_main_~d~0#1|))) (and (= (+ .cse0 (* |c_ULTIMATE.start_main_~B~0#1| .cse1)) |c_ULTIMATE.start_main_~A~0#1|) (or (>= |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~d~0#1|) (let ((.cse6 (* (+ .cse15 |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~B~0#1|)) (.cse4 (* (+ .cse14 |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~B~0#1|)) (.cse8 (- .cse13))) (and (or (let ((.cse3 (+ |c_ULTIMATE.start_main_~r~0#1| .cse8))) (and (or .cse2 (= (+ .cse3 .cse4) |c_ULTIMATE.start_main_~A~0#1|)) (or .cse5 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse3 .cse6)) .cse7))) .cse9) (or .cse10 .cse11 (let ((.cse12 (+ |c_ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse8)))) (and (or .cse5 (= (+ .cse12 .cse6) |c_ULTIMATE.start_main_~A~0#1|) .cse7) (or .cse2 (= (+ .cse12 .cse4) |c_ULTIMATE.start_main_~A~0#1|)))))))) (or (let ((.cse34 (< .cse14 0)) (.cse22 (= (mod .cse14 2) 0)) (.cse33 (div |c_ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse19 (* (+ .cse33 .cse1) |c_ULTIMATE.start_main_~B~0#1|)) (.cse20 (and .cse34 (not .cse22))) (.cse23 (not .cse34)) (.cse21 (* (+ (+ .cse33 1) .cse1) |c_ULTIMATE.start_main_~B~0#1|))) (and (or .cse16 (and (or .cse17 (and (or (= (+ .cse18 .cse19) |c_ULTIMATE.start_main_~A~0#1|) .cse20) (or (= (+ .cse21 .cse18) |c_ULTIMATE.start_main_~A~0#1|) .cse22 .cse23)) .cse24) (or .cse25 (and (or .cse22 .cse23 (= (+ .cse21 .cse26) |c_ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse19 .cse26) |c_ULTIMATE.start_main_~A~0#1|) .cse20)))) .cse9) (or .cse27 .cse10 .cse11 (and (or .cse28 (and (or (= (+ .cse29 .cse19) |c_ULTIMATE.start_main_~A~0#1|) .cse20) (or .cse22 (= (+ .cse29 .cse21) |c_ULTIMATE.start_main_~A~0#1|) .cse23))) (or .cse30 .cse31 (and (or (= (+ .cse32 .cse19) |c_ULTIMATE.start_main_~A~0#1|) .cse20) (or .cse22 .cse23 (= (+ .cse21 .cse32) |c_ULTIMATE.start_main_~A~0#1|))))))))) .cse2) (or .cse5 (let ((.cse37 (= (mod .cse15 2) 0)) (.cse40 (< .cse15 0)) (.cse41 (div .cse15 2))) (let ((.cse36 (* (+ (+ .cse41 1) .cse1) |c_ULTIMATE.start_main_~B~0#1|)) (.cse35 (not .cse40)) (.cse38 (* (+ .cse41 .cse1) |c_ULTIMATE.start_main_~B~0#1|)) (.cse39 (and (not .cse37) .cse40))) (and (or .cse27 (and (or .cse30 (and (or .cse35 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse32 .cse36)) .cse37) (or (= (+ .cse32 .cse38) |c_ULTIMATE.start_main_~A~0#1|) .cse39)) .cse31) (or .cse28 (and (or (= (+ .cse29 .cse38) |c_ULTIMATE.start_main_~A~0#1|) .cse39) (or (= (+ .cse29 .cse36) |c_ULTIMATE.start_main_~A~0#1|) .cse35 .cse37)))) .cse10 .cse11) (or .cse16 .cse9 (and (or .cse17 (and (or (= (+ .cse18 .cse38) |c_ULTIMATE.start_main_~A~0#1|) .cse39) (or (= (+ .cse18 .cse36) |c_ULTIMATE.start_main_~A~0#1|) .cse35 .cse37)) .cse24) (or (and (or (= (+ .cse36 .cse26) |c_ULTIMATE.start_main_~A~0#1|) .cse35 .cse37) (or (= (+ .cse38 .cse26) |c_ULTIMATE.start_main_~A~0#1|) .cse39)) .cse25)))))) .cse7) (let ((.cse46 (* 2 .cse43))) (let ((.cse42 (+ |c_ULTIMATE.start_main_~r~0#1| (- .cse46)))) (or (>= .cse42 .cse43) (= |c_ULTIMATE.start_main_~A~0#1| (+ (+ .cse42 .cse44) (* |c_ULTIMATE.start_main_~B~0#1| (+ (+ (* 2 .cse45) |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~p~0#1|)))) (not (>= |c_ULTIMATE.start_main_~r~0#1| .cse46))))) (let ((.cse47 (+ (- .cse43) |c_ULTIMATE.start_main_~r~0#1|))) (or (not (>= |c_ULTIMATE.start_main_~r~0#1| .cse43)) (>= .cse47 |c_ULTIMATE.start_main_~d~0#1|) (let ((.cse54 (+ .cse45 |c_ULTIMATE.start_main_~q~0#1|)) (.cse53 (div (* |c_ULTIMATE.start_main_~p~0#1| 4) 8))) (let ((.cse50 (* (+ .cse54 .cse53) |c_ULTIMATE.start_main_~B~0#1|)) (.cse49 (* (+ (+ .cse53 1) .cse54) |c_ULTIMATE.start_main_~B~0#1|)) (.cse51 (- (div (* |c_ULTIMATE.start_main_~d~0#1| 4) 8)))) (and (or .cse9 (let ((.cse48 (+ .cse51 .cse47))) (and (or .cse5 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse49)) .cse7) (or .cse2 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse50)))))) (or .cse10 (let ((.cse52 (+ (+ (- 1) .cse51) .cse47))) (and (or .cse2 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse50 .cse52))) (or (= (+ .cse49 .cse52) |c_ULTIMATE.start_main_~A~0#1|) .cse5 .cse7))) .cse11)))))) (= |c_ULTIMATE.start_main_~A~0#1| (+ (* |c_ULTIMATE.start_main_~B~0#1| |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~r~0#1|))))))) is different from false [2023-02-18 03:05:52,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:05:59,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:06:03,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:06:08,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:06:23,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:06:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:06:25,659 INFO L93 Difference]: Finished difference Result 214 states and 270 transitions. [2023-02-18 03:06:25,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-18 03:06:25,660 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 27 states have internal predecessors, (54), 15 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 13 states have call predecessors, (36), 13 states have call successors, (36) Word has length 116 [2023-02-18 03:06:25,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:06:25,661 INFO L225 Difference]: With dead ends: 214 [2023-02-18 03:06:25,661 INFO L226 Difference]: Without dead ends: 191 [2023-02-18 03:06:25,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 29.1s TimeCoverageRelationStatistics Valid=443, Invalid=1448, Unknown=5, NotChecked=84, Total=1980 [2023-02-18 03:06:25,662 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 96 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 230 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 27.4s IncrementalHoareTripleChecker+Time [2023-02-18 03:06:25,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 195 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1026 Invalid, 1 Unknown, 2 Unchecked, 27.4s Time] [2023-02-18 03:06:25,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-18 03:06:25,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 181. [2023-02-18 03:06:25,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 113 states have (on average 1.1327433628318584) internal successors, (128), 119 states have internal predecessors, (128), 48 states have call successors, (48), 19 states have call predecessors, (48), 19 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2023-02-18 03:06:25,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 223 transitions. [2023-02-18 03:06:25,907 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 223 transitions. Word has length 116 [2023-02-18 03:06:25,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:06:25,907 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 223 transitions. [2023-02-18 03:06:25,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 27 states have internal predecessors, (54), 15 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 13 states have call predecessors, (36), 13 states have call successors, (36) [2023-02-18 03:06:25,907 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 223 transitions. [2023-02-18 03:06:25,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-18 03:06:25,908 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:06:25,908 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:06:25,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-18 03:06:26,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-18 03:06:26,113 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:06:26,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:06:26,114 INFO L85 PathProgramCache]: Analyzing trace with hash -2143709678, now seen corresponding path program 3 times [2023-02-18 03:06:26,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:06:26,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771805663] [2023-02-18 03:06:26,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:06:26,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:06:26,120 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:06:26,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1649554449] [2023-02-18 03:06:26,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 03:06:26,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:06:26,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:06:26,123 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:06:26,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-18 03:06:26,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-18 03:06:26,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 03:06:26,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-18 03:06:26,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:06:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 118 proven. 52 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2023-02-18 03:06:26,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:06:26,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:06:26,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771805663] [2023-02-18 03:06:26,560 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:06:26,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649554449] [2023-02-18 03:06:26,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649554449] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 03:06:26,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 03:06:26,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-02-18 03:06:26,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625346372] [2023-02-18 03:06:26,560 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 03:06:26,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 03:06:26,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:06:26,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 03:06:26,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-02-18 03:06:26,561 INFO L87 Difference]: Start difference. First operand 181 states and 223 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-18 03:06:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:06:26,883 INFO L93 Difference]: Finished difference Result 203 states and 240 transitions. [2023-02-18 03:06:26,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 03:06:26,883 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 121 [2023-02-18 03:06:26,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:06:26,885 INFO L225 Difference]: With dead ends: 203 [2023-02-18 03:06:26,885 INFO L226 Difference]: Without dead ends: 201 [2023-02-18 03:06:26,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-02-18 03:06:26,886 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:06:26,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 61 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 03:06:26,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-02-18 03:06:27,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2023-02-18 03:06:27,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 128 states have (on average 1.1171875) internal successors, (143), 134 states have internal predecessors, (143), 48 states have call successors, (48), 24 states have call predecessors, (48), 24 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2023-02-18 03:06:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 238 transitions. [2023-02-18 03:06:27,136 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 238 transitions. Word has length 121 [2023-02-18 03:06:27,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:06:27,136 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 238 transitions. [2023-02-18 03:06:27,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-18 03:06:27,136 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 238 transitions. [2023-02-18 03:06:27,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-02-18 03:06:27,137 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:06:27,137 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:06:27,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-18 03:06:27,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-18 03:06:27,342 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:06:27,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:06:27,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1262824565, now seen corresponding path program 2 times [2023-02-18 03:06:27,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:06:27,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899435574] [2023-02-18 03:06:27,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:06:27,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:06:27,349 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:06:27,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1556306423] [2023-02-18 03:06:27,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 03:06:27,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:06:27,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:06:27,351 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:06:27,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-18 03:06:27,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 03:06:27,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 03:06:27,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 63 conjunts are in the unsatisfiable core [2023-02-18 03:06:27,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:06:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 95 proven. 110 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2023-02-18 03:06:27,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:06:29,185 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 95 proven. 110 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2023-02-18 03:06:29,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:06:29,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899435574] [2023-02-18 03:06:29,185 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:06:29,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556306423] [2023-02-18 03:06:29,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556306423] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 03:06:29,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 03:06:29,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2023-02-18 03:06:29,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417873206] [2023-02-18 03:06:29,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 03:06:29,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-18 03:06:29,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:06:29,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-18 03:06:29,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=773, Unknown=0, NotChecked=0, Total=992 [2023-02-18 03:06:29,187 INFO L87 Difference]: Start difference. First operand 201 states and 238 transitions. Second operand has 32 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 28 states have internal predecessors, (56), 17 states have call successors, (42), 3 states have call predecessors, (42), 2 states have return successors, (40), 17 states have call predecessors, (40), 15 states have call successors, (40) [2023-02-18 03:06:32,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:06:38,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:06:38,048 INFO L93 Difference]: Finished difference Result 298 states and 354 transitions. [2023-02-18 03:06:38,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-18 03:06:38,049 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 28 states have internal predecessors, (56), 17 states have call successors, (42), 3 states have call predecessors, (42), 2 states have return successors, (40), 17 states have call predecessors, (40), 15 states have call successors, (40) Word has length 127 [2023-02-18 03:06:38,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:06:38,050 INFO L225 Difference]: With dead ends: 298 [2023-02-18 03:06:38,050 INFO L226 Difference]: Without dead ends: 210 [2023-02-18 03:06:38,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=594, Invalid=1662, Unknown=0, NotChecked=0, Total=2256 [2023-02-18 03:06:38,051 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 63 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-02-18 03:06:38,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 214 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2023-02-18 03:06:38,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-02-18 03:06:38,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 194. [2023-02-18 03:06:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 126 states have (on average 1.0634920634920635) internal successors, (134), 132 states have internal predecessors, (134), 40 states have call successors, (40), 27 states have call predecessors, (40), 27 states have return successors, (40), 34 states have call predecessors, (40), 40 states have call successors, (40) [2023-02-18 03:06:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 214 transitions. [2023-02-18 03:06:38,254 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 214 transitions. Word has length 127 [2023-02-18 03:06:38,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:06:38,255 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 214 transitions. [2023-02-18 03:06:38,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 28 states have internal predecessors, (56), 17 states have call successors, (42), 3 states have call predecessors, (42), 2 states have return successors, (40), 17 states have call predecessors, (40), 15 states have call successors, (40) [2023-02-18 03:06:38,255 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 214 transitions. [2023-02-18 03:06:38,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-02-18 03:06:38,256 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:06:38,256 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:06:38,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-02-18 03:06:38,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-18 03:06:38,461 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:06:38,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:06:38,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1395307885, now seen corresponding path program 3 times [2023-02-18 03:06:38,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:06:38,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254473145] [2023-02-18 03:06:38,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:06:38,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:06:38,467 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:06:38,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [619949572] [2023-02-18 03:06:38,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 03:06:38,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:06:38,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:06:38,468 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:06:38,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-18 03:06:38,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-18 03:06:38,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 03:06:38,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-18 03:06:38,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:06:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 177 proven. 50 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2023-02-18 03:06:38,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:06:38,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:06:38,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254473145] [2023-02-18 03:06:38,854 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:06:38,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619949572] [2023-02-18 03:06:38,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619949572] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 03:06:38,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 03:06:38,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-18 03:06:38,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065890797] [2023-02-18 03:06:38,854 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 03:06:38,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 03:06:38,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:06:38,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 03:06:38,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-02-18 03:06:38,855 INFO L87 Difference]: Start difference. First operand 194 states and 214 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-18 03:06:39,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:06:39,114 INFO L93 Difference]: Finished difference Result 194 states and 214 transitions. [2023-02-18 03:06:39,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 03:06:39,114 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 129 [2023-02-18 03:06:39,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:06:39,115 INFO L225 Difference]: With dead ends: 194 [2023-02-18 03:06:39,115 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 03:06:39,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2023-02-18 03:06:39,116 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:06:39,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 37 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 03:06:39,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 03:06:39,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 03:06:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 03:06:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 03:06:39,117 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 129 [2023-02-18 03:06:39,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:06:39,117 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 03:06:39,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-18 03:06:39,117 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 03:06:39,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 03:06:39,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 03:06:39,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-18 03:06:39,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-18 03:06:39,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 03:06:39,442 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2023-02-18 03:06:39,446 INFO L895 garLoopResultBuilder]: At program point L52-2(lines 44 56) the Hoare annotation is: (let ((.cse179 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse312 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse313 (+ .cse312 1)) (.cse181 (+ .cse179 1))) (let ((.cse169 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse172 (div .cse181 2)) (.cse322 (- .cse179)) (.cse113 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse127 (div .cse313 2)) (.cse240 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse239 (* 2 |ULTIMATE.start_main_~d~0#1|))) (let ((.cse271 (div .cse239 4)) (.cse289 (div .cse240 4)) (.cse21 (- |ULTIMATE.start_main_~r~0#1|)) (.cse26 (* (- 1) |ULTIMATE.start_main_~r~0#1|)) (.cse124 (= (mod .cse313 2) 0)) (.cse329 (< .cse313 0)) (.cse128 (+ .cse127 1)) (.cse114 (+ .cse113 1)) (.cse330 (< .cse312 0)) (.cse102 (= (mod .cse312 2) 0)) (.cse321 (+ (- 1) .cse322)) (.cse173 (+ .cse172 1)) (.cse165 (+ .cse169 1)) (.cse315 (- .cse172)) (.cse317 (- .cse169)) (.cse22 (- |ULTIMATE.start_main_~d~0#1|)) (.cse25 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse59 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse155 (+ |ULTIMATE.start_main_~q~0#1| .cse313)) (.cse332 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse120 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse176 (+ |ULTIMATE.start_main_~q~0#1| .cse312)) (.cse331 (< |ULTIMATE.start_main_~d~0#1| 0))) (let ((.cse292 (= .cse312 1)) (.cse291 (= .cse313 1)) (.cse137 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse95 (not .cse331)) (.cse319 (* |ULTIMATE.start_main_~B~0#1| .cse176)) (.cse94 (and .cse332 (not .cse120))) (.cse320 (* .cse155 |ULTIMATE.start_main_~B~0#1|)) (.cse121 (not .cse332)) (.cse112 (and (not .cse59) .cse331)) (.cse115 (not .cse25)) (.cse93 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse269 (+ |ULTIMATE.start_main_~r~0#1| .cse22)) (.cse318 (+ (- 1) .cse317)) (.cse107 (= (mod .cse179 2) 0)) (.cse323 (< .cse179 0)) (.cse316 (+ (- 1) .cse315)) (.cse324 (< .cse181 0)) (.cse104 (= (mod .cse181 2) 0)) (.cse325 (< .cse165 0)) (.cse197 (= (mod .cse165 2) 0)) (.cse153 (+ |ULTIMATE.start_main_~r~0#1| .cse322)) (.cse199 (= (mod .cse169 2) 0)) (.cse326 (< .cse169 0)) (.cse213 (= (mod .cse173 2) 0)) (.cse327 (< .cse173 0)) (.cse151 (+ |ULTIMATE.start_main_~r~0#1| .cse321)) (.cse216 (= (mod .cse172 2) 0)) (.cse328 (< .cse172 0)) (.cse302 (div .cse165 2)) (.cse301 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse299 (div .cse181 4)) (.cse300 (div .cse173 2)) (.cse224 (= .cse113 1)) (.cse99 (and .cse330 (not .cse102))) (.cse223 (= .cse114 1)) (.cse101 (not .cse330)) (.cse138 (= .cse128 1)) (.cse126 (not .cse329)) (.cse122 (and .cse329 (not .cse124))) (.cse144 (= .cse127 1)) (.cse87 (+ .cse26 |ULTIMATE.start_main_~A~0#1|)) (.cse79 (+ |ULTIMATE.start_main_~A~0#1| .cse21)) (.cse290 (+ .cse289 1)) (.cse272 (+ .cse271 1))) (let ((.cse255 (div .cse240 8)) (.cse252 (= (mod .cse289 2) 0)) (.cse284 (< .cse289 0)) (.cse247 (= (mod .cse271 2) 0)) (.cse285 (< .cse271 0)) (.cse243 (= (mod .cse272 2) 0)) (.cse286 (< .cse272 0)) (.cse259 (div .cse290 2)) (.cse260 (= (mod .cse290 2) 0)) (.cse287 (< .cse290 0)) (.cse74 (div .cse79 2)) (.cse85 (< .cse87 0)) (.cse288 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse66 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse183 (and (or (not .cse138) .cse124 .cse126) (or .cse122 (not .cse144)))) (.cse162 (and (or (not .cse224) .cse99) (or (not .cse223) .cse101 .cse102))) (.cse146 (div .cse313 4)) (.cse140 (div .cse128 2)) (.cse142 (= (mod .cse128 2) 0)) (.cse294 (< .cse128 0)) (.cse293 (- .cse300)) (.cse295 (- .cse299)) (.cse147 (= (mod .cse127 2) 0)) (.cse296 (< .cse127 0)) (.cse297 (- .cse301)) (.cse298 (- .cse302)) (.cse235 (div (* |ULTIMATE.start_main_~p~0#1| 4) 8)) (.cse273 (>= |ULTIMATE.start_main_~r~0#1| .cse239)) (.cse218 (and (not .cse216) .cse328)) (.cse214 (not .cse328)) (.cse186 (>= .cse151 .cse172)) (.cse211 (not .cse327)) (.cse209 (and (not .cse213) .cse327)) (.cse185 (>= .cse151 .cse173)) (.cse203 (and (not .cse199) .cse326)) (.cse201 (not .cse326)) (.cse187 (>= .cse153 .cse169)) (.cse189 (and .cse325 (not .cse197))) (.cse196 (not .cse325)) (.cse156 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse188 (>= .cse153 .cse165)) (.cse207 (= (mod .cse113 2) 0)) (.cse303 (< .cse113 0)) (.cse222 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse193 (= (mod .cse114 2) 0)) (.cse219 (div .cse114 2)) (.cse304 (< .cse114 0)) (.cse171 (+ .cse151 .cse315)) (.cse96 (and .cse324 (not .cse104))) (.cse105 (not .cse324)) (.cse174 (+ .cse151 .cse316)) (.cse51 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse231 (+ (- .cse239) |ULTIMATE.start_main_~r~0#1|)) (.cse234 (+ |ULTIMATE.start_main_~q~0#1| .cse240)) (.cse106 (>= |ULTIMATE.start_main_~r~0#1| .cse181)) (.cse55 (>= |ULTIMATE.start_main_~r~0#1| .cse179)) (.cse306 (* (+ .cse155 .cse127) |ULTIMATE.start_main_~B~0#1|)) (.cse305 (* (+ .cse128 .cse155) |ULTIMATE.start_main_~B~0#1|)) (.cse110 (and (not .cse107) .cse323)) (.cse168 (+ .cse317 .cse153)) (.cse308 (* (+ .cse113 .cse176) |ULTIMATE.start_main_~B~0#1|)) (.cse163 (+ .cse318 .cse153)) (.cse307 (* (+ .cse114 .cse176) |ULTIMATE.start_main_~B~0#1|)) (.cse108 (not .cse323)) (.cse178 (+ .cse269 .cse322)) (.cse182 (+ .cse269 .cse321)) (.cse36 (or .cse115 .cse93)) (.cse0 (or (and (or (= (+ .cse319 .cse153) |ULTIMATE.start_main_~A~0#1|) .cse94) (or (= (+ .cse320 .cse153) |ULTIMATE.start_main_~A~0#1|) .cse120 .cse121)) .cse112)) (.cse1 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse2 (or .cse95 (and (or .cse94 (= (+ .cse151 .cse319) |ULTIMATE.start_main_~A~0#1|)) (or .cse120 .cse121 (= |ULTIMATE.start_main_~A~0#1| (+ .cse320 .cse151)))) .cse59)) (.cse46 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse9 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse48 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse10 (= |ULTIMATE.start_main_~A~0#1| (+ .cse269 (* |ULTIMATE.start_main_~B~0#1| .cse137)))) (.cse15 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse177 (and (or (not .cse292) .cse94) (or .cse120 .cse121 (not .cse291))))) (let ((.cse103 (+ .cse316 |ULTIMATE.start_main_~r~0#1|)) (.cse98 (+ |ULTIMATE.start_main_~r~0#1| .cse315)) (.cse111 (+ .cse317 |ULTIMATE.start_main_~r~0#1|)) (.cse109 (+ .cse318 |ULTIMATE.start_main_~r~0#1|)) (.cse130 (+ .cse269 .cse318)) (.cse133 (+ .cse317 .cse269)) (.cse135 (+ .cse316 .cse269)) (.cse136 (+ .cse269 .cse315)) (.cse53 (or .cse177 (and (or (= .cse179 |ULTIMATE.start_main_~B~0#1|) .cse112) (or .cse95 (= |ULTIMATE.start_main_~B~0#1| .cse181) .cse59)))) (.cse54 (let ((.cse314 (or .cse177 (and (or .cse95 .cse59 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse181)) |ULTIMATE.start_main_~A~0#1|)) (or .cse112 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse179 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse0 .cse1 .cse2 .cse36 .cse314 .cse46 .cse9 .cse48 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse314 .cse46 .cse9 .cse48 .cse10 .cse93 .cse15)))) (.cse24 (or .cse25 (let ((.cse311 (* (+ .cse137 .cse313) |ULTIMATE.start_main_~B~0#1|)) (.cse310 (* (+ .cse137 .cse312) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse310 .cse178) |ULTIMATE.start_main_~A~0#1|) .cse94) (or .cse120 .cse121 (= |ULTIMATE.start_main_~A~0#1| (+ .cse178 .cse311)))) .cse112) (or .cse95 (and (or .cse120 (= |ULTIMATE.start_main_~A~0#1| (+ .cse182 .cse311)) .cse121) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse182 .cse310)) .cse94)) .cse59))))) (.cse27 (or (and (or .cse291 .cse120 .cse121 (and (or .cse107 .cse108 (and (or .cse124 (= (+ .cse163 .cse305) |ULTIMATE.start_main_~A~0#1|) .cse126) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse306 .cse163))))) (or .cse110 (and (or .cse122 (= (+ .cse306 .cse168) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse305 .cse168)) .cse124 .cse126))))) (or (and (or .cse110 (and (or (= (+ .cse308 .cse168) |ULTIMATE.start_main_~A~0#1|) .cse99) (or (= (+ .cse168 .cse307) |ULTIMATE.start_main_~A~0#1|) .cse101 .cse102))) (or (and (or .cse99 (= (+ .cse308 .cse163) |ULTIMATE.start_main_~A~0#1|)) (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse307)))) .cse107 .cse108)) .cse94 .cse292)) .cse112)) (.cse56 (<= 2 .cse179)) (.cse29 (or .cse25 (and .cse0 .cse2))) (.cse61 (or .cse177 (let ((.cse309 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse95 (not .cse106) .cse59 (= |ULTIMATE.start_main_~A~0#1| (+ .cse151 (* .cse309 .cse181)))) (or (not .cse55) .cse112 (= (+ (* .cse179 .cse309) .cse153) |ULTIMATE.start_main_~A~0#1|)))))) (.cse14 (or (= .cse240 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ .cse231 .cse22) (* |ULTIMATE.start_main_~B~0#1| (+ .cse234 |ULTIMATE.start_main_~p~0#1|)))))) (.cse58 (or .cse115 .cse51)) (.cse31 (or .cse95 .cse59 (and (or .cse291 .cse120 .cse121 (and (or (and (or (= (+ .cse305 .cse174) |ULTIMATE.start_main_~A~0#1|) .cse124 .cse126) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse306 .cse174)))) .cse104 .cse105) (or .cse96 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse305)) .cse124 .cse126) (or .cse122 (= (+ .cse171 .cse306) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse101 .cse102 (= (+ .cse171 .cse307) |ULTIMATE.start_main_~A~0#1|)) (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse308)))) .cse96) (or .cse104 .cse105 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse307)) .cse101 .cse102) (or (= (+ .cse308 .cse174) |ULTIMATE.start_main_~A~0#1|) .cse99)))) .cse94 .cse292)))) (.cse194 (not .cse304)) (.cse220 (+ 1 .cse219)) (.cse192 (and (not .cse193) .cse304)) (.cse221 (+ .cse222 1)) (.cse208 (not .cse303)) (.cse205 (and (not .cse207) .cse303)) (.cse154 (and (or .cse110 (and (or (not (= .cse156 .cse301)) .cse203) (or .cse199 .cse201 (not (= .cse156 (+ .cse301 1))))) .cse187) (or .cse107 (and (or (not (= .cse156 .cse302)) .cse189) (or .cse196 .cse197 (not (= .cse156 (+ .cse302 1))))) .cse108 .cse188))) (.cse150 (and (or (and (or (not (= .cse156 .cse299)) .cse218) (or .cse214 (not (= .cse156 (+ .cse299 1))) .cse216)) .cse96 .cse186) (or (and (or .cse211 .cse213 (not (= .cse156 (+ .cse300 1)))) (or .cse209 (not (= .cse156 .cse300)))) .cse104 .cse105 .cse185))) (.cse226 (>= .cse231 |ULTIMATE.start_main_~d~0#1|)) (.cse237 (not .cse273)) (.cse236 (+ .cse235 1)) (.cse233 (div (* |ULTIMATE.start_main_~d~0#1| 4) 8)) (.cse117 (= (+ |ULTIMATE.start_main_~r~0#1| (* .cse156 |ULTIMATE.start_main_~q~0#1|)) |ULTIMATE.start_main_~A~0#1|)) (.cse190 (+ .cse153 .cse298)) (.cse198 (+ (+ (- 1) .cse298) .cse153)) (.cse200 (+ (+ (- 1) .cse297) .cse153)) (.cse202 (+ .cse153 .cse297)) (.cse148 (not .cse296)) (.cse145 (and (not .cse147) .cse296)) (.cse215 (+ .cse151 (+ (- 1) .cse295))) (.cse217 (+ .cse295 .cse151)) (.cse212 (+ .cse151 (+ (- 1) .cse293))) (.cse143 (not .cse294)) (.cse139 (and (not .cse142) .cse294)) (.cse210 (+ .cse151 .cse293)) (.cse141 (+ .cse140 1)) (.cse149 (+ .cse146 1)) (.cse116 (and (or .cse183 .cse291 .cse120 .cse121) (or .cse162 .cse94 .cse292))) (.cse134 (>= .cse269 .cse181)) (.cse118 (and (or .cse96 (not (= .cse156 .cse172))) (or (not (= .cse156 .cse173)) .cse104 .cse105))) (.cse119 (and (or .cse107 (not (= .cse156 .cse165)) .cse108) (or .cse110 (not (= .cse156 .cse169))))) (.cse129 (>= .cse269 .cse179)) (.cse264 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse156 .cse137) .cse269))) (.cse180 (+ .cse137 1)) (.cse263 (= 1 .cse290)) (.cse257 (= .cse289 1)) (.cse47 (* 2 .cse66)) (.cse62 (* |ULTIMATE.start_main_~B~0#1| 4)) (.cse75 (or (not .cse85) .cse288)) (.cse80 (+ .cse74 1)) (.cse84 (not .cse288)) (.cse70 (* 2 1)) (.cse28 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse57 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse261 (not .cse287)) (.cse258 (and (not .cse260) .cse287)) (.cse262 (+ .cse259 1)) (.cse242 (>= .cse269 .cse272)) (.cse245 (not .cse286)) (.cse246 (and .cse286 (not .cse243))) (.cse249 (not .cse285)) (.cse250 (and (not .cse247) .cse285)) (.cse256 (and (not .cse252) .cse284)) (.cse253 (not .cse284)) (.cse251 (>= .cse269 .cse271)) (.cse254 (+ .cse255 1)) (.cse244 (div .cse272 2)) (.cse248 (div .cse239 8))) (let ((.cse13 (or .cse57 (let ((.cse282 (- .cse248)) (.cse283 (- .cse244))) (let ((.cse274 (+ .cse269 (+ (- 1) .cse283))) (.cse277 (+ .cse283 .cse269)) (.cse278 (+ (+ (- 1) .cse282) .cse269)) (.cse279 (+ .cse282 .cse269))) (and (or .cse120 .cse121 (let ((.cse275 (* |ULTIMATE.start_main_~B~0#1| (+ .cse262 .cse137))) (.cse276 (* |ULTIMATE.start_main_~B~0#1| (+ .cse137 .cse259)))) (and (or .cse95 .cse242 (and (or .cse243 .cse245 (and (or .cse260 .cse261 (= |ULTIMATE.start_main_~A~0#1| (+ .cse274 .cse275))) (or (= (+ .cse276 .cse274) |ULTIMATE.start_main_~A~0#1|) .cse258))) (or (and (or .cse260 (= |ULTIMATE.start_main_~A~0#1| (+ .cse277 .cse275)) .cse261) (or (= (+ .cse276 .cse277) |ULTIMATE.start_main_~A~0#1|) .cse258)) .cse246)) .cse59) (or (and (or .cse247 .cse249 (and (or .cse260 .cse261 (= |ULTIMATE.start_main_~A~0#1| (+ .cse278 .cse275))) (or (= (+ .cse276 .cse278) |ULTIMATE.start_main_~A~0#1|) .cse258))) (or .cse250 (and (or .cse260 (= (+ .cse279 .cse275) |ULTIMATE.start_main_~A~0#1|) .cse261) (or (= (+ .cse279 .cse276) |ULTIMATE.start_main_~A~0#1|) .cse258)))) .cse112 .cse251)))) (or (let ((.cse281 (* (+ .cse255 .cse137) |ULTIMATE.start_main_~B~0#1|)) (.cse280 (* |ULTIMATE.start_main_~B~0#1| (+ .cse254 .cse137)))) (and (or .cse95 .cse242 (and (or (and (or .cse252 .cse253 (= (+ .cse274 .cse280) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse274 .cse281) |ULTIMATE.start_main_~A~0#1|) .cse256)) .cse243 .cse245) (or .cse246 (and (or .cse252 .cse253 (= (+ .cse280 .cse277) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse277 .cse281) |ULTIMATE.start_main_~A~0#1|) .cse256)))) .cse59) (or (and (or (and (or .cse256 (= |ULTIMATE.start_main_~A~0#1| (+ .cse278 .cse281))) (or .cse252 .cse253 (= |ULTIMATE.start_main_~A~0#1| (+ .cse278 .cse280)))) .cse247 .cse249) (or .cse250 (and (or .cse256 (= (+ .cse279 .cse281) |ULTIMATE.start_main_~A~0#1|)) (or .cse252 .cse253 (= (+ .cse279 .cse280) |ULTIMATE.start_main_~A~0#1|))))) .cse112 .cse251))) .cse94)))))) (.cse52 (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|)) (.cse50 (= .cse28 |ULTIMATE.start_main_~A~0#1|)) (.cse32 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|)) (.cse30 (* 2 .cse70)) (.cse71 (= |ULTIMATE.start_main_~p~0#1| .cse70)) (.cse33 (>= |ULTIMATE.start_main_~p~0#1| 1)) (.cse72 (= (+ 4 0) |ULTIMATE.start_main_~q~0#1|)) (.cse86 (or (and (= |ULTIMATE.start_main_~d~0#1| .cse74) .cse75) (and (= |ULTIMATE.start_main_~d~0#1| .cse80) .cse84 .cse85))) (.cse73 (= .cse87 .cse62)) (.cse69 (= |ULTIMATE.start_main_~d~0#1| .cse66)) (.cse88 (= 2 |ULTIMATE.start_main_~p~0#1|)) (.cse6 (<= 2 |ULTIMATE.start_main_~p~0#1|)) (.cse12 (or .cse115 (= (+ .cse269 (* |ULTIMATE.start_main_~d~0#1| .cse137)) |ULTIMATE.start_main_~A~0#1|) .cse57)) (.cse64 (>= |ULTIMATE.start_main_~A~0#1| .cse47)) (.cse16 (or .cse1 (and .cse1 (<= 1 |ULTIMATE.start_main_~d~0#1|)))) (.cse17 (or (let ((.cse270 (- .cse271))) (and (or .cse112 (= (+ (+ .cse269 .cse270) (* .cse271 .cse180)) |ULTIMATE.start_main_~A~0#1|) (not .cse251)) (or .cse95 (not .cse242) (= (+ (+ (+ (- 1) .cse270) .cse269) (* .cse272 .cse180)) |ULTIMATE.start_main_~A~0#1|) .cse59))) (and (or (not .cse263) .cse120 .cse121) (or (not .cse257) .cse94)) .cse273)) (.cse34 (or .cse116 (and (or .cse95 .cse134 .cse118 .cse59) (or .cse119 .cse112 .cse129)) .cse264)) (.cse37 (or .cse120 .cse121 (let ((.cse266 (* (+ .cse149 .cse155) |ULTIMATE.start_main_~B~0#1|)) (.cse265 (* (+ .cse155 .cse146) |ULTIMATE.start_main_~B~0#1|)) (.cse268 (* |ULTIMATE.start_main_~B~0#1| (+ .cse141 .cse155))) (.cse267 (* |ULTIMATE.start_main_~B~0#1| (+ .cse155 .cse140)))) (and (or (and (or .cse122 (and (or .cse107 .cse108 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse190 .cse265)) .cse145) (or .cse147 .cse148 (= |ULTIMATE.start_main_~A~0#1| (+ .cse190 .cse266)))) .cse189) (or (and (or .cse147 (= (+ .cse198 .cse266) |ULTIMATE.start_main_~A~0#1|) .cse148) (or .cse145 (= (+ .cse265 .cse198) |ULTIMATE.start_main_~A~0#1|))) .cse196 .cse197)) .cse188) (or .cse110 (and (or .cse199 .cse201 (and (or .cse145 (= (+ .cse265 .cse200) |ULTIMATE.start_main_~A~0#1|)) (or .cse147 .cse148 (= (+ .cse266 .cse200) |ULTIMATE.start_main_~A~0#1|)))) (or .cse203 (and (or .cse147 .cse148 (= (+ .cse202 .cse266) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse202 .cse265) |ULTIMATE.start_main_~A~0#1|) .cse145)))) .cse187))) (or (and (or .cse107 (and (or .cse189 (and (or .cse139 (= |ULTIMATE.start_main_~A~0#1| (+ .cse190 .cse267))) (or .cse142 (= (+ .cse268 .cse190) |ULTIMATE.start_main_~A~0#1|) .cse143))) (or .cse196 .cse197 (and (or (= (+ .cse198 .cse267) |ULTIMATE.start_main_~A~0#1|) .cse139) (or .cse142 (= |ULTIMATE.start_main_~A~0#1| (+ .cse268 .cse198)) .cse143)))) .cse108 .cse188) (or .cse110 .cse187 (and (or .cse199 (and (or .cse142 .cse143 (= |ULTIMATE.start_main_~A~0#1| (+ .cse268 .cse200))) (or .cse139 (= (+ .cse267 .cse200) |ULTIMATE.start_main_~A~0#1|))) .cse201) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse202 .cse267)) .cse139) (or .cse142 .cse143 (= (+ .cse202 .cse268) |ULTIMATE.start_main_~A~0#1|))) .cse203)))) .cse124 .cse126)) .cse112) (or .cse95 (and (or (and (or (and (or (and (or .cse147 (= (+ .cse212 .cse266) |ULTIMATE.start_main_~A~0#1|) .cse148) (or .cse145 (= |ULTIMATE.start_main_~A~0#1| (+ .cse212 .cse265)))) .cse211 .cse213) (or .cse209 (and (or .cse147 (= |ULTIMATE.start_main_~A~0#1| (+ .cse210 .cse266)) .cse148) (or .cse145 (= (+ .cse210 .cse265) |ULTIMATE.start_main_~A~0#1|))))) .cse104 .cse105 .cse185) (or .cse96 .cse186 (and (or .cse214 (and (or (= (+ .cse215 .cse266) |ULTIMATE.start_main_~A~0#1|) .cse147 .cse148) (or .cse145 (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse265)))) .cse216) (or (and (or .cse147 (= (+ .cse266 .cse217) |ULTIMATE.start_main_~A~0#1|) .cse148) (or .cse145 (= |ULTIMATE.start_main_~A~0#1| (+ .cse265 .cse217)))) .cse218)))) .cse122) (or .cse124 .cse126 (and (or (and (or .cse214 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse268 .cse215)) .cse142 .cse143) (or .cse139 (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse267)))) .cse216) (or (and (or (= (+ .cse268 .cse217) |ULTIMATE.start_main_~A~0#1|) .cse142 .cse143) (or .cse139 (= |ULTIMATE.start_main_~A~0#1| (+ .cse267 .cse217)))) .cse218)) .cse96 .cse186) (or (and (or .cse211 (and (or .cse142 .cse143 (= (+ .cse212 .cse268) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse212 .cse267)) .cse139)) .cse213) (or .cse209 (and (or .cse142 (= (+ .cse210 .cse268) |ULTIMATE.start_main_~A~0#1|) .cse143) (or .cse139 (= (+ .cse210 .cse267) |ULTIMATE.start_main_~A~0#1|))))) .cse104 .cse105 .cse185)))) .cse59))))) (.cse45 (<= 8 |ULTIMATE.start_main_~p~0#1|)) (.cse3 (or .cse177 (and (or .cse95 (not (= .cse156 .cse181)) .cse59) (or (not (= .cse179 .cse156)) .cse112)) .cse25 .cse117)) (.cse4 (or (and (or .cse95 .cse242 (and (or .cse243 (not (= (+ .cse244 1) .cse156)) .cse245) (or .cse246 (not (= .cse156 .cse244)))) .cse59) (or (and (or .cse247 (not (= (+ .cse248 1) .cse156)) .cse249) (or .cse250 (not (= .cse156 .cse248)))) .cse112 .cse251)) .cse57 (and (or (and (or .cse252 .cse253 (not (= .cse254 1))) (or (not (= .cse255 1)) .cse256)) .cse257 .cse94) (or .cse120 .cse121 (and (or .cse258 (not (= .cse259 1))) (or .cse260 .cse261 (not (= .cse262 1)))) .cse263)) .cse264)) (.cse5 (let ((.cse241 (* .cse239 2))) (let ((.cse238 (+ (- .cse241) |ULTIMATE.start_main_~r~0#1|))) (or (>= .cse238 .cse239) (= (+ (+ .cse238 .cse22) (* (+ |ULTIMATE.start_main_~p~0#1| (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse240))) |ULTIMATE.start_main_~B~0#1|)) |ULTIMATE.start_main_~A~0#1|) (not (>= |ULTIMATE.start_main_~r~0#1| .cse241)))))) (.cse8 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse156 .cse234) .cse231)) .cse226 .cse25 .cse237 (and (or (not (= .cse235 1)) .cse94) (or .cse120 .cse121 (not (= .cse236 1)))) (and (or (not (= .cse156 .cse233)) .cse112) (or .cse95 (not (= (+ .cse233 1) .cse156)) .cse59)))) (.cse11 (or .cse226 (let ((.cse228 (* |ULTIMATE.start_main_~B~0#1| (+ .cse234 .cse236))) (.cse229 (* (+ .cse234 .cse235) |ULTIMATE.start_main_~B~0#1|)) (.cse230 (- .cse233))) (and (or (let ((.cse227 (+ .cse230 .cse231))) (and (or .cse120 (= (+ .cse227 .cse228) |ULTIMATE.start_main_~A~0#1|) .cse121) (or (= (+ .cse227 .cse229) |ULTIMATE.start_main_~A~0#1|) .cse94))) .cse112) (or .cse95 .cse59 (let ((.cse232 (+ (+ (- 1) .cse230) .cse231))) (and (or .cse120 .cse121 (= (+ .cse232 .cse228) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse232 .cse229) |ULTIMATE.start_main_~A~0#1|) .cse94)))))) .cse237)) (.cse40 (or (and (or .cse223 (and (or .cse193 .cse194 (not (= .cse220 1))) (or (not (= 1 .cse219)) .cse192)) .cse101 .cse102) (or .cse224 (and (or .cse207 (not (= .cse221 1)) .cse208) (or (not (= .cse222 1)) .cse205)) .cse99)) (let ((.cse225 (* .cse156 .cse176))) (and (or (= (+ .cse225 .cse153) |ULTIMATE.start_main_~A~0#1|) .cse112 .cse154) (or .cse95 .cse150 (= (+ .cse151 .cse225) |ULTIMATE.start_main_~A~0#1|) .cse59))) .cse94)) (.cse41 (or (let ((.cse204 (* |ULTIMATE.start_main_~B~0#1| (+ .cse176 .cse222))) (.cse206 (* |ULTIMATE.start_main_~B~0#1| (+ .cse221 .cse176))) (.cse195 (* |ULTIMATE.start_main_~B~0#1| (+ .cse220 .cse176))) (.cse191 (* (+ .cse176 .cse219) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse112 (and (or (and (or (and (or .cse189 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse190 .cse191)) .cse192) (or .cse193 .cse194 (= |ULTIMATE.start_main_~A~0#1| (+ .cse190 .cse195))))) (or .cse196 .cse197 (and (or .cse192 (= (+ .cse191 .cse198) |ULTIMATE.start_main_~A~0#1|)) (or .cse193 .cse194 (= |ULTIMATE.start_main_~A~0#1| (+ .cse195 .cse198)))))) .cse107 .cse108 .cse188) (or .cse110 .cse187 (and (or .cse199 (and (or .cse193 .cse194 (= |ULTIMATE.start_main_~A~0#1| (+ .cse195 .cse200))) (or (= (+ .cse191 .cse200) |ULTIMATE.start_main_~A~0#1|) .cse192)) .cse201) (or (and (or .cse193 (= (+ .cse202 .cse195) |ULTIMATE.start_main_~A~0#1|) .cse194) (or .cse192 (= (+ .cse202 .cse191) |ULTIMATE.start_main_~A~0#1|))) .cse203)))) .cse101 .cse102) (or (and (or .cse107 (and (or .cse196 .cse197 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse198 .cse204)) .cse205) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse198 .cse206)) .cse207 .cse208))) (or (and (or .cse207 .cse208 (= |ULTIMATE.start_main_~A~0#1| (+ .cse190 .cse206))) (or .cse205 (= (+ .cse190 .cse204) |ULTIMATE.start_main_~A~0#1|))) .cse189)) .cse108 .cse188) (or .cse110 (and (or (and (or .cse207 .cse208 (= |ULTIMATE.start_main_~A~0#1| (+ .cse202 .cse206))) (or (= (+ .cse202 .cse204) |ULTIMATE.start_main_~A~0#1|) .cse205)) .cse203) (or .cse199 (and (or (= (+ .cse200 .cse204) |ULTIMATE.start_main_~A~0#1|) .cse205) (or (= (+ .cse200 .cse206) |ULTIMATE.start_main_~A~0#1|) .cse207 .cse208)) .cse201)) .cse187)) .cse99))) (or .cse95 (and (or (and (or (and (or .cse209 (and (or .cse205 (= (+ .cse210 .cse204) |ULTIMATE.start_main_~A~0#1|)) (or .cse207 (= (+ .cse210 .cse206) |ULTIMATE.start_main_~A~0#1|) .cse208))) (or .cse211 (and (or .cse207 (= |ULTIMATE.start_main_~A~0#1| (+ .cse212 .cse206)) .cse208) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse212 .cse204)) .cse205)) .cse213)) .cse104 .cse105 .cse185) (or (and (or .cse214 (and (or (= (+ .cse215 .cse204) |ULTIMATE.start_main_~A~0#1|) .cse205) (or .cse207 (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse206)) .cse208)) .cse216) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse204 .cse217)) .cse205) (or .cse207 (= (+ .cse206 .cse217) |ULTIMATE.start_main_~A~0#1|) .cse208)) .cse218)) .cse96 .cse186)) .cse99) (or (and (or (and (or (and (or (= (+ .cse210 .cse195) |ULTIMATE.start_main_~A~0#1|) .cse193 .cse194) (or .cse192 (= (+ .cse210 .cse191) |ULTIMATE.start_main_~A~0#1|))) .cse209) (or .cse211 .cse213 (and (or .cse193 .cse194 (= |ULTIMATE.start_main_~A~0#1| (+ .cse212 .cse195))) (or .cse192 (= |ULTIMATE.start_main_~A~0#1| (+ .cse212 .cse191)))))) .cse104 .cse105 .cse185) (or (and (or (and (or .cse192 (= (+ .cse191 .cse217) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse195 .cse217) |ULTIMATE.start_main_~A~0#1|) .cse193 .cse194)) .cse218) (or .cse214 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse195)) .cse193 .cse194) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse191)) .cse192)) .cse216)) .cse96 .cse186)) .cse101 .cse102)) .cse59))) .cse94)) (.cse49 (let ((.cse166 (not .cse188)) (.cse167 (not .cse187)) (.cse170 (not .cse186)) (.cse175 (not .cse185))) (let ((.cse159 (or .cse183 .cse120 (let ((.cse184 (+ .cse155 1))) (and (or .cse112 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 (* .cse184 .cse165))) .cse107 .cse108 .cse166) (or .cse110 .cse167 (= (+ (* .cse184 .cse169) .cse168) |ULTIMATE.start_main_~A~0#1|)))) (or .cse95 (and (or .cse170 (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 (* .cse184 .cse172))) .cse96) (or .cse175 .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse184 .cse173) .cse174)))) .cse59))) .cse121)) (.cse160 (or .cse177 (and (or (not .cse129) .cse112 (= (+ .cse178 (* .cse179 .cse180)) |ULTIMATE.start_main_~A~0#1|)) (or .cse95 (not .cse134) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse180 .cse181) .cse182)) .cse59)))) (.cse161 (or .cse162 (let ((.cse164 (+ .cse176 1))) (and (or .cse112 (and (or (= (+ .cse163 (* .cse164 .cse165)) |ULTIMATE.start_main_~A~0#1|) .cse107 .cse108 .cse166) (or .cse110 .cse167 (= (+ .cse168 (* .cse164 .cse169)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse95 (and (or .cse170 .cse96 (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 (* .cse164 .cse172)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse164 .cse173) .cse174)) .cse175 .cse104 .cse105)) .cse59))) .cse94))) (or (and .cse53 .cse54 .cse1 .cse24 .cse55 .cse36 .cse27 .cse56 .cse29 .cse159 .cse61 .cse160 .cse10 .cse161 .cse14 .cse58 .cse31 .cse59) (and .cse53 .cse54 .cse1 .cse24 .cse55 .cse27 .cse56 .cse29 .cse159 .cse61 .cse160 .cse10 .cse161 .cse14 .cse93 .cse58 .cse31 .cse59))))) (.cse42 (or (let ((.cse158 (* (+ .cse113 .cse137) |ULTIMATE.start_main_~B~0#1|)) (.cse157 (* (+ .cse137 .cse114) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse112 (and (or (and (or .cse101 .cse102 (= (+ .cse157 .cse130) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse130 .cse158)) .cse99)) .cse107 .cse108) (or .cse110 (and (or .cse99 (= (+ .cse133 .cse158) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse157 .cse133) |ULTIMATE.start_main_~A~0#1|) .cse101 .cse102)))) .cse129) (or .cse95 (and (or (and (or (= (+ .cse135 .cse157) |ULTIMATE.start_main_~A~0#1|) .cse101 .cse102) (or (= (+ .cse135 .cse158) |ULTIMATE.start_main_~A~0#1|) .cse99)) .cse104 .cse105) (or (and (or (= (+ .cse158 .cse136) |ULTIMATE.start_main_~A~0#1|) .cse99) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse136)) .cse101 .cse102)) .cse96)) .cse134 .cse59))) .cse94)) (.cse43 (or (and (or .cse124 .cse138 .cse126 (and (or .cse139 (not (= .cse140 1))) (or (not (= .cse141 1)) .cse142 .cse143))) (or .cse122 .cse144 (and (or .cse145 (not (= .cse146 1))) (or .cse147 .cse148 (not (= .cse149 1)))))) .cse120 (let ((.cse152 (* .cse155 .cse156))) (and (or .cse95 .cse150 (= |ULTIMATE.start_main_~A~0#1| (+ .cse151 .cse152)) .cse59) (or .cse112 (= (+ .cse153 .cse152) |ULTIMATE.start_main_~A~0#1|) .cse154))) .cse121)) (.cse44 (or .cse120 (let ((.cse131 (* (+ .cse128 .cse137) |ULTIMATE.start_main_~B~0#1|)) (.cse132 (* (+ .cse137 .cse127) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse112 .cse129 (and (or .cse107 (and (or .cse124 .cse126 (= |ULTIMATE.start_main_~A~0#1| (+ .cse130 .cse131))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse130 .cse132)) .cse122)) .cse108) (or .cse110 (and (or .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse131)) .cse126) (or (= (+ .cse132 .cse133) |ULTIMATE.start_main_~A~0#1|) .cse122))))) (or .cse95 .cse134 (and (or (and (or .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse131)) .cse126) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse132)))) .cse104 .cse105) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse136)) .cse124 .cse126) (or .cse122 (= (+ .cse132 .cse136) |ULTIMATE.start_main_~A~0#1|))) .cse96)) .cse59))) .cse121)) (.cse35 (or .cse120 .cse121 (let ((.cse125 (* |ULTIMATE.start_main_~B~0#1| (+ .cse128 |ULTIMATE.start_main_~q~0#1|))) (.cse123 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse127)))) (and (or .cse95 (and (or (and (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse103 .cse123))) (or .cse124 (= (+ .cse125 .cse103) |ULTIMATE.start_main_~A~0#1|) .cse126)) .cse104 .cse105) (or .cse96 (and (or .cse122 (= (+ .cse98 .cse123) |ULTIMATE.start_main_~A~0#1|)) (or .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ .cse125 .cse98)) .cse126)))) .cse106 .cse59) (or .cse55 (and (or .cse110 (and (or .cse122 (= (+ .cse111 .cse123) |ULTIMATE.start_main_~A~0#1|)) (or .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ .cse111 .cse125)) .cse126))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse125)) .cse124 .cse126) (or .cse122 (= (+ .cse109 .cse123) |ULTIMATE.start_main_~A~0#1|))) .cse107 .cse108)) .cse112))))) (.cse60 (<= 4 |ULTIMATE.start_main_~p~0#1|)) (.cse38 (or .cse116 .cse117 (and (or .cse95 .cse118 .cse106 .cse59) (or .cse55 .cse119 .cse112)))) (.cse7 (or .cse115 (not .cse9) .cse93)) (.cse63 (<= 2 |ULTIMATE.start_main_~d~0#1|)) (.cse39 (or .cse94 (let ((.cse100 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse114))) (.cse97 (* |ULTIMATE.start_main_~B~0#1| (+ .cse113 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse95 (and (or .cse96 (and (or (= (+ .cse97 .cse98) |ULTIMATE.start_main_~A~0#1|) .cse99) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse98 .cse100)) .cse101 .cse102))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse103 .cse100)) .cse101 .cse102) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse103)) .cse99)) .cse104 .cse105)) .cse106 .cse59) (or .cse55 (and (or .cse107 .cse108 (and (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse100)) .cse102) (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse97))))) (or .cse110 (and (or (= (+ .cse111 .cse100) |ULTIMATE.start_main_~A~0#1|) .cse101 .cse102) (or (= (+ .cse111 .cse97) |ULTIMATE.start_main_~A~0#1|) .cse99)))) .cse112)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse23 (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) .cse28)))) (and (let ((.cse20 (< .cse23 0)) (.cse18 (div (+ |ULTIMATE.start_main_~A~0#1| .cse21 .cse22) 2)) (.cse19 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0))) (or (and (= .cse18 |ULTIMATE.start_main_~d~0#1|) (or .cse19 (not .cse20))) (and .cse20 (= |ULTIMATE.start_main_~d~0#1| (+ .cse18 1)) (not .cse19)))) .cse24 .cse25 (= |ULTIMATE.start_main_~B~0#1| (+ (* (- 2) |ULTIMATE.start_main_~B~0#1|) .cse26 |ULTIMATE.start_main_~A~0#1|)) (= 2 .cse23) .cse27 (>= .cse28 |ULTIMATE.start_main_~d~0#1|) .cse29 .cse10 (= (+ (- 2) |ULTIMATE.start_main_~q~0#1|) 1) .cse14 .cse15 (not (>= (+ .cse28 .cse23) .cse30)) .cse31 (= (+ (* (- 1) 2) .cse32) 0))) (and .cse1 .cse33 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse34 .cse35 .cse0 .cse1 .cse2 .cse36 .cse37 .cse38 .cse3 .cse5 .cse6 .cse8 .cse39 .cse9 .cse10 .cse11 .cse40 .cse41 .cse14 .cse15 .cse42 .cse43 .cse44) (and .cse1 .cse33 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse1 .cse33 .cse7 .cse9 .cse15) (and .cse1 .cse45 (= (* 2 .cse30) |ULTIMATE.start_main_~p~0#1|) .cse46 (>= |ULTIMATE.start_main_~r~0#1| .cse47) .cse9 .cse48 (= (* .cse47 2) |ULTIMATE.start_main_~d~0#1|) .cse15 .cse49) (and .cse1 .cse33 .cse5 .cse7 .cse9 .cse10 .cse15) (and .cse50 (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 .cse2 .cse25 .cse51 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse10 .cse15 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1)) .cse52) (and .cse25 .cse51 .cse46 .cse48 .cse15) (and .cse1 .cse36 .cse6 .cse7 .cse9 .cse10 .cse14 .cse15) (and .cse53 .cse54 .cse55 (= .cse47 |ULTIMATE.start_main_~d~0#1|) .cse56 (= |ULTIMATE.start_main_~p~0#1| .cse30) .cse46 (= |ULTIMATE.start_main_~d~0#1| .cse30) .cse57 .cse48 .cse15 .cse58 .cse59) (and .cse0 .cse1 .cse2 .cse33 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse60 (= |ULTIMATE.start_main_~p~0#1| 4) .cse50 .cse1 .cse24 .cse36 .cse29 .cse61 (= |ULTIMATE.start_main_~d~0#1| .cse62) .cse63 .cse9 .cse10 (= (+ |ULTIMATE.start_main_~A~0#1| .cse22) |ULTIMATE.start_main_~r~0#1|) .cse64 .cse14 .cse15 .cse58 .cse52 (>= .cse28 .cse47)) (let ((.cse68 (* |ULTIMATE.start_main_~B~0#1| (- 4)))) (let ((.cse65 (+ .cse68 .cse26 |ULTIMATE.start_main_~A~0#1|)) (.cse67 (+ .cse68 |ULTIMATE.start_main_~A~0#1|))) (and .cse35 (not (>= (+ .cse65 |ULTIMATE.start_main_~r~0#1|) .cse66)) .cse0 .cse2 .cse25 .cse37 (= .cse65 |ULTIMATE.start_main_~B~0#1|) .cse33 .cse51 (= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 1) .cse39 .cse9 .cse10 (>= (+ .cse62 .cse67) .cse47) .cse41 .cse64 (not (>= .cse67 .cse66)) (= |ULTIMATE.start_main_~r~0#1| (+ .cse22 .cse67)) (= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~p~0#1| 4)) .cse15 .cse42 .cse44))) (and .cse69 (= |ULTIMATE.start_main_~d~0#1| .cse70) .cse46 .cse9 .cse48 .cse15 .cse71) (and .cse72 .cse1 .cse25 .cse73 .cse33 (or (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse74)) .cse75 (let ((.cse78 (= (mod .cse74 2) 0)) (.cse76 (< .cse74 0)) (.cse77 (div .cse79 4))) (or (and .cse76 (= (+ .cse77 1) |ULTIMATE.start_main_~d~0#1|) (not .cse78)) (and (or .cse78 (not .cse76)) (= |ULTIMATE.start_main_~d~0#1| .cse77))))) (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse80)) (let ((.cse82 (= (mod .cse80 2) 0)) (.cse81 (< .cse80 0)) (.cse83 (div .cse80 2))) (or (and .cse81 (not .cse82) (= (+ .cse83 1) |ULTIMATE.start_main_~d~0#1|)) (and (or .cse82 (not .cse81)) (= .cse83 |ULTIMATE.start_main_~d~0#1|)))) .cse84 .cse85)) .cse12 .cse64 .cse15 .cse16 .cse17) (and .cse86 .cse25 (= (+ (* (- 1) .cse70) |ULTIMATE.start_main_~q~0#1|) 0) .cse15 .cse16 (= .cse87 .cse66)) (and .cse50 .cse1 .cse36 .cse69 .cse88 .cse63 .cse10 (= .cse32 0) .cse15 .cse58 (= 2 |ULTIMATE.start_main_~d~0#1|) (not (>= .cse28 .cse30)) .cse71) (and .cse35 .cse1 .cse38 .cse33 .cse7 .cse39 .cse9 .cse15) (and .cse34 .cse0 .cse1 .cse2 .cse33 .cse3 .cse7 .cse8 .cse9 .cse12 .cse15 .cse16 .cse17) (let ((.cse89 (+ |ULTIMATE.start_main_~r~0#1| .cse62))) (and .cse72 .cse1 .cse86 .cse73 .cse69 (= .cse89 |ULTIMATE.start_main_~A~0#1|) .cse88 .cse6 (>= .cse89 .cse47) .cse57 .cse9 (= |ULTIMATE.start_main_~q~0#1| 4) (let ((.cse91 (= (mod |ULTIMATE.start_main_~q~0#1| 2) 0)) (.cse92 (< |ULTIMATE.start_main_~q~0#1| 0)) (.cse90 (div |ULTIMATE.start_main_~q~0#1| 2))) (or (and (= .cse90 |ULTIMATE.start_main_~p~0#1|) (or .cse91 (not .cse92))) (and (not .cse91) .cse92 (= (+ .cse90 1) |ULTIMATE.start_main_~p~0#1|)))) .cse10 .cse12 .cse64 .cse14 .cse15 .cse16 .cse17)) (and .cse1 .cse9 (or (and .cse34 .cse35 .cse0 .cse1 .cse2 .cse37 .cse38 .cse45 .cse3 .cse5 .cse8 .cse39 .cse9 .cse48 .cse10 .cse11 .cse40 .cse41 .cse93 .cse15 .cse49 .cse42 .cse43 .cse44) (and .cse35 .cse0 .cse1 .cse2 .cse36 .cse37 .cse38 .cse45 .cse3 .cse4 .cse5 .cse8 .cse39 .cse9 .cse48 .cse10 .cse11 .cse40 .cse41 .cse15 .cse49 .cse42 .cse43 .cse44)) .cse48 .cse15) (and .cse35 .cse60 .cse1 .cse24 .cse36 .cse38 .cse29 .cse61 .cse7 .cse63 .cse39 .cse9 .cse10 .cse14 .cse15 .cse58)))))))))) [2023-02-18 03:06:39,447 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2023-02-18 03:06:39,450 INFO L895 garLoopResultBuilder]: At program point L44-1(lines 44 56) the Hoare annotation is: (let ((.cse278 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse45 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse288 (- .cse45)) (.cse279 (+ .cse278 1))) (let ((.cse33 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse93 (+ |ULTIMATE.start_main_~q~0#1| .cse279)) (.cse294 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse52 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse76 (+ |ULTIMATE.start_main_~q~0#1| .cse278)) (.cse287 (+ (- 1) .cse288)) (.cse293 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse19 (- |ULTIMATE.start_main_~d~0#1|)) (.cse44 (+ .cse45 1))) (let ((.cse122 (div .cse44 2)) (.cse121 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse202 (div .cse279 2)) (.cse127 (= .cse278 1)) (.cse125 (= .cse279 1)) (.cse39 (+ |ULTIMATE.start_main_~r~0#1| .cse19)) (.cse38 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse30 (not .cse293)) (.cse75 (+ |ULTIMATE.start_main_~r~0#1| .cse287)) (.cse291 (* |ULTIMATE.start_main_~B~0#1| .cse76)) (.cse51 (and .cse294 (not .cse52))) (.cse292 (* .cse93 |ULTIMATE.start_main_~B~0#1|)) (.cse72 (+ |ULTIMATE.start_main_~r~0#1| .cse288)) (.cse53 (not .cse294)) (.cse35 (and (not .cse33) .cse293)) (.cse207 (div |ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse206 (+ .cse207 1)) (.cse289 (< .cse278 0)) (.cse63 (= (mod .cse278 2) 0)) (.cse146 (or (and (or (= (+ .cse291 .cse72) |ULTIMATE.start_main_~A~0#1|) .cse51) (or (= (+ .cse292 .cse72) |ULTIMATE.start_main_~A~0#1|) .cse52 .cse53)) .cse35)) (.cse147 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse148 (or .cse30 (and (or .cse51 (= (+ .cse75 .cse291) |ULTIMATE.start_main_~A~0#1|)) (or .cse52 .cse53 (= |ULTIMATE.start_main_~A~0#1| (+ .cse292 .cse75)))) .cse33)) (.cse15 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse152 (= |ULTIMATE.start_main_~A~0#1| (+ .cse39 (* |ULTIMATE.start_main_~B~0#1| .cse38)))) (.cse8 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse43 (and (or (not .cse127) .cse51) (or .cse52 .cse53 (not .cse125)))) (.cse77 (= (mod .cse279 2) 0)) (.cse290 (< .cse279 0)) (.cse203 (+ .cse202 1)) (.cse240 (- .cse121)) (.cse120 (+ .cse121 1)) (.cse123 (+ .cse122 1)) (.cse241 (- .cse122))) (let ((.cse242 (+ (- 1) .cse241)) (.cse119 (>= .cse75 .cse123)) (.cse285 (< .cse44 0)) (.cse117 (= (mod .cse44 2) 0)) (.cse112 (>= .cse75 .cse122)) (.cse99 (>= .cse72 .cse121)) (.cse100 (= (mod .cse45 2) 0)) (.cse106 (>= .cse72 .cse120)) (.cse286 (< .cse45 0)) (.cse239 (+ (- 1) .cse240)) (.cse78 (= .cse203 1)) (.cse79 (not .cse290)) (.cse85 (and .cse290 (not .cse77))) (.cse86 (= .cse202 1)) (.cse186 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse193 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse27 (or .cse43 (and (or (= .cse45 |ULTIMATE.start_main_~B~0#1|) .cse35) (or .cse30 (= |ULTIMATE.start_main_~B~0#1| .cse44) .cse33)))) (.cse11 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse247 (or .cse43 (and (or .cse30 .cse33 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse44)) |ULTIMATE.start_main_~A~0#1|)) (or .cse35 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse45 |ULTIMATE.start_main_~q~0#1|))))))) (.cse249 (or (and .cse147 .cse15 .cse152) (and .cse146 .cse147 .cse148 .cse15 .cse152) (and .cse146 .cse147 .cse148 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse15 .cse152 .cse8 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1))))) (.cse64 (= .cse207 1)) (.cse70 (and .cse289 (not .cse63))) (.cse56 (= .cse206 1)) (.cse62 (not .cse289))) (let ((.cse131 (- |ULTIMATE.start_main_~r~0#1|)) (.cse126 (and (or (not .cse64) .cse70) (or (not .cse56) .cse62 .cse63))) (.cse36 (>= .cse39 .cse45)) (.cse31 (>= .cse39 .cse44)) (.cse41 (>= |ULTIMATE.start_main_~r~0#1| .cse44)) (.cse42 (>= |ULTIMATE.start_main_~r~0#1| .cse45)) (.cse195 (* (- 1) |ULTIMATE.start_main_~r~0#1|)) (.cse7 (or (and .cse27 .cse11 .cse247 .cse249) (and .cse27 .cse11 .cse247 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse249))) (.cse47 (+ (- .cse193) |ULTIMATE.start_main_~r~0#1|)) (.cse46 (+ |ULTIMATE.start_main_~q~0#1| .cse186)) (.cse5 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse267 (+ .cse39 .cse288)) (.cse269 (+ .cse39 .cse287)) (.cse124 (and (or (not .cse78) .cse77 .cse79) (or .cse85 (not .cse86)))) (.cse258 (+ .cse239 .cse72)) (.cse105 (not .cse286)) (.cse260 (not .cse106)) (.cse94 (and (not .cse100) .cse286)) (.cse261 (not .cse99)) (.cse262 (+ .cse240 .cse72)) (.cse263 (not .cse112)) (.cse264 (+ .cse75 .cse241)) (.cse111 (and .cse285 (not .cse117))) (.cse266 (not .cse119)) (.cse118 (not .cse285)) (.cse265 (+ .cse75 .cse242)) (.cse10 (* 2 |ULTIMATE.start_main_~B~0#1|))) (let ((.cse50 (div (* |ULTIMATE.start_main_~p~0#1| 4) 8)) (.cse88 (div .cse279 4)) (.cse81 (div .cse203 2)) (.cse83 (= (mod .cse203 2) 0)) (.cse250 (< .cse203 0)) (.cse114 (= (mod .cse123 2) 0)) (.cse251 (< .cse123 0)) (.cse110 (= (mod .cse122 2) 0)) (.cse252 (< .cse122 0)) (.cse89 (= (mod .cse202 2) 0)) (.cse253 (< .cse202 0)) (.cse97 (= (mod .cse121 2) 0)) (.cse254 (< .cse121 0)) (.cse255 (< .cse120 0)) (.cse104 (= (mod .cse120 2) 0)) (.cse68 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse60 (div .cse206 2)) (.cse57 (= (mod .cse206 2) 0)) (.cse256 (< .cse206 0)) (.cse65 (= (mod .cse207 2) 0)) (.cse257 (< .cse207 0)) (.cse18 (* 2 .cse10)) (.cse21 (or .cse124 .cse52 (let ((.cse284 (+ .cse93 1))) (and (or .cse35 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse258 (* .cse284 .cse120))) .cse100 .cse105 .cse260) (or .cse94 .cse261 (= (+ (* .cse284 .cse121) .cse262) |ULTIMATE.start_main_~A~0#1|)))) (or .cse30 (and (or .cse263 (= |ULTIMATE.start_main_~A~0#1| (+ .cse264 (* .cse284 .cse122))) .cse111) (or .cse266 .cse117 .cse118 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse284 .cse123) .cse265)))) .cse33))) .cse53)) (.cse22 (let ((.cse281 (* (+ .cse93 .cse202) |ULTIMATE.start_main_~B~0#1|)) (.cse280 (* (+ .cse203 .cse93) |ULTIMATE.start_main_~B~0#1|)) (.cse283 (* (+ .cse207 .cse76) |ULTIMATE.start_main_~B~0#1|)) (.cse282 (* (+ .cse206 .cse76) |ULTIMATE.start_main_~B~0#1|))) (let ((.cse272 (or (and (or .cse125 .cse52 .cse53 (and (or .cse100 .cse105 (and (or .cse77 (= (+ .cse258 .cse280) |ULTIMATE.start_main_~A~0#1|) .cse79) (or .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse281 .cse258))))) (or .cse94 (and (or .cse85 (= (+ .cse281 .cse262) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse280 .cse262)) .cse77 .cse79))))) (or (and (or .cse94 (and (or (= (+ .cse283 .cse262) |ULTIMATE.start_main_~A~0#1|) .cse70) (or (= (+ .cse262 .cse282) |ULTIMATE.start_main_~A~0#1|) .cse62 .cse63))) (or (and (or .cse70 (= (+ .cse283 .cse258) |ULTIMATE.start_main_~A~0#1|)) (or .cse62 .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse258 .cse282)))) .cse100 .cse105)) .cse51 .cse127)) .cse35)) (.cse275 (or .cse30 .cse33 (and (or .cse125 .cse52 .cse53 (and (or (and (or (= (+ .cse280 .cse265) |ULTIMATE.start_main_~A~0#1|) .cse77 .cse79) (or .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse281 .cse265)))) .cse117 .cse118) (or .cse111 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse264 .cse280)) .cse77 .cse79) (or .cse85 (= (+ .cse264 .cse281) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse62 .cse63 (= (+ .cse264 .cse282) |ULTIMATE.start_main_~A~0#1|)) (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse264 .cse283)))) .cse111) (or .cse117 .cse118 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse265 .cse282)) .cse62 .cse63) (or (= (+ .cse283 .cse265) |ULTIMATE.start_main_~A~0#1|) .cse70)))) .cse51 .cse127)))) (.cse271 (or .cse5 (let ((.cse277 (* (+ .cse38 .cse279) |ULTIMATE.start_main_~B~0#1|)) (.cse276 (* (+ .cse38 .cse278) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse276 .cse267) |ULTIMATE.start_main_~A~0#1|) .cse51) (or .cse52 .cse53 (= |ULTIMATE.start_main_~A~0#1| (+ .cse267 .cse277)))) .cse35) (or .cse30 (and (or .cse52 (= |ULTIMATE.start_main_~A~0#1| (+ .cse269 .cse277)) .cse53) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse269 .cse276)) .cse51)) .cse33))))) (.cse273 (or .cse5 (and .cse146 .cse148))) (.cse274 (or (= .cse186 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ .cse47 .cse19) (* |ULTIMATE.start_main_~B~0#1| (+ .cse46 |ULTIMATE.start_main_~p~0#1|))))))) (or (and .cse147 .cse271 .cse272 .cse273 .cse152 .cse7 .cse274 .cse275) (and .cse271 (= |ULTIMATE.start_main_~B~0#1| (+ (* (- 2) |ULTIMATE.start_main_~B~0#1|) .cse195 |ULTIMATE.start_main_~A~0#1|)) .cse272 .cse273 .cse152 (= (+ (- 2) |ULTIMATE.start_main_~q~0#1|) 1) .cse7 .cse274 .cse8 .cse275) (and .cse147 .cse271 .cse273 .cse152 .cse7 .cse274))))) (.cse23 (or .cse43 (let ((.cse270 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse30 (not .cse41) .cse33 (= |ULTIMATE.start_main_~A~0#1| (+ .cse75 (* .cse270 .cse44)))) (or (not .cse42) .cse35 (= (+ (* .cse45 .cse270) .cse72) |ULTIMATE.start_main_~A~0#1|)))))) (.cse24 (or .cse43 (let ((.cse268 (+ .cse38 1))) (and (or (not .cse36) .cse35 (= (+ .cse267 (* .cse45 .cse268)) |ULTIMATE.start_main_~A~0#1|)) (or .cse30 (not .cse31) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse268 .cse44) .cse269)) .cse33))))) (.cse25 (or .cse126 (let ((.cse259 (+ .cse76 1))) (and (or .cse35 (and (or (= (+ .cse258 (* .cse259 .cse120)) |ULTIMATE.start_main_~A~0#1|) .cse100 .cse105 .cse260) (or .cse94 .cse261 (= (+ .cse262 (* .cse259 .cse121)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse30 (and (or .cse263 .cse111 (= |ULTIMATE.start_main_~A~0#1| (+ .cse264 (* .cse259 .cse122)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse259 .cse123) .cse265)) .cse266 .cse117 .cse118)) .cse33))) .cse51)) (.cse157 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse9 (+ .cse195 |ULTIMATE.start_main_~A~0#1|)) (.cse139 (+ |ULTIMATE.start_main_~A~0#1| .cse131))) (let ((.cse0 (div .cse139 2)) (.cse4 (< .cse9 0)) (.cse144 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse134 (>= |ULTIMATE.start_main_~p~0#1| 1)) (.cse135 (or (and .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse21 .cse22 .cse23 .cse24 .cse25 (or (not .cse5) (= (+ .cse39 (* |ULTIMATE.start_main_~d~0#1| .cse38)) |ULTIMATE.start_main_~A~0#1|) .cse157)))) (.cse143 (>= |ULTIMATE.start_main_~A~0#1| .cse18)) (.cse20 (* |ULTIMATE.start_main_~B~0#1| (- 4))) (.cse69 (and (not .cse65) .cse257)) (.cse67 (not .cse257)) (.cse58 (not .cse256)) (.cse61 (and (not .cse57) .cse256)) (.cse59 (+ 1 .cse60)) (.cse66 (+ .cse68 1)) (.cse102 (and .cse255 (not .cse104))) (.cse103 (not .cse255)) (.cse98 (not .cse254)) (.cse96 (and (not .cse97) .cse254)) (.cse90 (not .cse253)) (.cse87 (and (not .cse89) .cse253)) (.cse109 (not .cse252)) (.cse108 (and (not .cse110) .cse252)) (.cse113 (not .cse251)) (.cse116 (and (not .cse114) .cse251)) (.cse84 (not .cse250)) (.cse80 (and (not .cse83) .cse250)) (.cse82 (+ .cse81 1)) (.cse91 (+ .cse88 1)) (.cse48 (>= .cse47 |ULTIMATE.start_main_~d~0#1|)) (.cse55 (div (* |ULTIMATE.start_main_~d~0#1| 4) 8)) (.cse54 (+ .cse50 1)) (.cse49 (not (>= |ULTIMATE.start_main_~r~0#1| .cse193))) (.cse101 (div .cse120 2)) (.cse95 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse107 (div .cse44 4)) (.cse115 (div .cse123 2)) (.cse133 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse26 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse12 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse13 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))) (let ((.cse28 (let ((.cse248 (or (and .cse146 .cse147 .cse148 .cse12 .cse15 .cse13 .cse152 .cse8) (and .cse147 .cse12 .cse15 .cse13 .cse152 .cse8)))) (or (and .cse247 .cse248 .cse26) (and (= .cse133 |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) .cse5 .cse249 (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|)) (and .cse247 .cse249 .cse26) (and .cse247 .cse248)))) (.cse14 (let ((.cse243 (- .cse115)) (.cse244 (- .cse107)) (.cse245 (- .cse95)) (.cse246 (- .cse101))) (let ((.cse196 (+ .cse39 .cse239)) (.cse199 (+ .cse240 .cse39)) (.cse200 (+ .cse242 .cse39)) (.cse201 (+ .cse39 .cse241)) (.cse208 (+ .cse72 .cse246)) (.cse211 (+ (+ (- 1) .cse246) .cse72)) (.cse212 (+ (+ (- 1) .cse245) .cse72)) (.cse213 (+ .cse72 .cse245)) (.cse218 (+ .cse75 (+ (- 1) .cse244))) (.cse219 (+ .cse244 .cse75)) (.cse217 (+ .cse75 (+ (- 1) .cse243))) (.cse216 (+ .cse75 .cse243)) (.cse223 (+ .cse242 |ULTIMATE.start_main_~r~0#1|)) (.cse221 (+ |ULTIMATE.start_main_~r~0#1| .cse241)) (.cse225 (+ .cse240 |ULTIMATE.start_main_~r~0#1|)) (.cse224 (+ .cse239 |ULTIMATE.start_main_~r~0#1|))) (let ((.cse150 (let ((.cse238 (* .cse193 2))) (let ((.cse237 (+ (- .cse238) |ULTIMATE.start_main_~r~0#1|))) (or (>= .cse237 .cse193) (= (+ (+ .cse237 .cse19) (* (+ |ULTIMATE.start_main_~p~0#1| (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse186))) |ULTIMATE.start_main_~B~0#1|)) |ULTIMATE.start_main_~A~0#1|) (not (>= |ULTIMATE.start_main_~r~0#1| .cse238)))))) (.cse153 (or .cse48 (let ((.cse233 (* |ULTIMATE.start_main_~B~0#1| (+ .cse46 .cse54))) (.cse234 (* (+ .cse46 .cse50) |ULTIMATE.start_main_~B~0#1|)) (.cse235 (- .cse55))) (and (or (let ((.cse232 (+ .cse235 .cse47))) (and (or .cse52 (= (+ .cse232 .cse233) |ULTIMATE.start_main_~A~0#1|) .cse53) (or (= (+ .cse232 .cse234) |ULTIMATE.start_main_~A~0#1|) .cse51))) .cse35) (or .cse30 .cse33 (let ((.cse236 (+ (+ (- 1) .cse235) .cse47))) (and (or .cse52 .cse53 (= (+ .cse236 .cse233) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse236 .cse234) |ULTIMATE.start_main_~A~0#1|) .cse51)))))) .cse49)) (.cse145 (or .cse52 .cse53 (let ((.cse231 (* |ULTIMATE.start_main_~B~0#1| (+ .cse203 |ULTIMATE.start_main_~q~0#1|))) (.cse230 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse202)))) (and (or .cse30 (and (or (and (or .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse223 .cse230))) (or .cse77 (= (+ .cse231 .cse223) |ULTIMATE.start_main_~A~0#1|) .cse79)) .cse117 .cse118) (or .cse111 (and (or .cse85 (= (+ .cse221 .cse230) |ULTIMATE.start_main_~A~0#1|)) (or .cse77 (= |ULTIMATE.start_main_~A~0#1| (+ .cse231 .cse221)) .cse79)))) .cse41 .cse33) (or .cse42 (and (or .cse94 (and (or .cse85 (= (+ .cse225 .cse230) |ULTIMATE.start_main_~A~0#1|)) (or .cse77 (= |ULTIMATE.start_main_~A~0#1| (+ .cse225 .cse231)) .cse79))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse224 .cse231)) .cse77 .cse79) (or .cse85 (= (+ .cse224 .cse230) |ULTIMATE.start_main_~A~0#1|))) .cse100 .cse105)) .cse35))))) (.cse149 (or .cse52 .cse53 (let ((.cse227 (* (+ .cse91 .cse93) |ULTIMATE.start_main_~B~0#1|)) (.cse226 (* (+ .cse93 .cse88) |ULTIMATE.start_main_~B~0#1|)) (.cse229 (* |ULTIMATE.start_main_~B~0#1| (+ .cse82 .cse93))) (.cse228 (* |ULTIMATE.start_main_~B~0#1| (+ .cse93 .cse81)))) (and (or (and (or .cse85 (and (or .cse100 .cse105 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse208 .cse226)) .cse87) (or .cse89 .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse208 .cse227)))) .cse102) (or (and (or .cse89 (= (+ .cse211 .cse227) |ULTIMATE.start_main_~A~0#1|) .cse90) (or .cse87 (= (+ .cse226 .cse211) |ULTIMATE.start_main_~A~0#1|))) .cse103 .cse104)) .cse106) (or .cse94 (and (or .cse97 .cse98 (and (or .cse87 (= (+ .cse226 .cse212) |ULTIMATE.start_main_~A~0#1|)) (or .cse89 .cse90 (= (+ .cse227 .cse212) |ULTIMATE.start_main_~A~0#1|)))) (or .cse96 (and (or .cse89 .cse90 (= (+ .cse213 .cse227) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse213 .cse226) |ULTIMATE.start_main_~A~0#1|) .cse87)))) .cse99))) (or (and (or .cse100 (and (or .cse102 (and (or .cse80 (= |ULTIMATE.start_main_~A~0#1| (+ .cse208 .cse228))) (or .cse83 (= (+ .cse229 .cse208) |ULTIMATE.start_main_~A~0#1|) .cse84))) (or .cse103 .cse104 (and (or (= (+ .cse211 .cse228) |ULTIMATE.start_main_~A~0#1|) .cse80) (or .cse83 (= |ULTIMATE.start_main_~A~0#1| (+ .cse229 .cse211)) .cse84)))) .cse105 .cse106) (or .cse94 .cse99 (and (or .cse97 (and (or .cse83 .cse84 (= |ULTIMATE.start_main_~A~0#1| (+ .cse229 .cse212))) (or .cse80 (= (+ .cse228 .cse212) |ULTIMATE.start_main_~A~0#1|))) .cse98) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse228)) .cse80) (or .cse83 .cse84 (= (+ .cse213 .cse229) |ULTIMATE.start_main_~A~0#1|))) .cse96)))) .cse77 .cse79)) .cse35) (or .cse30 (and (or (and (or (and (or (and (or .cse89 (= (+ .cse217 .cse227) |ULTIMATE.start_main_~A~0#1|) .cse90) (or .cse87 (= |ULTIMATE.start_main_~A~0#1| (+ .cse217 .cse226)))) .cse113 .cse114) (or .cse116 (and (or .cse89 (= |ULTIMATE.start_main_~A~0#1| (+ .cse216 .cse227)) .cse90) (or .cse87 (= (+ .cse216 .cse226) |ULTIMATE.start_main_~A~0#1|))))) .cse117 .cse118 .cse119) (or .cse111 .cse112 (and (or .cse109 (and (or (= (+ .cse218 .cse227) |ULTIMATE.start_main_~A~0#1|) .cse89 .cse90) (or .cse87 (= |ULTIMATE.start_main_~A~0#1| (+ .cse218 .cse226)))) .cse110) (or (and (or .cse89 (= (+ .cse227 .cse219) |ULTIMATE.start_main_~A~0#1|) .cse90) (or .cse87 (= |ULTIMATE.start_main_~A~0#1| (+ .cse226 .cse219)))) .cse108)))) .cse85) (or .cse77 .cse79 (and (or (and (or .cse109 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse229 .cse218)) .cse83 .cse84) (or .cse80 (= |ULTIMATE.start_main_~A~0#1| (+ .cse218 .cse228)))) .cse110) (or (and (or (= (+ .cse229 .cse219) |ULTIMATE.start_main_~A~0#1|) .cse83 .cse84) (or .cse80 (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 .cse219)))) .cse108)) .cse111 .cse112) (or (and (or .cse113 (and (or .cse83 .cse84 (= (+ .cse217 .cse229) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse217 .cse228)) .cse80)) .cse114) (or .cse116 (and (or .cse83 (= (+ .cse216 .cse229) |ULTIMATE.start_main_~A~0#1|) .cse84) (or .cse80 (= (+ .cse216 .cse228) |ULTIMATE.start_main_~A~0#1|))))) .cse117 .cse118 .cse119)))) .cse33))))) (.cse151 (or .cse51 (let ((.cse222 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse206))) (.cse220 (* |ULTIMATE.start_main_~B~0#1| (+ .cse207 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse30 (and (or .cse111 (and (or (= (+ .cse220 .cse221) |ULTIMATE.start_main_~A~0#1|) .cse70) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse221 .cse222)) .cse62 .cse63))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse223 .cse222)) .cse62 .cse63) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse220 .cse223)) .cse70)) .cse117 .cse118)) .cse41 .cse33) (or .cse42 (and (or .cse100 .cse105 (and (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse224 .cse222)) .cse63) (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse224 .cse220))))) (or .cse94 (and (or (= (+ .cse225 .cse222) |ULTIMATE.start_main_~A~0#1|) .cse62 .cse63) (or (= (+ .cse225 .cse220) |ULTIMATE.start_main_~A~0#1|) .cse70)))) .cse35))))) (.cse154 (or (let ((.cse214 (* |ULTIMATE.start_main_~B~0#1| (+ .cse76 .cse68))) (.cse215 (* |ULTIMATE.start_main_~B~0#1| (+ .cse66 .cse76))) (.cse210 (* |ULTIMATE.start_main_~B~0#1| (+ .cse59 .cse76))) (.cse209 (* (+ .cse76 .cse60) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse35 (and (or (and (or (and (or .cse102 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse208 .cse209)) .cse61) (or .cse57 .cse58 (= |ULTIMATE.start_main_~A~0#1| (+ .cse208 .cse210))))) (or .cse103 .cse104 (and (or .cse61 (= (+ .cse209 .cse211) |ULTIMATE.start_main_~A~0#1|)) (or .cse57 .cse58 (= |ULTIMATE.start_main_~A~0#1| (+ .cse210 .cse211)))))) .cse100 .cse105 .cse106) (or .cse94 .cse99 (and (or .cse97 (and (or .cse57 .cse58 (= |ULTIMATE.start_main_~A~0#1| (+ .cse210 .cse212))) (or (= (+ .cse209 .cse212) |ULTIMATE.start_main_~A~0#1|) .cse61)) .cse98) (or (and (or .cse57 (= (+ .cse213 .cse210) |ULTIMATE.start_main_~A~0#1|) .cse58) (or .cse61 (= (+ .cse213 .cse209) |ULTIMATE.start_main_~A~0#1|))) .cse96)))) .cse62 .cse63) (or (and (or .cse100 (and (or .cse103 .cse104 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse214)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse215)) .cse65 .cse67))) (or (and (or .cse65 .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse208 .cse215))) (or .cse69 (= (+ .cse208 .cse214) |ULTIMATE.start_main_~A~0#1|))) .cse102)) .cse105 .cse106) (or .cse94 (and (or (and (or .cse65 .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse215))) (or (= (+ .cse213 .cse214) |ULTIMATE.start_main_~A~0#1|) .cse69)) .cse96) (or .cse97 (and (or (= (+ .cse212 .cse214) |ULTIMATE.start_main_~A~0#1|) .cse69) (or (= (+ .cse212 .cse215) |ULTIMATE.start_main_~A~0#1|) .cse65 .cse67)) .cse98)) .cse99)) .cse70))) (or .cse30 (and (or (and (or (and (or .cse116 (and (or .cse69 (= (+ .cse216 .cse214) |ULTIMATE.start_main_~A~0#1|)) (or .cse65 (= (+ .cse216 .cse215) |ULTIMATE.start_main_~A~0#1|) .cse67))) (or .cse113 (and (or .cse65 (= |ULTIMATE.start_main_~A~0#1| (+ .cse217 .cse215)) .cse67) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse217 .cse214)) .cse69)) .cse114)) .cse117 .cse118 .cse119) (or (and (or .cse109 (and (or (= (+ .cse218 .cse214) |ULTIMATE.start_main_~A~0#1|) .cse69) (or .cse65 (= |ULTIMATE.start_main_~A~0#1| (+ .cse218 .cse215)) .cse67)) .cse110) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse214 .cse219)) .cse69) (or .cse65 (= (+ .cse215 .cse219) |ULTIMATE.start_main_~A~0#1|) .cse67)) .cse108)) .cse111 .cse112)) .cse70) (or (and (or (and (or (and (or (= (+ .cse216 .cse210) |ULTIMATE.start_main_~A~0#1|) .cse57 .cse58) (or .cse61 (= (+ .cse216 .cse209) |ULTIMATE.start_main_~A~0#1|))) .cse116) (or .cse113 .cse114 (and (or .cse57 .cse58 (= |ULTIMATE.start_main_~A~0#1| (+ .cse217 .cse210))) (or .cse61 (= |ULTIMATE.start_main_~A~0#1| (+ .cse217 .cse209)))))) .cse117 .cse118 .cse119) (or (and (or (and (or .cse61 (= (+ .cse209 .cse219) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse210 .cse219) |ULTIMATE.start_main_~A~0#1|) .cse57 .cse58)) .cse108) (or .cse109 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse218 .cse210)) .cse57 .cse58) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse218 .cse209)) .cse61)) .cse110)) .cse111 .cse112)) .cse62 .cse63)) .cse33))) .cse51)) (.cse155 (or (let ((.cse205 (* (+ .cse207 .cse38) |ULTIMATE.start_main_~B~0#1|)) (.cse204 (* (+ .cse38 .cse206) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse35 (and (or (and (or .cse62 .cse63 (= (+ .cse204 .cse196) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse196 .cse205)) .cse70)) .cse100 .cse105) (or .cse94 (and (or .cse70 (= (+ .cse199 .cse205) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse204 .cse199) |ULTIMATE.start_main_~A~0#1|) .cse62 .cse63)))) .cse36) (or .cse30 (and (or (and (or (= (+ .cse200 .cse204) |ULTIMATE.start_main_~A~0#1|) .cse62 .cse63) (or (= (+ .cse200 .cse205) |ULTIMATE.start_main_~A~0#1|) .cse70)) .cse117 .cse118) (or (and (or (= (+ .cse205 .cse201) |ULTIMATE.start_main_~A~0#1|) .cse70) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse204 .cse201)) .cse62 .cse63)) .cse111)) .cse31 .cse33))) .cse51)) (.cse156 (or .cse52 (let ((.cse197 (* (+ .cse203 .cse38) |ULTIMATE.start_main_~B~0#1|)) (.cse198 (* (+ .cse38 .cse202) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse35 .cse36 (and (or .cse100 (and (or .cse77 .cse79 (= |ULTIMATE.start_main_~A~0#1| (+ .cse196 .cse197))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse196 .cse198)) .cse85)) .cse105) (or .cse94 (and (or .cse77 (= |ULTIMATE.start_main_~A~0#1| (+ .cse199 .cse197)) .cse79) (or (= (+ .cse198 .cse199) |ULTIMATE.start_main_~A~0#1|) .cse85))))) (or .cse30 .cse31 (and (or (and (or .cse77 (= |ULTIMATE.start_main_~A~0#1| (+ .cse200 .cse197)) .cse79) (or .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse200 .cse198)))) .cse117 .cse118) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse197 .cse201)) .cse77 .cse79) (or .cse85 (= (+ .cse198 .cse201) |ULTIMATE.start_main_~A~0#1|))) .cse111)) .cse33))) .cse53))) (or (and .cse145 .cse146 .cse147 .cse148 .cse149 .cse134 .cse150 .cse135 .cse151 .cse152 .cse153 .cse154 .cse155 .cse156) (and .cse145 .cse147 .cse134 .cse150 .cse135 .cse151 .cse152) (and .cse147 .cse134 .cse150 .cse135 .cse152) (and .cse147 .cse134 .cse150 .cse135 .cse152 .cse153 (or .cse157 (let ((.cse187 (div .cse193 4))) (let ((.cse192 (+ .cse187 1))) (let ((.cse169 (= (mod .cse187 2) 0)) (.cse189 (< .cse187 0)) (.cse188 (- (div .cse193 8))) (.cse159 (= (mod .cse192 2) 0)) (.cse191 (< .cse192 0)) (.cse190 (- (div .cse192 2)))) (let ((.cse158 (>= .cse39 .cse192)) (.cse163 (+ .cse39 (+ (- 1) .cse190))) (.cse160 (not .cse191)) (.cse168 (and .cse191 (not .cse159))) (.cse167 (+ .cse190 .cse39)) (.cse171 (+ (+ (- 1) .cse188) .cse39)) (.cse170 (not .cse189)) (.cse172 (and (not .cse169) .cse189)) (.cse173 (+ .cse188 .cse39)) (.cse174 (>= .cse39 .cse187)) (.cse178 (div .cse186 4))) (and (or .cse52 .cse53 (let ((.cse177 (+ .cse178 1))) (let ((.cse161 (= (mod .cse177 2) 0)) (.cse175 (< .cse177 0)) (.cse176 (div .cse177 2))) (let ((.cse164 (* |ULTIMATE.start_main_~B~0#1| (+ (+ .cse176 1) .cse38))) (.cse162 (not .cse175)) (.cse165 (* |ULTIMATE.start_main_~B~0#1| (+ .cse38 .cse176))) (.cse166 (and (not .cse161) .cse175))) (and (or .cse30 .cse158 (and (or .cse159 .cse160 (and (or .cse161 .cse162 (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse164))) (or (= (+ .cse165 .cse163) |ULTIMATE.start_main_~A~0#1|) .cse166))) (or (and (or .cse161 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse164)) .cse162) (or (= (+ .cse165 .cse167) |ULTIMATE.start_main_~A~0#1|) .cse166)) .cse168)) .cse33) (or (and (or .cse169 .cse170 (and (or .cse161 .cse162 (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse164))) (or (= (+ .cse165 .cse171) |ULTIMATE.start_main_~A~0#1|) .cse166))) (or .cse172 (and (or .cse161 (= (+ .cse173 .cse164) |ULTIMATE.start_main_~A~0#1|) .cse162) (or (= (+ .cse173 .cse165) |ULTIMATE.start_main_~A~0#1|) .cse166)))) .cse35 .cse174)))))) (or (let ((.cse184 (div .cse186 8)) (.cse179 (= (mod .cse178 2) 0)) (.cse185 (< .cse178 0))) (let ((.cse183 (and (not .cse179) .cse185)) (.cse182 (* (+ .cse184 .cse38) |ULTIMATE.start_main_~B~0#1|)) (.cse180 (not .cse185)) (.cse181 (* |ULTIMATE.start_main_~B~0#1| (+ (+ .cse184 1) .cse38)))) (and (or .cse30 .cse158 (and (or (and (or .cse179 .cse180 (= (+ .cse163 .cse181) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse163 .cse182) |ULTIMATE.start_main_~A~0#1|) .cse183)) .cse159 .cse160) (or .cse168 (and (or .cse179 .cse180 (= (+ .cse181 .cse167) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse167 .cse182) |ULTIMATE.start_main_~A~0#1|) .cse183)))) .cse33) (or (and (or (and (or .cse183 (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse182))) (or .cse179 .cse180 (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse181)))) .cse169 .cse170) (or .cse172 (and (or .cse183 (= (+ .cse173 .cse182) |ULTIMATE.start_main_~A~0#1|)) (or .cse179 .cse180 (= (+ .cse173 .cse181) |ULTIMATE.start_main_~A~0#1|))))) .cse35 .cse174)))) .cse51)))))))) (let ((.cse194 (+ .cse20 .cse195 |ULTIMATE.start_main_~A~0#1|))) (and .cse145 (not (>= (+ .cse194 |ULTIMATE.start_main_~r~0#1|) .cse10)) .cse146 .cse148 .cse149 (= .cse194 |ULTIMATE.start_main_~B~0#1|) .cse134 (= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 1) .cse135 .cse151 .cse152 .cse154 .cse143 .cse8 .cse155 .cse156))))))) (.cse6 (* 2 1)) (.cse16 (* |ULTIMATE.start_main_~B~0#1| 4)) (.cse1 (or (not .cse4) .cse144)) (.cse2 (+ .cse0 1)) (.cse3 (not .cse144))) (or (and (or (and (= |ULTIMATE.start_main_~d~0#1| .cse0) .cse1) (and (= |ULTIMATE.start_main_~d~0#1| .cse2) .cse3 .cse4)) .cse5 (= (+ (* (- 1) .cse6) |ULTIMATE.start_main_~q~0#1|) 0) .cse7 .cse8 (= .cse9 .cse10)) (and .cse5 .cse11 .cse12 .cse13 .cse8) (let ((.cse17 (+ .cse20 |ULTIMATE.start_main_~A~0#1|))) (and .cse5 .cse14 .cse11 .cse15 (>= (+ .cse16 .cse17) .cse18) (not (>= .cse17 .cse10)) (= |ULTIMATE.start_main_~r~0#1| (+ .cse19 .cse17)) (= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~p~0#1| 4)) .cse8)) (and .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse27 .cse11 .cse28) (and .cse5 .cse11 .cse28 .cse8) (and .cse5 .cse11 .cse12 .cse15 .cse13 .cse8) (let ((.cse37 (* |ULTIMATE.start_main_~B~0#1| 1))) (let ((.cse29 (and (or .cse124 .cse125 .cse52 .cse53) (or .cse126 .cse51 .cse127))) (.cse32 (and (or .cse111 (not (= .cse37 .cse122))) (or (not (= .cse37 .cse123)) .cse117 .cse118))) (.cse34 (and (or .cse100 (not (= .cse37 .cse120)) .cse105) (or .cse94 (not (= .cse37 .cse121))))) (.cse40 (= (+ |ULTIMATE.start_main_~r~0#1| (* .cse37 |ULTIMATE.start_main_~q~0#1|)) |ULTIMATE.start_main_~A~0#1|)) (.cse74 (and (or (and (or (not (= .cse37 .cse107)) .cse108) (or .cse109 (not (= .cse37 (+ .cse107 1))) .cse110)) .cse111 .cse112) (or (and (or .cse113 .cse114 (not (= .cse37 (+ .cse115 1)))) (or .cse116 (not (= .cse37 .cse115)))) .cse117 .cse118 .cse119))) (.cse73 (and (or .cse94 (and (or (not (= .cse37 .cse95)) .cse96) (or .cse97 .cse98 (not (= .cse37 (+ .cse95 1))))) .cse99) (or .cse100 (and (or (not (= .cse37 .cse101)) .cse102) (or .cse103 .cse104 (not (= .cse37 (+ .cse101 1))))) .cse105 .cse106)))) (and (or .cse29 (and (or .cse30 .cse31 .cse32 .cse33) (or .cse34 .cse35 .cse36)) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse37 .cse38) .cse39))) .cse14 (or .cse29 .cse40 (and (or .cse30 .cse32 .cse41 .cse33) (or .cse42 .cse34 .cse35))) (or .cse43 (and (or .cse30 (not (= .cse37 .cse44)) .cse33) (or (not (= .cse45 .cse37)) .cse35)) .cse5 .cse40) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse37 .cse46) .cse47)) .cse48 .cse5 .cse49 (and (or (not (= .cse50 1)) .cse51) (or .cse52 .cse53 (not (= .cse54 1)))) (and (or (not (= .cse37 .cse55)) .cse35) (or .cse30 (not (= (+ .cse55 1) .cse37)) .cse33))) .cse15 (or (and (or .cse56 (and (or .cse57 .cse58 (not (= .cse59 1))) (or (not (= 1 .cse60)) .cse61)) .cse62 .cse63) (or .cse64 (and (or .cse65 (not (= .cse66 1)) .cse67) (or (not (= .cse68 1)) .cse69)) .cse70)) (let ((.cse71 (* .cse37 .cse76))) (and (or (= (+ .cse71 .cse72) |ULTIMATE.start_main_~A~0#1|) .cse35 .cse73) (or .cse30 .cse74 (= (+ .cse75 .cse71) |ULTIMATE.start_main_~A~0#1|) .cse33))) .cse51) .cse26 .cse8 (or (and (or .cse77 .cse78 .cse79 (and (or .cse80 (not (= .cse81 1))) (or (not (= .cse82 1)) .cse83 .cse84))) (or .cse85 .cse86 (and (or .cse87 (not (= .cse88 1))) (or .cse89 .cse90 (not (= .cse91 1)))))) .cse52 (let ((.cse92 (* .cse93 .cse37))) (and (or .cse30 .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse75 .cse92)) .cse33) (or .cse35 (= (+ .cse72 .cse92) |ULTIMATE.start_main_~A~0#1|) .cse73))) .cse53)))) (let ((.cse132 (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) .cse133)))) (and (let ((.cse130 (< .cse132 0)) (.cse128 (div (+ |ULTIMATE.start_main_~A~0#1| .cse131 .cse19) 2)) (.cse129 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0))) (or (and (= .cse128 |ULTIMATE.start_main_~d~0#1|) (or .cse129 (not .cse130))) (and .cse130 (= |ULTIMATE.start_main_~d~0#1| (+ .cse128 1)) (not .cse129)))) .cse5 (= 2 .cse132) (>= .cse133 |ULTIMATE.start_main_~d~0#1|) .cse22 (not (>= (+ .cse133 .cse132) (* 2 .cse6))) (= (+ (* (- 1) 2) (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|)) 0))) (and (= (+ 4 0) |ULTIMATE.start_main_~q~0#1|) .cse5 (= .cse9 .cse16) .cse134 .cse135 (or (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse0)) .cse1 (let ((.cse138 (= (mod .cse0 2) 0)) (.cse136 (< .cse0 0)) (.cse137 (div .cse139 4))) (or (and .cse136 (= (+ .cse137 1) |ULTIMATE.start_main_~d~0#1|) (not .cse138)) (and (or .cse138 (not .cse136)) (= |ULTIMATE.start_main_~d~0#1| .cse137))))) (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse2)) (let ((.cse141 (= (mod .cse2 2) 0)) (.cse140 (< .cse2 0)) (.cse142 (div .cse2 2))) (or (and .cse140 (not .cse141) (= (+ .cse142 1) |ULTIMATE.start_main_~d~0#1|)) (and (or .cse141 (not .cse140)) (= .cse142 |ULTIMATE.start_main_~d~0#1|)))) .cse3 .cse4)) .cse143 .cse8)))))))))))) [2023-02-18 03:06:39,450 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 61) the Hoare annotation is: true [2023-02-18 03:06:39,453 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse245 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse178 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse247 (- .cse178)) (.cse214 (+ .cse245 1))) (let ((.cse177 (+ .cse178 1)) (.cse84 (div .cse214 2)) (.cse110 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse172 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse15 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse103 (+ |ULTIMATE.start_main_~q~0#1| .cse214)) (.cse257 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse44 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse145 (+ |ULTIMATE.start_main_~q~0#1| .cse245)) (.cse246 (+ (- 1) .cse247)) (.cse256 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse174 (- |ULTIMATE.start_main_~d~0#1|))) (let ((.cse203 (= .cse245 1)) (.cse201 (= .cse214 1)) (.cse5 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse25 (+ |ULTIMATE.start_main_~r~0#1| .cse174)) (.cse83 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse24 (not .cse256)) (.cse99 (+ |ULTIMATE.start_main_~r~0#1| .cse246)) (.cse252 (* |ULTIMATE.start_main_~B~0#1| .cse145)) (.cse43 (and .cse257 (not .cse44))) (.cse253 (* .cse103 |ULTIMATE.start_main_~B~0#1|)) (.cse101 (+ |ULTIMATE.start_main_~r~0#1| .cse247)) (.cse45 (not .cse257)) (.cse36 (and (not .cse15) .cse256)) (.cse250 (not .cse172)) (.cse67 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse109 (+ .cse110 1)) (.cse254 (< .cse245 0)) (.cse105 (= (mod .cse245 2) 0)) (.cse69 (= (mod .cse214 2) 0)) (.cse255 (< .cse214 0)) (.cse85 (+ .cse84 1)) (.cse198 (div .cse177 2)) (.cse197 (div |ULTIMATE.start_main_~d~0#1| 4))) (let ((.cse196 (+ .cse197 1)) (.cse199 (+ .cse198 1)) (.cse188 (- .cse198)) (.cse187 (- .cse197)) (.cse68 (= (mod .cse178 2) 0)) (.cse248 (< .cse178 0)) (.cse249 (< .cse177 0)) (.cse79 (= (mod .cse177 2) 0)) (.cse86 (= .cse85 1)) (.cse70 (not .cse255)) (.cse74 (and .cse255 (not .cse69))) (.cse92 (= .cse84 1)) (.cse151 (= .cse110 1)) (.cse108 (and .cse254 (not .cse105))) (.cse150 (= .cse109 1)) (.cse104 (not .cse254)) (.cse42 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse35 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse215 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse19 (or .cse250 .cse67)) (.cse17 (or (and (or (= (+ .cse252 .cse101) |ULTIMATE.start_main_~A~0#1|) .cse43) (or (= (+ .cse253 .cse101) |ULTIMATE.start_main_~A~0#1|) .cse44 .cse45)) .cse36)) (.cse0 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse18 (or .cse24 (and (or .cse43 (= (+ .cse99 .cse252) |ULTIMATE.start_main_~A~0#1|)) (or .cse44 .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse253 .cse99)))) .cse15)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse4 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse54 (= |ULTIMATE.start_main_~A~0#1| (+ .cse25 (* |ULTIMATE.start_main_~B~0#1| .cse83)))) (.cse6 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse7 (or .cse5 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0) (not .cse5)))) (.cse176 (and (or (not .cse203) .cse43) (or .cse44 .cse45 (not .cse201))))) (let ((.cse1 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse37 (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse8 (let ((.cse251 (or .cse176 (and (or .cse24 .cse15 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse177)) |ULTIMATE.start_main_~A~0#1|)) (or .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse178 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse17 .cse0 .cse18 .cse19 .cse251 .cse3 .cse4 .cse5 .cse54 .cse6 .cse7) (and .cse17 .cse0 .cse18 .cse251 .cse3 .cse4 .cse5 .cse54 .cse67 .cse6 .cse7)))) (.cse9 (or .cse176 (and (or (= .cse178 |ULTIMATE.start_main_~B~0#1|) .cse36) (or .cse24 (= |ULTIMATE.start_main_~B~0#1| .cse177) .cse15)))) (.cse12 (<= 2 .cse178)) (.cse14 (or .cse250 .cse215)) (.cse158 (+ (- .cse35) |ULTIMATE.start_main_~r~0#1|)) (.cse161 (+ |ULTIMATE.start_main_~q~0#1| .cse42)) (.cse202 (and (or (not .cse151) .cse108) (or (not .cse150) .cse104 .cse105))) (.cse66 (>= .cse25 .cse178)) (.cse63 (>= .cse25 .cse177)) (.cse169 (>= |ULTIMATE.start_main_~r~0#1| .cse177)) (.cse10 (>= |ULTIMATE.start_main_~r~0#1| .cse178)) (.cse200 (and (or (not .cse86) .cse69 .cse70) (or .cse74 (not .cse92)))) (.cse82 (and .cse249 (not .cse79))) (.cse80 (not .cse249)) (.cse76 (and (not .cse68) .cse248)) (.cse75 (not .cse248)) (.cse186 (+ (- 1) .cse187)) (.cse189 (+ (- 1) .cse188)) (.cse138 (>= .cse99 .cse199)) (.cse144 (>= .cse99 .cse198)) (.cse122 (>= .cse101 .cse197)) (.cse121 (>= .cse101 .cse196)) (.cse2 (* 2 1))) (let ((.cse22 (<= 8 |ULTIMATE.start_main_~p~0#1|)) (.cse13 (* 2 .cse2)) (.cse56 (let ((.cse233 (not .cse121)) (.cse234 (not .cse122)) (.cse236 (not .cse144)) (.cse228 (+ .cse99 .cse188)) (.cse237 (not .cse138)) (.cse226 (+ .cse99 .cse189)) (.cse227 (* (+ .cse103 .cse84) |ULTIMATE.start_main_~B~0#1|)) (.cse225 (* (+ .cse85 .cse103) |ULTIMATE.start_main_~B~0#1|)) (.cse235 (+ .cse187 .cse101)) (.cse230 (* (+ .cse110 .cse145) |ULTIMATE.start_main_~B~0#1|)) (.cse231 (+ .cse186 .cse101)) (.cse229 (* (+ .cse109 .cse145) |ULTIMATE.start_main_~B~0#1|)) (.cse238 (+ .cse25 .cse247)) (.cse240 (+ .cse25 .cse246))) (let ((.cse218 (or .cse172 (let ((.cse244 (* (+ .cse83 .cse214) |ULTIMATE.start_main_~B~0#1|)) (.cse243 (* (+ .cse83 .cse245) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse243 .cse238) |ULTIMATE.start_main_~A~0#1|) .cse43) (or .cse44 .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse238 .cse244)))) .cse36) (or .cse24 (and (or .cse44 (= |ULTIMATE.start_main_~A~0#1| (+ .cse240 .cse244)) .cse45) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse240 .cse243)) .cse43)) .cse15))))) (.cse219 (or (and (or .cse201 .cse44 .cse45 (and (or .cse68 .cse75 (and (or .cse69 (= (+ .cse231 .cse225) |ULTIMATE.start_main_~A~0#1|) .cse70) (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse231))))) (or .cse76 (and (or .cse74 (= (+ .cse227 .cse235) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse225 .cse235)) .cse69 .cse70))))) (or (and (or .cse76 (and (or (= (+ .cse230 .cse235) |ULTIMATE.start_main_~A~0#1|) .cse108) (or (= (+ .cse235 .cse229) |ULTIMATE.start_main_~A~0#1|) .cse104 .cse105))) (or (and (or .cse108 (= (+ .cse230 .cse231) |ULTIMATE.start_main_~A~0#1|)) (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse231 .cse229)))) .cse68 .cse75)) .cse43 .cse203)) .cse36)) (.cse220 (or .cse172 (and .cse17 .cse18))) (.cse216 (or .cse200 .cse44 (let ((.cse242 (+ .cse103 1))) (and (or .cse36 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse231 (* .cse242 .cse196))) .cse68 .cse75 .cse233) (or .cse76 .cse234 (= (+ (* .cse242 .cse197) .cse235) |ULTIMATE.start_main_~A~0#1|)))) (or .cse24 (and (or .cse236 (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 (* .cse242 .cse198))) .cse82) (or .cse237 .cse79 .cse80 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse242 .cse199) .cse226)))) .cse15))) .cse45)) (.cse221 (or .cse176 (let ((.cse241 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse24 (not .cse169) .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse99 (* .cse241 .cse177)))) (or (not .cse10) .cse36 (= (+ (* .cse178 .cse241) .cse101) |ULTIMATE.start_main_~A~0#1|)))))) (.cse222 (or .cse176 (let ((.cse239 (+ .cse83 1))) (and (or (not .cse66) .cse36 (= (+ .cse238 (* .cse178 .cse239)) |ULTIMATE.start_main_~A~0#1|)) (or .cse24 (not .cse63) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse239 .cse177) .cse240)) .cse15))))) (.cse217 (or .cse202 (let ((.cse232 (+ .cse145 1))) (and (or .cse36 (and (or (= (+ .cse231 (* .cse232 .cse196)) |ULTIMATE.start_main_~A~0#1|) .cse68 .cse75 .cse233) (or .cse76 .cse234 (= (+ .cse235 (* .cse232 .cse197)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse24 (and (or .cse236 .cse82 (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 (* .cse232 .cse198)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse232 .cse199) .cse226)) .cse237 .cse79 .cse80)) .cse15))) .cse43)) (.cse223 (or (= .cse42 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ .cse158 .cse174) (* |ULTIMATE.start_main_~B~0#1| (+ .cse161 |ULTIMATE.start_main_~p~0#1|)))))) (.cse224 (or .cse24 .cse15 (and (or .cse201 .cse44 .cse45 (and (or (and (or (= (+ .cse225 .cse226) |ULTIMATE.start_main_~A~0#1|) .cse69 .cse70) (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse226)))) .cse79 .cse80) (or .cse82 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 .cse225)) .cse69 .cse70) (or .cse74 (= (+ .cse228 .cse227) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse104 .cse105 (= (+ .cse228 .cse229) |ULTIMATE.start_main_~A~0#1|)) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 .cse230)))) .cse82) (or .cse79 .cse80 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse226 .cse229)) .cse104 .cse105) (or (= (+ .cse230 .cse226) |ULTIMATE.start_main_~A~0#1|) .cse108)))) .cse43 .cse203))))) (or (and (or .cse37 (and .cse216 .cse217)) .cse8 .cse9 .cse0 .cse218 .cse10 .cse19 .cse219 .cse12 .cse220 .cse221 .cse222 .cse54 .cse223 .cse14 .cse224 .cse15) (and .cse8 .cse9 .cse0 .cse218 .cse10 .cse19 .cse219 .cse12 .cse220 .cse216 .cse221 .cse222 .cse54 .cse217 .cse223 .cse14 .cse224 .cse15) (and .cse8 .cse9 .cse0 .cse218 .cse10 .cse219 .cse12 .cse220 .cse216 .cse221 .cse222 .cse54 .cse217 .cse223 .cse67 .cse14 .cse224 .cse15))))) (.cse11 (* 2 .cse1))) (or (and .cse0 (= |ULTIMATE.start_main_~d~0#1| .cse1) (= |ULTIMATE.start_main_~d~0#1| .cse2) (<= 2 |ULTIMATE.start_main_~p~0#1|) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~p~0#1| .cse2)) (and (<= 4 |ULTIMATE.start_main_~p~0#1|) .cse8 .cse9 .cse0 .cse10 (= .cse11 |ULTIMATE.start_main_~d~0#1|) .cse12 (= |ULTIMATE.start_main_~p~0#1| .cse13) .cse3 (= |ULTIMATE.start_main_~d~0#1| .cse13) .cse4 .cse5 .cse6 .cse14 .cse15) (and .cse0 .cse4 .cse5 (let ((.cse210 (< .cse196 0)) (.cse119 (= (mod .cse196 2) 0)) (.cse123 (= (mod .cse197 2) 0)) (.cse211 (< .cse197 0)) (.cse137 (= (mod .cse199 2) 0)) (.cse212 (< .cse199 0)) (.cse141 (= (mod .cse198 2) 0)) (.cse213 (< .cse198 0)) (.cse207 (div .cse196 2)) (.cse206 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse204 (div .cse177 4)) (.cse205 (div .cse199 2))) (let ((.cse94 (div .cse214 4)) (.cse88 (div .cse85 2)) (.cse90 (= (mod .cse85 2) 0)) (.cse191 (< .cse85 0)) (.cse190 (- .cse205)) (.cse192 (- .cse204)) (.cse95 (= (mod .cse84 2) 0)) (.cse193 (< .cse84 0)) (.cse194 (- .cse206)) (.cse195 (- .cse207)) (.cse162 (div (* |ULTIMATE.start_main_~p~0#1| 4) 8)) (.cse143 (and (not .cse141) .cse213)) (.cse139 (not .cse213)) (.cse135 (not .cse212)) (.cse133 (and (not .cse137) .cse212)) (.cse127 (and (not .cse123) .cse211)) (.cse125 (not .cse211)) (.cse111 (and .cse210 (not .cse119))) (.cse118 (not .cse210)) (.cse29 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse131 (= (mod .cse110 2) 0)) (.cse208 (< .cse110 0)) (.cse149 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse115 (= (mod .cse109 2) 0)) (.cse146 (div .cse109 2)) (.cse209 (< .cse109 0))) (let ((.cse71 (+ .cse25 .cse186)) (.cse77 (+ .cse187 .cse25)) (.cse78 (+ .cse189 .cse25)) (.cse81 (+ .cse25 .cse188)) (.cse116 (not .cse209)) (.cse147 (+ 1 .cse146)) (.cse114 (and (not .cse115) .cse209)) (.cse148 (+ .cse149 1)) (.cse132 (not .cse208)) (.cse129 (and (not .cse131) .cse208)) (.cse102 (and (or .cse76 (and (or (not (= .cse29 .cse206)) .cse127) (or .cse123 .cse125 (not (= .cse29 (+ .cse206 1))))) .cse122) (or .cse68 (and (or (not (= .cse29 .cse207)) .cse111) (or .cse118 .cse119 (not (= .cse29 (+ .cse207 1))))) .cse75 .cse121))) (.cse98 (and (or (and (or (not (= .cse29 .cse204)) .cse143) (or .cse139 (not (= .cse29 (+ .cse204 1))) .cse141)) .cse82 .cse144) (or (and (or .cse135 .cse137 (not (= .cse29 (+ .cse205 1)))) (or .cse133 (not (= .cse29 .cse205)))) .cse79 .cse80 .cse138))) (.cse153 (>= .cse158 |ULTIMATE.start_main_~d~0#1|)) (.cse164 (not (>= |ULTIMATE.start_main_~r~0#1| .cse35))) (.cse163 (+ .cse162 1)) (.cse160 (div (* |ULTIMATE.start_main_~d~0#1| 4) 8)) (.cse62 (and (or .cse200 .cse201 .cse44 .cse45) (or .cse202 .cse43 .cse203))) (.cse179 (= (+ |ULTIMATE.start_main_~r~0#1| (* .cse29 |ULTIMATE.start_main_~q~0#1|)) |ULTIMATE.start_main_~A~0#1|)) (.cse64 (and (or .cse82 (not (= .cse29 .cse198))) (or (not (= .cse29 .cse199)) .cse79 .cse80))) (.cse65 (and (or .cse68 (not (= .cse29 .cse196)) .cse75) (or .cse76 (not (= .cse29 .cse197))))) (.cse112 (+ .cse101 .cse195)) (.cse120 (+ (+ (- 1) .cse195) .cse101)) (.cse124 (+ (+ (- 1) .cse194) .cse101)) (.cse126 (+ .cse101 .cse194)) (.cse96 (not .cse193)) (.cse93 (and (not .cse95) .cse193)) (.cse140 (+ .cse99 (+ (- 1) .cse192))) (.cse142 (+ .cse192 .cse99)) (.cse136 (+ .cse99 (+ (- 1) .cse190))) (.cse91 (not .cse191)) (.cse87 (and (not .cse90) .cse191)) (.cse134 (+ .cse99 .cse190)) (.cse89 (+ .cse88 1)) (.cse97 (+ .cse94 1)) (.cse168 (+ .cse189 |ULTIMATE.start_main_~r~0#1|)) (.cse166 (+ |ULTIMATE.start_main_~r~0#1| .cse188)) (.cse171 (+ .cse187 |ULTIMATE.start_main_~r~0#1|)) (.cse170 (+ .cse186 |ULTIMATE.start_main_~r~0#1|))) (let ((.cse50 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse29 .cse83) .cse25))) (.cse16 (or .cse44 .cse45 (let ((.cse185 (* |ULTIMATE.start_main_~B~0#1| (+ .cse85 |ULTIMATE.start_main_~q~0#1|))) (.cse184 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse84)))) (and (or .cse24 (and (or (and (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse168 .cse184))) (or .cse69 (= (+ .cse185 .cse168) |ULTIMATE.start_main_~A~0#1|) .cse70)) .cse79 .cse80) (or .cse82 (and (or .cse74 (= (+ .cse166 .cse184) |ULTIMATE.start_main_~A~0#1|)) (or .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse185 .cse166)) .cse70)))) .cse169 .cse15) (or .cse10 (and (or .cse76 (and (or .cse74 (= (+ .cse171 .cse184) |ULTIMATE.start_main_~A~0#1|)) (or .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse185)) .cse70))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse170 .cse185)) .cse69 .cse70) (or .cse74 (= (+ .cse170 .cse184) |ULTIMATE.start_main_~A~0#1|))) .cse68 .cse75)) .cse36))))) (.cse20 (or .cse44 .cse45 (let ((.cse181 (* (+ .cse97 .cse103) |ULTIMATE.start_main_~B~0#1|)) (.cse180 (* (+ .cse103 .cse94) |ULTIMATE.start_main_~B~0#1|)) (.cse183 (* |ULTIMATE.start_main_~B~0#1| (+ .cse89 .cse103))) (.cse182 (* |ULTIMATE.start_main_~B~0#1| (+ .cse103 .cse88)))) (and (or (and (or .cse74 (and (or .cse68 .cse75 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse180)) .cse93) (or .cse95 .cse96 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse181)))) .cse111) (or (and (or .cse95 (= (+ .cse120 .cse181) |ULTIMATE.start_main_~A~0#1|) .cse96) (or .cse93 (= (+ .cse180 .cse120) |ULTIMATE.start_main_~A~0#1|))) .cse118 .cse119)) .cse121) (or .cse76 (and (or .cse123 .cse125 (and (or .cse93 (= (+ .cse180 .cse124) |ULTIMATE.start_main_~A~0#1|)) (or .cse95 .cse96 (= (+ .cse181 .cse124) |ULTIMATE.start_main_~A~0#1|)))) (or .cse127 (and (or .cse95 .cse96 (= (+ .cse126 .cse181) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse126 .cse180) |ULTIMATE.start_main_~A~0#1|) .cse93)))) .cse122))) (or (and (or .cse68 (and (or .cse111 (and (or .cse87 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse182))) (or .cse90 (= (+ .cse183 .cse112) |ULTIMATE.start_main_~A~0#1|) .cse91))) (or .cse118 .cse119 (and (or (= (+ .cse120 .cse182) |ULTIMATE.start_main_~A~0#1|) .cse87) (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse120)) .cse91)))) .cse75 .cse121) (or .cse76 .cse122 (and (or .cse123 (and (or .cse90 .cse91 (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse124))) (or .cse87 (= (+ .cse182 .cse124) |ULTIMATE.start_main_~A~0#1|))) .cse125) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse126 .cse182)) .cse87) (or .cse90 .cse91 (= (+ .cse126 .cse183) |ULTIMATE.start_main_~A~0#1|))) .cse127)))) .cse69 .cse70)) .cse36) (or .cse24 (and (or (and (or (and (or (and (or .cse95 (= (+ .cse136 .cse181) |ULTIMATE.start_main_~A~0#1|) .cse96) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse180)))) .cse135 .cse137) (or .cse133 (and (or .cse95 (= |ULTIMATE.start_main_~A~0#1| (+ .cse134 .cse181)) .cse96) (or .cse93 (= (+ .cse134 .cse180) |ULTIMATE.start_main_~A~0#1|))))) .cse79 .cse80 .cse138) (or .cse82 .cse144 (and (or .cse139 (and (or (= (+ .cse140 .cse181) |ULTIMATE.start_main_~A~0#1|) .cse95 .cse96) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse180)))) .cse141) (or (and (or .cse95 (= (+ .cse181 .cse142) |ULTIMATE.start_main_~A~0#1|) .cse96) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse180 .cse142)))) .cse143)))) .cse74) (or .cse69 .cse70 (and (or (and (or .cse139 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse140)) .cse90 .cse91) (or .cse87 (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse182)))) .cse141) (or (and (or (= (+ .cse183 .cse142) |ULTIMATE.start_main_~A~0#1|) .cse90 .cse91) (or .cse87 (= |ULTIMATE.start_main_~A~0#1| (+ .cse182 .cse142)))) .cse143)) .cse82 .cse144) (or (and (or .cse135 (and (or .cse90 .cse91 (= (+ .cse136 .cse183) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse182)) .cse87)) .cse137) (or .cse133 (and (or .cse90 (= (+ .cse134 .cse183) |ULTIMATE.start_main_~A~0#1|) .cse91) (or .cse87 (= (+ .cse134 .cse182) |ULTIMATE.start_main_~A~0#1|))))) .cse79 .cse80 .cse138)))) .cse15))))) (.cse21 (or .cse62 .cse179 (and (or .cse24 .cse64 .cse169 .cse15) (or .cse10 .cse65 .cse36)))) (.cse23 (or .cse176 (and (or .cse24 (not (= .cse29 .cse177)) .cse15) (or (not (= .cse178 .cse29)) .cse36)) .cse172 .cse179)) (.cse51 (let ((.cse175 (* .cse35 2))) (let ((.cse173 (+ (- .cse175) |ULTIMATE.start_main_~r~0#1|))) (or (>= .cse173 .cse35) (= (+ (+ .cse173 .cse174) (* (+ |ULTIMATE.start_main_~p~0#1| (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse42))) |ULTIMATE.start_main_~B~0#1|)) |ULTIMATE.start_main_~A~0#1|) (not (>= |ULTIMATE.start_main_~r~0#1| .cse175)))))) (.cse52 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse29 .cse161) .cse158)) .cse153 .cse172 .cse164 (and (or (not (= .cse162 1)) .cse43) (or .cse44 .cse45 (not (= .cse163 1)))) (and (or (not (= .cse29 .cse160)) .cse36) (or .cse24 (not (= (+ .cse160 1) .cse29)) .cse15)))) (.cse53 (or .cse43 (let ((.cse167 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse109))) (.cse165 (* |ULTIMATE.start_main_~B~0#1| (+ .cse110 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse24 (and (or .cse82 (and (or (= (+ .cse165 .cse166) |ULTIMATE.start_main_~A~0#1|) .cse108) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse166 .cse167)) .cse104 .cse105))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse168 .cse167)) .cse104 .cse105) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse168)) .cse108)) .cse79 .cse80)) .cse169 .cse15) (or .cse10 (and (or .cse68 .cse75 (and (or .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse170 .cse167)) .cse105) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse170 .cse165))))) (or .cse76 (and (or (= (+ .cse171 .cse167) |ULTIMATE.start_main_~A~0#1|) .cse104 .cse105) (or (= (+ .cse171 .cse165) |ULTIMATE.start_main_~A~0#1|) .cse108)))) .cse36))))) (.cse55 (or .cse153 (let ((.cse155 (* |ULTIMATE.start_main_~B~0#1| (+ .cse161 .cse163))) (.cse156 (* (+ .cse161 .cse162) |ULTIMATE.start_main_~B~0#1|)) (.cse157 (- .cse160))) (and (or (let ((.cse154 (+ .cse157 .cse158))) (and (or .cse44 (= (+ .cse154 .cse155) |ULTIMATE.start_main_~A~0#1|) .cse45) (or (= (+ .cse154 .cse156) |ULTIMATE.start_main_~A~0#1|) .cse43))) .cse36) (or .cse24 .cse15 (let ((.cse159 (+ (+ (- 1) .cse157) .cse158))) (and (or .cse44 .cse45 (= (+ .cse159 .cse155) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse159 .cse156) |ULTIMATE.start_main_~A~0#1|) .cse43)))))) .cse164)) (.cse57 (or (and (or .cse150 (and (or .cse115 .cse116 (not (= .cse147 1))) (or (not (= 1 .cse146)) .cse114)) .cse104 .cse105) (or .cse151 (and (or .cse131 (not (= .cse148 1)) .cse132) (or (not (= .cse149 1)) .cse129)) .cse108)) (let ((.cse152 (* .cse29 .cse145))) (and (or (= (+ .cse152 .cse101) |ULTIMATE.start_main_~A~0#1|) .cse36 .cse102) (or .cse24 .cse98 (= (+ .cse99 .cse152) |ULTIMATE.start_main_~A~0#1|) .cse15))) .cse43)) (.cse58 (or (let ((.cse128 (* |ULTIMATE.start_main_~B~0#1| (+ .cse145 .cse149))) (.cse130 (* |ULTIMATE.start_main_~B~0#1| (+ .cse148 .cse145))) (.cse117 (* |ULTIMATE.start_main_~B~0#1| (+ .cse147 .cse145))) (.cse113 (* (+ .cse145 .cse146) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse36 (and (or (and (or (and (or .cse111 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse113)) .cse114) (or .cse115 .cse116 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse117))))) (or .cse118 .cse119 (and (or .cse114 (= (+ .cse113 .cse120) |ULTIMATE.start_main_~A~0#1|)) (or .cse115 .cse116 (= |ULTIMATE.start_main_~A~0#1| (+ .cse117 .cse120)))))) .cse68 .cse75 .cse121) (or .cse76 .cse122 (and (or .cse123 (and (or .cse115 .cse116 (= |ULTIMATE.start_main_~A~0#1| (+ .cse117 .cse124))) (or (= (+ .cse113 .cse124) |ULTIMATE.start_main_~A~0#1|) .cse114)) .cse125) (or (and (or .cse115 (= (+ .cse126 .cse117) |ULTIMATE.start_main_~A~0#1|) .cse116) (or .cse114 (= (+ .cse126 .cse113) |ULTIMATE.start_main_~A~0#1|))) .cse127)))) .cse104 .cse105) (or (and (or .cse68 (and (or .cse118 .cse119 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse120 .cse128)) .cse129) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse120 .cse130)) .cse131 .cse132))) (or (and (or .cse131 .cse132 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse130))) (or .cse129 (= (+ .cse112 .cse128) |ULTIMATE.start_main_~A~0#1|))) .cse111)) .cse75 .cse121) (or .cse76 (and (or (and (or .cse131 .cse132 (= |ULTIMATE.start_main_~A~0#1| (+ .cse126 .cse130))) (or (= (+ .cse126 .cse128) |ULTIMATE.start_main_~A~0#1|) .cse129)) .cse127) (or .cse123 (and (or (= (+ .cse124 .cse128) |ULTIMATE.start_main_~A~0#1|) .cse129) (or (= (+ .cse124 .cse130) |ULTIMATE.start_main_~A~0#1|) .cse131 .cse132)) .cse125)) .cse122)) .cse108))) (or .cse24 (and (or (and (or (and (or .cse133 (and (or .cse129 (= (+ .cse134 .cse128) |ULTIMATE.start_main_~A~0#1|)) (or .cse131 (= (+ .cse134 .cse130) |ULTIMATE.start_main_~A~0#1|) .cse132))) (or .cse135 (and (or .cse131 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse130)) .cse132) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse128)) .cse129)) .cse137)) .cse79 .cse80 .cse138) (or (and (or .cse139 (and (or (= (+ .cse140 .cse128) |ULTIMATE.start_main_~A~0#1|) .cse129) (or .cse131 (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse130)) .cse132)) .cse141) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse142)) .cse129) (or .cse131 (= (+ .cse130 .cse142) |ULTIMATE.start_main_~A~0#1|) .cse132)) .cse143)) .cse82 .cse144)) .cse108) (or (and (or (and (or (and (or (= (+ .cse134 .cse117) |ULTIMATE.start_main_~A~0#1|) .cse115 .cse116) (or .cse114 (= (+ .cse134 .cse113) |ULTIMATE.start_main_~A~0#1|))) .cse133) (or .cse135 .cse137 (and (or .cse115 .cse116 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse117))) (or .cse114 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse113)))))) .cse79 .cse80 .cse138) (or (and (or (and (or .cse114 (= (+ .cse113 .cse142) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse117 .cse142) |ULTIMATE.start_main_~A~0#1|) .cse115 .cse116)) .cse143) (or .cse139 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse117)) .cse115 .cse116) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse113)) .cse114)) .cse141)) .cse82 .cse144)) .cse104 .cse105)) .cse15))) .cse43)) (.cse59 (or (let ((.cse107 (* (+ .cse110 .cse83) |ULTIMATE.start_main_~B~0#1|)) (.cse106 (* (+ .cse83 .cse109) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse36 (and (or (and (or .cse104 .cse105 (= (+ .cse106 .cse71) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse107)) .cse108)) .cse68 .cse75) (or .cse76 (and (or .cse108 (= (+ .cse77 .cse107) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse106 .cse77) |ULTIMATE.start_main_~A~0#1|) .cse104 .cse105)))) .cse66) (or .cse24 (and (or (and (or (= (+ .cse78 .cse106) |ULTIMATE.start_main_~A~0#1|) .cse104 .cse105) (or (= (+ .cse78 .cse107) |ULTIMATE.start_main_~A~0#1|) .cse108)) .cse79 .cse80) (or (and (or (= (+ .cse107 .cse81) |ULTIMATE.start_main_~A~0#1|) .cse108) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse106 .cse81)) .cse104 .cse105)) .cse82)) .cse63 .cse15))) .cse43)) (.cse60 (or (and (or .cse69 .cse86 .cse70 (and (or .cse87 (not (= .cse88 1))) (or (not (= .cse89 1)) .cse90 .cse91))) (or .cse74 .cse92 (and (or .cse93 (not (= .cse94 1))) (or .cse95 .cse96 (not (= .cse97 1)))))) .cse44 (let ((.cse100 (* .cse103 .cse29))) (and (or .cse24 .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ .cse99 .cse100)) .cse15) (or .cse36 (= (+ .cse101 .cse100) |ULTIMATE.start_main_~A~0#1|) .cse102))) .cse45)) (.cse61 (or .cse44 (let ((.cse72 (* (+ .cse85 .cse83) |ULTIMATE.start_main_~B~0#1|)) (.cse73 (* (+ .cse83 .cse84) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse36 .cse66 (and (or .cse68 (and (or .cse69 .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse72))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse73)) .cse74)) .cse75) (or .cse76 (and (or .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse77 .cse72)) .cse70) (or (= (+ .cse73 .cse77) |ULTIMATE.start_main_~A~0#1|) .cse74))))) (or .cse24 .cse63 (and (or (and (or .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse72)) .cse70) (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse73)))) .cse79 .cse80) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse72 .cse81)) .cse69 .cse70) (or .cse74 (= (+ .cse73 .cse81) |ULTIMATE.start_main_~A~0#1|))) .cse82)) .cse15))) .cse45))) (or (and .cse16 .cse17 .cse0 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (or (let ((.cse31 (div .cse35 4))) (and (let ((.cse26 (+ .cse31 1))) (or .cse24 (>= .cse25 .cse26) (let ((.cse30 (< .cse26 0)) (.cse27 (= (mod .cse26 2) 0)) (.cse28 (div .cse26 2))) (and (or .cse27 (not (= (+ .cse28 1) .cse29)) (not .cse30)) (or (and .cse30 (not .cse27)) (not (= .cse29 .cse28))))) .cse15)) (or (let ((.cse32 (= (mod .cse31 2) 0)) (.cse34 (< .cse31 0)) (.cse33 (div .cse35 8))) (and (or .cse32 (not (= (+ .cse33 1) .cse29)) (not .cse34)) (or (and (not .cse32) .cse34) (not (= .cse29 .cse33))))) .cse36 (>= .cse25 .cse31)))) (not .cse37) (let ((.cse41 (div .cse42 4))) (and (or (let ((.cse40 (div .cse42 8)) (.cse38 (= (mod .cse41 2) 0)) (.cse39 (< .cse41 0))) (and (or .cse38 (not .cse39) (not (= (+ .cse40 1) 1))) (or (not (= .cse40 1)) (and (not .cse38) .cse39)))) (= .cse41 1) .cse43) (let ((.cse49 (+ .cse41 1))) (or .cse44 .cse45 (let ((.cse46 (= (mod .cse49 2) 0)) (.cse47 (< .cse49 0)) (.cse48 (div .cse49 2))) (and (or (and (not .cse46) .cse47) (not (= .cse48 1))) (or .cse46 (not .cse47) (not (= (+ .cse48 1) 1))))) (= 1 .cse49))))) .cse50) .cse51 .cse52 .cse53 .cse4 .cse5 .cse54 .cse55 .cse56 .cse57 .cse58 .cse6 .cse59 .cse60 .cse61) (and (or .cse62 (and (or .cse24 .cse63 .cse64 .cse15) (or .cse65 .cse36 .cse66)) .cse50) .cse16 .cse17 .cse0 .cse18 .cse20 .cse21 .cse22 .cse23 .cse51 .cse52 .cse53 .cse4 .cse5 .cse54 .cse55 .cse56 .cse57 .cse58 .cse67 .cse6 .cse59 .cse60 .cse61)))))) .cse6) (and (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 .cse172 (>= |ULTIMATE.start_main_~p~0#1| 1) .cse215 .cse3 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse22 (= (* 2 .cse13) |ULTIMATE.start_main_~p~0#1|) .cse3 (>= |ULTIMATE.start_main_~r~0#1| .cse11) .cse4 .cse5 .cse56 (= (* .cse11 2) |ULTIMATE.start_main_~d~0#1|) .cse6))))))))) [2023-02-18 03:06:39,454 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 03:06:39,454 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 03:06:39,457 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (let ((.cse179 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse312 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse313 (+ .cse312 1)) (.cse181 (+ .cse179 1))) (let ((.cse169 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse172 (div .cse181 2)) (.cse322 (- .cse179)) (.cse113 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse127 (div .cse313 2)) (.cse240 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse239 (* 2 |ULTIMATE.start_main_~d~0#1|))) (let ((.cse271 (div .cse239 4)) (.cse289 (div .cse240 4)) (.cse21 (- |ULTIMATE.start_main_~r~0#1|)) (.cse26 (* (- 1) |ULTIMATE.start_main_~r~0#1|)) (.cse124 (= (mod .cse313 2) 0)) (.cse329 (< .cse313 0)) (.cse128 (+ .cse127 1)) (.cse114 (+ .cse113 1)) (.cse330 (< .cse312 0)) (.cse102 (= (mod .cse312 2) 0)) (.cse321 (+ (- 1) .cse322)) (.cse173 (+ .cse172 1)) (.cse165 (+ .cse169 1)) (.cse315 (- .cse172)) (.cse317 (- .cse169)) (.cse22 (- |ULTIMATE.start_main_~d~0#1|)) (.cse25 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse59 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse155 (+ |ULTIMATE.start_main_~q~0#1| .cse313)) (.cse332 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse120 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse176 (+ |ULTIMATE.start_main_~q~0#1| .cse312)) (.cse331 (< |ULTIMATE.start_main_~d~0#1| 0))) (let ((.cse292 (= .cse312 1)) (.cse291 (= .cse313 1)) (.cse137 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse95 (not .cse331)) (.cse319 (* |ULTIMATE.start_main_~B~0#1| .cse176)) (.cse94 (and .cse332 (not .cse120))) (.cse320 (* .cse155 |ULTIMATE.start_main_~B~0#1|)) (.cse121 (not .cse332)) (.cse112 (and (not .cse59) .cse331)) (.cse115 (not .cse25)) (.cse93 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse269 (+ |ULTIMATE.start_main_~r~0#1| .cse22)) (.cse318 (+ (- 1) .cse317)) (.cse107 (= (mod .cse179 2) 0)) (.cse323 (< .cse179 0)) (.cse316 (+ (- 1) .cse315)) (.cse324 (< .cse181 0)) (.cse104 (= (mod .cse181 2) 0)) (.cse325 (< .cse165 0)) (.cse197 (= (mod .cse165 2) 0)) (.cse153 (+ |ULTIMATE.start_main_~r~0#1| .cse322)) (.cse199 (= (mod .cse169 2) 0)) (.cse326 (< .cse169 0)) (.cse213 (= (mod .cse173 2) 0)) (.cse327 (< .cse173 0)) (.cse151 (+ |ULTIMATE.start_main_~r~0#1| .cse321)) (.cse216 (= (mod .cse172 2) 0)) (.cse328 (< .cse172 0)) (.cse302 (div .cse165 2)) (.cse301 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse299 (div .cse181 4)) (.cse300 (div .cse173 2)) (.cse224 (= .cse113 1)) (.cse99 (and .cse330 (not .cse102))) (.cse223 (= .cse114 1)) (.cse101 (not .cse330)) (.cse138 (= .cse128 1)) (.cse126 (not .cse329)) (.cse122 (and .cse329 (not .cse124))) (.cse144 (= .cse127 1)) (.cse87 (+ .cse26 |ULTIMATE.start_main_~A~0#1|)) (.cse79 (+ |ULTIMATE.start_main_~A~0#1| .cse21)) (.cse290 (+ .cse289 1)) (.cse272 (+ .cse271 1))) (let ((.cse255 (div .cse240 8)) (.cse252 (= (mod .cse289 2) 0)) (.cse284 (< .cse289 0)) (.cse247 (= (mod .cse271 2) 0)) (.cse285 (< .cse271 0)) (.cse243 (= (mod .cse272 2) 0)) (.cse286 (< .cse272 0)) (.cse259 (div .cse290 2)) (.cse260 (= (mod .cse290 2) 0)) (.cse287 (< .cse290 0)) (.cse74 (div .cse79 2)) (.cse85 (< .cse87 0)) (.cse288 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse66 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse183 (and (or (not .cse138) .cse124 .cse126) (or .cse122 (not .cse144)))) (.cse162 (and (or (not .cse224) .cse99) (or (not .cse223) .cse101 .cse102))) (.cse146 (div .cse313 4)) (.cse140 (div .cse128 2)) (.cse142 (= (mod .cse128 2) 0)) (.cse294 (< .cse128 0)) (.cse293 (- .cse300)) (.cse295 (- .cse299)) (.cse147 (= (mod .cse127 2) 0)) (.cse296 (< .cse127 0)) (.cse297 (- .cse301)) (.cse298 (- .cse302)) (.cse235 (div (* |ULTIMATE.start_main_~p~0#1| 4) 8)) (.cse273 (>= |ULTIMATE.start_main_~r~0#1| .cse239)) (.cse218 (and (not .cse216) .cse328)) (.cse214 (not .cse328)) (.cse186 (>= .cse151 .cse172)) (.cse211 (not .cse327)) (.cse209 (and (not .cse213) .cse327)) (.cse185 (>= .cse151 .cse173)) (.cse203 (and (not .cse199) .cse326)) (.cse201 (not .cse326)) (.cse187 (>= .cse153 .cse169)) (.cse189 (and .cse325 (not .cse197))) (.cse196 (not .cse325)) (.cse156 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse188 (>= .cse153 .cse165)) (.cse207 (= (mod .cse113 2) 0)) (.cse303 (< .cse113 0)) (.cse222 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse193 (= (mod .cse114 2) 0)) (.cse219 (div .cse114 2)) (.cse304 (< .cse114 0)) (.cse171 (+ .cse151 .cse315)) (.cse96 (and .cse324 (not .cse104))) (.cse105 (not .cse324)) (.cse174 (+ .cse151 .cse316)) (.cse51 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse231 (+ (- .cse239) |ULTIMATE.start_main_~r~0#1|)) (.cse234 (+ |ULTIMATE.start_main_~q~0#1| .cse240)) (.cse106 (>= |ULTIMATE.start_main_~r~0#1| .cse181)) (.cse55 (>= |ULTIMATE.start_main_~r~0#1| .cse179)) (.cse306 (* (+ .cse155 .cse127) |ULTIMATE.start_main_~B~0#1|)) (.cse305 (* (+ .cse128 .cse155) |ULTIMATE.start_main_~B~0#1|)) (.cse110 (and (not .cse107) .cse323)) (.cse168 (+ .cse317 .cse153)) (.cse308 (* (+ .cse113 .cse176) |ULTIMATE.start_main_~B~0#1|)) (.cse163 (+ .cse318 .cse153)) (.cse307 (* (+ .cse114 .cse176) |ULTIMATE.start_main_~B~0#1|)) (.cse108 (not .cse323)) (.cse178 (+ .cse269 .cse322)) (.cse182 (+ .cse269 .cse321)) (.cse36 (or .cse115 .cse93)) (.cse0 (or (and (or (= (+ .cse319 .cse153) |ULTIMATE.start_main_~A~0#1|) .cse94) (or (= (+ .cse320 .cse153) |ULTIMATE.start_main_~A~0#1|) .cse120 .cse121)) .cse112)) (.cse1 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse2 (or .cse95 (and (or .cse94 (= (+ .cse151 .cse319) |ULTIMATE.start_main_~A~0#1|)) (or .cse120 .cse121 (= |ULTIMATE.start_main_~A~0#1| (+ .cse320 .cse151)))) .cse59)) (.cse46 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse9 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse48 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse10 (= |ULTIMATE.start_main_~A~0#1| (+ .cse269 (* |ULTIMATE.start_main_~B~0#1| .cse137)))) (.cse15 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse177 (and (or (not .cse292) .cse94) (or .cse120 .cse121 (not .cse291))))) (let ((.cse103 (+ .cse316 |ULTIMATE.start_main_~r~0#1|)) (.cse98 (+ |ULTIMATE.start_main_~r~0#1| .cse315)) (.cse111 (+ .cse317 |ULTIMATE.start_main_~r~0#1|)) (.cse109 (+ .cse318 |ULTIMATE.start_main_~r~0#1|)) (.cse130 (+ .cse269 .cse318)) (.cse133 (+ .cse317 .cse269)) (.cse135 (+ .cse316 .cse269)) (.cse136 (+ .cse269 .cse315)) (.cse53 (or .cse177 (and (or (= .cse179 |ULTIMATE.start_main_~B~0#1|) .cse112) (or .cse95 (= |ULTIMATE.start_main_~B~0#1| .cse181) .cse59)))) (.cse54 (let ((.cse314 (or .cse177 (and (or .cse95 .cse59 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse181)) |ULTIMATE.start_main_~A~0#1|)) (or .cse112 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse179 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse0 .cse1 .cse2 .cse36 .cse314 .cse46 .cse9 .cse48 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse314 .cse46 .cse9 .cse48 .cse10 .cse93 .cse15)))) (.cse24 (or .cse25 (let ((.cse311 (* (+ .cse137 .cse313) |ULTIMATE.start_main_~B~0#1|)) (.cse310 (* (+ .cse137 .cse312) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse310 .cse178) |ULTIMATE.start_main_~A~0#1|) .cse94) (or .cse120 .cse121 (= |ULTIMATE.start_main_~A~0#1| (+ .cse178 .cse311)))) .cse112) (or .cse95 (and (or .cse120 (= |ULTIMATE.start_main_~A~0#1| (+ .cse182 .cse311)) .cse121) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse182 .cse310)) .cse94)) .cse59))))) (.cse27 (or (and (or .cse291 .cse120 .cse121 (and (or .cse107 .cse108 (and (or .cse124 (= (+ .cse163 .cse305) |ULTIMATE.start_main_~A~0#1|) .cse126) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse306 .cse163))))) (or .cse110 (and (or .cse122 (= (+ .cse306 .cse168) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse305 .cse168)) .cse124 .cse126))))) (or (and (or .cse110 (and (or (= (+ .cse308 .cse168) |ULTIMATE.start_main_~A~0#1|) .cse99) (or (= (+ .cse168 .cse307) |ULTIMATE.start_main_~A~0#1|) .cse101 .cse102))) (or (and (or .cse99 (= (+ .cse308 .cse163) |ULTIMATE.start_main_~A~0#1|)) (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse307)))) .cse107 .cse108)) .cse94 .cse292)) .cse112)) (.cse56 (<= 2 .cse179)) (.cse29 (or .cse25 (and .cse0 .cse2))) (.cse61 (or .cse177 (let ((.cse309 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse95 (not .cse106) .cse59 (= |ULTIMATE.start_main_~A~0#1| (+ .cse151 (* .cse309 .cse181)))) (or (not .cse55) .cse112 (= (+ (* .cse179 .cse309) .cse153) |ULTIMATE.start_main_~A~0#1|)))))) (.cse14 (or (= .cse240 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ .cse231 .cse22) (* |ULTIMATE.start_main_~B~0#1| (+ .cse234 |ULTIMATE.start_main_~p~0#1|)))))) (.cse58 (or .cse115 .cse51)) (.cse31 (or .cse95 .cse59 (and (or .cse291 .cse120 .cse121 (and (or (and (or (= (+ .cse305 .cse174) |ULTIMATE.start_main_~A~0#1|) .cse124 .cse126) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse306 .cse174)))) .cse104 .cse105) (or .cse96 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse305)) .cse124 .cse126) (or .cse122 (= (+ .cse171 .cse306) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse101 .cse102 (= (+ .cse171 .cse307) |ULTIMATE.start_main_~A~0#1|)) (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse308)))) .cse96) (or .cse104 .cse105 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse307)) .cse101 .cse102) (or (= (+ .cse308 .cse174) |ULTIMATE.start_main_~A~0#1|) .cse99)))) .cse94 .cse292)))) (.cse194 (not .cse304)) (.cse220 (+ 1 .cse219)) (.cse192 (and (not .cse193) .cse304)) (.cse221 (+ .cse222 1)) (.cse208 (not .cse303)) (.cse205 (and (not .cse207) .cse303)) (.cse154 (and (or .cse110 (and (or (not (= .cse156 .cse301)) .cse203) (or .cse199 .cse201 (not (= .cse156 (+ .cse301 1))))) .cse187) (or .cse107 (and (or (not (= .cse156 .cse302)) .cse189) (or .cse196 .cse197 (not (= .cse156 (+ .cse302 1))))) .cse108 .cse188))) (.cse150 (and (or (and (or (not (= .cse156 .cse299)) .cse218) (or .cse214 (not (= .cse156 (+ .cse299 1))) .cse216)) .cse96 .cse186) (or (and (or .cse211 .cse213 (not (= .cse156 (+ .cse300 1)))) (or .cse209 (not (= .cse156 .cse300)))) .cse104 .cse105 .cse185))) (.cse226 (>= .cse231 |ULTIMATE.start_main_~d~0#1|)) (.cse237 (not .cse273)) (.cse236 (+ .cse235 1)) (.cse233 (div (* |ULTIMATE.start_main_~d~0#1| 4) 8)) (.cse117 (= (+ |ULTIMATE.start_main_~r~0#1| (* .cse156 |ULTIMATE.start_main_~q~0#1|)) |ULTIMATE.start_main_~A~0#1|)) (.cse190 (+ .cse153 .cse298)) (.cse198 (+ (+ (- 1) .cse298) .cse153)) (.cse200 (+ (+ (- 1) .cse297) .cse153)) (.cse202 (+ .cse153 .cse297)) (.cse148 (not .cse296)) (.cse145 (and (not .cse147) .cse296)) (.cse215 (+ .cse151 (+ (- 1) .cse295))) (.cse217 (+ .cse295 .cse151)) (.cse212 (+ .cse151 (+ (- 1) .cse293))) (.cse143 (not .cse294)) (.cse139 (and (not .cse142) .cse294)) (.cse210 (+ .cse151 .cse293)) (.cse141 (+ .cse140 1)) (.cse149 (+ .cse146 1)) (.cse116 (and (or .cse183 .cse291 .cse120 .cse121) (or .cse162 .cse94 .cse292))) (.cse134 (>= .cse269 .cse181)) (.cse118 (and (or .cse96 (not (= .cse156 .cse172))) (or (not (= .cse156 .cse173)) .cse104 .cse105))) (.cse119 (and (or .cse107 (not (= .cse156 .cse165)) .cse108) (or .cse110 (not (= .cse156 .cse169))))) (.cse129 (>= .cse269 .cse179)) (.cse264 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse156 .cse137) .cse269))) (.cse180 (+ .cse137 1)) (.cse263 (= 1 .cse290)) (.cse257 (= .cse289 1)) (.cse47 (* 2 .cse66)) (.cse62 (* |ULTIMATE.start_main_~B~0#1| 4)) (.cse75 (or (not .cse85) .cse288)) (.cse80 (+ .cse74 1)) (.cse84 (not .cse288)) (.cse70 (* 2 1)) (.cse28 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse57 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse261 (not .cse287)) (.cse258 (and (not .cse260) .cse287)) (.cse262 (+ .cse259 1)) (.cse242 (>= .cse269 .cse272)) (.cse245 (not .cse286)) (.cse246 (and .cse286 (not .cse243))) (.cse249 (not .cse285)) (.cse250 (and (not .cse247) .cse285)) (.cse256 (and (not .cse252) .cse284)) (.cse253 (not .cse284)) (.cse251 (>= .cse269 .cse271)) (.cse254 (+ .cse255 1)) (.cse244 (div .cse272 2)) (.cse248 (div .cse239 8))) (let ((.cse13 (or .cse57 (let ((.cse282 (- .cse248)) (.cse283 (- .cse244))) (let ((.cse274 (+ .cse269 (+ (- 1) .cse283))) (.cse277 (+ .cse283 .cse269)) (.cse278 (+ (+ (- 1) .cse282) .cse269)) (.cse279 (+ .cse282 .cse269))) (and (or .cse120 .cse121 (let ((.cse275 (* |ULTIMATE.start_main_~B~0#1| (+ .cse262 .cse137))) (.cse276 (* |ULTIMATE.start_main_~B~0#1| (+ .cse137 .cse259)))) (and (or .cse95 .cse242 (and (or .cse243 .cse245 (and (or .cse260 .cse261 (= |ULTIMATE.start_main_~A~0#1| (+ .cse274 .cse275))) (or (= (+ .cse276 .cse274) |ULTIMATE.start_main_~A~0#1|) .cse258))) (or (and (or .cse260 (= |ULTIMATE.start_main_~A~0#1| (+ .cse277 .cse275)) .cse261) (or (= (+ .cse276 .cse277) |ULTIMATE.start_main_~A~0#1|) .cse258)) .cse246)) .cse59) (or (and (or .cse247 .cse249 (and (or .cse260 .cse261 (= |ULTIMATE.start_main_~A~0#1| (+ .cse278 .cse275))) (or (= (+ .cse276 .cse278) |ULTIMATE.start_main_~A~0#1|) .cse258))) (or .cse250 (and (or .cse260 (= (+ .cse279 .cse275) |ULTIMATE.start_main_~A~0#1|) .cse261) (or (= (+ .cse279 .cse276) |ULTIMATE.start_main_~A~0#1|) .cse258)))) .cse112 .cse251)))) (or (let ((.cse281 (* (+ .cse255 .cse137) |ULTIMATE.start_main_~B~0#1|)) (.cse280 (* |ULTIMATE.start_main_~B~0#1| (+ .cse254 .cse137)))) (and (or .cse95 .cse242 (and (or (and (or .cse252 .cse253 (= (+ .cse274 .cse280) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse274 .cse281) |ULTIMATE.start_main_~A~0#1|) .cse256)) .cse243 .cse245) (or .cse246 (and (or .cse252 .cse253 (= (+ .cse280 .cse277) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse277 .cse281) |ULTIMATE.start_main_~A~0#1|) .cse256)))) .cse59) (or (and (or (and (or .cse256 (= |ULTIMATE.start_main_~A~0#1| (+ .cse278 .cse281))) (or .cse252 .cse253 (= |ULTIMATE.start_main_~A~0#1| (+ .cse278 .cse280)))) .cse247 .cse249) (or .cse250 (and (or .cse256 (= (+ .cse279 .cse281) |ULTIMATE.start_main_~A~0#1|)) (or .cse252 .cse253 (= (+ .cse279 .cse280) |ULTIMATE.start_main_~A~0#1|))))) .cse112 .cse251))) .cse94)))))) (.cse52 (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|)) (.cse50 (= .cse28 |ULTIMATE.start_main_~A~0#1|)) (.cse32 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|)) (.cse30 (* 2 .cse70)) (.cse71 (= |ULTIMATE.start_main_~p~0#1| .cse70)) (.cse33 (>= |ULTIMATE.start_main_~p~0#1| 1)) (.cse72 (= (+ 4 0) |ULTIMATE.start_main_~q~0#1|)) (.cse86 (or (and (= |ULTIMATE.start_main_~d~0#1| .cse74) .cse75) (and (= |ULTIMATE.start_main_~d~0#1| .cse80) .cse84 .cse85))) (.cse73 (= .cse87 .cse62)) (.cse69 (= |ULTIMATE.start_main_~d~0#1| .cse66)) (.cse88 (= 2 |ULTIMATE.start_main_~p~0#1|)) (.cse6 (<= 2 |ULTIMATE.start_main_~p~0#1|)) (.cse12 (or .cse115 (= (+ .cse269 (* |ULTIMATE.start_main_~d~0#1| .cse137)) |ULTIMATE.start_main_~A~0#1|) .cse57)) (.cse64 (>= |ULTIMATE.start_main_~A~0#1| .cse47)) (.cse16 (or .cse1 (and .cse1 (<= 1 |ULTIMATE.start_main_~d~0#1|)))) (.cse17 (or (let ((.cse270 (- .cse271))) (and (or .cse112 (= (+ (+ .cse269 .cse270) (* .cse271 .cse180)) |ULTIMATE.start_main_~A~0#1|) (not .cse251)) (or .cse95 (not .cse242) (= (+ (+ (+ (- 1) .cse270) .cse269) (* .cse272 .cse180)) |ULTIMATE.start_main_~A~0#1|) .cse59))) (and (or (not .cse263) .cse120 .cse121) (or (not .cse257) .cse94)) .cse273)) (.cse34 (or .cse116 (and (or .cse95 .cse134 .cse118 .cse59) (or .cse119 .cse112 .cse129)) .cse264)) (.cse37 (or .cse120 .cse121 (let ((.cse266 (* (+ .cse149 .cse155) |ULTIMATE.start_main_~B~0#1|)) (.cse265 (* (+ .cse155 .cse146) |ULTIMATE.start_main_~B~0#1|)) (.cse268 (* |ULTIMATE.start_main_~B~0#1| (+ .cse141 .cse155))) (.cse267 (* |ULTIMATE.start_main_~B~0#1| (+ .cse155 .cse140)))) (and (or (and (or .cse122 (and (or .cse107 .cse108 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse190 .cse265)) .cse145) (or .cse147 .cse148 (= |ULTIMATE.start_main_~A~0#1| (+ .cse190 .cse266)))) .cse189) (or (and (or .cse147 (= (+ .cse198 .cse266) |ULTIMATE.start_main_~A~0#1|) .cse148) (or .cse145 (= (+ .cse265 .cse198) |ULTIMATE.start_main_~A~0#1|))) .cse196 .cse197)) .cse188) (or .cse110 (and (or .cse199 .cse201 (and (or .cse145 (= (+ .cse265 .cse200) |ULTIMATE.start_main_~A~0#1|)) (or .cse147 .cse148 (= (+ .cse266 .cse200) |ULTIMATE.start_main_~A~0#1|)))) (or .cse203 (and (or .cse147 .cse148 (= (+ .cse202 .cse266) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse202 .cse265) |ULTIMATE.start_main_~A~0#1|) .cse145)))) .cse187))) (or (and (or .cse107 (and (or .cse189 (and (or .cse139 (= |ULTIMATE.start_main_~A~0#1| (+ .cse190 .cse267))) (or .cse142 (= (+ .cse268 .cse190) |ULTIMATE.start_main_~A~0#1|) .cse143))) (or .cse196 .cse197 (and (or (= (+ .cse198 .cse267) |ULTIMATE.start_main_~A~0#1|) .cse139) (or .cse142 (= |ULTIMATE.start_main_~A~0#1| (+ .cse268 .cse198)) .cse143)))) .cse108 .cse188) (or .cse110 .cse187 (and (or .cse199 (and (or .cse142 .cse143 (= |ULTIMATE.start_main_~A~0#1| (+ .cse268 .cse200))) (or .cse139 (= (+ .cse267 .cse200) |ULTIMATE.start_main_~A~0#1|))) .cse201) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse202 .cse267)) .cse139) (or .cse142 .cse143 (= (+ .cse202 .cse268) |ULTIMATE.start_main_~A~0#1|))) .cse203)))) .cse124 .cse126)) .cse112) (or .cse95 (and (or (and (or (and (or (and (or .cse147 (= (+ .cse212 .cse266) |ULTIMATE.start_main_~A~0#1|) .cse148) (or .cse145 (= |ULTIMATE.start_main_~A~0#1| (+ .cse212 .cse265)))) .cse211 .cse213) (or .cse209 (and (or .cse147 (= |ULTIMATE.start_main_~A~0#1| (+ .cse210 .cse266)) .cse148) (or .cse145 (= (+ .cse210 .cse265) |ULTIMATE.start_main_~A~0#1|))))) .cse104 .cse105 .cse185) (or .cse96 .cse186 (and (or .cse214 (and (or (= (+ .cse215 .cse266) |ULTIMATE.start_main_~A~0#1|) .cse147 .cse148) (or .cse145 (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse265)))) .cse216) (or (and (or .cse147 (= (+ .cse266 .cse217) |ULTIMATE.start_main_~A~0#1|) .cse148) (or .cse145 (= |ULTIMATE.start_main_~A~0#1| (+ .cse265 .cse217)))) .cse218)))) .cse122) (or .cse124 .cse126 (and (or (and (or .cse214 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse268 .cse215)) .cse142 .cse143) (or .cse139 (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse267)))) .cse216) (or (and (or (= (+ .cse268 .cse217) |ULTIMATE.start_main_~A~0#1|) .cse142 .cse143) (or .cse139 (= |ULTIMATE.start_main_~A~0#1| (+ .cse267 .cse217)))) .cse218)) .cse96 .cse186) (or (and (or .cse211 (and (or .cse142 .cse143 (= (+ .cse212 .cse268) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse212 .cse267)) .cse139)) .cse213) (or .cse209 (and (or .cse142 (= (+ .cse210 .cse268) |ULTIMATE.start_main_~A~0#1|) .cse143) (or .cse139 (= (+ .cse210 .cse267) |ULTIMATE.start_main_~A~0#1|))))) .cse104 .cse105 .cse185)))) .cse59))))) (.cse45 (<= 8 |ULTIMATE.start_main_~p~0#1|)) (.cse3 (or .cse177 (and (or .cse95 (not (= .cse156 .cse181)) .cse59) (or (not (= .cse179 .cse156)) .cse112)) .cse25 .cse117)) (.cse4 (or (and (or .cse95 .cse242 (and (or .cse243 (not (= (+ .cse244 1) .cse156)) .cse245) (or .cse246 (not (= .cse156 .cse244)))) .cse59) (or (and (or .cse247 (not (= (+ .cse248 1) .cse156)) .cse249) (or .cse250 (not (= .cse156 .cse248)))) .cse112 .cse251)) .cse57 (and (or (and (or .cse252 .cse253 (not (= .cse254 1))) (or (not (= .cse255 1)) .cse256)) .cse257 .cse94) (or .cse120 .cse121 (and (or .cse258 (not (= .cse259 1))) (or .cse260 .cse261 (not (= .cse262 1)))) .cse263)) .cse264)) (.cse5 (let ((.cse241 (* .cse239 2))) (let ((.cse238 (+ (- .cse241) |ULTIMATE.start_main_~r~0#1|))) (or (>= .cse238 .cse239) (= (+ (+ .cse238 .cse22) (* (+ |ULTIMATE.start_main_~p~0#1| (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse240))) |ULTIMATE.start_main_~B~0#1|)) |ULTIMATE.start_main_~A~0#1|) (not (>= |ULTIMATE.start_main_~r~0#1| .cse241)))))) (.cse8 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse156 .cse234) .cse231)) .cse226 .cse25 .cse237 (and (or (not (= .cse235 1)) .cse94) (or .cse120 .cse121 (not (= .cse236 1)))) (and (or (not (= .cse156 .cse233)) .cse112) (or .cse95 (not (= (+ .cse233 1) .cse156)) .cse59)))) (.cse11 (or .cse226 (let ((.cse228 (* |ULTIMATE.start_main_~B~0#1| (+ .cse234 .cse236))) (.cse229 (* (+ .cse234 .cse235) |ULTIMATE.start_main_~B~0#1|)) (.cse230 (- .cse233))) (and (or (let ((.cse227 (+ .cse230 .cse231))) (and (or .cse120 (= (+ .cse227 .cse228) |ULTIMATE.start_main_~A~0#1|) .cse121) (or (= (+ .cse227 .cse229) |ULTIMATE.start_main_~A~0#1|) .cse94))) .cse112) (or .cse95 .cse59 (let ((.cse232 (+ (+ (- 1) .cse230) .cse231))) (and (or .cse120 .cse121 (= (+ .cse232 .cse228) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse232 .cse229) |ULTIMATE.start_main_~A~0#1|) .cse94)))))) .cse237)) (.cse40 (or (and (or .cse223 (and (or .cse193 .cse194 (not (= .cse220 1))) (or (not (= 1 .cse219)) .cse192)) .cse101 .cse102) (or .cse224 (and (or .cse207 (not (= .cse221 1)) .cse208) (or (not (= .cse222 1)) .cse205)) .cse99)) (let ((.cse225 (* .cse156 .cse176))) (and (or (= (+ .cse225 .cse153) |ULTIMATE.start_main_~A~0#1|) .cse112 .cse154) (or .cse95 .cse150 (= (+ .cse151 .cse225) |ULTIMATE.start_main_~A~0#1|) .cse59))) .cse94)) (.cse41 (or (let ((.cse204 (* |ULTIMATE.start_main_~B~0#1| (+ .cse176 .cse222))) (.cse206 (* |ULTIMATE.start_main_~B~0#1| (+ .cse221 .cse176))) (.cse195 (* |ULTIMATE.start_main_~B~0#1| (+ .cse220 .cse176))) (.cse191 (* (+ .cse176 .cse219) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse112 (and (or (and (or (and (or .cse189 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse190 .cse191)) .cse192) (or .cse193 .cse194 (= |ULTIMATE.start_main_~A~0#1| (+ .cse190 .cse195))))) (or .cse196 .cse197 (and (or .cse192 (= (+ .cse191 .cse198) |ULTIMATE.start_main_~A~0#1|)) (or .cse193 .cse194 (= |ULTIMATE.start_main_~A~0#1| (+ .cse195 .cse198)))))) .cse107 .cse108 .cse188) (or .cse110 .cse187 (and (or .cse199 (and (or .cse193 .cse194 (= |ULTIMATE.start_main_~A~0#1| (+ .cse195 .cse200))) (or (= (+ .cse191 .cse200) |ULTIMATE.start_main_~A~0#1|) .cse192)) .cse201) (or (and (or .cse193 (= (+ .cse202 .cse195) |ULTIMATE.start_main_~A~0#1|) .cse194) (or .cse192 (= (+ .cse202 .cse191) |ULTIMATE.start_main_~A~0#1|))) .cse203)))) .cse101 .cse102) (or (and (or .cse107 (and (or .cse196 .cse197 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse198 .cse204)) .cse205) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse198 .cse206)) .cse207 .cse208))) (or (and (or .cse207 .cse208 (= |ULTIMATE.start_main_~A~0#1| (+ .cse190 .cse206))) (or .cse205 (= (+ .cse190 .cse204) |ULTIMATE.start_main_~A~0#1|))) .cse189)) .cse108 .cse188) (or .cse110 (and (or (and (or .cse207 .cse208 (= |ULTIMATE.start_main_~A~0#1| (+ .cse202 .cse206))) (or (= (+ .cse202 .cse204) |ULTIMATE.start_main_~A~0#1|) .cse205)) .cse203) (or .cse199 (and (or (= (+ .cse200 .cse204) |ULTIMATE.start_main_~A~0#1|) .cse205) (or (= (+ .cse200 .cse206) |ULTIMATE.start_main_~A~0#1|) .cse207 .cse208)) .cse201)) .cse187)) .cse99))) (or .cse95 (and (or (and (or (and (or .cse209 (and (or .cse205 (= (+ .cse210 .cse204) |ULTIMATE.start_main_~A~0#1|)) (or .cse207 (= (+ .cse210 .cse206) |ULTIMATE.start_main_~A~0#1|) .cse208))) (or .cse211 (and (or .cse207 (= |ULTIMATE.start_main_~A~0#1| (+ .cse212 .cse206)) .cse208) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse212 .cse204)) .cse205)) .cse213)) .cse104 .cse105 .cse185) (or (and (or .cse214 (and (or (= (+ .cse215 .cse204) |ULTIMATE.start_main_~A~0#1|) .cse205) (or .cse207 (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse206)) .cse208)) .cse216) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse204 .cse217)) .cse205) (or .cse207 (= (+ .cse206 .cse217) |ULTIMATE.start_main_~A~0#1|) .cse208)) .cse218)) .cse96 .cse186)) .cse99) (or (and (or (and (or (and (or (= (+ .cse210 .cse195) |ULTIMATE.start_main_~A~0#1|) .cse193 .cse194) (or .cse192 (= (+ .cse210 .cse191) |ULTIMATE.start_main_~A~0#1|))) .cse209) (or .cse211 .cse213 (and (or .cse193 .cse194 (= |ULTIMATE.start_main_~A~0#1| (+ .cse212 .cse195))) (or .cse192 (= |ULTIMATE.start_main_~A~0#1| (+ .cse212 .cse191)))))) .cse104 .cse105 .cse185) (or (and (or (and (or .cse192 (= (+ .cse191 .cse217) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse195 .cse217) |ULTIMATE.start_main_~A~0#1|) .cse193 .cse194)) .cse218) (or .cse214 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse195)) .cse193 .cse194) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse215 .cse191)) .cse192)) .cse216)) .cse96 .cse186)) .cse101 .cse102)) .cse59))) .cse94)) (.cse49 (let ((.cse166 (not .cse188)) (.cse167 (not .cse187)) (.cse170 (not .cse186)) (.cse175 (not .cse185))) (let ((.cse159 (or .cse183 .cse120 (let ((.cse184 (+ .cse155 1))) (and (or .cse112 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 (* .cse184 .cse165))) .cse107 .cse108 .cse166) (or .cse110 .cse167 (= (+ (* .cse184 .cse169) .cse168) |ULTIMATE.start_main_~A~0#1|)))) (or .cse95 (and (or .cse170 (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 (* .cse184 .cse172))) .cse96) (or .cse175 .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse184 .cse173) .cse174)))) .cse59))) .cse121)) (.cse160 (or .cse177 (and (or (not .cse129) .cse112 (= (+ .cse178 (* .cse179 .cse180)) |ULTIMATE.start_main_~A~0#1|)) (or .cse95 (not .cse134) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse180 .cse181) .cse182)) .cse59)))) (.cse161 (or .cse162 (let ((.cse164 (+ .cse176 1))) (and (or .cse112 (and (or (= (+ .cse163 (* .cse164 .cse165)) |ULTIMATE.start_main_~A~0#1|) .cse107 .cse108 .cse166) (or .cse110 .cse167 (= (+ .cse168 (* .cse164 .cse169)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse95 (and (or .cse170 .cse96 (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 (* .cse164 .cse172)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse164 .cse173) .cse174)) .cse175 .cse104 .cse105)) .cse59))) .cse94))) (or (and .cse53 .cse54 .cse1 .cse24 .cse55 .cse36 .cse27 .cse56 .cse29 .cse159 .cse61 .cse160 .cse10 .cse161 .cse14 .cse58 .cse31 .cse59) (and .cse53 .cse54 .cse1 .cse24 .cse55 .cse27 .cse56 .cse29 .cse159 .cse61 .cse160 .cse10 .cse161 .cse14 .cse93 .cse58 .cse31 .cse59))))) (.cse42 (or (let ((.cse158 (* (+ .cse113 .cse137) |ULTIMATE.start_main_~B~0#1|)) (.cse157 (* (+ .cse137 .cse114) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse112 (and (or (and (or .cse101 .cse102 (= (+ .cse157 .cse130) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse130 .cse158)) .cse99)) .cse107 .cse108) (or .cse110 (and (or .cse99 (= (+ .cse133 .cse158) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse157 .cse133) |ULTIMATE.start_main_~A~0#1|) .cse101 .cse102)))) .cse129) (or .cse95 (and (or (and (or (= (+ .cse135 .cse157) |ULTIMATE.start_main_~A~0#1|) .cse101 .cse102) (or (= (+ .cse135 .cse158) |ULTIMATE.start_main_~A~0#1|) .cse99)) .cse104 .cse105) (or (and (or (= (+ .cse158 .cse136) |ULTIMATE.start_main_~A~0#1|) .cse99) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse136)) .cse101 .cse102)) .cse96)) .cse134 .cse59))) .cse94)) (.cse43 (or (and (or .cse124 .cse138 .cse126 (and (or .cse139 (not (= .cse140 1))) (or (not (= .cse141 1)) .cse142 .cse143))) (or .cse122 .cse144 (and (or .cse145 (not (= .cse146 1))) (or .cse147 .cse148 (not (= .cse149 1)))))) .cse120 (let ((.cse152 (* .cse155 .cse156))) (and (or .cse95 .cse150 (= |ULTIMATE.start_main_~A~0#1| (+ .cse151 .cse152)) .cse59) (or .cse112 (= (+ .cse153 .cse152) |ULTIMATE.start_main_~A~0#1|) .cse154))) .cse121)) (.cse44 (or .cse120 (let ((.cse131 (* (+ .cse128 .cse137) |ULTIMATE.start_main_~B~0#1|)) (.cse132 (* (+ .cse137 .cse127) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse112 .cse129 (and (or .cse107 (and (or .cse124 .cse126 (= |ULTIMATE.start_main_~A~0#1| (+ .cse130 .cse131))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse130 .cse132)) .cse122)) .cse108) (or .cse110 (and (or .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse131)) .cse126) (or (= (+ .cse132 .cse133) |ULTIMATE.start_main_~A~0#1|) .cse122))))) (or .cse95 .cse134 (and (or (and (or .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse131)) .cse126) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse132)))) .cse104 .cse105) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse136)) .cse124 .cse126) (or .cse122 (= (+ .cse132 .cse136) |ULTIMATE.start_main_~A~0#1|))) .cse96)) .cse59))) .cse121)) (.cse35 (or .cse120 .cse121 (let ((.cse125 (* |ULTIMATE.start_main_~B~0#1| (+ .cse128 |ULTIMATE.start_main_~q~0#1|))) (.cse123 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse127)))) (and (or .cse95 (and (or (and (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse103 .cse123))) (or .cse124 (= (+ .cse125 .cse103) |ULTIMATE.start_main_~A~0#1|) .cse126)) .cse104 .cse105) (or .cse96 (and (or .cse122 (= (+ .cse98 .cse123) |ULTIMATE.start_main_~A~0#1|)) (or .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ .cse125 .cse98)) .cse126)))) .cse106 .cse59) (or .cse55 (and (or .cse110 (and (or .cse122 (= (+ .cse111 .cse123) |ULTIMATE.start_main_~A~0#1|)) (or .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ .cse111 .cse125)) .cse126))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse125)) .cse124 .cse126) (or .cse122 (= (+ .cse109 .cse123) |ULTIMATE.start_main_~A~0#1|))) .cse107 .cse108)) .cse112))))) (.cse60 (<= 4 |ULTIMATE.start_main_~p~0#1|)) (.cse38 (or .cse116 .cse117 (and (or .cse95 .cse118 .cse106 .cse59) (or .cse55 .cse119 .cse112)))) (.cse7 (or .cse115 (not .cse9) .cse93)) (.cse63 (<= 2 |ULTIMATE.start_main_~d~0#1|)) (.cse39 (or .cse94 (let ((.cse100 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse114))) (.cse97 (* |ULTIMATE.start_main_~B~0#1| (+ .cse113 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse95 (and (or .cse96 (and (or (= (+ .cse97 .cse98) |ULTIMATE.start_main_~A~0#1|) .cse99) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse98 .cse100)) .cse101 .cse102))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse103 .cse100)) .cse101 .cse102) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse103)) .cse99)) .cse104 .cse105)) .cse106 .cse59) (or .cse55 (and (or .cse107 .cse108 (and (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse100)) .cse102) (or .cse99 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse97))))) (or .cse110 (and (or (= (+ .cse111 .cse100) |ULTIMATE.start_main_~A~0#1|) .cse101 .cse102) (or (= (+ .cse111 .cse97) |ULTIMATE.start_main_~A~0#1|) .cse99)))) .cse112)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse23 (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) .cse28)))) (and (let ((.cse20 (< .cse23 0)) (.cse18 (div (+ |ULTIMATE.start_main_~A~0#1| .cse21 .cse22) 2)) (.cse19 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0))) (or (and (= .cse18 |ULTIMATE.start_main_~d~0#1|) (or .cse19 (not .cse20))) (and .cse20 (= |ULTIMATE.start_main_~d~0#1| (+ .cse18 1)) (not .cse19)))) .cse24 .cse25 (= |ULTIMATE.start_main_~B~0#1| (+ (* (- 2) |ULTIMATE.start_main_~B~0#1|) .cse26 |ULTIMATE.start_main_~A~0#1|)) (= 2 .cse23) .cse27 (>= .cse28 |ULTIMATE.start_main_~d~0#1|) .cse29 .cse10 (= (+ (- 2) |ULTIMATE.start_main_~q~0#1|) 1) .cse14 .cse15 (not (>= (+ .cse28 .cse23) .cse30)) .cse31 (= (+ (* (- 1) 2) .cse32) 0))) (and .cse1 .cse33 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse34 .cse35 .cse0 .cse1 .cse2 .cse36 .cse37 .cse38 .cse3 .cse5 .cse6 .cse8 .cse39 .cse9 .cse10 .cse11 .cse40 .cse41 .cse14 .cse15 .cse42 .cse43 .cse44) (and .cse1 .cse33 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse1 .cse33 .cse7 .cse9 .cse15) (and .cse1 .cse45 (= (* 2 .cse30) |ULTIMATE.start_main_~p~0#1|) .cse46 (>= |ULTIMATE.start_main_~r~0#1| .cse47) .cse9 .cse48 (= (* .cse47 2) |ULTIMATE.start_main_~d~0#1|) .cse15 .cse49) (and .cse1 .cse33 .cse5 .cse7 .cse9 .cse10 .cse15) (and .cse50 (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 .cse2 .cse25 .cse51 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse10 .cse15 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1)) .cse52) (and .cse25 .cse51 .cse46 .cse48 .cse15) (and .cse1 .cse36 .cse6 .cse7 .cse9 .cse10 .cse14 .cse15) (and .cse53 .cse54 .cse55 (= .cse47 |ULTIMATE.start_main_~d~0#1|) .cse56 (= |ULTIMATE.start_main_~p~0#1| .cse30) .cse46 (= |ULTIMATE.start_main_~d~0#1| .cse30) .cse57 .cse48 .cse15 .cse58 .cse59) (and .cse0 .cse1 .cse2 .cse33 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse60 (= |ULTIMATE.start_main_~p~0#1| 4) .cse50 .cse1 .cse24 .cse36 .cse29 .cse61 (= |ULTIMATE.start_main_~d~0#1| .cse62) .cse63 .cse9 .cse10 (= (+ |ULTIMATE.start_main_~A~0#1| .cse22) |ULTIMATE.start_main_~r~0#1|) .cse64 .cse14 .cse15 .cse58 .cse52 (>= .cse28 .cse47)) (let ((.cse68 (* |ULTIMATE.start_main_~B~0#1| (- 4)))) (let ((.cse65 (+ .cse68 .cse26 |ULTIMATE.start_main_~A~0#1|)) (.cse67 (+ .cse68 |ULTIMATE.start_main_~A~0#1|))) (and .cse35 (not (>= (+ .cse65 |ULTIMATE.start_main_~r~0#1|) .cse66)) .cse0 .cse2 .cse25 .cse37 (= .cse65 |ULTIMATE.start_main_~B~0#1|) .cse33 .cse51 (= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 1) .cse39 .cse9 .cse10 (>= (+ .cse62 .cse67) .cse47) .cse41 .cse64 (not (>= .cse67 .cse66)) (= |ULTIMATE.start_main_~r~0#1| (+ .cse22 .cse67)) (= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~p~0#1| 4)) .cse15 .cse42 .cse44))) (and .cse69 (= |ULTIMATE.start_main_~d~0#1| .cse70) .cse46 .cse9 .cse48 .cse15 .cse71) (and .cse72 .cse1 .cse25 .cse73 .cse33 (or (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse74)) .cse75 (let ((.cse78 (= (mod .cse74 2) 0)) (.cse76 (< .cse74 0)) (.cse77 (div .cse79 4))) (or (and .cse76 (= (+ .cse77 1) |ULTIMATE.start_main_~d~0#1|) (not .cse78)) (and (or .cse78 (not .cse76)) (= |ULTIMATE.start_main_~d~0#1| .cse77))))) (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse80)) (let ((.cse82 (= (mod .cse80 2) 0)) (.cse81 (< .cse80 0)) (.cse83 (div .cse80 2))) (or (and .cse81 (not .cse82) (= (+ .cse83 1) |ULTIMATE.start_main_~d~0#1|)) (and (or .cse82 (not .cse81)) (= .cse83 |ULTIMATE.start_main_~d~0#1|)))) .cse84 .cse85)) .cse12 .cse64 .cse15 .cse16 .cse17) (and .cse86 .cse25 (= (+ (* (- 1) .cse70) |ULTIMATE.start_main_~q~0#1|) 0) .cse15 .cse16 (= .cse87 .cse66)) (and .cse50 .cse1 .cse36 .cse69 .cse88 .cse63 .cse10 (= .cse32 0) .cse15 .cse58 (= 2 |ULTIMATE.start_main_~d~0#1|) (not (>= .cse28 .cse30)) .cse71) (and .cse35 .cse1 .cse38 .cse33 .cse7 .cse39 .cse9 .cse15) (and .cse34 .cse0 .cse1 .cse2 .cse33 .cse3 .cse7 .cse8 .cse9 .cse12 .cse15 .cse16 .cse17) (let ((.cse89 (+ |ULTIMATE.start_main_~r~0#1| .cse62))) (and .cse72 .cse1 .cse86 .cse73 .cse69 (= .cse89 |ULTIMATE.start_main_~A~0#1|) .cse88 .cse6 (>= .cse89 .cse47) .cse57 .cse9 (= |ULTIMATE.start_main_~q~0#1| 4) (let ((.cse91 (= (mod |ULTIMATE.start_main_~q~0#1| 2) 0)) (.cse92 (< |ULTIMATE.start_main_~q~0#1| 0)) (.cse90 (div |ULTIMATE.start_main_~q~0#1| 2))) (or (and (= .cse90 |ULTIMATE.start_main_~p~0#1|) (or .cse91 (not .cse92))) (and (not .cse91) .cse92 (= (+ .cse90 1) |ULTIMATE.start_main_~p~0#1|)))) .cse10 .cse12 .cse64 .cse14 .cse15 .cse16 .cse17)) (and .cse1 .cse9 (or (and .cse34 .cse35 .cse0 .cse1 .cse2 .cse37 .cse38 .cse45 .cse3 .cse5 .cse8 .cse39 .cse9 .cse48 .cse10 .cse11 .cse40 .cse41 .cse93 .cse15 .cse49 .cse42 .cse43 .cse44) (and .cse35 .cse0 .cse1 .cse2 .cse36 .cse37 .cse38 .cse45 .cse3 .cse4 .cse5 .cse8 .cse39 .cse9 .cse48 .cse10 .cse11 .cse40 .cse41 .cse15 .cse49 .cse42 .cse43 .cse44)) .cse48 .cse15) (and .cse35 .cse60 .cse1 .cse24 .cse36 .cse38 .cse29 .cse61 .cse7 .cse63 .cse39 .cse9 .cse10 .cse14 .cse15 .cse58)))))))))) [2023-02-18 03:06:39,458 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-02-18 03:06:39,461 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse158 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse311 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse312 (+ .cse311 1)) (.cse157 (+ .cse158 1))) (let ((.cse226 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse229 (div .cse157 2)) (.cse327 (- .cse158)) (.cse179 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse186 (div .cse312 2)) (.cse149 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse148 (* 2 |ULTIMATE.start_main_~d~0#1|))) (let ((.cse58 (- |ULTIMATE.start_main_~d~0#1|)) (.cse286 (div .cse148 4)) (.cse322 (div .cse149 4)) (.cse57 (- |ULTIMATE.start_main_~r~0#1|)) (.cse60 (* (- 1) |ULTIMATE.start_main_~r~0#1|)) (.cse183 (= (mod .cse312 2) 0)) (.cse334 (< .cse312 0)) (.cse187 (+ .cse186 1)) (.cse180 (+ .cse179 1)) (.cse335 (< .cse311 0)) (.cse170 (= (mod .cse311 2) 0)) (.cse326 (+ (- 1) .cse327)) (.cse230 (+ .cse229 1)) (.cse222 (+ .cse226 1)) (.cse314 (- .cse229)) (.cse316 (- .cse226)) (.cse1 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse85 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse213 (+ |ULTIMATE.start_main_~q~0#1| .cse312)) (.cse337 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse96 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse233 (+ |ULTIMATE.start_main_~q~0#1| .cse311)) (.cse336 (< |ULTIMATE.start_main_~d~0#1| 0))) (let ((.cse291 (= .cse311 1)) (.cse290 (= .cse312 1)) (.cse98 (not .cse336)) (.cse324 (* |ULTIMATE.start_main_~B~0#1| .cse233)) (.cse127 (and .cse337 (not .cse96))) (.cse325 (* .cse213 |ULTIMATE.start_main_~B~0#1|)) (.cse97 (not .cse337)) (.cse115 (and (not .cse85) .cse336)) (.cse152 (not .cse1)) (.cse94 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse317 (+ (- 1) .cse316)) (.cse174 (= (mod .cse158 2) 0)) (.cse328 (< .cse158 0)) (.cse315 (+ (- 1) .cse314)) (.cse329 (< .cse157 0)) (.cse172 (= (mod .cse157 2) 0)) (.cse330 (< .cse222 0)) (.cse251 (= (mod .cse222 2) 0)) (.cse211 (+ |ULTIMATE.start_main_~r~0#1| .cse327)) (.cse253 (= (mod .cse226 2) 0)) (.cse331 (< .cse226 0)) (.cse267 (= (mod .cse230 2) 0)) (.cse332 (< .cse230 0)) (.cse209 (+ |ULTIMATE.start_main_~r~0#1| .cse326)) (.cse270 (= (mod .cse229 2) 0)) (.cse333 (< .cse229 0)) (.cse301 (div .cse222 2)) (.cse300 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse298 (div .cse157 4)) (.cse299 (div .cse230 2)) (.cse278 (= .cse179 1)) (.cse167 (and .cse335 (not .cse170))) (.cse277 (= .cse180 1)) (.cse169 (not .cse335)) (.cse196 (= .cse187 1)) (.cse185 (not .cse334)) (.cse181 (and .cse334 (not .cse183))) (.cse202 (= .cse186 1)) (.cse89 (+ .cse60 |ULTIMATE.start_main_~A~0#1|)) (.cse10 (+ |ULTIMATE.start_main_~A~0#1| .cse57)) (.cse323 (+ .cse322 1)) (.cse117 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse287 (+ .cse286 1)) (.cse129 (+ |ULTIMATE.start_main_~r~0#1| .cse58))) (let ((.cse116 (>= .cse129 .cse286)) (.cse99 (>= .cse129 .cse287)) (.cse235 (+ .cse117 1)) (.cse154 (= 1 .cse323)) (.cse153 (= .cse322 1)) (.cse141 (+ |ULTIMATE.start_main_~q~0#1| .cse149)) (.cse76 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse5 (div .cse10 2)) (.cse16 (< .cse89 0)) (.cse289 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse90 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse237 (and (or (not .cse196) .cse183 .cse185) (or .cse181 (not .cse202)))) (.cse219 (and (or (not .cse278) .cse167) (or (not .cse277) .cse169 .cse170))) (.cse204 (div .cse312 4)) (.cse198 (div .cse187 2)) (.cse200 (= (mod .cse187 2) 0)) (.cse293 (< .cse187 0)) (.cse292 (- .cse299)) (.cse294 (- .cse298)) (.cse205 (= (mod .cse186 2) 0)) (.cse295 (< .cse186 0)) (.cse296 (- .cse300)) (.cse297 (- .cse301)) (.cse272 (and (not .cse270) .cse333)) (.cse268 (not .cse333)) (.cse240 (>= .cse209 .cse229)) (.cse265 (not .cse332)) (.cse263 (and (not .cse267) .cse332)) (.cse239 (>= .cse209 .cse230)) (.cse257 (and (not .cse253) .cse331)) (.cse255 (not .cse331)) (.cse241 (>= .cse211 .cse226)) (.cse243 (and .cse330 (not .cse251))) (.cse250 (not .cse330)) (.cse242 (>= .cse211 .cse222)) (.cse261 (= (mod .cse179 2) 0)) (.cse302 (< .cse179 0)) (.cse276 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse247 (= (mod .cse180 2) 0)) (.cse273 (div .cse180 2)) (.cse303 (< .cse180 0)) (.cse228 (+ .cse209 .cse314)) (.cse164 (and .cse329 (not .cse172))) (.cse173 (not .cse329)) (.cse231 (+ .cse209 .cse315)) (.cse45 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse162 (>= |ULTIMATE.start_main_~r~0#1| .cse157)) (.cse83 (>= |ULTIMATE.start_main_~r~0#1| .cse158)) (.cse305 (* (+ .cse213 .cse186) |ULTIMATE.start_main_~B~0#1|)) (.cse304 (* (+ .cse187 .cse213) |ULTIMATE.start_main_~B~0#1|)) (.cse177 (and (not .cse174) .cse328)) (.cse225 (+ .cse316 .cse211)) (.cse307 (* (+ .cse179 .cse233) |ULTIMATE.start_main_~B~0#1|)) (.cse220 (+ .cse317 .cse211)) (.cse306 (* (+ .cse180 .cse233) |ULTIMATE.start_main_~B~0#1|)) (.cse175 (not .cse328)) (.cse234 (+ .cse129 .cse327)) (.cse236 (+ .cse129 .cse326)) (.cse24 (or .cse152 .cse94)) (.cse21 (or (and (or (= (+ .cse324 .cse211) |ULTIMATE.start_main_~A~0#1|) .cse127) (or (= (+ .cse325 .cse211) |ULTIMATE.start_main_~A~0#1|) .cse96 .cse97)) .cse115)) (.cse22 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse23 (or .cse98 (and (or .cse127 (= (+ .cse209 .cse324) |ULTIMATE.start_main_~A~0#1|)) (or .cse96 .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse325 .cse209)))) .cse85)) (.cse68 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse31 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse70 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse32 (= |ULTIMATE.start_main_~A~0#1| (+ .cse129 (* |ULTIMATE.start_main_~B~0#1| .cse117)))) (.cse18 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse156 (and (or (not .cse291) .cse127) (or .cse96 .cse97 (not .cse290)))) (.cse151 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse118 (div .cse323 2)) (.cse102 (= (mod .cse323 2) 0)) (.cse318 (< .cse323 0)) (.cse120 (= (mod .cse322 2) 0)) (.cse126 (div .cse149 8)) (.cse319 (< .cse322 0)) (.cse110 (= (mod .cse286 2) 0)) (.cse320 (< .cse286 0)) (.cse100 (= (mod .cse287 2) 0)) (.cse321 (< .cse287 0)) (.cse142 (div (* |ULTIMATE.start_main_~p~0#1| 4) 8)) (.cse288 (>= |ULTIMATE.start_main_~r~0#1| .cse148)) (.cse138 (+ (- .cse148) |ULTIMATE.start_main_~r~0#1|))) (let ((.cse133 (>= .cse138 |ULTIMATE.start_main_~d~0#1|)) (.cse144 (not .cse288)) (.cse143 (+ .cse142 1)) (.cse140 (div (* |ULTIMATE.start_main_~d~0#1| 4) 8)) (.cse101 (not .cse321)) (.cse109 (and .cse321 (not .cse100))) (.cse131 (div .cse287 2)) (.cse111 (not .cse320)) (.cse113 (and (not .cse110) .cse320)) (.cse132 (div .cse148 8)) (.cse121 (not .cse319)) (.cse125 (+ .cse126 1)) (.cse124 (and (not .cse120) .cse319)) (.cse107 (and (not .cse102) .cse318)) (.cse103 (not .cse318)) (.cse119 (+ .cse118 1)) (.cse159 (= (+ |ULTIMATE.start_main_~r~0#1| (* .cse151 |ULTIMATE.start_main_~q~0#1|)) |ULTIMATE.start_main_~A~0#1|)) (.cse171 (+ .cse315 |ULTIMATE.start_main_~r~0#1|)) (.cse166 (+ |ULTIMATE.start_main_~r~0#1| .cse314)) (.cse178 (+ .cse316 |ULTIMATE.start_main_~r~0#1|)) (.cse176 (+ .cse317 |ULTIMATE.start_main_~r~0#1|)) (.cse189 (+ .cse129 .cse317)) (.cse192 (+ .cse316 .cse129)) (.cse194 (+ .cse315 .cse129)) (.cse195 (+ .cse129 .cse314)) (.cse81 (or .cse156 (and (or (= .cse158 |ULTIMATE.start_main_~B~0#1|) .cse115) (or .cse98 (= |ULTIMATE.start_main_~B~0#1| .cse157) .cse85)))) (.cse82 (let ((.cse313 (or .cse156 (and (or .cse98 .cse85 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse157)) |ULTIMATE.start_main_~A~0#1|)) (or .cse115 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse158 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse21 .cse22 .cse23 .cse24 .cse313 .cse68 .cse31 .cse70 .cse32 .cse18) (and .cse21 .cse22 .cse23 .cse313 .cse68 .cse31 .cse70 .cse32 .cse94 .cse18)))) (.cse48 (or .cse1 (let ((.cse310 (* (+ .cse117 .cse312) |ULTIMATE.start_main_~B~0#1|)) (.cse309 (* (+ .cse117 .cse311) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse309 .cse234) |ULTIMATE.start_main_~A~0#1|) .cse127) (or .cse96 .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse234 .cse310)))) .cse115) (or .cse98 (and (or .cse96 (= |ULTIMATE.start_main_~A~0#1| (+ .cse236 .cse310)) .cse97) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse236 .cse309)) .cse127)) .cse85))))) (.cse61 (or (and (or .cse290 .cse96 .cse97 (and (or .cse174 .cse175 (and (or .cse183 (= (+ .cse220 .cse304) |ULTIMATE.start_main_~A~0#1|) .cse185) (or .cse181 (= |ULTIMATE.start_main_~A~0#1| (+ .cse305 .cse220))))) (or .cse177 (and (or .cse181 (= (+ .cse305 .cse225) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse304 .cse225)) .cse183 .cse185))))) (or (and (or .cse177 (and (or (= (+ .cse307 .cse225) |ULTIMATE.start_main_~A~0#1|) .cse167) (or (= (+ .cse225 .cse306) |ULTIMATE.start_main_~A~0#1|) .cse169 .cse170))) (or (and (or .cse167 (= (+ .cse307 .cse220) |ULTIMATE.start_main_~A~0#1|)) (or .cse169 .cse170 (= |ULTIMATE.start_main_~A~0#1| (+ .cse220 .cse306)))) .cse174 .cse175)) .cse127 .cse291)) .cse115)) (.cse84 (<= 2 .cse158)) (.cse49 (or .cse1 (and .cse21 .cse23))) (.cse50 (or .cse156 (let ((.cse308 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse98 (not .cse162) .cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse209 (* .cse308 .cse157)))) (or (not .cse83) .cse115 (= (+ (* .cse158 .cse308) .cse211) |ULTIMATE.start_main_~A~0#1|)))))) (.cse53 (or .cse152 .cse45)) (.cse65 (or .cse98 .cse85 (and (or .cse290 .cse96 .cse97 (and (or (and (or (= (+ .cse304 .cse231) |ULTIMATE.start_main_~A~0#1|) .cse183 .cse185) (or .cse181 (= |ULTIMATE.start_main_~A~0#1| (+ .cse305 .cse231)))) .cse172 .cse173) (or .cse164 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 .cse304)) .cse183 .cse185) (or .cse181 (= (+ .cse228 .cse305) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse169 .cse170 (= (+ .cse228 .cse306) |ULTIMATE.start_main_~A~0#1|)) (or .cse167 (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 .cse307)))) .cse164) (or .cse172 .cse173 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse231 .cse306)) .cse169 .cse170) (or (= (+ .cse307 .cse231) |ULTIMATE.start_main_~A~0#1|) .cse167)))) .cse127 .cse291)))) (.cse248 (not .cse303)) (.cse274 (+ 1 .cse273)) (.cse246 (and (not .cse247) .cse303)) (.cse275 (+ .cse276 1)) (.cse262 (not .cse302)) (.cse259 (and (not .cse261) .cse302)) (.cse212 (and (or .cse177 (and (or (not (= .cse151 .cse300)) .cse257) (or .cse253 .cse255 (not (= .cse151 (+ .cse300 1))))) .cse241) (or .cse174 (and (or (not (= .cse151 .cse301)) .cse243) (or .cse250 .cse251 (not (= .cse151 (+ .cse301 1))))) .cse175 .cse242))) (.cse208 (and (or (and (or (not (= .cse151 .cse298)) .cse272) (or .cse268 (not (= .cse151 (+ .cse298 1))) .cse270)) .cse164 .cse240) (or (and (or .cse265 .cse267 (not (= .cse151 (+ .cse299 1)))) (or .cse263 (not (= .cse151 .cse299)))) .cse172 .cse173 .cse239))) (.cse244 (+ .cse211 .cse297)) (.cse252 (+ (+ (- 1) .cse297) .cse211)) (.cse254 (+ (+ (- 1) .cse296) .cse211)) (.cse256 (+ .cse211 .cse296)) (.cse206 (not .cse295)) (.cse203 (and (not .cse205) .cse295)) (.cse269 (+ .cse209 (+ (- 1) .cse294))) (.cse271 (+ .cse294 .cse209)) (.cse266 (+ .cse209 (+ (- 1) .cse292))) (.cse201 (not .cse293)) (.cse197 (and (not .cse200) .cse293)) (.cse264 (+ .cse209 .cse292)) (.cse199 (+ .cse198 1)) (.cse207 (+ .cse204 1)) (.cse160 (and (or .cse237 .cse290 .cse96 .cse97) (or .cse219 .cse127 .cse291))) (.cse193 (>= .cse129 .cse157)) (.cse161 (and (or .cse164 (not (= .cse151 .cse229))) (or (not (= .cse151 .cse230)) .cse172 .cse173))) (.cse163 (and (or .cse174 (not (= .cse151 .cse222)) .cse175) (or .cse177 (not (= .cse151 .cse226))))) (.cse188 (>= .cse129 .cse158)) (.cse155 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse151 .cse117) .cse129))) (.cse69 (* 2 .cse90)) (.cse86 (* 2 1)) (.cse62 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse6 (or (not .cse16) .cse289)) (.cse11 (+ .cse5 1)) (.cse15 (not .cse289)) (.cse145 (or .cse152 (= (+ .cse129 (* |ULTIMATE.start_main_~d~0#1| .cse117)) |ULTIMATE.start_main_~A~0#1|) .cse76)) (.cse52 (or (= .cse149 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ .cse138 .cse58) (* |ULTIMATE.start_main_~B~0#1| (+ .cse141 |ULTIMATE.start_main_~p~0#1|)))))) (.cse63 (or .cse22 (and .cse22 (<= 1 |ULTIMATE.start_main_~d~0#1|)))) (.cse146 (or (let ((.cse285 (- .cse286))) (and (or .cse115 (= (+ (+ .cse129 .cse285) (* .cse286 .cse235)) |ULTIMATE.start_main_~A~0#1|) (not .cse116)) (or .cse98 (not .cse99) (= (+ (+ (+ (- 1) .cse285) .cse129) (* .cse287 .cse235)) |ULTIMATE.start_main_~A~0#1|) .cse85))) (and (or (not .cse154) .cse96 .cse97) (or (not .cse153) .cse127)) .cse288)) (.cse80 (* |ULTIMATE.start_main_~B~0#1| 4))) (let ((.cse0 (= (+ 4 0) |ULTIMATE.start_main_~q~0#1|)) (.cse2 (= .cse89 .cse80)) (.cse47 (<= 4 |ULTIMATE.start_main_~p~0#1|)) (.cse46 (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|)) (.cse36 (let ((.cse284 (<= 2 |ULTIMATE.start_main_~p~0#1|))) (or (and .cse22 .cse24 .cse284 .cse32 .cse52 .cse63) (and .cse22 .cse284 .cse32 .cse145 .cse52 .cse63 .cse146)))) (.cse72 (or (and (= |ULTIMATE.start_main_~d~0#1| .cse5) .cse6) (and (= |ULTIMATE.start_main_~d~0#1| .cse11) .cse15 .cse16))) (.cse44 (= .cse62 |ULTIMATE.start_main_~A~0#1|)) (.cse73 (= |ULTIMATE.start_main_~d~0#1| .cse90)) (.cse75 (= 2 |ULTIMATE.start_main_~p~0#1|)) (.cse51 (<= 2 |ULTIMATE.start_main_~d~0#1|)) (.cse66 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|)) (.cse64 (* 2 .cse86)) (.cse87 (= |ULTIMATE.start_main_~p~0#1| .cse86)) (.cse17 (>= |ULTIMATE.start_main_~A~0#1| .cse69)) (.cse19 (or .cse160 (and (or .cse98 .cse193 .cse161 .cse85) (or .cse163 .cse115 .cse188)) .cse155)) (.cse25 (or .cse96 .cse97 (let ((.cse281 (* (+ .cse207 .cse213) |ULTIMATE.start_main_~B~0#1|)) (.cse280 (* (+ .cse213 .cse204) |ULTIMATE.start_main_~B~0#1|)) (.cse283 (* |ULTIMATE.start_main_~B~0#1| (+ .cse199 .cse213))) (.cse282 (* |ULTIMATE.start_main_~B~0#1| (+ .cse213 .cse198)))) (and (or (and (or .cse181 (and (or .cse174 .cse175 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse244 .cse280)) .cse203) (or .cse205 .cse206 (= |ULTIMATE.start_main_~A~0#1| (+ .cse244 .cse281)))) .cse243) (or (and (or .cse205 (= (+ .cse252 .cse281) |ULTIMATE.start_main_~A~0#1|) .cse206) (or .cse203 (= (+ .cse280 .cse252) |ULTIMATE.start_main_~A~0#1|))) .cse250 .cse251)) .cse242) (or .cse177 (and (or .cse253 .cse255 (and (or .cse203 (= (+ .cse280 .cse254) |ULTIMATE.start_main_~A~0#1|)) (or .cse205 .cse206 (= (+ .cse281 .cse254) |ULTIMATE.start_main_~A~0#1|)))) (or .cse257 (and (or .cse205 .cse206 (= (+ .cse256 .cse281) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse256 .cse280) |ULTIMATE.start_main_~A~0#1|) .cse203)))) .cse241))) (or (and (or .cse174 (and (or .cse243 (and (or .cse197 (= |ULTIMATE.start_main_~A~0#1| (+ .cse244 .cse282))) (or .cse200 (= (+ .cse283 .cse244) |ULTIMATE.start_main_~A~0#1|) .cse201))) (or .cse250 .cse251 (and (or (= (+ .cse252 .cse282) |ULTIMATE.start_main_~A~0#1|) .cse197) (or .cse200 (= |ULTIMATE.start_main_~A~0#1| (+ .cse283 .cse252)) .cse201)))) .cse175 .cse242) (or .cse177 .cse241 (and (or .cse253 (and (or .cse200 .cse201 (= |ULTIMATE.start_main_~A~0#1| (+ .cse283 .cse254))) (or .cse197 (= (+ .cse282 .cse254) |ULTIMATE.start_main_~A~0#1|))) .cse255) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse256 .cse282)) .cse197) (or .cse200 .cse201 (= (+ .cse256 .cse283) |ULTIMATE.start_main_~A~0#1|))) .cse257)))) .cse183 .cse185)) .cse115) (or .cse98 (and (or (and (or (and (or (and (or .cse205 (= (+ .cse266 .cse281) |ULTIMATE.start_main_~A~0#1|) .cse206) (or .cse203 (= |ULTIMATE.start_main_~A~0#1| (+ .cse266 .cse280)))) .cse265 .cse267) (or .cse263 (and (or .cse205 (= |ULTIMATE.start_main_~A~0#1| (+ .cse264 .cse281)) .cse206) (or .cse203 (= (+ .cse264 .cse280) |ULTIMATE.start_main_~A~0#1|))))) .cse172 .cse173 .cse239) (or .cse164 .cse240 (and (or .cse268 (and (or (= (+ .cse269 .cse281) |ULTIMATE.start_main_~A~0#1|) .cse205 .cse206) (or .cse203 (= |ULTIMATE.start_main_~A~0#1| (+ .cse269 .cse280)))) .cse270) (or (and (or .cse205 (= (+ .cse281 .cse271) |ULTIMATE.start_main_~A~0#1|) .cse206) (or .cse203 (= |ULTIMATE.start_main_~A~0#1| (+ .cse280 .cse271)))) .cse272)))) .cse181) (or .cse183 .cse185 (and (or (and (or .cse268 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse283 .cse269)) .cse200 .cse201) (or .cse197 (= |ULTIMATE.start_main_~A~0#1| (+ .cse269 .cse282)))) .cse270) (or (and (or (= (+ .cse283 .cse271) |ULTIMATE.start_main_~A~0#1|) .cse200 .cse201) (or .cse197 (= |ULTIMATE.start_main_~A~0#1| (+ .cse282 .cse271)))) .cse272)) .cse164 .cse240) (or (and (or .cse265 (and (or .cse200 .cse201 (= (+ .cse266 .cse283) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse266 .cse282)) .cse197)) .cse267) (or .cse263 (and (or .cse200 (= (+ .cse264 .cse283) |ULTIMATE.start_main_~A~0#1|) .cse201) (or .cse197 (= (+ .cse264 .cse282) |ULTIMATE.start_main_~A~0#1|))))) .cse172 .cse173 .cse239)))) .cse85))))) (.cse67 (<= 8 |ULTIMATE.start_main_~p~0#1|)) (.cse34 (or (and (or .cse277 (and (or .cse247 .cse248 (not (= .cse274 1))) (or (not (= 1 .cse273)) .cse246)) .cse169 .cse170) (or .cse278 (and (or .cse261 (not (= .cse275 1)) .cse262) (or (not (= .cse276 1)) .cse259)) .cse167)) (let ((.cse279 (* .cse151 .cse233))) (and (or (= (+ .cse279 .cse211) |ULTIMATE.start_main_~A~0#1|) .cse115 .cse212) (or .cse98 .cse208 (= (+ .cse209 .cse279) |ULTIMATE.start_main_~A~0#1|) .cse85))) .cse127)) (.cse35 (or (let ((.cse258 (* |ULTIMATE.start_main_~B~0#1| (+ .cse233 .cse276))) (.cse260 (* |ULTIMATE.start_main_~B~0#1| (+ .cse275 .cse233))) (.cse249 (* |ULTIMATE.start_main_~B~0#1| (+ .cse274 .cse233))) (.cse245 (* (+ .cse233 .cse273) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse115 (and (or (and (or (and (or .cse243 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse244 .cse245)) .cse246) (or .cse247 .cse248 (= |ULTIMATE.start_main_~A~0#1| (+ .cse244 .cse249))))) (or .cse250 .cse251 (and (or .cse246 (= (+ .cse245 .cse252) |ULTIMATE.start_main_~A~0#1|)) (or .cse247 .cse248 (= |ULTIMATE.start_main_~A~0#1| (+ .cse249 .cse252)))))) .cse174 .cse175 .cse242) (or .cse177 .cse241 (and (or .cse253 (and (or .cse247 .cse248 (= |ULTIMATE.start_main_~A~0#1| (+ .cse249 .cse254))) (or (= (+ .cse245 .cse254) |ULTIMATE.start_main_~A~0#1|) .cse246)) .cse255) (or (and (or .cse247 (= (+ .cse256 .cse249) |ULTIMATE.start_main_~A~0#1|) .cse248) (or .cse246 (= (+ .cse256 .cse245) |ULTIMATE.start_main_~A~0#1|))) .cse257)))) .cse169 .cse170) (or (and (or .cse174 (and (or .cse250 .cse251 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse252 .cse258)) .cse259) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse252 .cse260)) .cse261 .cse262))) (or (and (or .cse261 .cse262 (= |ULTIMATE.start_main_~A~0#1| (+ .cse244 .cse260))) (or .cse259 (= (+ .cse244 .cse258) |ULTIMATE.start_main_~A~0#1|))) .cse243)) .cse175 .cse242) (or .cse177 (and (or (and (or .cse261 .cse262 (= |ULTIMATE.start_main_~A~0#1| (+ .cse256 .cse260))) (or (= (+ .cse256 .cse258) |ULTIMATE.start_main_~A~0#1|) .cse259)) .cse257) (or .cse253 (and (or (= (+ .cse254 .cse258) |ULTIMATE.start_main_~A~0#1|) .cse259) (or (= (+ .cse254 .cse260) |ULTIMATE.start_main_~A~0#1|) .cse261 .cse262)) .cse255)) .cse241)) .cse167))) (or .cse98 (and (or (and (or (and (or .cse263 (and (or .cse259 (= (+ .cse264 .cse258) |ULTIMATE.start_main_~A~0#1|)) (or .cse261 (= (+ .cse264 .cse260) |ULTIMATE.start_main_~A~0#1|) .cse262))) (or .cse265 (and (or .cse261 (= |ULTIMATE.start_main_~A~0#1| (+ .cse266 .cse260)) .cse262) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse266 .cse258)) .cse259)) .cse267)) .cse172 .cse173 .cse239) (or (and (or .cse268 (and (or (= (+ .cse269 .cse258) |ULTIMATE.start_main_~A~0#1|) .cse259) (or .cse261 (= |ULTIMATE.start_main_~A~0#1| (+ .cse269 .cse260)) .cse262)) .cse270) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse258 .cse271)) .cse259) (or .cse261 (= (+ .cse260 .cse271) |ULTIMATE.start_main_~A~0#1|) .cse262)) .cse272)) .cse164 .cse240)) .cse167) (or (and (or (and (or (and (or (= (+ .cse264 .cse249) |ULTIMATE.start_main_~A~0#1|) .cse247 .cse248) (or .cse246 (= (+ .cse264 .cse245) |ULTIMATE.start_main_~A~0#1|))) .cse263) (or .cse265 .cse267 (and (or .cse247 .cse248 (= |ULTIMATE.start_main_~A~0#1| (+ .cse266 .cse249))) (or .cse246 (= |ULTIMATE.start_main_~A~0#1| (+ .cse266 .cse245)))))) .cse172 .cse173 .cse239) (or (and (or (and (or .cse246 (= (+ .cse245 .cse271) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse249 .cse271) |ULTIMATE.start_main_~A~0#1|) .cse247 .cse248)) .cse272) (or .cse268 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse269 .cse249)) .cse247 .cse248) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse269 .cse245)) .cse246)) .cse270)) .cse164 .cse240)) .cse169 .cse170)) .cse85))) .cse127)) (.cse71 (let ((.cse223 (not .cse242)) (.cse224 (not .cse241)) (.cse227 (not .cse240)) (.cse232 (not .cse239))) (let ((.cse216 (or .cse237 .cse96 (let ((.cse238 (+ .cse213 1))) (and (or .cse115 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse220 (* .cse238 .cse222))) .cse174 .cse175 .cse223) (or .cse177 .cse224 (= (+ (* .cse238 .cse226) .cse225) |ULTIMATE.start_main_~A~0#1|)))) (or .cse98 (and (or .cse227 (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 (* .cse238 .cse229))) .cse164) (or .cse232 .cse172 .cse173 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse238 .cse230) .cse231)))) .cse85))) .cse97)) (.cse217 (or .cse156 (and (or (not .cse188) .cse115 (= (+ .cse234 (* .cse158 .cse235)) |ULTIMATE.start_main_~A~0#1|)) (or .cse98 (not .cse193) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse235 .cse157) .cse236)) .cse85)))) (.cse218 (or .cse219 (let ((.cse221 (+ .cse233 1))) (and (or .cse115 (and (or (= (+ .cse220 (* .cse221 .cse222)) |ULTIMATE.start_main_~A~0#1|) .cse174 .cse175 .cse223) (or .cse177 .cse224 (= (+ .cse225 (* .cse221 .cse226)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse98 (and (or .cse227 .cse164 (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 (* .cse221 .cse229)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse221 .cse230) .cse231)) .cse232 .cse172 .cse173)) .cse85))) .cse127))) (or (and .cse81 .cse82 .cse22 .cse48 .cse83 .cse24 .cse61 .cse84 .cse49 .cse216 .cse50 .cse217 .cse32 .cse218 .cse52 .cse53 .cse65 .cse85) (and .cse81 .cse82 .cse22 .cse48 .cse83 .cse61 .cse84 .cse49 .cse216 .cse50 .cse217 .cse32 .cse218 .cse52 .cse94 .cse53 .cse65 .cse85))))) (.cse37 (or (let ((.cse215 (* (+ .cse179 .cse117) |ULTIMATE.start_main_~B~0#1|)) (.cse214 (* (+ .cse117 .cse180) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse115 (and (or (and (or .cse169 .cse170 (= (+ .cse214 .cse189) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse189 .cse215)) .cse167)) .cse174 .cse175) (or .cse177 (and (or .cse167 (= (+ .cse192 .cse215) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse214 .cse192) |ULTIMATE.start_main_~A~0#1|) .cse169 .cse170)))) .cse188) (or .cse98 (and (or (and (or (= (+ .cse194 .cse214) |ULTIMATE.start_main_~A~0#1|) .cse169 .cse170) (or (= (+ .cse194 .cse215) |ULTIMATE.start_main_~A~0#1|) .cse167)) .cse172 .cse173) (or (and (or (= (+ .cse215 .cse195) |ULTIMATE.start_main_~A~0#1|) .cse167) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse214 .cse195)) .cse169 .cse170)) .cse164)) .cse193 .cse85))) .cse127)) (.cse38 (or (and (or .cse183 .cse196 .cse185 (and (or .cse197 (not (= .cse198 1))) (or (not (= .cse199 1)) .cse200 .cse201))) (or .cse181 .cse202 (and (or .cse203 (not (= .cse204 1))) (or .cse205 .cse206 (not (= .cse207 1)))))) .cse96 (let ((.cse210 (* .cse213 .cse151))) (and (or .cse98 .cse208 (= |ULTIMATE.start_main_~A~0#1| (+ .cse209 .cse210)) .cse85) (or .cse115 (= (+ .cse211 .cse210) |ULTIMATE.start_main_~A~0#1|) .cse212))) .cse97)) (.cse39 (or .cse96 (let ((.cse190 (* (+ .cse187 .cse117) |ULTIMATE.start_main_~B~0#1|)) (.cse191 (* (+ .cse117 .cse186) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse115 .cse188 (and (or .cse174 (and (or .cse183 .cse185 (= |ULTIMATE.start_main_~A~0#1| (+ .cse189 .cse190))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse189 .cse191)) .cse181)) .cse175) (or .cse177 (and (or .cse183 (= |ULTIMATE.start_main_~A~0#1| (+ .cse192 .cse190)) .cse185) (or (= (+ .cse191 .cse192) |ULTIMATE.start_main_~A~0#1|) .cse181))))) (or .cse98 .cse193 (and (or (and (or .cse183 (= |ULTIMATE.start_main_~A~0#1| (+ .cse194 .cse190)) .cse185) (or .cse181 (= |ULTIMATE.start_main_~A~0#1| (+ .cse194 .cse191)))) .cse172 .cse173) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse190 .cse195)) .cse183 .cse185) (or .cse181 (= (+ .cse191 .cse195) |ULTIMATE.start_main_~A~0#1|))) .cse164)) .cse85))) .cse97)) (.cse20 (or .cse96 .cse97 (let ((.cse184 (* |ULTIMATE.start_main_~B~0#1| (+ .cse187 |ULTIMATE.start_main_~q~0#1|))) (.cse182 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse186)))) (and (or .cse98 (and (or (and (or .cse181 (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse182))) (or .cse183 (= (+ .cse184 .cse171) |ULTIMATE.start_main_~A~0#1|) .cse185)) .cse172 .cse173) (or .cse164 (and (or .cse181 (= (+ .cse166 .cse182) |ULTIMATE.start_main_~A~0#1|)) (or .cse183 (= |ULTIMATE.start_main_~A~0#1| (+ .cse184 .cse166)) .cse185)))) .cse162 .cse85) (or .cse83 (and (or .cse177 (and (or .cse181 (= (+ .cse178 .cse182) |ULTIMATE.start_main_~A~0#1|)) (or .cse183 (= |ULTIMATE.start_main_~A~0#1| (+ .cse178 .cse184)) .cse185))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse184)) .cse183 .cse185) (or .cse181 (= (+ .cse176 .cse182) |ULTIMATE.start_main_~A~0#1|))) .cse174 .cse175)) .cse115))))) (.cse30 (or .cse127 (let ((.cse168 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse180))) (.cse165 (* |ULTIMATE.start_main_~B~0#1| (+ .cse179 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse98 (and (or .cse164 (and (or (= (+ .cse165 .cse166) |ULTIMATE.start_main_~A~0#1|) .cse167) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse166 .cse168)) .cse169 .cse170))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse168)) .cse169 .cse170) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse171)) .cse167)) .cse172 .cse173)) .cse162 .cse85) (or .cse83 (and (or .cse174 .cse175 (and (or .cse169 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse168)) .cse170) (or .cse167 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse165))))) (or .cse177 (and (or (= (+ .cse178 .cse168) |ULTIMATE.start_main_~A~0#1|) .cse169 .cse170) (or (= (+ .cse178 .cse165) |ULTIMATE.start_main_~A~0#1|) .cse167)))) .cse115))))) (.cse26 (or .cse160 .cse159 (and (or .cse98 .cse161 .cse162 .cse85) (or .cse83 .cse163 .cse115)))) (.cse27 (or .cse156 (and (or .cse98 (not (= .cse151 .cse157)) .cse85) (or (not (= .cse158 .cse151)) .cse115)) .cse1 .cse159)) (.cse40 (or (and (or .cse98 .cse99 (and (or .cse100 (not (= (+ .cse131 1) .cse151)) .cse101) (or .cse109 (not (= .cse151 .cse131)))) .cse85) (or (and (or .cse110 (not (= (+ .cse132 1) .cse151)) .cse111) (or .cse113 (not (= .cse151 .cse132)))) .cse115 .cse116)) .cse76 (and (or (and (or .cse120 .cse121 (not (= .cse125 1))) (or (not (= .cse126 1)) .cse124)) .cse153 .cse127) (or .cse96 .cse97 (and (or .cse107 (not (= .cse118 1))) (or .cse102 .cse103 (not (= .cse119 1)))) .cse154)) .cse155)) (.cse41 (or .cse152 (not .cse31) .cse94)) (.cse29 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse151 .cse141) .cse138)) .cse133 .cse1 .cse144 (and (or (not (= .cse142 1)) .cse127) (or .cse96 .cse97 (not (= .cse143 1)))) (and (or (not (= .cse151 .cse140)) .cse115) (or .cse98 (not (= (+ .cse140 1) .cse151)) .cse85)))) (.cse3 (>= |ULTIMATE.start_main_~p~0#1| 1)) (.cse28 (let ((.cse150 (* .cse148 2))) (let ((.cse147 (+ (- .cse150) |ULTIMATE.start_main_~r~0#1|))) (or (>= .cse147 .cse148) (= (+ (+ .cse147 .cse58) (* (+ |ULTIMATE.start_main_~p~0#1| (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse149))) |ULTIMATE.start_main_~B~0#1|)) |ULTIMATE.start_main_~A~0#1|) (not (>= |ULTIMATE.start_main_~r~0#1| .cse150)))))) (.cse4 (or (and .cse22 .cse145 .cse63 .cse146) (and .cse22 .cse63))) (.cse33 (or .cse133 (let ((.cse135 (* |ULTIMATE.start_main_~B~0#1| (+ .cse141 .cse143))) (.cse136 (* (+ .cse141 .cse142) |ULTIMATE.start_main_~B~0#1|)) (.cse137 (- .cse140))) (and (or (let ((.cse134 (+ .cse137 .cse138))) (and (or .cse96 (= (+ .cse134 .cse135) |ULTIMATE.start_main_~A~0#1|) .cse97) (or (= (+ .cse134 .cse136) |ULTIMATE.start_main_~A~0#1|) .cse127))) .cse115) (or .cse98 .cse85 (let ((.cse139 (+ (+ (- 1) .cse137) .cse138))) (and (or .cse96 .cse97 (= (+ .cse139 .cse135) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse139 .cse136) |ULTIMATE.start_main_~A~0#1|) .cse127)))))) .cse144)) (.cse43 (or .cse76 (let ((.cse128 (- .cse132)) (.cse130 (- .cse131))) (let ((.cse104 (+ .cse129 (+ (- 1) .cse130))) (.cse108 (+ .cse130 .cse129)) (.cse112 (+ (+ (- 1) .cse128) .cse129)) (.cse114 (+ .cse128 .cse129))) (and (or .cse96 .cse97 (let ((.cse105 (* |ULTIMATE.start_main_~B~0#1| (+ .cse119 .cse117))) (.cse106 (* |ULTIMATE.start_main_~B~0#1| (+ .cse117 .cse118)))) (and (or .cse98 .cse99 (and (or .cse100 .cse101 (and (or .cse102 .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse105))) (or (= (+ .cse106 .cse104) |ULTIMATE.start_main_~A~0#1|) .cse107))) (or (and (or .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse108 .cse105)) .cse103) (or (= (+ .cse106 .cse108) |ULTIMATE.start_main_~A~0#1|) .cse107)) .cse109)) .cse85) (or (and (or .cse110 .cse111 (and (or .cse102 .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse105))) (or (= (+ .cse106 .cse112) |ULTIMATE.start_main_~A~0#1|) .cse107))) (or .cse113 (and (or .cse102 (= (+ .cse114 .cse105) |ULTIMATE.start_main_~A~0#1|) .cse103) (or (= (+ .cse114 .cse106) |ULTIMATE.start_main_~A~0#1|) .cse107)))) .cse115 .cse116)))) (or (let ((.cse123 (* (+ .cse126 .cse117) |ULTIMATE.start_main_~B~0#1|)) (.cse122 (* |ULTIMATE.start_main_~B~0#1| (+ .cse125 .cse117)))) (and (or .cse98 .cse99 (and (or (and (or .cse120 .cse121 (= (+ .cse104 .cse122) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse104 .cse123) |ULTIMATE.start_main_~A~0#1|) .cse124)) .cse100 .cse101) (or .cse109 (and (or .cse120 .cse121 (= (+ .cse122 .cse108) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse108 .cse123) |ULTIMATE.start_main_~A~0#1|) .cse124)))) .cse85) (or (and (or (and (or .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse123))) (or .cse120 .cse121 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse122)))) .cse110 .cse111) (or .cse113 (and (or .cse124 (= (+ .cse114 .cse123) |ULTIMATE.start_main_~A~0#1|)) (or .cse120 .cse121 (= (+ .cse114 .cse122) |ULTIMATE.start_main_~A~0#1|))))) .cse115 .cse116))) .cse127))))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse5)) .cse6 (let ((.cse9 (= (mod .cse5 2) 0)) (.cse7 (< .cse5 0)) (.cse8 (div .cse10 4))) (or (and .cse7 (= (+ .cse8 1) |ULTIMATE.start_main_~d~0#1|) (not .cse9)) (and (or .cse9 (not .cse7)) (= |ULTIMATE.start_main_~d~0#1| .cse8))))) (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse11)) (let ((.cse13 (= (mod .cse11 2) 0)) (.cse12 (< .cse11 0)) (.cse14 (div .cse11 2))) (or (and .cse12 (not .cse13) (= (+ .cse14 1) |ULTIMATE.start_main_~d~0#1|)) (and (or .cse13 (not .cse12)) (= .cse14 |ULTIMATE.start_main_~d~0#1|)))) .cse15 .cse16)) .cse17 .cse18) (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse18 .cse36 .cse37 .cse38 .cse39) (and .cse22 (let ((.cse42 (or (and .cse21 .cse22 .cse23 .cse3 .cse28 .cse4 .cse33 .cse43) (and .cse21 .cse22 .cse23 .cse3 .cse4)))) (or (and .cse26 .cse27 .cse40 .cse41 .cse29 .cse31 .cse18 .cse42) (and .cse19 .cse26 .cse27 .cse41 .cse29 .cse31 .cse18 .cse42))) .cse31 .cse18) (and .cse44 (= |ULTIMATE.start_main_~d~0#1| 1) .cse21 .cse22 .cse23 .cse1 .cse45 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse32 .cse18 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1)) .cse46) (and .cse20 .cse47 .cse22 .cse48 .cse24 .cse26 .cse49 .cse27 .cse50 .cse41 .cse51 .cse30 .cse31 .cse32 .cse52 .cse18 .cse53) (let ((.cse59 (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) .cse62)))) (and (let ((.cse56 (< .cse59 0)) (.cse54 (div (+ |ULTIMATE.start_main_~A~0#1| .cse57 .cse58) 2)) (.cse55 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0))) (or (and (= .cse54 |ULTIMATE.start_main_~d~0#1|) (or .cse55 (not .cse56))) (and .cse56 (= |ULTIMATE.start_main_~d~0#1| (+ .cse54 1)) (not .cse55)))) .cse48 .cse1 (= |ULTIMATE.start_main_~B~0#1| (+ (* (- 2) |ULTIMATE.start_main_~B~0#1|) .cse60 |ULTIMATE.start_main_~A~0#1|)) (= 2 .cse59) .cse61 (>= .cse62 |ULTIMATE.start_main_~d~0#1|) .cse49 .cse32 (= (+ (- 2) |ULTIMATE.start_main_~q~0#1|) 1) .cse52 .cse18 .cse63 (not (>= (+ .cse62 .cse59) .cse64)) .cse65 (= (+ (* (- 1) 2) .cse66) 0))) (and .cse22 .cse67 (= (* 2 .cse64) |ULTIMATE.start_main_~p~0#1|) .cse68 (>= |ULTIMATE.start_main_~r~0#1| .cse69) .cse31 .cse70 (= (* .cse69 2) |ULTIMATE.start_main_~d~0#1|) .cse18 .cse71) (and .cse1 .cse45 .cse68 .cse70 .cse18) (let ((.cse74 (+ |ULTIMATE.start_main_~r~0#1| .cse80))) (and .cse0 .cse72 .cse2 .cse73 (= .cse74 |ULTIMATE.start_main_~A~0#1|) .cse75 (>= .cse74 .cse69) .cse76 .cse31 (= |ULTIMATE.start_main_~q~0#1| 4) (let ((.cse78 (= (mod |ULTIMATE.start_main_~q~0#1| 2) 0)) (.cse79 (< |ULTIMATE.start_main_~q~0#1| 0)) (.cse77 (div |ULTIMATE.start_main_~q~0#1| 2))) (or (and (= .cse77 |ULTIMATE.start_main_~p~0#1|) (or .cse78 (not .cse79))) (and (not .cse78) .cse79 (= (+ .cse77 1) |ULTIMATE.start_main_~p~0#1|)))) .cse17 .cse18 .cse36)) (and .cse81 .cse82 .cse83 (= .cse69 |ULTIMATE.start_main_~d~0#1|) .cse84 (= |ULTIMATE.start_main_~p~0#1| .cse64) .cse68 (= |ULTIMATE.start_main_~d~0#1| .cse64) .cse76 .cse70 .cse18 .cse53 .cse85) (and .cse47 (= |ULTIMATE.start_main_~p~0#1| 4) .cse44 .cse22 .cse48 .cse24 .cse49 .cse50 (= |ULTIMATE.start_main_~d~0#1| .cse80) .cse51 .cse31 .cse32 (= (+ |ULTIMATE.start_main_~A~0#1| .cse58) |ULTIMATE.start_main_~r~0#1|) .cse17 .cse52 .cse18 .cse53 .cse46 (>= .cse62 .cse69)) (and .cse21 .cse22 .cse23 .cse26 .cse27 .cse40 .cse28 .cse41 .cse29 .cse31 .cse33 .cse43 .cse18 .cse36) (and .cse73 (= |ULTIMATE.start_main_~d~0#1| .cse86) .cse68 .cse31 .cse70 .cse18 .cse87) (and .cse22 .cse26 .cse27 .cse41 .cse31 .cse18 .cse36) (and .cse22 (let ((.cse88 (or (and .cse22 .cse3 .cse28 .cse4 .cse33 .cse43) (and .cse22 .cse3 .cse4)))) (or (and .cse26 .cse27 .cse40 .cse41 .cse29 .cse88 .cse31 .cse18) (and .cse26 .cse27 .cse41 .cse88 .cse31 .cse18))) .cse31 .cse18) (and .cse72 .cse1 (= (+ (* (- 1) .cse86) |ULTIMATE.start_main_~q~0#1|) 0) .cse18 .cse63 (= .cse89 .cse90)) (and .cse44 .cse22 .cse24 .cse73 .cse75 .cse51 .cse32 (= .cse66 0) .cse18 .cse53 (= 2 |ULTIMATE.start_main_~d~0#1|) (not (>= .cse62 .cse64)) .cse87) (let ((.cse93 (* |ULTIMATE.start_main_~B~0#1| (- 4)))) (let ((.cse91 (+ .cse93 .cse60 |ULTIMATE.start_main_~A~0#1|)) (.cse92 (+ .cse93 |ULTIMATE.start_main_~A~0#1|))) (and .cse20 (not (>= (+ .cse91 |ULTIMATE.start_main_~r~0#1|) .cse90)) .cse21 .cse23 .cse1 .cse25 (= .cse91 |ULTIMATE.start_main_~B~0#1|) .cse3 .cse45 (= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 1) .cse30 .cse31 .cse4 .cse32 (>= (+ .cse80 .cse92) .cse69) .cse35 .cse17 (not (>= .cse92 .cse90)) (= |ULTIMATE.start_main_~r~0#1| (+ .cse58 .cse92)) (= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~p~0#1| 4)) .cse18 .cse37 .cse39))) (and .cse22 .cse31 (or (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse67 .cse27 .cse28 .cse29 .cse30 .cse31 .cse70 .cse32 .cse33 .cse34 .cse35 .cse94 .cse18 .cse71 .cse37 .cse38 .cse39) (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse67 .cse27 .cse40 .cse28 .cse29 .cse30 .cse31 .cse70 .cse32 .cse33 .cse34 .cse35 .cse18 .cse71 .cse37 .cse38 .cse39)) .cse70 .cse18) (and .cse20 .cse22 .cse26 .cse3 .cse27 .cse41 .cse30 .cse31 .cse4 .cse18) (and .cse22 (let ((.cse95 (or (and .cse22 .cse3 .cse28 .cse4 .cse32) (and .cse22 .cse3 .cse28 .cse4 .cse32 .cse33 .cse43)))) (or (and .cse26 .cse27 .cse41 .cse31 .cse95 .cse18) (and .cse26 .cse27 .cse40 .cse41 .cse29 .cse31 .cse95 .cse18))) .cse31 .cse18)))))))))) [2023-02-18 03:06:39,462 INFO L899 garLoopResultBuilder]: For program point L37(lines 34 42) no Hoare annotation was computed. [2023-02-18 03:06:39,462 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 03:06:39,462 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse27 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse30 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse21 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (let ((.cse11 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse28 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse4 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse5 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse15 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse7 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse18 (and .cse30 (not .cse21))) (.cse22 (not .cse30)) (.cse26 (+ .cse27 1))) (let ((.cse6 (and (or (not (= .cse27 1)) .cse18) (or .cse21 .cse22 (not (= .cse26 1))))) (.cse10 (+ .cse7 1)) (.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse1 (let ((.cse29 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|))) (or (and .cse3 .cse29 .cse4 .cse5) (and .cse15 .cse29)))) (.cse9 (not .cse28)) (.cse8 (and (not .cse11) .cse28))) (let ((.cse12 (let ((.cse13 (let ((.cse20 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse27))) (.cse23 (* (+ |ULTIMATE.start_main_~q~0#1| .cse26) |ULTIMATE.start_main_~B~0#1|)) (.cse24 (- .cse7))) (let ((.cse14 (or (let ((.cse25 (+ |ULTIMATE.start_main_~r~0#1| .cse24))) (and (or (= (+ .cse20 .cse25) |ULTIMATE.start_main_~A~0#1|) .cse18) (or (= (+ .cse23 .cse25) |ULTIMATE.start_main_~A~0#1|) .cse21 .cse22))) .cse8)) (.cse16 (or .cse9 (let ((.cse19 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse24)))) (and (or .cse18 (= (+ .cse19 .cse20) |ULTIMATE.start_main_~A~0#1|)) (or .cse21 .cse22 (= |ULTIMATE.start_main_~A~0#1| (+ .cse23 .cse19))))) .cse11)) (.cse17 (= |ULTIMATE.start_main_~A~0#1| (+ (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~d~0#1|)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)))))) (or (and .cse14 .cse15 .cse16 .cse1 .cse17) (and .cse15 .cse1 .cse17) (and .cse14 .cse16 .cse1 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse17 .cse5 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1)))))))) (or (and (or .cse6 (and (or .cse9 .cse11 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse10)) |ULTIMATE.start_main_~A~0#1|)) (or .cse8 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse7 |ULTIMATE.start_main_~q~0#1|)))))) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) .cse13) (and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|) .cse13)))) (.cse2 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (or .cse6 (and (or (= .cse7 |ULTIMATE.start_main_~B~0#1|) .cse8) (or .cse9 (= |ULTIMATE.start_main_~B~0#1| .cse10) .cse11))) .cse12 .cse2) (and .cse0 .cse2 .cse4 .cse5) (and .cse0 .cse12 .cse2 .cse5)))))) [2023-02-18 03:06:39,462 INFO L899 garLoopResultBuilder]: For program point L46(lines 44 56) no Hoare annotation was computed. [2023-02-18 03:06:39,462 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 03:06:39,465 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 42) the Hoare annotation is: (let ((.cse245 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse178 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse247 (- .cse178)) (.cse214 (+ .cse245 1))) (let ((.cse177 (+ .cse178 1)) (.cse84 (div .cse214 2)) (.cse110 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse172 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse15 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse103 (+ |ULTIMATE.start_main_~q~0#1| .cse214)) (.cse257 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse44 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse145 (+ |ULTIMATE.start_main_~q~0#1| .cse245)) (.cse246 (+ (- 1) .cse247)) (.cse256 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse174 (- |ULTIMATE.start_main_~d~0#1|))) (let ((.cse203 (= .cse245 1)) (.cse201 (= .cse214 1)) (.cse5 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse25 (+ |ULTIMATE.start_main_~r~0#1| .cse174)) (.cse83 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse24 (not .cse256)) (.cse99 (+ |ULTIMATE.start_main_~r~0#1| .cse246)) (.cse252 (* |ULTIMATE.start_main_~B~0#1| .cse145)) (.cse43 (and .cse257 (not .cse44))) (.cse253 (* .cse103 |ULTIMATE.start_main_~B~0#1|)) (.cse101 (+ |ULTIMATE.start_main_~r~0#1| .cse247)) (.cse45 (not .cse257)) (.cse36 (and (not .cse15) .cse256)) (.cse250 (not .cse172)) (.cse67 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse109 (+ .cse110 1)) (.cse254 (< .cse245 0)) (.cse105 (= (mod .cse245 2) 0)) (.cse69 (= (mod .cse214 2) 0)) (.cse255 (< .cse214 0)) (.cse85 (+ .cse84 1)) (.cse198 (div .cse177 2)) (.cse197 (div |ULTIMATE.start_main_~d~0#1| 4))) (let ((.cse196 (+ .cse197 1)) (.cse199 (+ .cse198 1)) (.cse188 (- .cse198)) (.cse187 (- .cse197)) (.cse68 (= (mod .cse178 2) 0)) (.cse248 (< .cse178 0)) (.cse249 (< .cse177 0)) (.cse79 (= (mod .cse177 2) 0)) (.cse86 (= .cse85 1)) (.cse70 (not .cse255)) (.cse74 (and .cse255 (not .cse69))) (.cse92 (= .cse84 1)) (.cse151 (= .cse110 1)) (.cse108 (and .cse254 (not .cse105))) (.cse150 (= .cse109 1)) (.cse104 (not .cse254)) (.cse42 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse35 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse215 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse19 (or .cse250 .cse67)) (.cse17 (or (and (or (= (+ .cse252 .cse101) |ULTIMATE.start_main_~A~0#1|) .cse43) (or (= (+ .cse253 .cse101) |ULTIMATE.start_main_~A~0#1|) .cse44 .cse45)) .cse36)) (.cse0 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse18 (or .cse24 (and (or .cse43 (= (+ .cse99 .cse252) |ULTIMATE.start_main_~A~0#1|)) (or .cse44 .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse253 .cse99)))) .cse15)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse4 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse54 (= |ULTIMATE.start_main_~A~0#1| (+ .cse25 (* |ULTIMATE.start_main_~B~0#1| .cse83)))) (.cse6 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse7 (or .cse5 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0) (not .cse5)))) (.cse176 (and (or (not .cse203) .cse43) (or .cse44 .cse45 (not .cse201))))) (let ((.cse1 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse37 (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse8 (let ((.cse251 (or .cse176 (and (or .cse24 .cse15 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse177)) |ULTIMATE.start_main_~A~0#1|)) (or .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse178 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse17 .cse0 .cse18 .cse19 .cse251 .cse3 .cse4 .cse5 .cse54 .cse6 .cse7) (and .cse17 .cse0 .cse18 .cse251 .cse3 .cse4 .cse5 .cse54 .cse67 .cse6 .cse7)))) (.cse9 (or .cse176 (and (or (= .cse178 |ULTIMATE.start_main_~B~0#1|) .cse36) (or .cse24 (= |ULTIMATE.start_main_~B~0#1| .cse177) .cse15)))) (.cse12 (<= 2 .cse178)) (.cse14 (or .cse250 .cse215)) (.cse158 (+ (- .cse35) |ULTIMATE.start_main_~r~0#1|)) (.cse161 (+ |ULTIMATE.start_main_~q~0#1| .cse42)) (.cse202 (and (or (not .cse151) .cse108) (or (not .cse150) .cse104 .cse105))) (.cse66 (>= .cse25 .cse178)) (.cse63 (>= .cse25 .cse177)) (.cse169 (>= |ULTIMATE.start_main_~r~0#1| .cse177)) (.cse10 (>= |ULTIMATE.start_main_~r~0#1| .cse178)) (.cse200 (and (or (not .cse86) .cse69 .cse70) (or .cse74 (not .cse92)))) (.cse82 (and .cse249 (not .cse79))) (.cse80 (not .cse249)) (.cse76 (and (not .cse68) .cse248)) (.cse75 (not .cse248)) (.cse186 (+ (- 1) .cse187)) (.cse189 (+ (- 1) .cse188)) (.cse138 (>= .cse99 .cse199)) (.cse144 (>= .cse99 .cse198)) (.cse122 (>= .cse101 .cse197)) (.cse121 (>= .cse101 .cse196)) (.cse2 (* 2 1))) (let ((.cse22 (<= 8 |ULTIMATE.start_main_~p~0#1|)) (.cse13 (* 2 .cse2)) (.cse56 (let ((.cse233 (not .cse121)) (.cse234 (not .cse122)) (.cse236 (not .cse144)) (.cse228 (+ .cse99 .cse188)) (.cse237 (not .cse138)) (.cse226 (+ .cse99 .cse189)) (.cse227 (* (+ .cse103 .cse84) |ULTIMATE.start_main_~B~0#1|)) (.cse225 (* (+ .cse85 .cse103) |ULTIMATE.start_main_~B~0#1|)) (.cse235 (+ .cse187 .cse101)) (.cse230 (* (+ .cse110 .cse145) |ULTIMATE.start_main_~B~0#1|)) (.cse231 (+ .cse186 .cse101)) (.cse229 (* (+ .cse109 .cse145) |ULTIMATE.start_main_~B~0#1|)) (.cse238 (+ .cse25 .cse247)) (.cse240 (+ .cse25 .cse246))) (let ((.cse218 (or .cse172 (let ((.cse244 (* (+ .cse83 .cse214) |ULTIMATE.start_main_~B~0#1|)) (.cse243 (* (+ .cse83 .cse245) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse243 .cse238) |ULTIMATE.start_main_~A~0#1|) .cse43) (or .cse44 .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse238 .cse244)))) .cse36) (or .cse24 (and (or .cse44 (= |ULTIMATE.start_main_~A~0#1| (+ .cse240 .cse244)) .cse45) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse240 .cse243)) .cse43)) .cse15))))) (.cse219 (or (and (or .cse201 .cse44 .cse45 (and (or .cse68 .cse75 (and (or .cse69 (= (+ .cse231 .cse225) |ULTIMATE.start_main_~A~0#1|) .cse70) (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse231))))) (or .cse76 (and (or .cse74 (= (+ .cse227 .cse235) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse225 .cse235)) .cse69 .cse70))))) (or (and (or .cse76 (and (or (= (+ .cse230 .cse235) |ULTIMATE.start_main_~A~0#1|) .cse108) (or (= (+ .cse235 .cse229) |ULTIMATE.start_main_~A~0#1|) .cse104 .cse105))) (or (and (or .cse108 (= (+ .cse230 .cse231) |ULTIMATE.start_main_~A~0#1|)) (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse231 .cse229)))) .cse68 .cse75)) .cse43 .cse203)) .cse36)) (.cse220 (or .cse172 (and .cse17 .cse18))) (.cse216 (or .cse200 .cse44 (let ((.cse242 (+ .cse103 1))) (and (or .cse36 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse231 (* .cse242 .cse196))) .cse68 .cse75 .cse233) (or .cse76 .cse234 (= (+ (* .cse242 .cse197) .cse235) |ULTIMATE.start_main_~A~0#1|)))) (or .cse24 (and (or .cse236 (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 (* .cse242 .cse198))) .cse82) (or .cse237 .cse79 .cse80 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse242 .cse199) .cse226)))) .cse15))) .cse45)) (.cse221 (or .cse176 (let ((.cse241 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse24 (not .cse169) .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse99 (* .cse241 .cse177)))) (or (not .cse10) .cse36 (= (+ (* .cse178 .cse241) .cse101) |ULTIMATE.start_main_~A~0#1|)))))) (.cse222 (or .cse176 (let ((.cse239 (+ .cse83 1))) (and (or (not .cse66) .cse36 (= (+ .cse238 (* .cse178 .cse239)) |ULTIMATE.start_main_~A~0#1|)) (or .cse24 (not .cse63) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse239 .cse177) .cse240)) .cse15))))) (.cse217 (or .cse202 (let ((.cse232 (+ .cse145 1))) (and (or .cse36 (and (or (= (+ .cse231 (* .cse232 .cse196)) |ULTIMATE.start_main_~A~0#1|) .cse68 .cse75 .cse233) (or .cse76 .cse234 (= (+ .cse235 (* .cse232 .cse197)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse24 (and (or .cse236 .cse82 (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 (* .cse232 .cse198)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse232 .cse199) .cse226)) .cse237 .cse79 .cse80)) .cse15))) .cse43)) (.cse223 (or (= .cse42 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ .cse158 .cse174) (* |ULTIMATE.start_main_~B~0#1| (+ .cse161 |ULTIMATE.start_main_~p~0#1|)))))) (.cse224 (or .cse24 .cse15 (and (or .cse201 .cse44 .cse45 (and (or (and (or (= (+ .cse225 .cse226) |ULTIMATE.start_main_~A~0#1|) .cse69 .cse70) (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse226)))) .cse79 .cse80) (or .cse82 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 .cse225)) .cse69 .cse70) (or .cse74 (= (+ .cse228 .cse227) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse104 .cse105 (= (+ .cse228 .cse229) |ULTIMATE.start_main_~A~0#1|)) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 .cse230)))) .cse82) (or .cse79 .cse80 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse226 .cse229)) .cse104 .cse105) (or (= (+ .cse230 .cse226) |ULTIMATE.start_main_~A~0#1|) .cse108)))) .cse43 .cse203))))) (or (and (or .cse37 (and .cse216 .cse217)) .cse8 .cse9 .cse0 .cse218 .cse10 .cse19 .cse219 .cse12 .cse220 .cse221 .cse222 .cse54 .cse223 .cse14 .cse224 .cse15) (and .cse8 .cse9 .cse0 .cse218 .cse10 .cse19 .cse219 .cse12 .cse220 .cse216 .cse221 .cse222 .cse54 .cse217 .cse223 .cse14 .cse224 .cse15) (and .cse8 .cse9 .cse0 .cse218 .cse10 .cse219 .cse12 .cse220 .cse216 .cse221 .cse222 .cse54 .cse217 .cse223 .cse67 .cse14 .cse224 .cse15))))) (.cse11 (* 2 .cse1))) (or (and .cse0 (= |ULTIMATE.start_main_~d~0#1| .cse1) (= |ULTIMATE.start_main_~d~0#1| .cse2) (<= 2 |ULTIMATE.start_main_~p~0#1|) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~p~0#1| .cse2)) (and (<= 4 |ULTIMATE.start_main_~p~0#1|) .cse8 .cse9 .cse0 .cse10 (= .cse11 |ULTIMATE.start_main_~d~0#1|) .cse12 (= |ULTIMATE.start_main_~p~0#1| .cse13) .cse3 (= |ULTIMATE.start_main_~d~0#1| .cse13) .cse4 .cse5 .cse6 .cse14 .cse15) (and .cse0 .cse4 .cse5 (let ((.cse210 (< .cse196 0)) (.cse119 (= (mod .cse196 2) 0)) (.cse123 (= (mod .cse197 2) 0)) (.cse211 (< .cse197 0)) (.cse137 (= (mod .cse199 2) 0)) (.cse212 (< .cse199 0)) (.cse141 (= (mod .cse198 2) 0)) (.cse213 (< .cse198 0)) (.cse207 (div .cse196 2)) (.cse206 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse204 (div .cse177 4)) (.cse205 (div .cse199 2))) (let ((.cse94 (div .cse214 4)) (.cse88 (div .cse85 2)) (.cse90 (= (mod .cse85 2) 0)) (.cse191 (< .cse85 0)) (.cse190 (- .cse205)) (.cse192 (- .cse204)) (.cse95 (= (mod .cse84 2) 0)) (.cse193 (< .cse84 0)) (.cse194 (- .cse206)) (.cse195 (- .cse207)) (.cse162 (div (* |ULTIMATE.start_main_~p~0#1| 4) 8)) (.cse143 (and (not .cse141) .cse213)) (.cse139 (not .cse213)) (.cse135 (not .cse212)) (.cse133 (and (not .cse137) .cse212)) (.cse127 (and (not .cse123) .cse211)) (.cse125 (not .cse211)) (.cse111 (and .cse210 (not .cse119))) (.cse118 (not .cse210)) (.cse29 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse131 (= (mod .cse110 2) 0)) (.cse208 (< .cse110 0)) (.cse149 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse115 (= (mod .cse109 2) 0)) (.cse146 (div .cse109 2)) (.cse209 (< .cse109 0))) (let ((.cse71 (+ .cse25 .cse186)) (.cse77 (+ .cse187 .cse25)) (.cse78 (+ .cse189 .cse25)) (.cse81 (+ .cse25 .cse188)) (.cse116 (not .cse209)) (.cse147 (+ 1 .cse146)) (.cse114 (and (not .cse115) .cse209)) (.cse148 (+ .cse149 1)) (.cse132 (not .cse208)) (.cse129 (and (not .cse131) .cse208)) (.cse102 (and (or .cse76 (and (or (not (= .cse29 .cse206)) .cse127) (or .cse123 .cse125 (not (= .cse29 (+ .cse206 1))))) .cse122) (or .cse68 (and (or (not (= .cse29 .cse207)) .cse111) (or .cse118 .cse119 (not (= .cse29 (+ .cse207 1))))) .cse75 .cse121))) (.cse98 (and (or (and (or (not (= .cse29 .cse204)) .cse143) (or .cse139 (not (= .cse29 (+ .cse204 1))) .cse141)) .cse82 .cse144) (or (and (or .cse135 .cse137 (not (= .cse29 (+ .cse205 1)))) (or .cse133 (not (= .cse29 .cse205)))) .cse79 .cse80 .cse138))) (.cse153 (>= .cse158 |ULTIMATE.start_main_~d~0#1|)) (.cse164 (not (>= |ULTIMATE.start_main_~r~0#1| .cse35))) (.cse163 (+ .cse162 1)) (.cse160 (div (* |ULTIMATE.start_main_~d~0#1| 4) 8)) (.cse62 (and (or .cse200 .cse201 .cse44 .cse45) (or .cse202 .cse43 .cse203))) (.cse179 (= (+ |ULTIMATE.start_main_~r~0#1| (* .cse29 |ULTIMATE.start_main_~q~0#1|)) |ULTIMATE.start_main_~A~0#1|)) (.cse64 (and (or .cse82 (not (= .cse29 .cse198))) (or (not (= .cse29 .cse199)) .cse79 .cse80))) (.cse65 (and (or .cse68 (not (= .cse29 .cse196)) .cse75) (or .cse76 (not (= .cse29 .cse197))))) (.cse112 (+ .cse101 .cse195)) (.cse120 (+ (+ (- 1) .cse195) .cse101)) (.cse124 (+ (+ (- 1) .cse194) .cse101)) (.cse126 (+ .cse101 .cse194)) (.cse96 (not .cse193)) (.cse93 (and (not .cse95) .cse193)) (.cse140 (+ .cse99 (+ (- 1) .cse192))) (.cse142 (+ .cse192 .cse99)) (.cse136 (+ .cse99 (+ (- 1) .cse190))) (.cse91 (not .cse191)) (.cse87 (and (not .cse90) .cse191)) (.cse134 (+ .cse99 .cse190)) (.cse89 (+ .cse88 1)) (.cse97 (+ .cse94 1)) (.cse168 (+ .cse189 |ULTIMATE.start_main_~r~0#1|)) (.cse166 (+ |ULTIMATE.start_main_~r~0#1| .cse188)) (.cse171 (+ .cse187 |ULTIMATE.start_main_~r~0#1|)) (.cse170 (+ .cse186 |ULTIMATE.start_main_~r~0#1|))) (let ((.cse50 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse29 .cse83) .cse25))) (.cse16 (or .cse44 .cse45 (let ((.cse185 (* |ULTIMATE.start_main_~B~0#1| (+ .cse85 |ULTIMATE.start_main_~q~0#1|))) (.cse184 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse84)))) (and (or .cse24 (and (or (and (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse168 .cse184))) (or .cse69 (= (+ .cse185 .cse168) |ULTIMATE.start_main_~A~0#1|) .cse70)) .cse79 .cse80) (or .cse82 (and (or .cse74 (= (+ .cse166 .cse184) |ULTIMATE.start_main_~A~0#1|)) (or .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse185 .cse166)) .cse70)))) .cse169 .cse15) (or .cse10 (and (or .cse76 (and (or .cse74 (= (+ .cse171 .cse184) |ULTIMATE.start_main_~A~0#1|)) (or .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse185)) .cse70))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse170 .cse185)) .cse69 .cse70) (or .cse74 (= (+ .cse170 .cse184) |ULTIMATE.start_main_~A~0#1|))) .cse68 .cse75)) .cse36))))) (.cse20 (or .cse44 .cse45 (let ((.cse181 (* (+ .cse97 .cse103) |ULTIMATE.start_main_~B~0#1|)) (.cse180 (* (+ .cse103 .cse94) |ULTIMATE.start_main_~B~0#1|)) (.cse183 (* |ULTIMATE.start_main_~B~0#1| (+ .cse89 .cse103))) (.cse182 (* |ULTIMATE.start_main_~B~0#1| (+ .cse103 .cse88)))) (and (or (and (or .cse74 (and (or .cse68 .cse75 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse180)) .cse93) (or .cse95 .cse96 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse181)))) .cse111) (or (and (or .cse95 (= (+ .cse120 .cse181) |ULTIMATE.start_main_~A~0#1|) .cse96) (or .cse93 (= (+ .cse180 .cse120) |ULTIMATE.start_main_~A~0#1|))) .cse118 .cse119)) .cse121) (or .cse76 (and (or .cse123 .cse125 (and (or .cse93 (= (+ .cse180 .cse124) |ULTIMATE.start_main_~A~0#1|)) (or .cse95 .cse96 (= (+ .cse181 .cse124) |ULTIMATE.start_main_~A~0#1|)))) (or .cse127 (and (or .cse95 .cse96 (= (+ .cse126 .cse181) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse126 .cse180) |ULTIMATE.start_main_~A~0#1|) .cse93)))) .cse122))) (or (and (or .cse68 (and (or .cse111 (and (or .cse87 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse182))) (or .cse90 (= (+ .cse183 .cse112) |ULTIMATE.start_main_~A~0#1|) .cse91))) (or .cse118 .cse119 (and (or (= (+ .cse120 .cse182) |ULTIMATE.start_main_~A~0#1|) .cse87) (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse120)) .cse91)))) .cse75 .cse121) (or .cse76 .cse122 (and (or .cse123 (and (or .cse90 .cse91 (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse124))) (or .cse87 (= (+ .cse182 .cse124) |ULTIMATE.start_main_~A~0#1|))) .cse125) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse126 .cse182)) .cse87) (or .cse90 .cse91 (= (+ .cse126 .cse183) |ULTIMATE.start_main_~A~0#1|))) .cse127)))) .cse69 .cse70)) .cse36) (or .cse24 (and (or (and (or (and (or (and (or .cse95 (= (+ .cse136 .cse181) |ULTIMATE.start_main_~A~0#1|) .cse96) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse180)))) .cse135 .cse137) (or .cse133 (and (or .cse95 (= |ULTIMATE.start_main_~A~0#1| (+ .cse134 .cse181)) .cse96) (or .cse93 (= (+ .cse134 .cse180) |ULTIMATE.start_main_~A~0#1|))))) .cse79 .cse80 .cse138) (or .cse82 .cse144 (and (or .cse139 (and (or (= (+ .cse140 .cse181) |ULTIMATE.start_main_~A~0#1|) .cse95 .cse96) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse180)))) .cse141) (or (and (or .cse95 (= (+ .cse181 .cse142) |ULTIMATE.start_main_~A~0#1|) .cse96) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse180 .cse142)))) .cse143)))) .cse74) (or .cse69 .cse70 (and (or (and (or .cse139 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse140)) .cse90 .cse91) (or .cse87 (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse182)))) .cse141) (or (and (or (= (+ .cse183 .cse142) |ULTIMATE.start_main_~A~0#1|) .cse90 .cse91) (or .cse87 (= |ULTIMATE.start_main_~A~0#1| (+ .cse182 .cse142)))) .cse143)) .cse82 .cse144) (or (and (or .cse135 (and (or .cse90 .cse91 (= (+ .cse136 .cse183) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse182)) .cse87)) .cse137) (or .cse133 (and (or .cse90 (= (+ .cse134 .cse183) |ULTIMATE.start_main_~A~0#1|) .cse91) (or .cse87 (= (+ .cse134 .cse182) |ULTIMATE.start_main_~A~0#1|))))) .cse79 .cse80 .cse138)))) .cse15))))) (.cse21 (or .cse62 .cse179 (and (or .cse24 .cse64 .cse169 .cse15) (or .cse10 .cse65 .cse36)))) (.cse23 (or .cse176 (and (or .cse24 (not (= .cse29 .cse177)) .cse15) (or (not (= .cse178 .cse29)) .cse36)) .cse172 .cse179)) (.cse51 (let ((.cse175 (* .cse35 2))) (let ((.cse173 (+ (- .cse175) |ULTIMATE.start_main_~r~0#1|))) (or (>= .cse173 .cse35) (= (+ (+ .cse173 .cse174) (* (+ |ULTIMATE.start_main_~p~0#1| (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse42))) |ULTIMATE.start_main_~B~0#1|)) |ULTIMATE.start_main_~A~0#1|) (not (>= |ULTIMATE.start_main_~r~0#1| .cse175)))))) (.cse52 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse29 .cse161) .cse158)) .cse153 .cse172 .cse164 (and (or (not (= .cse162 1)) .cse43) (or .cse44 .cse45 (not (= .cse163 1)))) (and (or (not (= .cse29 .cse160)) .cse36) (or .cse24 (not (= (+ .cse160 1) .cse29)) .cse15)))) (.cse53 (or .cse43 (let ((.cse167 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse109))) (.cse165 (* |ULTIMATE.start_main_~B~0#1| (+ .cse110 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse24 (and (or .cse82 (and (or (= (+ .cse165 .cse166) |ULTIMATE.start_main_~A~0#1|) .cse108) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse166 .cse167)) .cse104 .cse105))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse168 .cse167)) .cse104 .cse105) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse168)) .cse108)) .cse79 .cse80)) .cse169 .cse15) (or .cse10 (and (or .cse68 .cse75 (and (or .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse170 .cse167)) .cse105) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse170 .cse165))))) (or .cse76 (and (or (= (+ .cse171 .cse167) |ULTIMATE.start_main_~A~0#1|) .cse104 .cse105) (or (= (+ .cse171 .cse165) |ULTIMATE.start_main_~A~0#1|) .cse108)))) .cse36))))) (.cse55 (or .cse153 (let ((.cse155 (* |ULTIMATE.start_main_~B~0#1| (+ .cse161 .cse163))) (.cse156 (* (+ .cse161 .cse162) |ULTIMATE.start_main_~B~0#1|)) (.cse157 (- .cse160))) (and (or (let ((.cse154 (+ .cse157 .cse158))) (and (or .cse44 (= (+ .cse154 .cse155) |ULTIMATE.start_main_~A~0#1|) .cse45) (or (= (+ .cse154 .cse156) |ULTIMATE.start_main_~A~0#1|) .cse43))) .cse36) (or .cse24 .cse15 (let ((.cse159 (+ (+ (- 1) .cse157) .cse158))) (and (or .cse44 .cse45 (= (+ .cse159 .cse155) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse159 .cse156) |ULTIMATE.start_main_~A~0#1|) .cse43)))))) .cse164)) (.cse57 (or (and (or .cse150 (and (or .cse115 .cse116 (not (= .cse147 1))) (or (not (= 1 .cse146)) .cse114)) .cse104 .cse105) (or .cse151 (and (or .cse131 (not (= .cse148 1)) .cse132) (or (not (= .cse149 1)) .cse129)) .cse108)) (let ((.cse152 (* .cse29 .cse145))) (and (or (= (+ .cse152 .cse101) |ULTIMATE.start_main_~A~0#1|) .cse36 .cse102) (or .cse24 .cse98 (= (+ .cse99 .cse152) |ULTIMATE.start_main_~A~0#1|) .cse15))) .cse43)) (.cse58 (or (let ((.cse128 (* |ULTIMATE.start_main_~B~0#1| (+ .cse145 .cse149))) (.cse130 (* |ULTIMATE.start_main_~B~0#1| (+ .cse148 .cse145))) (.cse117 (* |ULTIMATE.start_main_~B~0#1| (+ .cse147 .cse145))) (.cse113 (* (+ .cse145 .cse146) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse36 (and (or (and (or (and (or .cse111 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse113)) .cse114) (or .cse115 .cse116 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse117))))) (or .cse118 .cse119 (and (or .cse114 (= (+ .cse113 .cse120) |ULTIMATE.start_main_~A~0#1|)) (or .cse115 .cse116 (= |ULTIMATE.start_main_~A~0#1| (+ .cse117 .cse120)))))) .cse68 .cse75 .cse121) (or .cse76 .cse122 (and (or .cse123 (and (or .cse115 .cse116 (= |ULTIMATE.start_main_~A~0#1| (+ .cse117 .cse124))) (or (= (+ .cse113 .cse124) |ULTIMATE.start_main_~A~0#1|) .cse114)) .cse125) (or (and (or .cse115 (= (+ .cse126 .cse117) |ULTIMATE.start_main_~A~0#1|) .cse116) (or .cse114 (= (+ .cse126 .cse113) |ULTIMATE.start_main_~A~0#1|))) .cse127)))) .cse104 .cse105) (or (and (or .cse68 (and (or .cse118 .cse119 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse120 .cse128)) .cse129) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse120 .cse130)) .cse131 .cse132))) (or (and (or .cse131 .cse132 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse130))) (or .cse129 (= (+ .cse112 .cse128) |ULTIMATE.start_main_~A~0#1|))) .cse111)) .cse75 .cse121) (or .cse76 (and (or (and (or .cse131 .cse132 (= |ULTIMATE.start_main_~A~0#1| (+ .cse126 .cse130))) (or (= (+ .cse126 .cse128) |ULTIMATE.start_main_~A~0#1|) .cse129)) .cse127) (or .cse123 (and (or (= (+ .cse124 .cse128) |ULTIMATE.start_main_~A~0#1|) .cse129) (or (= (+ .cse124 .cse130) |ULTIMATE.start_main_~A~0#1|) .cse131 .cse132)) .cse125)) .cse122)) .cse108))) (or .cse24 (and (or (and (or (and (or .cse133 (and (or .cse129 (= (+ .cse134 .cse128) |ULTIMATE.start_main_~A~0#1|)) (or .cse131 (= (+ .cse134 .cse130) |ULTIMATE.start_main_~A~0#1|) .cse132))) (or .cse135 (and (or .cse131 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse130)) .cse132) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse128)) .cse129)) .cse137)) .cse79 .cse80 .cse138) (or (and (or .cse139 (and (or (= (+ .cse140 .cse128) |ULTIMATE.start_main_~A~0#1|) .cse129) (or .cse131 (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse130)) .cse132)) .cse141) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse142)) .cse129) (or .cse131 (= (+ .cse130 .cse142) |ULTIMATE.start_main_~A~0#1|) .cse132)) .cse143)) .cse82 .cse144)) .cse108) (or (and (or (and (or (and (or (= (+ .cse134 .cse117) |ULTIMATE.start_main_~A~0#1|) .cse115 .cse116) (or .cse114 (= (+ .cse134 .cse113) |ULTIMATE.start_main_~A~0#1|))) .cse133) (or .cse135 .cse137 (and (or .cse115 .cse116 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse117))) (or .cse114 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse113)))))) .cse79 .cse80 .cse138) (or (and (or (and (or .cse114 (= (+ .cse113 .cse142) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse117 .cse142) |ULTIMATE.start_main_~A~0#1|) .cse115 .cse116)) .cse143) (or .cse139 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse117)) .cse115 .cse116) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse113)) .cse114)) .cse141)) .cse82 .cse144)) .cse104 .cse105)) .cse15))) .cse43)) (.cse59 (or (let ((.cse107 (* (+ .cse110 .cse83) |ULTIMATE.start_main_~B~0#1|)) (.cse106 (* (+ .cse83 .cse109) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse36 (and (or (and (or .cse104 .cse105 (= (+ .cse106 .cse71) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse107)) .cse108)) .cse68 .cse75) (or .cse76 (and (or .cse108 (= (+ .cse77 .cse107) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse106 .cse77) |ULTIMATE.start_main_~A~0#1|) .cse104 .cse105)))) .cse66) (or .cse24 (and (or (and (or (= (+ .cse78 .cse106) |ULTIMATE.start_main_~A~0#1|) .cse104 .cse105) (or (= (+ .cse78 .cse107) |ULTIMATE.start_main_~A~0#1|) .cse108)) .cse79 .cse80) (or (and (or (= (+ .cse107 .cse81) |ULTIMATE.start_main_~A~0#1|) .cse108) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse106 .cse81)) .cse104 .cse105)) .cse82)) .cse63 .cse15))) .cse43)) (.cse60 (or (and (or .cse69 .cse86 .cse70 (and (or .cse87 (not (= .cse88 1))) (or (not (= .cse89 1)) .cse90 .cse91))) (or .cse74 .cse92 (and (or .cse93 (not (= .cse94 1))) (or .cse95 .cse96 (not (= .cse97 1)))))) .cse44 (let ((.cse100 (* .cse103 .cse29))) (and (or .cse24 .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ .cse99 .cse100)) .cse15) (or .cse36 (= (+ .cse101 .cse100) |ULTIMATE.start_main_~A~0#1|) .cse102))) .cse45)) (.cse61 (or .cse44 (let ((.cse72 (* (+ .cse85 .cse83) |ULTIMATE.start_main_~B~0#1|)) (.cse73 (* (+ .cse83 .cse84) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse36 .cse66 (and (or .cse68 (and (or .cse69 .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse72))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse73)) .cse74)) .cse75) (or .cse76 (and (or .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse77 .cse72)) .cse70) (or (= (+ .cse73 .cse77) |ULTIMATE.start_main_~A~0#1|) .cse74))))) (or .cse24 .cse63 (and (or (and (or .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse72)) .cse70) (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse73)))) .cse79 .cse80) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse72 .cse81)) .cse69 .cse70) (or .cse74 (= (+ .cse73 .cse81) |ULTIMATE.start_main_~A~0#1|))) .cse82)) .cse15))) .cse45))) (or (and .cse16 .cse17 .cse0 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (or (let ((.cse31 (div .cse35 4))) (and (let ((.cse26 (+ .cse31 1))) (or .cse24 (>= .cse25 .cse26) (let ((.cse30 (< .cse26 0)) (.cse27 (= (mod .cse26 2) 0)) (.cse28 (div .cse26 2))) (and (or .cse27 (not (= (+ .cse28 1) .cse29)) (not .cse30)) (or (and .cse30 (not .cse27)) (not (= .cse29 .cse28))))) .cse15)) (or (let ((.cse32 (= (mod .cse31 2) 0)) (.cse34 (< .cse31 0)) (.cse33 (div .cse35 8))) (and (or .cse32 (not (= (+ .cse33 1) .cse29)) (not .cse34)) (or (and (not .cse32) .cse34) (not (= .cse29 .cse33))))) .cse36 (>= .cse25 .cse31)))) (not .cse37) (let ((.cse41 (div .cse42 4))) (and (or (let ((.cse40 (div .cse42 8)) (.cse38 (= (mod .cse41 2) 0)) (.cse39 (< .cse41 0))) (and (or .cse38 (not .cse39) (not (= (+ .cse40 1) 1))) (or (not (= .cse40 1)) (and (not .cse38) .cse39)))) (= .cse41 1) .cse43) (let ((.cse49 (+ .cse41 1))) (or .cse44 .cse45 (let ((.cse46 (= (mod .cse49 2) 0)) (.cse47 (< .cse49 0)) (.cse48 (div .cse49 2))) (and (or (and (not .cse46) .cse47) (not (= .cse48 1))) (or .cse46 (not .cse47) (not (= (+ .cse48 1) 1))))) (= 1 .cse49))))) .cse50) .cse51 .cse52 .cse53 .cse4 .cse5 .cse54 .cse55 .cse56 .cse57 .cse58 .cse6 .cse59 .cse60 .cse61) (and (or .cse62 (and (or .cse24 .cse63 .cse64 .cse15) (or .cse65 .cse36 .cse66)) .cse50) .cse16 .cse17 .cse0 .cse18 .cse20 .cse21 .cse22 .cse23 .cse51 .cse52 .cse53 .cse4 .cse5 .cse54 .cse55 .cse56 .cse57 .cse58 .cse67 .cse6 .cse59 .cse60 .cse61)))))) .cse6) (and (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 .cse172 (>= |ULTIMATE.start_main_~p~0#1| 1) .cse215 .cse3 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse22 (= (* 2 .cse13) |ULTIMATE.start_main_~p~0#1|) .cse3 (>= |ULTIMATE.start_main_~r~0#1| .cse11) .cse4 .cse5 .cse56 (= (* .cse11 2) |ULTIMATE.start_main_~d~0#1|) .cse6))))))))) [2023-02-18 03:06:39,465 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-02-18 03:06:39,468 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse245 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse178 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse247 (- .cse178)) (.cse214 (+ .cse245 1))) (let ((.cse177 (+ .cse178 1)) (.cse84 (div .cse214 2)) (.cse110 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse172 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse15 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse103 (+ |ULTIMATE.start_main_~q~0#1| .cse214)) (.cse257 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse44 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse145 (+ |ULTIMATE.start_main_~q~0#1| .cse245)) (.cse246 (+ (- 1) .cse247)) (.cse256 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse174 (- |ULTIMATE.start_main_~d~0#1|))) (let ((.cse203 (= .cse245 1)) (.cse201 (= .cse214 1)) (.cse5 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse25 (+ |ULTIMATE.start_main_~r~0#1| .cse174)) (.cse83 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse24 (not .cse256)) (.cse99 (+ |ULTIMATE.start_main_~r~0#1| .cse246)) (.cse252 (* |ULTIMATE.start_main_~B~0#1| .cse145)) (.cse43 (and .cse257 (not .cse44))) (.cse253 (* .cse103 |ULTIMATE.start_main_~B~0#1|)) (.cse101 (+ |ULTIMATE.start_main_~r~0#1| .cse247)) (.cse45 (not .cse257)) (.cse36 (and (not .cse15) .cse256)) (.cse250 (not .cse172)) (.cse67 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse109 (+ .cse110 1)) (.cse254 (< .cse245 0)) (.cse105 (= (mod .cse245 2) 0)) (.cse69 (= (mod .cse214 2) 0)) (.cse255 (< .cse214 0)) (.cse85 (+ .cse84 1)) (.cse198 (div .cse177 2)) (.cse197 (div |ULTIMATE.start_main_~d~0#1| 4))) (let ((.cse196 (+ .cse197 1)) (.cse199 (+ .cse198 1)) (.cse188 (- .cse198)) (.cse187 (- .cse197)) (.cse68 (= (mod .cse178 2) 0)) (.cse248 (< .cse178 0)) (.cse249 (< .cse177 0)) (.cse79 (= (mod .cse177 2) 0)) (.cse86 (= .cse85 1)) (.cse70 (not .cse255)) (.cse74 (and .cse255 (not .cse69))) (.cse92 (= .cse84 1)) (.cse151 (= .cse110 1)) (.cse108 (and .cse254 (not .cse105))) (.cse150 (= .cse109 1)) (.cse104 (not .cse254)) (.cse42 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse35 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse215 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse19 (or .cse250 .cse67)) (.cse17 (or (and (or (= (+ .cse252 .cse101) |ULTIMATE.start_main_~A~0#1|) .cse43) (or (= (+ .cse253 .cse101) |ULTIMATE.start_main_~A~0#1|) .cse44 .cse45)) .cse36)) (.cse0 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse18 (or .cse24 (and (or .cse43 (= (+ .cse99 .cse252) |ULTIMATE.start_main_~A~0#1|)) (or .cse44 .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse253 .cse99)))) .cse15)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse4 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse54 (= |ULTIMATE.start_main_~A~0#1| (+ .cse25 (* |ULTIMATE.start_main_~B~0#1| .cse83)))) (.cse6 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse7 (or .cse5 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0) (not .cse5)))) (.cse176 (and (or (not .cse203) .cse43) (or .cse44 .cse45 (not .cse201))))) (let ((.cse1 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse37 (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse8 (let ((.cse251 (or .cse176 (and (or .cse24 .cse15 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse177)) |ULTIMATE.start_main_~A~0#1|)) (or .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse178 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse17 .cse0 .cse18 .cse19 .cse251 .cse3 .cse4 .cse5 .cse54 .cse6 .cse7) (and .cse17 .cse0 .cse18 .cse251 .cse3 .cse4 .cse5 .cse54 .cse67 .cse6 .cse7)))) (.cse9 (or .cse176 (and (or (= .cse178 |ULTIMATE.start_main_~B~0#1|) .cse36) (or .cse24 (= |ULTIMATE.start_main_~B~0#1| .cse177) .cse15)))) (.cse12 (<= 2 .cse178)) (.cse14 (or .cse250 .cse215)) (.cse158 (+ (- .cse35) |ULTIMATE.start_main_~r~0#1|)) (.cse161 (+ |ULTIMATE.start_main_~q~0#1| .cse42)) (.cse202 (and (or (not .cse151) .cse108) (or (not .cse150) .cse104 .cse105))) (.cse66 (>= .cse25 .cse178)) (.cse63 (>= .cse25 .cse177)) (.cse169 (>= |ULTIMATE.start_main_~r~0#1| .cse177)) (.cse10 (>= |ULTIMATE.start_main_~r~0#1| .cse178)) (.cse200 (and (or (not .cse86) .cse69 .cse70) (or .cse74 (not .cse92)))) (.cse82 (and .cse249 (not .cse79))) (.cse80 (not .cse249)) (.cse76 (and (not .cse68) .cse248)) (.cse75 (not .cse248)) (.cse186 (+ (- 1) .cse187)) (.cse189 (+ (- 1) .cse188)) (.cse138 (>= .cse99 .cse199)) (.cse144 (>= .cse99 .cse198)) (.cse122 (>= .cse101 .cse197)) (.cse121 (>= .cse101 .cse196)) (.cse2 (* 2 1))) (let ((.cse22 (<= 8 |ULTIMATE.start_main_~p~0#1|)) (.cse13 (* 2 .cse2)) (.cse56 (let ((.cse233 (not .cse121)) (.cse234 (not .cse122)) (.cse236 (not .cse144)) (.cse228 (+ .cse99 .cse188)) (.cse237 (not .cse138)) (.cse226 (+ .cse99 .cse189)) (.cse227 (* (+ .cse103 .cse84) |ULTIMATE.start_main_~B~0#1|)) (.cse225 (* (+ .cse85 .cse103) |ULTIMATE.start_main_~B~0#1|)) (.cse235 (+ .cse187 .cse101)) (.cse230 (* (+ .cse110 .cse145) |ULTIMATE.start_main_~B~0#1|)) (.cse231 (+ .cse186 .cse101)) (.cse229 (* (+ .cse109 .cse145) |ULTIMATE.start_main_~B~0#1|)) (.cse238 (+ .cse25 .cse247)) (.cse240 (+ .cse25 .cse246))) (let ((.cse218 (or .cse172 (let ((.cse244 (* (+ .cse83 .cse214) |ULTIMATE.start_main_~B~0#1|)) (.cse243 (* (+ .cse83 .cse245) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse243 .cse238) |ULTIMATE.start_main_~A~0#1|) .cse43) (or .cse44 .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse238 .cse244)))) .cse36) (or .cse24 (and (or .cse44 (= |ULTIMATE.start_main_~A~0#1| (+ .cse240 .cse244)) .cse45) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse240 .cse243)) .cse43)) .cse15))))) (.cse219 (or (and (or .cse201 .cse44 .cse45 (and (or .cse68 .cse75 (and (or .cse69 (= (+ .cse231 .cse225) |ULTIMATE.start_main_~A~0#1|) .cse70) (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse231))))) (or .cse76 (and (or .cse74 (= (+ .cse227 .cse235) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse225 .cse235)) .cse69 .cse70))))) (or (and (or .cse76 (and (or (= (+ .cse230 .cse235) |ULTIMATE.start_main_~A~0#1|) .cse108) (or (= (+ .cse235 .cse229) |ULTIMATE.start_main_~A~0#1|) .cse104 .cse105))) (or (and (or .cse108 (= (+ .cse230 .cse231) |ULTIMATE.start_main_~A~0#1|)) (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse231 .cse229)))) .cse68 .cse75)) .cse43 .cse203)) .cse36)) (.cse220 (or .cse172 (and .cse17 .cse18))) (.cse216 (or .cse200 .cse44 (let ((.cse242 (+ .cse103 1))) (and (or .cse36 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse231 (* .cse242 .cse196))) .cse68 .cse75 .cse233) (or .cse76 .cse234 (= (+ (* .cse242 .cse197) .cse235) |ULTIMATE.start_main_~A~0#1|)))) (or .cse24 (and (or .cse236 (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 (* .cse242 .cse198))) .cse82) (or .cse237 .cse79 .cse80 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse242 .cse199) .cse226)))) .cse15))) .cse45)) (.cse221 (or .cse176 (let ((.cse241 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse24 (not .cse169) .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse99 (* .cse241 .cse177)))) (or (not .cse10) .cse36 (= (+ (* .cse178 .cse241) .cse101) |ULTIMATE.start_main_~A~0#1|)))))) (.cse222 (or .cse176 (let ((.cse239 (+ .cse83 1))) (and (or (not .cse66) .cse36 (= (+ .cse238 (* .cse178 .cse239)) |ULTIMATE.start_main_~A~0#1|)) (or .cse24 (not .cse63) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse239 .cse177) .cse240)) .cse15))))) (.cse217 (or .cse202 (let ((.cse232 (+ .cse145 1))) (and (or .cse36 (and (or (= (+ .cse231 (* .cse232 .cse196)) |ULTIMATE.start_main_~A~0#1|) .cse68 .cse75 .cse233) (or .cse76 .cse234 (= (+ .cse235 (* .cse232 .cse197)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse24 (and (or .cse236 .cse82 (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 (* .cse232 .cse198)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse232 .cse199) .cse226)) .cse237 .cse79 .cse80)) .cse15))) .cse43)) (.cse223 (or (= .cse42 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ .cse158 .cse174) (* |ULTIMATE.start_main_~B~0#1| (+ .cse161 |ULTIMATE.start_main_~p~0#1|)))))) (.cse224 (or .cse24 .cse15 (and (or .cse201 .cse44 .cse45 (and (or (and (or (= (+ .cse225 .cse226) |ULTIMATE.start_main_~A~0#1|) .cse69 .cse70) (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse226)))) .cse79 .cse80) (or .cse82 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 .cse225)) .cse69 .cse70) (or .cse74 (= (+ .cse228 .cse227) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse104 .cse105 (= (+ .cse228 .cse229) |ULTIMATE.start_main_~A~0#1|)) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 .cse230)))) .cse82) (or .cse79 .cse80 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse226 .cse229)) .cse104 .cse105) (or (= (+ .cse230 .cse226) |ULTIMATE.start_main_~A~0#1|) .cse108)))) .cse43 .cse203))))) (or (and (or .cse37 (and .cse216 .cse217)) .cse8 .cse9 .cse0 .cse218 .cse10 .cse19 .cse219 .cse12 .cse220 .cse221 .cse222 .cse54 .cse223 .cse14 .cse224 .cse15) (and .cse8 .cse9 .cse0 .cse218 .cse10 .cse19 .cse219 .cse12 .cse220 .cse216 .cse221 .cse222 .cse54 .cse217 .cse223 .cse14 .cse224 .cse15) (and .cse8 .cse9 .cse0 .cse218 .cse10 .cse219 .cse12 .cse220 .cse216 .cse221 .cse222 .cse54 .cse217 .cse223 .cse67 .cse14 .cse224 .cse15))))) (.cse11 (* 2 .cse1))) (or (and .cse0 (= |ULTIMATE.start_main_~d~0#1| .cse1) (= |ULTIMATE.start_main_~d~0#1| .cse2) (<= 2 |ULTIMATE.start_main_~p~0#1|) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~p~0#1| .cse2)) (and (<= 4 |ULTIMATE.start_main_~p~0#1|) .cse8 .cse9 .cse0 .cse10 (= .cse11 |ULTIMATE.start_main_~d~0#1|) .cse12 (= |ULTIMATE.start_main_~p~0#1| .cse13) .cse3 (= |ULTIMATE.start_main_~d~0#1| .cse13) .cse4 .cse5 .cse6 .cse14 .cse15) (and .cse0 .cse4 .cse5 (let ((.cse210 (< .cse196 0)) (.cse119 (= (mod .cse196 2) 0)) (.cse123 (= (mod .cse197 2) 0)) (.cse211 (< .cse197 0)) (.cse137 (= (mod .cse199 2) 0)) (.cse212 (< .cse199 0)) (.cse141 (= (mod .cse198 2) 0)) (.cse213 (< .cse198 0)) (.cse207 (div .cse196 2)) (.cse206 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse204 (div .cse177 4)) (.cse205 (div .cse199 2))) (let ((.cse94 (div .cse214 4)) (.cse88 (div .cse85 2)) (.cse90 (= (mod .cse85 2) 0)) (.cse191 (< .cse85 0)) (.cse190 (- .cse205)) (.cse192 (- .cse204)) (.cse95 (= (mod .cse84 2) 0)) (.cse193 (< .cse84 0)) (.cse194 (- .cse206)) (.cse195 (- .cse207)) (.cse162 (div (* |ULTIMATE.start_main_~p~0#1| 4) 8)) (.cse143 (and (not .cse141) .cse213)) (.cse139 (not .cse213)) (.cse135 (not .cse212)) (.cse133 (and (not .cse137) .cse212)) (.cse127 (and (not .cse123) .cse211)) (.cse125 (not .cse211)) (.cse111 (and .cse210 (not .cse119))) (.cse118 (not .cse210)) (.cse29 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse131 (= (mod .cse110 2) 0)) (.cse208 (< .cse110 0)) (.cse149 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse115 (= (mod .cse109 2) 0)) (.cse146 (div .cse109 2)) (.cse209 (< .cse109 0))) (let ((.cse71 (+ .cse25 .cse186)) (.cse77 (+ .cse187 .cse25)) (.cse78 (+ .cse189 .cse25)) (.cse81 (+ .cse25 .cse188)) (.cse116 (not .cse209)) (.cse147 (+ 1 .cse146)) (.cse114 (and (not .cse115) .cse209)) (.cse148 (+ .cse149 1)) (.cse132 (not .cse208)) (.cse129 (and (not .cse131) .cse208)) (.cse102 (and (or .cse76 (and (or (not (= .cse29 .cse206)) .cse127) (or .cse123 .cse125 (not (= .cse29 (+ .cse206 1))))) .cse122) (or .cse68 (and (or (not (= .cse29 .cse207)) .cse111) (or .cse118 .cse119 (not (= .cse29 (+ .cse207 1))))) .cse75 .cse121))) (.cse98 (and (or (and (or (not (= .cse29 .cse204)) .cse143) (or .cse139 (not (= .cse29 (+ .cse204 1))) .cse141)) .cse82 .cse144) (or (and (or .cse135 .cse137 (not (= .cse29 (+ .cse205 1)))) (or .cse133 (not (= .cse29 .cse205)))) .cse79 .cse80 .cse138))) (.cse153 (>= .cse158 |ULTIMATE.start_main_~d~0#1|)) (.cse164 (not (>= |ULTIMATE.start_main_~r~0#1| .cse35))) (.cse163 (+ .cse162 1)) (.cse160 (div (* |ULTIMATE.start_main_~d~0#1| 4) 8)) (.cse62 (and (or .cse200 .cse201 .cse44 .cse45) (or .cse202 .cse43 .cse203))) (.cse179 (= (+ |ULTIMATE.start_main_~r~0#1| (* .cse29 |ULTIMATE.start_main_~q~0#1|)) |ULTIMATE.start_main_~A~0#1|)) (.cse64 (and (or .cse82 (not (= .cse29 .cse198))) (or (not (= .cse29 .cse199)) .cse79 .cse80))) (.cse65 (and (or .cse68 (not (= .cse29 .cse196)) .cse75) (or .cse76 (not (= .cse29 .cse197))))) (.cse112 (+ .cse101 .cse195)) (.cse120 (+ (+ (- 1) .cse195) .cse101)) (.cse124 (+ (+ (- 1) .cse194) .cse101)) (.cse126 (+ .cse101 .cse194)) (.cse96 (not .cse193)) (.cse93 (and (not .cse95) .cse193)) (.cse140 (+ .cse99 (+ (- 1) .cse192))) (.cse142 (+ .cse192 .cse99)) (.cse136 (+ .cse99 (+ (- 1) .cse190))) (.cse91 (not .cse191)) (.cse87 (and (not .cse90) .cse191)) (.cse134 (+ .cse99 .cse190)) (.cse89 (+ .cse88 1)) (.cse97 (+ .cse94 1)) (.cse168 (+ .cse189 |ULTIMATE.start_main_~r~0#1|)) (.cse166 (+ |ULTIMATE.start_main_~r~0#1| .cse188)) (.cse171 (+ .cse187 |ULTIMATE.start_main_~r~0#1|)) (.cse170 (+ .cse186 |ULTIMATE.start_main_~r~0#1|))) (let ((.cse50 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse29 .cse83) .cse25))) (.cse16 (or .cse44 .cse45 (let ((.cse185 (* |ULTIMATE.start_main_~B~0#1| (+ .cse85 |ULTIMATE.start_main_~q~0#1|))) (.cse184 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse84)))) (and (or .cse24 (and (or (and (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse168 .cse184))) (or .cse69 (= (+ .cse185 .cse168) |ULTIMATE.start_main_~A~0#1|) .cse70)) .cse79 .cse80) (or .cse82 (and (or .cse74 (= (+ .cse166 .cse184) |ULTIMATE.start_main_~A~0#1|)) (or .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse185 .cse166)) .cse70)))) .cse169 .cse15) (or .cse10 (and (or .cse76 (and (or .cse74 (= (+ .cse171 .cse184) |ULTIMATE.start_main_~A~0#1|)) (or .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse185)) .cse70))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse170 .cse185)) .cse69 .cse70) (or .cse74 (= (+ .cse170 .cse184) |ULTIMATE.start_main_~A~0#1|))) .cse68 .cse75)) .cse36))))) (.cse20 (or .cse44 .cse45 (let ((.cse181 (* (+ .cse97 .cse103) |ULTIMATE.start_main_~B~0#1|)) (.cse180 (* (+ .cse103 .cse94) |ULTIMATE.start_main_~B~0#1|)) (.cse183 (* |ULTIMATE.start_main_~B~0#1| (+ .cse89 .cse103))) (.cse182 (* |ULTIMATE.start_main_~B~0#1| (+ .cse103 .cse88)))) (and (or (and (or .cse74 (and (or .cse68 .cse75 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse180)) .cse93) (or .cse95 .cse96 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse181)))) .cse111) (or (and (or .cse95 (= (+ .cse120 .cse181) |ULTIMATE.start_main_~A~0#1|) .cse96) (or .cse93 (= (+ .cse180 .cse120) |ULTIMATE.start_main_~A~0#1|))) .cse118 .cse119)) .cse121) (or .cse76 (and (or .cse123 .cse125 (and (or .cse93 (= (+ .cse180 .cse124) |ULTIMATE.start_main_~A~0#1|)) (or .cse95 .cse96 (= (+ .cse181 .cse124) |ULTIMATE.start_main_~A~0#1|)))) (or .cse127 (and (or .cse95 .cse96 (= (+ .cse126 .cse181) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse126 .cse180) |ULTIMATE.start_main_~A~0#1|) .cse93)))) .cse122))) (or (and (or .cse68 (and (or .cse111 (and (or .cse87 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse182))) (or .cse90 (= (+ .cse183 .cse112) |ULTIMATE.start_main_~A~0#1|) .cse91))) (or .cse118 .cse119 (and (or (= (+ .cse120 .cse182) |ULTIMATE.start_main_~A~0#1|) .cse87) (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse120)) .cse91)))) .cse75 .cse121) (or .cse76 .cse122 (and (or .cse123 (and (or .cse90 .cse91 (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse124))) (or .cse87 (= (+ .cse182 .cse124) |ULTIMATE.start_main_~A~0#1|))) .cse125) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse126 .cse182)) .cse87) (or .cse90 .cse91 (= (+ .cse126 .cse183) |ULTIMATE.start_main_~A~0#1|))) .cse127)))) .cse69 .cse70)) .cse36) (or .cse24 (and (or (and (or (and (or (and (or .cse95 (= (+ .cse136 .cse181) |ULTIMATE.start_main_~A~0#1|) .cse96) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse180)))) .cse135 .cse137) (or .cse133 (and (or .cse95 (= |ULTIMATE.start_main_~A~0#1| (+ .cse134 .cse181)) .cse96) (or .cse93 (= (+ .cse134 .cse180) |ULTIMATE.start_main_~A~0#1|))))) .cse79 .cse80 .cse138) (or .cse82 .cse144 (and (or .cse139 (and (or (= (+ .cse140 .cse181) |ULTIMATE.start_main_~A~0#1|) .cse95 .cse96) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse180)))) .cse141) (or (and (or .cse95 (= (+ .cse181 .cse142) |ULTIMATE.start_main_~A~0#1|) .cse96) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse180 .cse142)))) .cse143)))) .cse74) (or .cse69 .cse70 (and (or (and (or .cse139 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse140)) .cse90 .cse91) (or .cse87 (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse182)))) .cse141) (or (and (or (= (+ .cse183 .cse142) |ULTIMATE.start_main_~A~0#1|) .cse90 .cse91) (or .cse87 (= |ULTIMATE.start_main_~A~0#1| (+ .cse182 .cse142)))) .cse143)) .cse82 .cse144) (or (and (or .cse135 (and (or .cse90 .cse91 (= (+ .cse136 .cse183) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse182)) .cse87)) .cse137) (or .cse133 (and (or .cse90 (= (+ .cse134 .cse183) |ULTIMATE.start_main_~A~0#1|) .cse91) (or .cse87 (= (+ .cse134 .cse182) |ULTIMATE.start_main_~A~0#1|))))) .cse79 .cse80 .cse138)))) .cse15))))) (.cse21 (or .cse62 .cse179 (and (or .cse24 .cse64 .cse169 .cse15) (or .cse10 .cse65 .cse36)))) (.cse23 (or .cse176 (and (or .cse24 (not (= .cse29 .cse177)) .cse15) (or (not (= .cse178 .cse29)) .cse36)) .cse172 .cse179)) (.cse51 (let ((.cse175 (* .cse35 2))) (let ((.cse173 (+ (- .cse175) |ULTIMATE.start_main_~r~0#1|))) (or (>= .cse173 .cse35) (= (+ (+ .cse173 .cse174) (* (+ |ULTIMATE.start_main_~p~0#1| (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse42))) |ULTIMATE.start_main_~B~0#1|)) |ULTIMATE.start_main_~A~0#1|) (not (>= |ULTIMATE.start_main_~r~0#1| .cse175)))))) (.cse52 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse29 .cse161) .cse158)) .cse153 .cse172 .cse164 (and (or (not (= .cse162 1)) .cse43) (or .cse44 .cse45 (not (= .cse163 1)))) (and (or (not (= .cse29 .cse160)) .cse36) (or .cse24 (not (= (+ .cse160 1) .cse29)) .cse15)))) (.cse53 (or .cse43 (let ((.cse167 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse109))) (.cse165 (* |ULTIMATE.start_main_~B~0#1| (+ .cse110 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse24 (and (or .cse82 (and (or (= (+ .cse165 .cse166) |ULTIMATE.start_main_~A~0#1|) .cse108) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse166 .cse167)) .cse104 .cse105))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse168 .cse167)) .cse104 .cse105) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse168)) .cse108)) .cse79 .cse80)) .cse169 .cse15) (or .cse10 (and (or .cse68 .cse75 (and (or .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse170 .cse167)) .cse105) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse170 .cse165))))) (or .cse76 (and (or (= (+ .cse171 .cse167) |ULTIMATE.start_main_~A~0#1|) .cse104 .cse105) (or (= (+ .cse171 .cse165) |ULTIMATE.start_main_~A~0#1|) .cse108)))) .cse36))))) (.cse55 (or .cse153 (let ((.cse155 (* |ULTIMATE.start_main_~B~0#1| (+ .cse161 .cse163))) (.cse156 (* (+ .cse161 .cse162) |ULTIMATE.start_main_~B~0#1|)) (.cse157 (- .cse160))) (and (or (let ((.cse154 (+ .cse157 .cse158))) (and (or .cse44 (= (+ .cse154 .cse155) |ULTIMATE.start_main_~A~0#1|) .cse45) (or (= (+ .cse154 .cse156) |ULTIMATE.start_main_~A~0#1|) .cse43))) .cse36) (or .cse24 .cse15 (let ((.cse159 (+ (+ (- 1) .cse157) .cse158))) (and (or .cse44 .cse45 (= (+ .cse159 .cse155) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse159 .cse156) |ULTIMATE.start_main_~A~0#1|) .cse43)))))) .cse164)) (.cse57 (or (and (or .cse150 (and (or .cse115 .cse116 (not (= .cse147 1))) (or (not (= 1 .cse146)) .cse114)) .cse104 .cse105) (or .cse151 (and (or .cse131 (not (= .cse148 1)) .cse132) (or (not (= .cse149 1)) .cse129)) .cse108)) (let ((.cse152 (* .cse29 .cse145))) (and (or (= (+ .cse152 .cse101) |ULTIMATE.start_main_~A~0#1|) .cse36 .cse102) (or .cse24 .cse98 (= (+ .cse99 .cse152) |ULTIMATE.start_main_~A~0#1|) .cse15))) .cse43)) (.cse58 (or (let ((.cse128 (* |ULTIMATE.start_main_~B~0#1| (+ .cse145 .cse149))) (.cse130 (* |ULTIMATE.start_main_~B~0#1| (+ .cse148 .cse145))) (.cse117 (* |ULTIMATE.start_main_~B~0#1| (+ .cse147 .cse145))) (.cse113 (* (+ .cse145 .cse146) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse36 (and (or (and (or (and (or .cse111 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse113)) .cse114) (or .cse115 .cse116 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse117))))) (or .cse118 .cse119 (and (or .cse114 (= (+ .cse113 .cse120) |ULTIMATE.start_main_~A~0#1|)) (or .cse115 .cse116 (= |ULTIMATE.start_main_~A~0#1| (+ .cse117 .cse120)))))) .cse68 .cse75 .cse121) (or .cse76 .cse122 (and (or .cse123 (and (or .cse115 .cse116 (= |ULTIMATE.start_main_~A~0#1| (+ .cse117 .cse124))) (or (= (+ .cse113 .cse124) |ULTIMATE.start_main_~A~0#1|) .cse114)) .cse125) (or (and (or .cse115 (= (+ .cse126 .cse117) |ULTIMATE.start_main_~A~0#1|) .cse116) (or .cse114 (= (+ .cse126 .cse113) |ULTIMATE.start_main_~A~0#1|))) .cse127)))) .cse104 .cse105) (or (and (or .cse68 (and (or .cse118 .cse119 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse120 .cse128)) .cse129) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse120 .cse130)) .cse131 .cse132))) (or (and (or .cse131 .cse132 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse130))) (or .cse129 (= (+ .cse112 .cse128) |ULTIMATE.start_main_~A~0#1|))) .cse111)) .cse75 .cse121) (or .cse76 (and (or (and (or .cse131 .cse132 (= |ULTIMATE.start_main_~A~0#1| (+ .cse126 .cse130))) (or (= (+ .cse126 .cse128) |ULTIMATE.start_main_~A~0#1|) .cse129)) .cse127) (or .cse123 (and (or (= (+ .cse124 .cse128) |ULTIMATE.start_main_~A~0#1|) .cse129) (or (= (+ .cse124 .cse130) |ULTIMATE.start_main_~A~0#1|) .cse131 .cse132)) .cse125)) .cse122)) .cse108))) (or .cse24 (and (or (and (or (and (or .cse133 (and (or .cse129 (= (+ .cse134 .cse128) |ULTIMATE.start_main_~A~0#1|)) (or .cse131 (= (+ .cse134 .cse130) |ULTIMATE.start_main_~A~0#1|) .cse132))) (or .cse135 (and (or .cse131 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse130)) .cse132) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse128)) .cse129)) .cse137)) .cse79 .cse80 .cse138) (or (and (or .cse139 (and (or (= (+ .cse140 .cse128) |ULTIMATE.start_main_~A~0#1|) .cse129) (or .cse131 (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse130)) .cse132)) .cse141) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse142)) .cse129) (or .cse131 (= (+ .cse130 .cse142) |ULTIMATE.start_main_~A~0#1|) .cse132)) .cse143)) .cse82 .cse144)) .cse108) (or (and (or (and (or (and (or (= (+ .cse134 .cse117) |ULTIMATE.start_main_~A~0#1|) .cse115 .cse116) (or .cse114 (= (+ .cse134 .cse113) |ULTIMATE.start_main_~A~0#1|))) .cse133) (or .cse135 .cse137 (and (or .cse115 .cse116 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse117))) (or .cse114 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse113)))))) .cse79 .cse80 .cse138) (or (and (or (and (or .cse114 (= (+ .cse113 .cse142) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse117 .cse142) |ULTIMATE.start_main_~A~0#1|) .cse115 .cse116)) .cse143) (or .cse139 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse117)) .cse115 .cse116) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse113)) .cse114)) .cse141)) .cse82 .cse144)) .cse104 .cse105)) .cse15))) .cse43)) (.cse59 (or (let ((.cse107 (* (+ .cse110 .cse83) |ULTIMATE.start_main_~B~0#1|)) (.cse106 (* (+ .cse83 .cse109) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse36 (and (or (and (or .cse104 .cse105 (= (+ .cse106 .cse71) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse107)) .cse108)) .cse68 .cse75) (or .cse76 (and (or .cse108 (= (+ .cse77 .cse107) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse106 .cse77) |ULTIMATE.start_main_~A~0#1|) .cse104 .cse105)))) .cse66) (or .cse24 (and (or (and (or (= (+ .cse78 .cse106) |ULTIMATE.start_main_~A~0#1|) .cse104 .cse105) (or (= (+ .cse78 .cse107) |ULTIMATE.start_main_~A~0#1|) .cse108)) .cse79 .cse80) (or (and (or (= (+ .cse107 .cse81) |ULTIMATE.start_main_~A~0#1|) .cse108) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse106 .cse81)) .cse104 .cse105)) .cse82)) .cse63 .cse15))) .cse43)) (.cse60 (or (and (or .cse69 .cse86 .cse70 (and (or .cse87 (not (= .cse88 1))) (or (not (= .cse89 1)) .cse90 .cse91))) (or .cse74 .cse92 (and (or .cse93 (not (= .cse94 1))) (or .cse95 .cse96 (not (= .cse97 1)))))) .cse44 (let ((.cse100 (* .cse103 .cse29))) (and (or .cse24 .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ .cse99 .cse100)) .cse15) (or .cse36 (= (+ .cse101 .cse100) |ULTIMATE.start_main_~A~0#1|) .cse102))) .cse45)) (.cse61 (or .cse44 (let ((.cse72 (* (+ .cse85 .cse83) |ULTIMATE.start_main_~B~0#1|)) (.cse73 (* (+ .cse83 .cse84) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse36 .cse66 (and (or .cse68 (and (or .cse69 .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse72))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse73)) .cse74)) .cse75) (or .cse76 (and (or .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse77 .cse72)) .cse70) (or (= (+ .cse73 .cse77) |ULTIMATE.start_main_~A~0#1|) .cse74))))) (or .cse24 .cse63 (and (or (and (or .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse72)) .cse70) (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse73)))) .cse79 .cse80) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse72 .cse81)) .cse69 .cse70) (or .cse74 (= (+ .cse73 .cse81) |ULTIMATE.start_main_~A~0#1|))) .cse82)) .cse15))) .cse45))) (or (and .cse16 .cse17 .cse0 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (or (let ((.cse31 (div .cse35 4))) (and (let ((.cse26 (+ .cse31 1))) (or .cse24 (>= .cse25 .cse26) (let ((.cse30 (< .cse26 0)) (.cse27 (= (mod .cse26 2) 0)) (.cse28 (div .cse26 2))) (and (or .cse27 (not (= (+ .cse28 1) .cse29)) (not .cse30)) (or (and .cse30 (not .cse27)) (not (= .cse29 .cse28))))) .cse15)) (or (let ((.cse32 (= (mod .cse31 2) 0)) (.cse34 (< .cse31 0)) (.cse33 (div .cse35 8))) (and (or .cse32 (not (= (+ .cse33 1) .cse29)) (not .cse34)) (or (and (not .cse32) .cse34) (not (= .cse29 .cse33))))) .cse36 (>= .cse25 .cse31)))) (not .cse37) (let ((.cse41 (div .cse42 4))) (and (or (let ((.cse40 (div .cse42 8)) (.cse38 (= (mod .cse41 2) 0)) (.cse39 (< .cse41 0))) (and (or .cse38 (not .cse39) (not (= (+ .cse40 1) 1))) (or (not (= .cse40 1)) (and (not .cse38) .cse39)))) (= .cse41 1) .cse43) (let ((.cse49 (+ .cse41 1))) (or .cse44 .cse45 (let ((.cse46 (= (mod .cse49 2) 0)) (.cse47 (< .cse49 0)) (.cse48 (div .cse49 2))) (and (or (and (not .cse46) .cse47) (not (= .cse48 1))) (or .cse46 (not .cse47) (not (= (+ .cse48 1) 1))))) (= 1 .cse49))))) .cse50) .cse51 .cse52 .cse53 .cse4 .cse5 .cse54 .cse55 .cse56 .cse57 .cse58 .cse6 .cse59 .cse60 .cse61) (and (or .cse62 (and (or .cse24 .cse63 .cse64 .cse15) (or .cse65 .cse36 .cse66)) .cse50) .cse16 .cse17 .cse0 .cse18 .cse20 .cse21 .cse22 .cse23 .cse51 .cse52 .cse53 .cse4 .cse5 .cse54 .cse55 .cse56 .cse57 .cse58 .cse67 .cse6 .cse59 .cse60 .cse61)))))) .cse6) (and (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 .cse172 (>= |ULTIMATE.start_main_~p~0#1| 1) .cse215 .cse3 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse22 (= (* 2 .cse13) |ULTIMATE.start_main_~p~0#1|) .cse3 (>= |ULTIMATE.start_main_~r~0#1| .cse11) .cse4 .cse5 .cse56 (= (* .cse11 2) |ULTIMATE.start_main_~d~0#1|) .cse6))))))))) [2023-02-18 03:06:39,471 INFO L895 garLoopResultBuilder]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse245 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse178 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse247 (- .cse178)) (.cse214 (+ .cse245 1))) (let ((.cse177 (+ .cse178 1)) (.cse84 (div .cse214 2)) (.cse110 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse172 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse15 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse103 (+ |ULTIMATE.start_main_~q~0#1| .cse214)) (.cse257 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse44 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse145 (+ |ULTIMATE.start_main_~q~0#1| .cse245)) (.cse246 (+ (- 1) .cse247)) (.cse256 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse174 (- |ULTIMATE.start_main_~d~0#1|))) (let ((.cse203 (= .cse245 1)) (.cse201 (= .cse214 1)) (.cse5 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse25 (+ |ULTIMATE.start_main_~r~0#1| .cse174)) (.cse83 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse24 (not .cse256)) (.cse99 (+ |ULTIMATE.start_main_~r~0#1| .cse246)) (.cse252 (* |ULTIMATE.start_main_~B~0#1| .cse145)) (.cse43 (and .cse257 (not .cse44))) (.cse253 (* .cse103 |ULTIMATE.start_main_~B~0#1|)) (.cse101 (+ |ULTIMATE.start_main_~r~0#1| .cse247)) (.cse45 (not .cse257)) (.cse36 (and (not .cse15) .cse256)) (.cse250 (not .cse172)) (.cse67 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse109 (+ .cse110 1)) (.cse254 (< .cse245 0)) (.cse105 (= (mod .cse245 2) 0)) (.cse69 (= (mod .cse214 2) 0)) (.cse255 (< .cse214 0)) (.cse85 (+ .cse84 1)) (.cse198 (div .cse177 2)) (.cse197 (div |ULTIMATE.start_main_~d~0#1| 4))) (let ((.cse196 (+ .cse197 1)) (.cse199 (+ .cse198 1)) (.cse188 (- .cse198)) (.cse187 (- .cse197)) (.cse68 (= (mod .cse178 2) 0)) (.cse248 (< .cse178 0)) (.cse249 (< .cse177 0)) (.cse79 (= (mod .cse177 2) 0)) (.cse86 (= .cse85 1)) (.cse70 (not .cse255)) (.cse74 (and .cse255 (not .cse69))) (.cse92 (= .cse84 1)) (.cse151 (= .cse110 1)) (.cse108 (and .cse254 (not .cse105))) (.cse150 (= .cse109 1)) (.cse104 (not .cse254)) (.cse42 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse35 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse215 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse19 (or .cse250 .cse67)) (.cse17 (or (and (or (= (+ .cse252 .cse101) |ULTIMATE.start_main_~A~0#1|) .cse43) (or (= (+ .cse253 .cse101) |ULTIMATE.start_main_~A~0#1|) .cse44 .cse45)) .cse36)) (.cse0 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse18 (or .cse24 (and (or .cse43 (= (+ .cse99 .cse252) |ULTIMATE.start_main_~A~0#1|)) (or .cse44 .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse253 .cse99)))) .cse15)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse4 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse54 (= |ULTIMATE.start_main_~A~0#1| (+ .cse25 (* |ULTIMATE.start_main_~B~0#1| .cse83)))) (.cse6 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse7 (or .cse5 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0) (not .cse5)))) (.cse176 (and (or (not .cse203) .cse43) (or .cse44 .cse45 (not .cse201))))) (let ((.cse1 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse37 (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse8 (let ((.cse251 (or .cse176 (and (or .cse24 .cse15 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse177)) |ULTIMATE.start_main_~A~0#1|)) (or .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse178 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse17 .cse0 .cse18 .cse19 .cse251 .cse3 .cse4 .cse5 .cse54 .cse6 .cse7) (and .cse17 .cse0 .cse18 .cse251 .cse3 .cse4 .cse5 .cse54 .cse67 .cse6 .cse7)))) (.cse9 (or .cse176 (and (or (= .cse178 |ULTIMATE.start_main_~B~0#1|) .cse36) (or .cse24 (= |ULTIMATE.start_main_~B~0#1| .cse177) .cse15)))) (.cse12 (<= 2 .cse178)) (.cse14 (or .cse250 .cse215)) (.cse158 (+ (- .cse35) |ULTIMATE.start_main_~r~0#1|)) (.cse161 (+ |ULTIMATE.start_main_~q~0#1| .cse42)) (.cse202 (and (or (not .cse151) .cse108) (or (not .cse150) .cse104 .cse105))) (.cse66 (>= .cse25 .cse178)) (.cse63 (>= .cse25 .cse177)) (.cse169 (>= |ULTIMATE.start_main_~r~0#1| .cse177)) (.cse10 (>= |ULTIMATE.start_main_~r~0#1| .cse178)) (.cse200 (and (or (not .cse86) .cse69 .cse70) (or .cse74 (not .cse92)))) (.cse82 (and .cse249 (not .cse79))) (.cse80 (not .cse249)) (.cse76 (and (not .cse68) .cse248)) (.cse75 (not .cse248)) (.cse186 (+ (- 1) .cse187)) (.cse189 (+ (- 1) .cse188)) (.cse138 (>= .cse99 .cse199)) (.cse144 (>= .cse99 .cse198)) (.cse122 (>= .cse101 .cse197)) (.cse121 (>= .cse101 .cse196)) (.cse2 (* 2 1))) (let ((.cse22 (<= 8 |ULTIMATE.start_main_~p~0#1|)) (.cse13 (* 2 .cse2)) (.cse56 (let ((.cse233 (not .cse121)) (.cse234 (not .cse122)) (.cse236 (not .cse144)) (.cse228 (+ .cse99 .cse188)) (.cse237 (not .cse138)) (.cse226 (+ .cse99 .cse189)) (.cse227 (* (+ .cse103 .cse84) |ULTIMATE.start_main_~B~0#1|)) (.cse225 (* (+ .cse85 .cse103) |ULTIMATE.start_main_~B~0#1|)) (.cse235 (+ .cse187 .cse101)) (.cse230 (* (+ .cse110 .cse145) |ULTIMATE.start_main_~B~0#1|)) (.cse231 (+ .cse186 .cse101)) (.cse229 (* (+ .cse109 .cse145) |ULTIMATE.start_main_~B~0#1|)) (.cse238 (+ .cse25 .cse247)) (.cse240 (+ .cse25 .cse246))) (let ((.cse218 (or .cse172 (let ((.cse244 (* (+ .cse83 .cse214) |ULTIMATE.start_main_~B~0#1|)) (.cse243 (* (+ .cse83 .cse245) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse243 .cse238) |ULTIMATE.start_main_~A~0#1|) .cse43) (or .cse44 .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse238 .cse244)))) .cse36) (or .cse24 (and (or .cse44 (= |ULTIMATE.start_main_~A~0#1| (+ .cse240 .cse244)) .cse45) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse240 .cse243)) .cse43)) .cse15))))) (.cse219 (or (and (or .cse201 .cse44 .cse45 (and (or .cse68 .cse75 (and (or .cse69 (= (+ .cse231 .cse225) |ULTIMATE.start_main_~A~0#1|) .cse70) (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse231))))) (or .cse76 (and (or .cse74 (= (+ .cse227 .cse235) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse225 .cse235)) .cse69 .cse70))))) (or (and (or .cse76 (and (or (= (+ .cse230 .cse235) |ULTIMATE.start_main_~A~0#1|) .cse108) (or (= (+ .cse235 .cse229) |ULTIMATE.start_main_~A~0#1|) .cse104 .cse105))) (or (and (or .cse108 (= (+ .cse230 .cse231) |ULTIMATE.start_main_~A~0#1|)) (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse231 .cse229)))) .cse68 .cse75)) .cse43 .cse203)) .cse36)) (.cse220 (or .cse172 (and .cse17 .cse18))) (.cse216 (or .cse200 .cse44 (let ((.cse242 (+ .cse103 1))) (and (or .cse36 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse231 (* .cse242 .cse196))) .cse68 .cse75 .cse233) (or .cse76 .cse234 (= (+ (* .cse242 .cse197) .cse235) |ULTIMATE.start_main_~A~0#1|)))) (or .cse24 (and (or .cse236 (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 (* .cse242 .cse198))) .cse82) (or .cse237 .cse79 .cse80 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse242 .cse199) .cse226)))) .cse15))) .cse45)) (.cse221 (or .cse176 (let ((.cse241 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse24 (not .cse169) .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse99 (* .cse241 .cse177)))) (or (not .cse10) .cse36 (= (+ (* .cse178 .cse241) .cse101) |ULTIMATE.start_main_~A~0#1|)))))) (.cse222 (or .cse176 (let ((.cse239 (+ .cse83 1))) (and (or (not .cse66) .cse36 (= (+ .cse238 (* .cse178 .cse239)) |ULTIMATE.start_main_~A~0#1|)) (or .cse24 (not .cse63) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse239 .cse177) .cse240)) .cse15))))) (.cse217 (or .cse202 (let ((.cse232 (+ .cse145 1))) (and (or .cse36 (and (or (= (+ .cse231 (* .cse232 .cse196)) |ULTIMATE.start_main_~A~0#1|) .cse68 .cse75 .cse233) (or .cse76 .cse234 (= (+ .cse235 (* .cse232 .cse197)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse24 (and (or .cse236 .cse82 (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 (* .cse232 .cse198)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse232 .cse199) .cse226)) .cse237 .cse79 .cse80)) .cse15))) .cse43)) (.cse223 (or (= .cse42 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ .cse158 .cse174) (* |ULTIMATE.start_main_~B~0#1| (+ .cse161 |ULTIMATE.start_main_~p~0#1|)))))) (.cse224 (or .cse24 .cse15 (and (or .cse201 .cse44 .cse45 (and (or (and (or (= (+ .cse225 .cse226) |ULTIMATE.start_main_~A~0#1|) .cse69 .cse70) (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse226)))) .cse79 .cse80) (or .cse82 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 .cse225)) .cse69 .cse70) (or .cse74 (= (+ .cse228 .cse227) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse104 .cse105 (= (+ .cse228 .cse229) |ULTIMATE.start_main_~A~0#1|)) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 .cse230)))) .cse82) (or .cse79 .cse80 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse226 .cse229)) .cse104 .cse105) (or (= (+ .cse230 .cse226) |ULTIMATE.start_main_~A~0#1|) .cse108)))) .cse43 .cse203))))) (or (and (or .cse37 (and .cse216 .cse217)) .cse8 .cse9 .cse0 .cse218 .cse10 .cse19 .cse219 .cse12 .cse220 .cse221 .cse222 .cse54 .cse223 .cse14 .cse224 .cse15) (and .cse8 .cse9 .cse0 .cse218 .cse10 .cse19 .cse219 .cse12 .cse220 .cse216 .cse221 .cse222 .cse54 .cse217 .cse223 .cse14 .cse224 .cse15) (and .cse8 .cse9 .cse0 .cse218 .cse10 .cse219 .cse12 .cse220 .cse216 .cse221 .cse222 .cse54 .cse217 .cse223 .cse67 .cse14 .cse224 .cse15))))) (.cse11 (* 2 .cse1))) (or (and .cse0 (= |ULTIMATE.start_main_~d~0#1| .cse1) (= |ULTIMATE.start_main_~d~0#1| .cse2) (<= 2 |ULTIMATE.start_main_~p~0#1|) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~p~0#1| .cse2)) (and (<= 4 |ULTIMATE.start_main_~p~0#1|) .cse8 .cse9 .cse0 .cse10 (= .cse11 |ULTIMATE.start_main_~d~0#1|) .cse12 (= |ULTIMATE.start_main_~p~0#1| .cse13) .cse3 (= |ULTIMATE.start_main_~d~0#1| .cse13) .cse4 .cse5 .cse6 .cse14 .cse15) (and .cse0 .cse4 .cse5 (let ((.cse210 (< .cse196 0)) (.cse119 (= (mod .cse196 2) 0)) (.cse123 (= (mod .cse197 2) 0)) (.cse211 (< .cse197 0)) (.cse137 (= (mod .cse199 2) 0)) (.cse212 (< .cse199 0)) (.cse141 (= (mod .cse198 2) 0)) (.cse213 (< .cse198 0)) (.cse207 (div .cse196 2)) (.cse206 (div |ULTIMATE.start_main_~d~0#1| 8)) (.cse204 (div .cse177 4)) (.cse205 (div .cse199 2))) (let ((.cse94 (div .cse214 4)) (.cse88 (div .cse85 2)) (.cse90 (= (mod .cse85 2) 0)) (.cse191 (< .cse85 0)) (.cse190 (- .cse205)) (.cse192 (- .cse204)) (.cse95 (= (mod .cse84 2) 0)) (.cse193 (< .cse84 0)) (.cse194 (- .cse206)) (.cse195 (- .cse207)) (.cse162 (div (* |ULTIMATE.start_main_~p~0#1| 4) 8)) (.cse143 (and (not .cse141) .cse213)) (.cse139 (not .cse213)) (.cse135 (not .cse212)) (.cse133 (and (not .cse137) .cse212)) (.cse127 (and (not .cse123) .cse211)) (.cse125 (not .cse211)) (.cse111 (and .cse210 (not .cse119))) (.cse118 (not .cse210)) (.cse29 (* |ULTIMATE.start_main_~B~0#1| 1)) (.cse131 (= (mod .cse110 2) 0)) (.cse208 (< .cse110 0)) (.cse149 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse115 (= (mod .cse109 2) 0)) (.cse146 (div .cse109 2)) (.cse209 (< .cse109 0))) (let ((.cse71 (+ .cse25 .cse186)) (.cse77 (+ .cse187 .cse25)) (.cse78 (+ .cse189 .cse25)) (.cse81 (+ .cse25 .cse188)) (.cse116 (not .cse209)) (.cse147 (+ 1 .cse146)) (.cse114 (and (not .cse115) .cse209)) (.cse148 (+ .cse149 1)) (.cse132 (not .cse208)) (.cse129 (and (not .cse131) .cse208)) (.cse102 (and (or .cse76 (and (or (not (= .cse29 .cse206)) .cse127) (or .cse123 .cse125 (not (= .cse29 (+ .cse206 1))))) .cse122) (or .cse68 (and (or (not (= .cse29 .cse207)) .cse111) (or .cse118 .cse119 (not (= .cse29 (+ .cse207 1))))) .cse75 .cse121))) (.cse98 (and (or (and (or (not (= .cse29 .cse204)) .cse143) (or .cse139 (not (= .cse29 (+ .cse204 1))) .cse141)) .cse82 .cse144) (or (and (or .cse135 .cse137 (not (= .cse29 (+ .cse205 1)))) (or .cse133 (not (= .cse29 .cse205)))) .cse79 .cse80 .cse138))) (.cse153 (>= .cse158 |ULTIMATE.start_main_~d~0#1|)) (.cse164 (not (>= |ULTIMATE.start_main_~r~0#1| .cse35))) (.cse163 (+ .cse162 1)) (.cse160 (div (* |ULTIMATE.start_main_~d~0#1| 4) 8)) (.cse62 (and (or .cse200 .cse201 .cse44 .cse45) (or .cse202 .cse43 .cse203))) (.cse179 (= (+ |ULTIMATE.start_main_~r~0#1| (* .cse29 |ULTIMATE.start_main_~q~0#1|)) |ULTIMATE.start_main_~A~0#1|)) (.cse64 (and (or .cse82 (not (= .cse29 .cse198))) (or (not (= .cse29 .cse199)) .cse79 .cse80))) (.cse65 (and (or .cse68 (not (= .cse29 .cse196)) .cse75) (or .cse76 (not (= .cse29 .cse197))))) (.cse112 (+ .cse101 .cse195)) (.cse120 (+ (+ (- 1) .cse195) .cse101)) (.cse124 (+ (+ (- 1) .cse194) .cse101)) (.cse126 (+ .cse101 .cse194)) (.cse96 (not .cse193)) (.cse93 (and (not .cse95) .cse193)) (.cse140 (+ .cse99 (+ (- 1) .cse192))) (.cse142 (+ .cse192 .cse99)) (.cse136 (+ .cse99 (+ (- 1) .cse190))) (.cse91 (not .cse191)) (.cse87 (and (not .cse90) .cse191)) (.cse134 (+ .cse99 .cse190)) (.cse89 (+ .cse88 1)) (.cse97 (+ .cse94 1)) (.cse168 (+ .cse189 |ULTIMATE.start_main_~r~0#1|)) (.cse166 (+ |ULTIMATE.start_main_~r~0#1| .cse188)) (.cse171 (+ .cse187 |ULTIMATE.start_main_~r~0#1|)) (.cse170 (+ .cse186 |ULTIMATE.start_main_~r~0#1|))) (let ((.cse50 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse29 .cse83) .cse25))) (.cse16 (or .cse44 .cse45 (let ((.cse185 (* |ULTIMATE.start_main_~B~0#1| (+ .cse85 |ULTIMATE.start_main_~q~0#1|))) (.cse184 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse84)))) (and (or .cse24 (and (or (and (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse168 .cse184))) (or .cse69 (= (+ .cse185 .cse168) |ULTIMATE.start_main_~A~0#1|) .cse70)) .cse79 .cse80) (or .cse82 (and (or .cse74 (= (+ .cse166 .cse184) |ULTIMATE.start_main_~A~0#1|)) (or .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse185 .cse166)) .cse70)))) .cse169 .cse15) (or .cse10 (and (or .cse76 (and (or .cse74 (= (+ .cse171 .cse184) |ULTIMATE.start_main_~A~0#1|)) (or .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse185)) .cse70))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse170 .cse185)) .cse69 .cse70) (or .cse74 (= (+ .cse170 .cse184) |ULTIMATE.start_main_~A~0#1|))) .cse68 .cse75)) .cse36))))) (.cse20 (or .cse44 .cse45 (let ((.cse181 (* (+ .cse97 .cse103) |ULTIMATE.start_main_~B~0#1|)) (.cse180 (* (+ .cse103 .cse94) |ULTIMATE.start_main_~B~0#1|)) (.cse183 (* |ULTIMATE.start_main_~B~0#1| (+ .cse89 .cse103))) (.cse182 (* |ULTIMATE.start_main_~B~0#1| (+ .cse103 .cse88)))) (and (or (and (or .cse74 (and (or .cse68 .cse75 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse180)) .cse93) (or .cse95 .cse96 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse181)))) .cse111) (or (and (or .cse95 (= (+ .cse120 .cse181) |ULTIMATE.start_main_~A~0#1|) .cse96) (or .cse93 (= (+ .cse180 .cse120) |ULTIMATE.start_main_~A~0#1|))) .cse118 .cse119)) .cse121) (or .cse76 (and (or .cse123 .cse125 (and (or .cse93 (= (+ .cse180 .cse124) |ULTIMATE.start_main_~A~0#1|)) (or .cse95 .cse96 (= (+ .cse181 .cse124) |ULTIMATE.start_main_~A~0#1|)))) (or .cse127 (and (or .cse95 .cse96 (= (+ .cse126 .cse181) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse126 .cse180) |ULTIMATE.start_main_~A~0#1|) .cse93)))) .cse122))) (or (and (or .cse68 (and (or .cse111 (and (or .cse87 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse182))) (or .cse90 (= (+ .cse183 .cse112) |ULTIMATE.start_main_~A~0#1|) .cse91))) (or .cse118 .cse119 (and (or (= (+ .cse120 .cse182) |ULTIMATE.start_main_~A~0#1|) .cse87) (or .cse90 (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse120)) .cse91)))) .cse75 .cse121) (or .cse76 .cse122 (and (or .cse123 (and (or .cse90 .cse91 (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse124))) (or .cse87 (= (+ .cse182 .cse124) |ULTIMATE.start_main_~A~0#1|))) .cse125) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse126 .cse182)) .cse87) (or .cse90 .cse91 (= (+ .cse126 .cse183) |ULTIMATE.start_main_~A~0#1|))) .cse127)))) .cse69 .cse70)) .cse36) (or .cse24 (and (or (and (or (and (or (and (or .cse95 (= (+ .cse136 .cse181) |ULTIMATE.start_main_~A~0#1|) .cse96) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse180)))) .cse135 .cse137) (or .cse133 (and (or .cse95 (= |ULTIMATE.start_main_~A~0#1| (+ .cse134 .cse181)) .cse96) (or .cse93 (= (+ .cse134 .cse180) |ULTIMATE.start_main_~A~0#1|))))) .cse79 .cse80 .cse138) (or .cse82 .cse144 (and (or .cse139 (and (or (= (+ .cse140 .cse181) |ULTIMATE.start_main_~A~0#1|) .cse95 .cse96) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse180)))) .cse141) (or (and (or .cse95 (= (+ .cse181 .cse142) |ULTIMATE.start_main_~A~0#1|) .cse96) (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse180 .cse142)))) .cse143)))) .cse74) (or .cse69 .cse70 (and (or (and (or .cse139 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse140)) .cse90 .cse91) (or .cse87 (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse182)))) .cse141) (or (and (or (= (+ .cse183 .cse142) |ULTIMATE.start_main_~A~0#1|) .cse90 .cse91) (or .cse87 (= |ULTIMATE.start_main_~A~0#1| (+ .cse182 .cse142)))) .cse143)) .cse82 .cse144) (or (and (or .cse135 (and (or .cse90 .cse91 (= (+ .cse136 .cse183) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse182)) .cse87)) .cse137) (or .cse133 (and (or .cse90 (= (+ .cse134 .cse183) |ULTIMATE.start_main_~A~0#1|) .cse91) (or .cse87 (= (+ .cse134 .cse182) |ULTIMATE.start_main_~A~0#1|))))) .cse79 .cse80 .cse138)))) .cse15))))) (.cse21 (or .cse62 .cse179 (and (or .cse24 .cse64 .cse169 .cse15) (or .cse10 .cse65 .cse36)))) (.cse23 (or .cse176 (and (or .cse24 (not (= .cse29 .cse177)) .cse15) (or (not (= .cse178 .cse29)) .cse36)) .cse172 .cse179)) (.cse51 (let ((.cse175 (* .cse35 2))) (let ((.cse173 (+ (- .cse175) |ULTIMATE.start_main_~r~0#1|))) (or (>= .cse173 .cse35) (= (+ (+ .cse173 .cse174) (* (+ |ULTIMATE.start_main_~p~0#1| (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse42))) |ULTIMATE.start_main_~B~0#1|)) |ULTIMATE.start_main_~A~0#1|) (not (>= |ULTIMATE.start_main_~r~0#1| .cse175)))))) (.cse52 (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse29 .cse161) .cse158)) .cse153 .cse172 .cse164 (and (or (not (= .cse162 1)) .cse43) (or .cse44 .cse45 (not (= .cse163 1)))) (and (or (not (= .cse29 .cse160)) .cse36) (or .cse24 (not (= (+ .cse160 1) .cse29)) .cse15)))) (.cse53 (or .cse43 (let ((.cse167 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse109))) (.cse165 (* |ULTIMATE.start_main_~B~0#1| (+ .cse110 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse24 (and (or .cse82 (and (or (= (+ .cse165 .cse166) |ULTIMATE.start_main_~A~0#1|) .cse108) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse166 .cse167)) .cse104 .cse105))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse168 .cse167)) .cse104 .cse105) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse168)) .cse108)) .cse79 .cse80)) .cse169 .cse15) (or .cse10 (and (or .cse68 .cse75 (and (or .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse170 .cse167)) .cse105) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse170 .cse165))))) (or .cse76 (and (or (= (+ .cse171 .cse167) |ULTIMATE.start_main_~A~0#1|) .cse104 .cse105) (or (= (+ .cse171 .cse165) |ULTIMATE.start_main_~A~0#1|) .cse108)))) .cse36))))) (.cse55 (or .cse153 (let ((.cse155 (* |ULTIMATE.start_main_~B~0#1| (+ .cse161 .cse163))) (.cse156 (* (+ .cse161 .cse162) |ULTIMATE.start_main_~B~0#1|)) (.cse157 (- .cse160))) (and (or (let ((.cse154 (+ .cse157 .cse158))) (and (or .cse44 (= (+ .cse154 .cse155) |ULTIMATE.start_main_~A~0#1|) .cse45) (or (= (+ .cse154 .cse156) |ULTIMATE.start_main_~A~0#1|) .cse43))) .cse36) (or .cse24 .cse15 (let ((.cse159 (+ (+ (- 1) .cse157) .cse158))) (and (or .cse44 .cse45 (= (+ .cse159 .cse155) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse159 .cse156) |ULTIMATE.start_main_~A~0#1|) .cse43)))))) .cse164)) (.cse57 (or (and (or .cse150 (and (or .cse115 .cse116 (not (= .cse147 1))) (or (not (= 1 .cse146)) .cse114)) .cse104 .cse105) (or .cse151 (and (or .cse131 (not (= .cse148 1)) .cse132) (or (not (= .cse149 1)) .cse129)) .cse108)) (let ((.cse152 (* .cse29 .cse145))) (and (or (= (+ .cse152 .cse101) |ULTIMATE.start_main_~A~0#1|) .cse36 .cse102) (or .cse24 .cse98 (= (+ .cse99 .cse152) |ULTIMATE.start_main_~A~0#1|) .cse15))) .cse43)) (.cse58 (or (let ((.cse128 (* |ULTIMATE.start_main_~B~0#1| (+ .cse145 .cse149))) (.cse130 (* |ULTIMATE.start_main_~B~0#1| (+ .cse148 .cse145))) (.cse117 (* |ULTIMATE.start_main_~B~0#1| (+ .cse147 .cse145))) (.cse113 (* (+ .cse145 .cse146) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse36 (and (or (and (or (and (or .cse111 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse113)) .cse114) (or .cse115 .cse116 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse117))))) (or .cse118 .cse119 (and (or .cse114 (= (+ .cse113 .cse120) |ULTIMATE.start_main_~A~0#1|)) (or .cse115 .cse116 (= |ULTIMATE.start_main_~A~0#1| (+ .cse117 .cse120)))))) .cse68 .cse75 .cse121) (or .cse76 .cse122 (and (or .cse123 (and (or .cse115 .cse116 (= |ULTIMATE.start_main_~A~0#1| (+ .cse117 .cse124))) (or (= (+ .cse113 .cse124) |ULTIMATE.start_main_~A~0#1|) .cse114)) .cse125) (or (and (or .cse115 (= (+ .cse126 .cse117) |ULTIMATE.start_main_~A~0#1|) .cse116) (or .cse114 (= (+ .cse126 .cse113) |ULTIMATE.start_main_~A~0#1|))) .cse127)))) .cse104 .cse105) (or (and (or .cse68 (and (or .cse118 .cse119 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse120 .cse128)) .cse129) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse120 .cse130)) .cse131 .cse132))) (or (and (or .cse131 .cse132 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse130))) (or .cse129 (= (+ .cse112 .cse128) |ULTIMATE.start_main_~A~0#1|))) .cse111)) .cse75 .cse121) (or .cse76 (and (or (and (or .cse131 .cse132 (= |ULTIMATE.start_main_~A~0#1| (+ .cse126 .cse130))) (or (= (+ .cse126 .cse128) |ULTIMATE.start_main_~A~0#1|) .cse129)) .cse127) (or .cse123 (and (or (= (+ .cse124 .cse128) |ULTIMATE.start_main_~A~0#1|) .cse129) (or (= (+ .cse124 .cse130) |ULTIMATE.start_main_~A~0#1|) .cse131 .cse132)) .cse125)) .cse122)) .cse108))) (or .cse24 (and (or (and (or (and (or .cse133 (and (or .cse129 (= (+ .cse134 .cse128) |ULTIMATE.start_main_~A~0#1|)) (or .cse131 (= (+ .cse134 .cse130) |ULTIMATE.start_main_~A~0#1|) .cse132))) (or .cse135 (and (or .cse131 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse130)) .cse132) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse128)) .cse129)) .cse137)) .cse79 .cse80 .cse138) (or (and (or .cse139 (and (or (= (+ .cse140 .cse128) |ULTIMATE.start_main_~A~0#1|) .cse129) (or .cse131 (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse130)) .cse132)) .cse141) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse142)) .cse129) (or .cse131 (= (+ .cse130 .cse142) |ULTIMATE.start_main_~A~0#1|) .cse132)) .cse143)) .cse82 .cse144)) .cse108) (or (and (or (and (or (and (or (= (+ .cse134 .cse117) |ULTIMATE.start_main_~A~0#1|) .cse115 .cse116) (or .cse114 (= (+ .cse134 .cse113) |ULTIMATE.start_main_~A~0#1|))) .cse133) (or .cse135 .cse137 (and (or .cse115 .cse116 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse117))) (or .cse114 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse113)))))) .cse79 .cse80 .cse138) (or (and (or (and (or .cse114 (= (+ .cse113 .cse142) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse117 .cse142) |ULTIMATE.start_main_~A~0#1|) .cse115 .cse116)) .cse143) (or .cse139 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse117)) .cse115 .cse116) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse140 .cse113)) .cse114)) .cse141)) .cse82 .cse144)) .cse104 .cse105)) .cse15))) .cse43)) (.cse59 (or (let ((.cse107 (* (+ .cse110 .cse83) |ULTIMATE.start_main_~B~0#1|)) (.cse106 (* (+ .cse83 .cse109) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse36 (and (or (and (or .cse104 .cse105 (= (+ .cse106 .cse71) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse107)) .cse108)) .cse68 .cse75) (or .cse76 (and (or .cse108 (= (+ .cse77 .cse107) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse106 .cse77) |ULTIMATE.start_main_~A~0#1|) .cse104 .cse105)))) .cse66) (or .cse24 (and (or (and (or (= (+ .cse78 .cse106) |ULTIMATE.start_main_~A~0#1|) .cse104 .cse105) (or (= (+ .cse78 .cse107) |ULTIMATE.start_main_~A~0#1|) .cse108)) .cse79 .cse80) (or (and (or (= (+ .cse107 .cse81) |ULTIMATE.start_main_~A~0#1|) .cse108) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse106 .cse81)) .cse104 .cse105)) .cse82)) .cse63 .cse15))) .cse43)) (.cse60 (or (and (or .cse69 .cse86 .cse70 (and (or .cse87 (not (= .cse88 1))) (or (not (= .cse89 1)) .cse90 .cse91))) (or .cse74 .cse92 (and (or .cse93 (not (= .cse94 1))) (or .cse95 .cse96 (not (= .cse97 1)))))) .cse44 (let ((.cse100 (* .cse103 .cse29))) (and (or .cse24 .cse98 (= |ULTIMATE.start_main_~A~0#1| (+ .cse99 .cse100)) .cse15) (or .cse36 (= (+ .cse101 .cse100) |ULTIMATE.start_main_~A~0#1|) .cse102))) .cse45)) (.cse61 (or .cse44 (let ((.cse72 (* (+ .cse85 .cse83) |ULTIMATE.start_main_~B~0#1|)) (.cse73 (* (+ .cse83 .cse84) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse36 .cse66 (and (or .cse68 (and (or .cse69 .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse72))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse73)) .cse74)) .cse75) (or .cse76 (and (or .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse77 .cse72)) .cse70) (or (= (+ .cse73 .cse77) |ULTIMATE.start_main_~A~0#1|) .cse74))))) (or .cse24 .cse63 (and (or (and (or .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse72)) .cse70) (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse73)))) .cse79 .cse80) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse72 .cse81)) .cse69 .cse70) (or .cse74 (= (+ .cse73 .cse81) |ULTIMATE.start_main_~A~0#1|))) .cse82)) .cse15))) .cse45))) (or (and .cse16 .cse17 .cse0 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (or (let ((.cse31 (div .cse35 4))) (and (let ((.cse26 (+ .cse31 1))) (or .cse24 (>= .cse25 .cse26) (let ((.cse30 (< .cse26 0)) (.cse27 (= (mod .cse26 2) 0)) (.cse28 (div .cse26 2))) (and (or .cse27 (not (= (+ .cse28 1) .cse29)) (not .cse30)) (or (and .cse30 (not .cse27)) (not (= .cse29 .cse28))))) .cse15)) (or (let ((.cse32 (= (mod .cse31 2) 0)) (.cse34 (< .cse31 0)) (.cse33 (div .cse35 8))) (and (or .cse32 (not (= (+ .cse33 1) .cse29)) (not .cse34)) (or (and (not .cse32) .cse34) (not (= .cse29 .cse33))))) .cse36 (>= .cse25 .cse31)))) (not .cse37) (let ((.cse41 (div .cse42 4))) (and (or (let ((.cse40 (div .cse42 8)) (.cse38 (= (mod .cse41 2) 0)) (.cse39 (< .cse41 0))) (and (or .cse38 (not .cse39) (not (= (+ .cse40 1) 1))) (or (not (= .cse40 1)) (and (not .cse38) .cse39)))) (= .cse41 1) .cse43) (let ((.cse49 (+ .cse41 1))) (or .cse44 .cse45 (let ((.cse46 (= (mod .cse49 2) 0)) (.cse47 (< .cse49 0)) (.cse48 (div .cse49 2))) (and (or (and (not .cse46) .cse47) (not (= .cse48 1))) (or .cse46 (not .cse47) (not (= (+ .cse48 1) 1))))) (= 1 .cse49))))) .cse50) .cse51 .cse52 .cse53 .cse4 .cse5 .cse54 .cse55 .cse56 .cse57 .cse58 .cse6 .cse59 .cse60 .cse61) (and (or .cse62 (and (or .cse24 .cse63 .cse64 .cse15) (or .cse65 .cse36 .cse66)) .cse50) .cse16 .cse17 .cse0 .cse18 .cse20 .cse21 .cse22 .cse23 .cse51 .cse52 .cse53 .cse4 .cse5 .cse54 .cse55 .cse56 .cse57 .cse58 .cse67 .cse6 .cse59 .cse60 .cse61)))))) .cse6) (and (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 .cse172 (>= |ULTIMATE.start_main_~p~0#1| 1) .cse215 .cse3 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse22 (= (* 2 .cse13) |ULTIMATE.start_main_~p~0#1|) .cse3 (>= |ULTIMATE.start_main_~r~0#1| .cse11) .cse4 .cse5 .cse56 (= (* .cse11 2) |ULTIMATE.start_main_~d~0#1|) .cse6))))))))) [2023-02-18 03:06:39,471 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-18 03:06:39,471 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-18 03:06:39,472 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-18 03:06:39,472 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-18 03:06:39,472 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-02-18 03:06:39,472 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-18 03:06:39,474 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-18 03:06:39,476 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 03:06:39,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 03:06:39 BoogieIcfgContainer [2023-02-18 03:06:39,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 03:06:39,651 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 03:06:39,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 03:06:39,651 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 03:06:39,651 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 03:04:57" (3/4) ... [2023-02-18 03:06:39,653 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 03:06:39,657 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 03:06:39,660 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-02-18 03:06:39,661 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-02-18 03:06:39,661 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-02-18 03:06:39,661 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 03:06:39,661 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 03:06:39,723 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 03:06:39,723 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 03:06:39,724 INFO L158 Benchmark]: Toolchain (without parser) took 102338.93ms. Allocated memory was 186.6MB in the beginning and 390.1MB in the end (delta: 203.4MB). Free memory was 150.6MB in the beginning and 228.3MB in the end (delta: -77.7MB). Peak memory consumption was 124.7MB. Max. memory is 16.1GB. [2023-02-18 03:06:39,724 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 03:06:39,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.17ms. Allocated memory is still 186.6MB. Free memory was 150.6MB in the beginning and 140.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 03:06:39,725 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.37ms. Allocated memory is still 186.6MB. Free memory was 140.1MB in the beginning and 138.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 03:06:39,725 INFO L158 Benchmark]: Boogie Preprocessor took 15.89ms. Allocated memory is still 186.6MB. Free memory was 138.0MB in the beginning and 137.3MB in the end (delta: 757.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 03:06:39,725 INFO L158 Benchmark]: RCFGBuilder took 272.34ms. Allocated memory is still 186.6MB. Free memory was 137.3MB in the beginning and 126.2MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 03:06:39,725 INFO L158 Benchmark]: TraceAbstraction took 101779.90ms. Allocated memory was 186.6MB in the beginning and 390.1MB in the end (delta: 203.4MB). Free memory was 125.4MB in the beginning and 236.4MB in the end (delta: -111.0MB). Peak memory consumption was 205.1MB. Max. memory is 16.1GB. [2023-02-18 03:06:39,726 INFO L158 Benchmark]: Witness Printer took 72.87ms. Allocated memory is still 390.1MB. Free memory was 236.4MB in the beginning and 228.3MB in the end (delta: 8.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-18 03:06:39,730 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.17ms. Allocated memory is still 186.6MB. Free memory was 150.6MB in the beginning and 140.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.37ms. Allocated memory is still 186.6MB. Free memory was 140.1MB in the beginning and 138.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.89ms. Allocated memory is still 186.6MB. Free memory was 138.0MB in the beginning and 137.3MB in the end (delta: 757.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 272.34ms. Allocated memory is still 186.6MB. Free memory was 137.3MB in the beginning and 126.2MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 101779.90ms. Allocated memory was 186.6MB in the beginning and 390.1MB in the end (delta: 203.4MB). Free memory was 125.4MB in the beginning and 236.4MB in the end (delta: -111.0MB). Peak memory consumption was 205.1MB. Max. memory is 16.1GB. * Witness Printer took 72.87ms. Allocated memory is still 390.1MB. Free memory was 236.4MB in the beginning and 228.3MB in the end (delta: 8.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 101.6s, OverallIterations: 16, TraceHistogramMax: 21, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 79.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 565 SdHoareTripleChecker+Valid, 50.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 513 mSDsluCounter, 1640 SdHoareTripleChecker+Invalid, 49.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2 IncrementalHoareTripleChecker+Unchecked, 1179 mSDsCounter, 831 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5495 IncrementalHoareTripleChecker+Invalid, 6331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 831 mSolverCounterUnsat, 461 mSDtfsCounter, 5495 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1981 GetRequests, 1689 SyntacticMatches, 20 SemanticMatches, 272 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 37.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred in iteration=14, InterpolantAutomatonStates: 195, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 97 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 164 PreInvPairs, 268 NumberOfFragments, 618605 HoareAnnotationTreeSize, 164 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 1148 NumberOfCodeBlocks, 1013 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1902 ConstructedInterpolants, 0 QuantifiedInterpolants, 104119 SizeOfPredicates, 63 NumberOfNonLiveVariables, 2569 ConjunctsInSsa, 419 ConjunctsInUnsatCore, 26 InterpolantComputations, 4 PerfectInterpolantSequences, 8420/9424 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || !(B * 1 == d / 2 + 1)) || d % 2 == 0) && (!(d / 2 == B * 1) || (!(d % 2 == 0) && d < 0)))) || p == 1) || r + B * 1 * q == A)) && (((((((!(d < 0) || r + -d >= 2 * d / 4 + 1) || ((((2 * d / 4 + 1) % 2 == 0 || !((2 * d / 4 + 1) / 2 + 1 == B * 1)) || !(2 * d / 4 + 1 < 0)) && ((2 * d / 4 + 1 < 0 && !((2 * d / 4 + 1) % 2 == 0)) || !(B * 1 == (2 * d / 4 + 1) / 2)))) || d % 2 == 0) && (((((2 * d / 4 % 2 == 0 || !(2 * d / 8 + 1 == B * 1)) || !(2 * d / 4 < 0)) && ((!(2 * d / 4 % 2 == 0) && 2 * d / 4 < 0) || !(B * 1 == 2 * d / 8))) || (!(d % 2 == 0) && d < 0)) || r + -d >= 2 * d / 4)) || !(r >= d)) || ((((((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || !(2 * p / 8 + 1 == 1)) && (!(2 * p / 8 == 1) || (!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0))) || 2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))) && (((p % 2 == 0 || !(p < 0)) || (((!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0) || !((2 * p / 4 + 1) / 2 == 1)) && (((2 * p / 4 + 1) % 2 == 0 || !(2 * p / 4 + 1 < 0)) || !((2 * p / 4 + 1) / 2 + 1 == 1)))) || 1 == 2 * p / 4 + 1))) || A == B * 1 * (p + q) + (r + -d))) && ((-(2 * d * 2) + r >= 2 * d || -(2 * d * 2) + r + -d + (p + (q + 2 * (2 * p))) * B == A) || !(r >= 2 * d * 2))) && 2 <= p) && ((!(p == 1) || !(B * p == d)) || d * q + r == A)) && (((((A == B * 1 * (q + 2 * p) + (-(2 * d) + r) || -(2 * d) + r >= d) || p == 1) || !(r >= 2 * d)) || ((!(p * 4 / 8 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p * 4 / 8 + 1 == 1)))) || ((!(B * 1 == d * 4 / 8) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || !(d * 4 / 8 + 1 == B * 1)) || d % 2 == 0)))) && B * p == d) && A == r + -d + B * (p + q)) && ((-(2 * d) + r >= d || (((((p % 2 == 0 || -(d * 4 / 8) + (-(2 * d) + r) + B * (q + 2 * p + (p * 4 / 8 + 1)) == A) || !(p < 0)) && (-(d * 4 / 8) + (-(2 * d) + r) + (q + 2 * p + p * 4 / 8) * B == A || (p < 0 && !(p % 2 == 0)))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || d % 2 == 0) || (((p % 2 == 0 || !(p < 0)) || -1 + -(d * 4 / 8) + (-(2 * d) + r) + B * (q + 2 * p + (p * 4 / 8 + 1)) == A) && (-1 + -(d * 4 / 8) + (-(2 * d) + r) + (q + 2 * p + p * 4 / 8) * B == A || (p < 0 && !(p % 2 == 0))))))) || !(r >= 2 * d))) && ((!(p == 1) || r + -d + d * (p + q) == A) || !(r >= d))) && (!(r >= d) || (((p % 2 == 0 || !(p < 0)) || ((((!(d < 0) || r + -d >= 2 * d / 4 + 1) || ((((2 * d / 4 + 1) % 2 == 0 || !(2 * d / 4 + 1 < 0)) || ((((2 * p / 4 + 1) % 2 == 0 || !(2 * p / 4 + 1 < 0)) || A == r + -d + (-1 + -((2 * d / 4 + 1) / 2)) + B * ((2 * p / 4 + 1) / 2 + 1 + (p + q))) && (B * (p + q + (2 * p / 4 + 1) / 2) + (r + -d + (-1 + -((2 * d / 4 + 1) / 2))) == A || (!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0)))) && (((((2 * p / 4 + 1) % 2 == 0 || A == -((2 * d / 4 + 1) / 2) + (r + -d) + B * ((2 * p / 4 + 1) / 2 + 1 + (p + q))) || !(2 * p / 4 + 1 < 0)) && (B * (p + q + (2 * p / 4 + 1) / 2) + (-((2 * d / 4 + 1) / 2) + (r + -d)) == A || (!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0))) || (2 * d / 4 + 1 < 0 && !((2 * d / 4 + 1) % 2 == 0))))) || d % 2 == 0) && (((((2 * d / 4 % 2 == 0 || !(2 * d / 4 < 0)) || ((((2 * p / 4 + 1) % 2 == 0 || !(2 * p / 4 + 1 < 0)) || A == -1 + -(2 * d / 8) + (r + -d) + B * ((2 * p / 4 + 1) / 2 + 1 + (p + q))) && (B * (p + q + (2 * p / 4 + 1) / 2) + (-1 + -(2 * d / 8) + (r + -d)) == A || (!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0)))) && ((!(2 * d / 4 % 2 == 0) && 2 * d / 4 < 0) || ((((2 * p / 4 + 1) % 2 == 0 || -(2 * d / 8) + (r + -d) + B * ((2 * p / 4 + 1) / 2 + 1 + (p + q)) == A) || !(2 * p / 4 + 1 < 0)) && (-(2 * d / 8) + (r + -d) + B * (p + q + (2 * p / 4 + 1) / 2) == A || (!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0))))) || (!(d % 2 == 0) && d < 0)) || r + -d >= 2 * d / 4))) && (((((!(d < 0) || r + -d >= 2 * d / 4 + 1) || ((((((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || r + -d + (-1 + -((2 * d / 4 + 1) / 2)) + B * (2 * p / 8 + 1 + (p + q)) == A) && (r + -d + (-1 + -((2 * d / 4 + 1) / 2)) + (2 * p / 8 + (p + q)) * B == A || (!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0))) || (2 * d / 4 + 1) % 2 == 0) || !(2 * d / 4 + 1 < 0)) && ((2 * d / 4 + 1 < 0 && !((2 * d / 4 + 1) % 2 == 0)) || (((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || B * (2 * p / 8 + 1 + (p + q)) + (-((2 * d / 4 + 1) / 2) + (r + -d)) == A) && (-((2 * d / 4 + 1) / 2) + (r + -d) + (2 * p / 8 + (p + q)) * B == A || (!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0)))))) || d % 2 == 0) && ((((((((!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0) || A == -1 + -(2 * d / 8) + (r + -d) + (2 * p / 8 + (p + q)) * B) && ((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || A == -1 + -(2 * d / 8) + (r + -d) + B * (2 * p / 8 + 1 + (p + q)))) || 2 * d / 4 % 2 == 0) || !(2 * d / 4 < 0)) && ((!(2 * d / 4 % 2 == 0) && 2 * d / 4 < 0) || (((!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0) || -(2 * d / 8) + (r + -d) + (2 * p / 8 + (p + q)) * B == A) && ((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || -(2 * d / 8) + (r + -d) + B * (2 * p / 8 + 1 + (p + q)) == A)))) || (!(d % 2 == 0) && d < 0)) || r + -d >= 2 * d / 4)) || (p < 0 && !(p % 2 == 0)))))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && B == 1) && (A == B * q + r || (A == B * q + r && 1 <= d))) && ((((((!(d % 2 == 0) && d < 0) || r + -d + -(2 * d / 4) + 2 * d / 4 * (p + q + 1) == A) || !(r + -d >= 2 * d / 4)) && (((!(d < 0) || !(r + -d >= 2 * d / 4 + 1)) || -1 + -(2 * d / 4) + (r + -d) + (2 * d / 4 + 1) * (p + q + 1) == A) || d % 2 == 0)) || (((!(1 == 2 * p / 4 + 1) || p % 2 == 0) || !(p < 0)) && (!(2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))))) || r >= 2 * d)) || (((((((((((((((((A + -r + -d) / 2 == d && ((A + d + r) % 2 == 0 || !(A + -1 * (d + r) < 0))) || ((A + -1 * (d + r) < 0 && d == (A + -r + -d) / 2 + 1) && !((A + d + r) % 2 == 0))) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && p == 1) && B == -2 * B + -1 * r + A) && 2 == A + -1 * (d + r)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && d + r >= d) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && -2 + q == 1) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && B == 1) && !(d + r + (A + -1 * (d + r)) >= 2 * (2 * 1))) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && -1 * 2 + (-1 * p + q) == 0)) || ((((((((((((((A == B * q + r && p >= 1) && (((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || !(B * 1 == d / 2 + 1)) || d % 2 == 0) && (!(d / 2 == B * 1) || (!(d % 2 == 0) && d < 0)))) || p == 1) || r + B * 1 * q == A)) && (((((((!(d < 0) || r + -d >= 2 * d / 4 + 1) || ((((2 * d / 4 + 1) % 2 == 0 || !((2 * d / 4 + 1) / 2 + 1 == B * 1)) || !(2 * d / 4 + 1 < 0)) && ((2 * d / 4 + 1 < 0 && !((2 * d / 4 + 1) % 2 == 0)) || !(B * 1 == (2 * d / 4 + 1) / 2)))) || d % 2 == 0) && (((((2 * d / 4 % 2 == 0 || !(2 * d / 8 + 1 == B * 1)) || !(2 * d / 4 < 0)) && ((!(2 * d / 4 % 2 == 0) && 2 * d / 4 < 0) || !(B * 1 == 2 * d / 8))) || (!(d % 2 == 0) && d < 0)) || r + -d >= 2 * d / 4)) || !(r >= d)) || ((((((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || !(2 * p / 8 + 1 == 1)) && (!(2 * p / 8 == 1) || (!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0))) || 2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))) && (((p % 2 == 0 || !(p < 0)) || (((!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0) || !((2 * p / 4 + 1) / 2 == 1)) && (((2 * p / 4 + 1) % 2 == 0 || !(2 * p / 4 + 1 < 0)) || !((2 * p / 4 + 1) / 2 + 1 == 1)))) || 1 == 2 * p / 4 + 1))) || A == B * 1 * (p + q) + (r + -d))) && ((-(2 * d * 2) + r >= 2 * d || -(2 * d * 2) + r + -d + (p + (q + 2 * (2 * p))) * B == A) || !(r >= 2 * d * 2))) && ((!(p == 1) || !(B * p == d)) || d * q + r == A)) && (((((A == B * 1 * (q + 2 * p) + (-(2 * d) + r) || -(2 * d) + r >= d) || p == 1) || !(r >= 2 * d)) || ((!(p * 4 / 8 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p * 4 / 8 + 1 == 1)))) || ((!(B * 1 == d * 4 / 8) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || !(d * 4 / 8 + 1 == B * 1)) || d % 2 == 0)))) && B * p == d) && A == r + -d + B * (p + q)) && ((-(2 * d) + r >= d || (((((p % 2 == 0 || -(d * 4 / 8) + (-(2 * d) + r) + B * (q + 2 * p + (p * 4 / 8 + 1)) == A) || !(p < 0)) && (-(d * 4 / 8) + (-(2 * d) + r) + (q + 2 * p + p * 4 / 8) * B == A || (p < 0 && !(p % 2 == 0)))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || d % 2 == 0) || (((p % 2 == 0 || !(p < 0)) || -1 + -(d * 4 / 8) + (-(2 * d) + r) + B * (q + 2 * p + (p * 4 / 8 + 1)) == A) && (-1 + -(d * 4 / 8) + (-(2 * d) + r) + (q + 2 * p + p * 4 / 8) * B == A || (p < 0 && !(p % 2 == 0))))))) || !(r >= 2 * d))) && ((!(p == 1) || r + -d + d * (p + q) == A) || !(r >= d))) && (!(r >= d) || (((p % 2 == 0 || !(p < 0)) || ((((!(d < 0) || r + -d >= 2 * d / 4 + 1) || ((((2 * d / 4 + 1) % 2 == 0 || !(2 * d / 4 + 1 < 0)) || ((((2 * p / 4 + 1) % 2 == 0 || !(2 * p / 4 + 1 < 0)) || A == r + -d + (-1 + -((2 * d / 4 + 1) / 2)) + B * ((2 * p / 4 + 1) / 2 + 1 + (p + q))) && (B * (p + q + (2 * p / 4 + 1) / 2) + (r + -d + (-1 + -((2 * d / 4 + 1) / 2))) == A || (!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0)))) && (((((2 * p / 4 + 1) % 2 == 0 || A == -((2 * d / 4 + 1) / 2) + (r + -d) + B * ((2 * p / 4 + 1) / 2 + 1 + (p + q))) || !(2 * p / 4 + 1 < 0)) && (B * (p + q + (2 * p / 4 + 1) / 2) + (-((2 * d / 4 + 1) / 2) + (r + -d)) == A || (!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0))) || (2 * d / 4 + 1 < 0 && !((2 * d / 4 + 1) % 2 == 0))))) || d % 2 == 0) && (((((2 * d / 4 % 2 == 0 || !(2 * d / 4 < 0)) || ((((2 * p / 4 + 1) % 2 == 0 || !(2 * p / 4 + 1 < 0)) || A == -1 + -(2 * d / 8) + (r + -d) + B * ((2 * p / 4 + 1) / 2 + 1 + (p + q))) && (B * (p + q + (2 * p / 4 + 1) / 2) + (-1 + -(2 * d / 8) + (r + -d)) == A || (!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0)))) && ((!(2 * d / 4 % 2 == 0) && 2 * d / 4 < 0) || ((((2 * p / 4 + 1) % 2 == 0 || -(2 * d / 8) + (r + -d) + B * ((2 * p / 4 + 1) / 2 + 1 + (p + q)) == A) || !(2 * p / 4 + 1 < 0)) && (-(2 * d / 8) + (r + -d) + B * (p + q + (2 * p / 4 + 1) / 2) == A || (!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0))))) || (!(d % 2 == 0) && d < 0)) || r + -d >= 2 * d / 4))) && (((((!(d < 0) || r + -d >= 2 * d / 4 + 1) || ((((((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || r + -d + (-1 + -((2 * d / 4 + 1) / 2)) + B * (2 * p / 8 + 1 + (p + q)) == A) && (r + -d + (-1 + -((2 * d / 4 + 1) / 2)) + (2 * p / 8 + (p + q)) * B == A || (!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0))) || (2 * d / 4 + 1) % 2 == 0) || !(2 * d / 4 + 1 < 0)) && ((2 * d / 4 + 1 < 0 && !((2 * d / 4 + 1) % 2 == 0)) || (((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || B * (2 * p / 8 + 1 + (p + q)) + (-((2 * d / 4 + 1) / 2) + (r + -d)) == A) && (-((2 * d / 4 + 1) / 2) + (r + -d) + (2 * p / 8 + (p + q)) * B == A || (!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0)))))) || d % 2 == 0) && ((((((((!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0) || A == -1 + -(2 * d / 8) + (r + -d) + (2 * p / 8 + (p + q)) * B) && ((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || A == -1 + -(2 * d / 8) + (r + -d) + B * (2 * p / 8 + 1 + (p + q)))) || 2 * d / 4 % 2 == 0) || !(2 * d / 4 < 0)) && ((!(2 * d / 4 % 2 == 0) && 2 * d / 4 < 0) || (((!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0) || -(2 * d / 8) + (r + -d) + (2 * p / 8 + (p + q)) * B == A) && ((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || -(2 * d / 8) + (r + -d) + B * (2 * p / 8 + 1 + (p + q)) == A)))) || (!(d % 2 == 0) && d < 0)) || r + -d >= 2 * d / 4)) || (p < 0 && !(p % 2 == 0)))))) && B == 1) && (A == B * q + r || (A == B * q + r && 1 <= d))) && ((((((!(d % 2 == 0) && d < 0) || r + -d + -(2 * d / 4) + 2 * d / 4 * (p + q + 1) == A) || !(r + -d >= 2 * d / 4)) && (((!(d < 0) || !(r + -d >= 2 * d / 4 + 1)) || -1 + -(2 * d / 4) + (r + -d) + (2 * d / 4 + 1) * (p + q + 1) == A) || d % 2 == 0)) || (((!(1 == 2 * p / 4 + 1) || p % 2 == 0) || !(p < 0)) && (!(2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))))) || r >= 2 * d))) || (((((((((((((((((((((((((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || ((((!(d < 0) || r + -d >= d / 2 + 1) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0) && (((((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4))) || (!(d % 2 == 0) && d < 0)) || r + -d >= d / 2))) || A == B * 1 * (p + q) + (r + -d)) && ((p % 2 == 0 || !(p < 0)) || ((((!(d < 0) || ((((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 2 + 1) / 2)) && (((p / 2 + 1) % 2 == 0 || B * ((p / 2 + 1) / 2 + 1 + q) + (-1 + -((d / 2 + 1) / 2) + r) == A) || !(p / 2 + 1 < 0))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + -((d / 2 + 1) / 2) + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == B * ((p / 2 + 1) / 2 + 1 + q) + (r + -((d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q)) || !(p / 2 + 1 < 0)))) && (((((A == -1 + -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -1 + -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A)) || d / 2 % 2 == 0) || !(d / 2 < 0)))) || (!(d % 2 == 0) && d < 0))))) && (((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0))) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && ((p % 2 == 0 || !(p < 0)) || (((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || ((((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((((((p / 2 + 1) / 2 % 2 == 0 || -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A)) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0))) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((d / 4 % 2 == 0 || !(d / 4 < 0)) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A))) && ((!(d / 4 % 2 == 0) && d / 4 < 0) || ((((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || r + -(d / 2) + -(d / 8) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) && (r + -(d / 2) + -(d / 8) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)))))) || r + -(d / 2) >= d / 4))) && ((((((d / 2 % 2 == 0 || (((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + -(d / 2) + -((d / 4 + 1) / 2)) == A) || !((p / 2 + 1) / 2 + 1 < 0)))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || ((-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)))) || !((p / 2 + 1) / 2 + 1 < 0)))))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || r + -(d / 2) >= d / 4) || (((d / 4 % 2 == 0 || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-1 + -(d / 8) + (r + -(d / 2))) == A))) || !(d / 4 < 0)) && (((A == r + -(d / 2) + -(d / 8) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + -(d / 2) + -(d / 8) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A)) || (!(d / 4 % 2 == 0) && d / 4 < 0))))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((((((((((((p / 2 + 1) / 2 % 2 == 0 || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B)) || !((d / 2 + 1) / 2 + 1 < 0)) || ((d / 2 + 1) / 2 + 1) % 2 == 0) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || ((((p / 2 + 1) / 2 % 2 == 0 || A == r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (((!((d / 2 + 1) / 2 < 0) || (((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A || (p / 2 + 1) / 2 % 2 == 0) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B))) || (d / 2 + 1) / 2 % 2 == 0) && (((((p / 2 + 1) / 2 % 2 == 0 || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))))) || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))) && (((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || ((((((!((d / 2 + 1) / 2 < 0) || (((A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)))) || (d / 2 + 1) / 2 % 2 == 0) && ((((B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))))) || d % 2 == 0)))) && (((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || r + B * 1 * q == A) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4)))) || (!(d % 2 == 0) && d < 0))))) && (((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || !(B * 1 == d / 2 + 1)) || d % 2 == 0) && (!(d / 2 == B * 1) || (!(d % 2 == 0) && d < 0)))) || p == 1) || r + B * 1 * q == A)) && ((-(2 * d * 2) + r >= 2 * d || -(2 * d * 2) + r + -d + (p + (q + 2 * (2 * p))) * B == A) || !(r >= 2 * d * 2))) && 2 <= p) && (((((A == B * 1 * (q + 2 * p) + (-(2 * d) + r) || -(2 * d) + r >= d) || p == 1) || !(r >= 2 * d)) || ((!(p * 4 / 8 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p * 4 / 8 + 1 == 1)))) || ((!(B * 1 == d * 4 / 8) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || !(d * 4 / 8 + 1 == B * 1)) || d % 2 == 0)))) && ((p < 0 && !(p % 2 == 0)) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || ((B * (p / 4 + q) + (r + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == r + -((d / 2 + 1) / 2) + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (A == B * (p / 4 + q) + (-1 + -((d / 2 + 1) / 2) + r) || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || (((!(p / 2 < 0) || A == -1 + -(d / 4) + r + B * (q + (p / 4 + 1))) || p / 2 % 2 == 0) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == -1 + -(d / 4) + r + B * (p / 4 + q)))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((-(d / 4) + r + B * (q + (p / 4 + 1)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-(d / 4) + r + B * (p / 4 + q) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))))))) || (!(d % 2 == 0) && d < 0))))) && B * p == d) && A == r + -d + B * (p + q)) && ((-(2 * d) + r >= d || (((((p % 2 == 0 || -(d * 4 / 8) + (-(2 * d) + r) + B * (q + 2 * p + (p * 4 / 8 + 1)) == A) || !(p < 0)) && (-(d * 4 / 8) + (-(2 * d) + r) + (q + 2 * p + p * 4 / 8) * B == A || (p < 0 && !(p % 2 == 0)))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || d % 2 == 0) || (((p % 2 == 0 || !(p < 0)) || -1 + -(d * 4 / 8) + (-(2 * d) + r) + B * (q + 2 * p + (p * 4 / 8 + 1)) == A) && (-1 + -(d * 4 / 8) + (-(2 * d) + r) + (q + 2 * p + p * 4 / 8) * B == A || (p < 0 && !(p % 2 == 0))))))) || !(r >= 2 * d))) && ((((((p / 4 + 1 == 1 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || !(1 + (p / 4 + 1) / 2 == 1)) && (!(1 == (p / 4 + 1) / 2) || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 == 1 || (((p / 4 % 2 == 0 || !(p / 8 + 1 == 1)) || !(p / 4 < 0)) && (!(p / 8 == 1) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (((B * 1 * (q + p / 2) + (r + -(d / 2)) == A || (!(d % 2 == 0) && d < 0)) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((!(B * 1 == d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || !(d / 4 < 0)) || !(B * 1 == d / 8 + 1)))) || r + -(d / 2) >= d / 4) && (((d / 2 % 2 == 0 || ((!(B * 1 == (d / 4 + 1) / 2) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || !(B * 1 == (d / 4 + 1) / 2 + 1)))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1))) && (((!(d < 0) || (((((!(B * 1 == (d / 2 + 1) / 4) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2 + 1)) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) || r + (-1 + -(d / 2)) + B * 1 * (q + p / 2) == A) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && ((((!(d % 2 == 0) && d < 0) || ((((((((((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || ((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || (((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))))))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || r + -(d / 2) >= d / 4) || (((d / 4 % 2 == 0 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(d / 4 < 0)) && (((((p / 4 + 1) % 2 == 0 || r + -(d / 2) + -(d / 8) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + -(d / 2) + -(d / 8) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || (!(d / 4 % 2 == 0) && d / 4 < 0))))) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (((((d / 2 % 2 == 0 || (((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) || p / 4 % 2 == 0) || !(p / 4 < 0)))) && ((((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2))) && ((!(p / 4 % 2 == 0) && p / 4 < 0) || r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + p / 2 + p / 8) == A)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -(d / 8) + B * (p / 8 + 1 + (q + p / 2))) && (r + -(d / 2) + -(d / 8) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0))) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || ((-1 + -(d / 8) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((-1 + -(d / 8) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) == A || p / 4 % 2 == 0) || !(p / 4 < 0)))) || !(d / 4 < 0)))) || r + -(d / 2) >= d / 4)) || (p / 2 < 0 && !(p / 2 % 2 == 0))))) && ((!(d < 0) || (((((((((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || (((!(p / 4 % 2 == 0) && p / 4 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + p / 2 + p / 8) == A) && ((p / 4 % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2)) == A) || !(p / 4 < 0)))) && ((!((d / 2 + 1) / 2 + 1 < 0) || (((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((((!((d / 2 + 1) / 2 < 0) || ((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)))) || (d / 2 + 1) / 2 % 2 == 0) && (((A == B * (q + p / 2 + p / 8) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || B * (p / 8 + 1 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !(p / 4 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2)) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && (((((((((((r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || (!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0)) && ((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + p / 2 + (p / 4 + 1) / 2) * B)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((((((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) && ((B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && B == 1) && (((((!(d % 2 == 0) && d < 0) || ((((((!(p / 2 < 0) || p / 2 % 2 == 0) || (p + q + (p / 4 + 1)) * B + (r + -d + (-1 + -(d / 4))) == A) && (A == r + -d + (-1 + -(d / 4)) + (p / 4 + (p + q)) * B || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || d / 2 % 2 == 0) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 < 0 && !(p / 2 % 2 == 0)) || -(d / 4) + (r + -d) + (p / 4 + (p + q)) * B == A) && (((p + q + (p / 4 + 1)) * B + (-(d / 4) + (r + -d)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0))))) || r + -d >= d / 2) && (((!(d < 0) || ((((((-1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 4 + 1)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-1 + -((d / 2 + 1) / 2) + (r + -d) + (p / 4 + (p + q)) * B == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((((p / 4 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == (p + q + (p / 4 + 1)) * B + (r + -d + -((d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || r + -d >= d / 2 + 1) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && ((((((((p / 2 + 1) % 2 == 0 || (p / 2 + 1) / 2 + 1 == 1) || !(p / 2 + 1 < 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || !(((p / 2 + 1) / 2 + 1) / 2 == 1)) && ((!(((p / 2 + 1) / 2 + 1) / 2 + 1 == 1) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)))) && (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p / 2 + 1) / 2 == 1) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || !((p / 2 + 1) / 4 == 1)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || !((p / 2 + 1) / 4 + 1 == 1))))) || p % 2 == 0) || ((((!(d < 0) || (((((!(B * 1 == (d / 2 + 1) / 4) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2 + 1)) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) || A == r + (-1 + -(d / 2)) + (q + (p / 2 + 1)) * (B * 1)) || d % 2 == 0) && (((!(d % 2 == 0) && d < 0) || r + -(d / 2) + (q + (p / 2 + 1)) * (B * 1) == A) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((!(B * 1 == d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || !(d / 4 < 0)) || !(B * 1 == d / 8 + 1)))) || r + -(d / 2) >= d / 4) && (((d / 2 % 2 == 0 || ((!(B * 1 == (d / 4 + 1) / 2) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || !(B * 1 == (d / 4 + 1) / 2 + 1)))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1))))) || !(p < 0))) && ((p % 2 == 0 || ((((!(d % 2 == 0) && d < 0) || r + -d >= d / 2) || (((d / 2 % 2 == 0 || ((((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || A == r + -d + (-1 + -(d / 4)) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) && (A == r + -d + (-1 + -(d / 4)) + (p + q + (p / 2 + 1) / 2) * B || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || ((((p / 2 + 1) % 2 == 0 || A == -(d / 4) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p + q + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -d)) == A || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))))) && (((!(d < 0) || r + -d >= d / 2 + 1) || (((((((p / 2 + 1) % 2 == 0 || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 2 + 1) / 2) * B)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((((A == ((p / 2 + 1) / 2 + 1 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p + q + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2)) == A)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || d % 2 == 0))) || !(p < 0)))) || (((((((((((((A == B * q + r && p >= 1) && (((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || !(B * 1 == d / 2 + 1)) || d % 2 == 0) && (!(d / 2 == B * 1) || (!(d % 2 == 0) && d < 0)))) || p == 1) || r + B * 1 * q == A)) && (((((((!(d < 0) || r + -d >= 2 * d / 4 + 1) || ((((2 * d / 4 + 1) % 2 == 0 || !((2 * d / 4 + 1) / 2 + 1 == B * 1)) || !(2 * d / 4 + 1 < 0)) && ((2 * d / 4 + 1 < 0 && !((2 * d / 4 + 1) % 2 == 0)) || !(B * 1 == (2 * d / 4 + 1) / 2)))) || d % 2 == 0) && (((((2 * d / 4 % 2 == 0 || !(2 * d / 8 + 1 == B * 1)) || !(2 * d / 4 < 0)) && ((!(2 * d / 4 % 2 == 0) && 2 * d / 4 < 0) || !(B * 1 == 2 * d / 8))) || (!(d % 2 == 0) && d < 0)) || r + -d >= 2 * d / 4)) || !(r >= d)) || ((((((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || !(2 * p / 8 + 1 == 1)) && (!(2 * p / 8 == 1) || (!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0))) || 2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))) && (((p % 2 == 0 || !(p < 0)) || (((!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0) || !((2 * p / 4 + 1) / 2 == 1)) && (((2 * p / 4 + 1) % 2 == 0 || !(2 * p / 4 + 1 < 0)) || !((2 * p / 4 + 1) / 2 + 1 == 1)))) || 1 == 2 * p / 4 + 1))) || A == B * 1 * (p + q) + (r + -d))) && ((-(2 * d * 2) + r >= 2 * d || -(2 * d * 2) + r + -d + (p + (q + 2 * (2 * p))) * B == A) || !(r >= 2 * d * 2))) && ((!(p == 1) || !(B * p == d)) || d * q + r == A)) && (((((A == B * 1 * (q + 2 * p) + (-(2 * d) + r) || -(2 * d) + r >= d) || p == 1) || !(r >= 2 * d)) || ((!(p * 4 / 8 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p * 4 / 8 + 1 == 1)))) || ((!(B * 1 == d * 4 / 8) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || !(d * 4 / 8 + 1 == B * 1)) || d % 2 == 0)))) && B * p == d) && ((-(2 * d) + r >= d || (((((p % 2 == 0 || -(d * 4 / 8) + (-(2 * d) + r) + B * (q + 2 * p + (p * 4 / 8 + 1)) == A) || !(p < 0)) && (-(d * 4 / 8) + (-(2 * d) + r) + (q + 2 * p + p * 4 / 8) * B == A || (p < 0 && !(p % 2 == 0)))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || d % 2 == 0) || (((p % 2 == 0 || !(p < 0)) || -1 + -(d * 4 / 8) + (-(2 * d) + r) + B * (q + 2 * p + (p * 4 / 8 + 1)) == A) && (-1 + -(d * 4 / 8) + (-(2 * d) + r) + (q + 2 * p + p * 4 / 8) * B == A || (p < 0 && !(p % 2 == 0))))))) || !(r >= 2 * d))) && ((!(p == 1) || r + -d + d * (p + q) == A) || !(r >= d))) && (!(r >= d) || (((p % 2 == 0 || !(p < 0)) || ((((!(d < 0) || r + -d >= 2 * d / 4 + 1) || ((((2 * d / 4 + 1) % 2 == 0 || !(2 * d / 4 + 1 < 0)) || ((((2 * p / 4 + 1) % 2 == 0 || !(2 * p / 4 + 1 < 0)) || A == r + -d + (-1 + -((2 * d / 4 + 1) / 2)) + B * ((2 * p / 4 + 1) / 2 + 1 + (p + q))) && (B * (p + q + (2 * p / 4 + 1) / 2) + (r + -d + (-1 + -((2 * d / 4 + 1) / 2))) == A || (!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0)))) && (((((2 * p / 4 + 1) % 2 == 0 || A == -((2 * d / 4 + 1) / 2) + (r + -d) + B * ((2 * p / 4 + 1) / 2 + 1 + (p + q))) || !(2 * p / 4 + 1 < 0)) && (B * (p + q + (2 * p / 4 + 1) / 2) + (-((2 * d / 4 + 1) / 2) + (r + -d)) == A || (!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0))) || (2 * d / 4 + 1 < 0 && !((2 * d / 4 + 1) % 2 == 0))))) || d % 2 == 0) && (((((2 * d / 4 % 2 == 0 || !(2 * d / 4 < 0)) || ((((2 * p / 4 + 1) % 2 == 0 || !(2 * p / 4 + 1 < 0)) || A == -1 + -(2 * d / 8) + (r + -d) + B * ((2 * p / 4 + 1) / 2 + 1 + (p + q))) && (B * (p + q + (2 * p / 4 + 1) / 2) + (-1 + -(2 * d / 8) + (r + -d)) == A || (!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0)))) && ((!(2 * d / 4 % 2 == 0) && 2 * d / 4 < 0) || ((((2 * p / 4 + 1) % 2 == 0 || -(2 * d / 8) + (r + -d) + B * ((2 * p / 4 + 1) / 2 + 1 + (p + q)) == A) || !(2 * p / 4 + 1 < 0)) && (-(2 * d / 8) + (r + -d) + B * (p + q + (2 * p / 4 + 1) / 2) == A || (!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0))))) || (!(d % 2 == 0) && d < 0)) || r + -d >= 2 * d / 4))) && (((((!(d < 0) || r + -d >= 2 * d / 4 + 1) || ((((((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || r + -d + (-1 + -((2 * d / 4 + 1) / 2)) + B * (2 * p / 8 + 1 + (p + q)) == A) && (r + -d + (-1 + -((2 * d / 4 + 1) / 2)) + (2 * p / 8 + (p + q)) * B == A || (!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0))) || (2 * d / 4 + 1) % 2 == 0) || !(2 * d / 4 + 1 < 0)) && ((2 * d / 4 + 1 < 0 && !((2 * d / 4 + 1) % 2 == 0)) || (((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || B * (2 * p / 8 + 1 + (p + q)) + (-((2 * d / 4 + 1) / 2) + (r + -d)) == A) && (-((2 * d / 4 + 1) / 2) + (r + -d) + (2 * p / 8 + (p + q)) * B == A || (!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0)))))) || d % 2 == 0) && ((((((((!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0) || A == -1 + -(2 * d / 8) + (r + -d) + (2 * p / 8 + (p + q)) * B) && ((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || A == -1 + -(2 * d / 8) + (r + -d) + B * (2 * p / 8 + 1 + (p + q)))) || 2 * d / 4 % 2 == 0) || !(2 * d / 4 < 0)) && ((!(2 * d / 4 % 2 == 0) && 2 * d / 4 < 0) || (((!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0) || -(2 * d / 8) + (r + -d) + (2 * p / 8 + (p + q)) * B == A) && ((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || -(2 * d / 8) + (r + -d) + B * (2 * p / 8 + 1 + (p + q)) == A)))) || (!(d % 2 == 0) && d < 0)) || r + -d >= 2 * d / 4)) || (p < 0 && !(p % 2 == 0)))))) && B == 1) && (A == B * q + r || (A == B * q + r && 1 <= d))) && ((((((!(d % 2 == 0) && d < 0) || r + -d + -(2 * d / 4) + 2 * d / 4 * (p + q + 1) == A) || !(r + -d >= 2 * d / 4)) && (((!(d < 0) || !(r + -d >= 2 * d / 4 + 1)) || -1 + -(2 * d / 4) + (r + -d) + (2 * d / 4 + 1) * (p + q + 1) == A) || d % 2 == 0)) || (((!(1 == 2 * p / 4 + 1) || p % 2 == 0) || !(p < 0)) && (!(2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))))) || r >= 2 * d))) || ((((A == B * q + r && p >= 1) && ((!(p == 1) || !(B * p == d)) || d * q + r == A)) && B * p == d) && B == 1)) || (((((((((A == B * q + r && 8 <= p) && 2 * (2 * (2 * 1)) == p) && q == 0) && r >= 2 * (2 * B)) && B * p == d) && A == r) && 2 * (2 * B) * 2 == d) && B == 1) && (((((((((((((((((((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0))) && (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) || ((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0) || ((((((((((((((((((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0))) && (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) || ((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && d * q + r == A) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0)))) || ((((((A == B * q + r && p >= 1) && ((-(2 * d * 2) + r >= 2 * d || -(2 * d * 2) + r + -d + (p + (q + 2 * (2 * p))) * B == A) || !(r >= 2 * d * 2))) && ((!(p == 1) || !(B * p == d)) || d * q + r == A)) && B * p == d) && A == r + -d + B * (p + q)) && B == 1)) || ((((((((((d + r == A && d == 1) && (((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0))) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && p == 1) && B == d) && r == -B + A) && A == r + -d + B * (p + q)) && B == 1) && q == 0 + 1) && p + 0 == q)) || ((((p == 1 && B == d) && q == 0) && A == r) && B == 1)) || (((((((A == B * q + r && (!(p == 1) || d * q + r == A)) && 2 <= p) && ((!(p == 1) || !(B * p == d)) || d * q + r == A)) && B * p == d) && A == r + -d + B * (p + q)) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && B == 1)) || (((((((((((((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0))) && (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) || ((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1))) && r >= d / 2) && 2 * (2 * B) == d) && 2 <= d / 2) && p == 2 * (2 * 1)) && q == 0) && d == 2 * (2 * 1)) && !(r >= d)) && A == r) && B == 1) && (!(p == 1) || B == d)) && d % 2 == 0)) || ((((((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && p >= 1) && (((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || !(B * 1 == d / 2 + 1)) || d % 2 == 0) && (!(d / 2 == B * 1) || (!(d % 2 == 0) && d < 0)))) || p == 1) || r + B * 1 * q == A)) && (((((((!(d < 0) || r + -d >= 2 * d / 4 + 1) || ((((2 * d / 4 + 1) % 2 == 0 || !((2 * d / 4 + 1) / 2 + 1 == B * 1)) || !(2 * d / 4 + 1 < 0)) && ((2 * d / 4 + 1 < 0 && !((2 * d / 4 + 1) % 2 == 0)) || !(B * 1 == (2 * d / 4 + 1) / 2)))) || d % 2 == 0) && (((((2 * d / 4 % 2 == 0 || !(2 * d / 8 + 1 == B * 1)) || !(2 * d / 4 < 0)) && ((!(2 * d / 4 % 2 == 0) && 2 * d / 4 < 0) || !(B * 1 == 2 * d / 8))) || (!(d % 2 == 0) && d < 0)) || r + -d >= 2 * d / 4)) || !(r >= d)) || ((((((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || !(2 * p / 8 + 1 == 1)) && (!(2 * p / 8 == 1) || (!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0))) || 2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))) && (((p % 2 == 0 || !(p < 0)) || (((!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0) || !((2 * p / 4 + 1) / 2 == 1)) && (((2 * p / 4 + 1) % 2 == 0 || !(2 * p / 4 + 1 < 0)) || !((2 * p / 4 + 1) / 2 + 1 == 1)))) || 1 == 2 * p / 4 + 1))) || A == B * 1 * (p + q) + (r + -d))) && ((-(2 * d * 2) + r >= 2 * d || -(2 * d * 2) + r + -d + (p + (q + 2 * (2 * p))) * B == A) || !(r >= 2 * d * 2))) && ((!(p == 1) || !(B * p == d)) || d * q + r == A)) && (((((A == B * 1 * (q + 2 * p) + (-(2 * d) + r) || -(2 * d) + r >= d) || p == 1) || !(r >= 2 * d)) || ((!(p * 4 / 8 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p * 4 / 8 + 1 == 1)))) || ((!(B * 1 == d * 4 / 8) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || !(d * 4 / 8 + 1 == B * 1)) || d % 2 == 0)))) && B * p == d) && ((-(2 * d) + r >= d || (((((p % 2 == 0 || -(d * 4 / 8) + (-(2 * d) + r) + B * (q + 2 * p + (p * 4 / 8 + 1)) == A) || !(p < 0)) && (-(d * 4 / 8) + (-(2 * d) + r) + (q + 2 * p + p * 4 / 8) * B == A || (p < 0 && !(p % 2 == 0)))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || d % 2 == 0) || (((p % 2 == 0 || !(p < 0)) || -1 + -(d * 4 / 8) + (-(2 * d) + r) + B * (q + 2 * p + (p * 4 / 8 + 1)) == A) && (-1 + -(d * 4 / 8) + (-(2 * d) + r) + (q + 2 * p + p * 4 / 8) * B == A || (p < 0 && !(p % 2 == 0))))))) || !(r >= 2 * d))) && ((!(p == 1) || r + -d + d * (p + q) == A) || !(r >= d))) && (!(r >= d) || (((p % 2 == 0 || !(p < 0)) || ((((!(d < 0) || r + -d >= 2 * d / 4 + 1) || ((((2 * d / 4 + 1) % 2 == 0 || !(2 * d / 4 + 1 < 0)) || ((((2 * p / 4 + 1) % 2 == 0 || !(2 * p / 4 + 1 < 0)) || A == r + -d + (-1 + -((2 * d / 4 + 1) / 2)) + B * ((2 * p / 4 + 1) / 2 + 1 + (p + q))) && (B * (p + q + (2 * p / 4 + 1) / 2) + (r + -d + (-1 + -((2 * d / 4 + 1) / 2))) == A || (!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0)))) && (((((2 * p / 4 + 1) % 2 == 0 || A == -((2 * d / 4 + 1) / 2) + (r + -d) + B * ((2 * p / 4 + 1) / 2 + 1 + (p + q))) || !(2 * p / 4 + 1 < 0)) && (B * (p + q + (2 * p / 4 + 1) / 2) + (-((2 * d / 4 + 1) / 2) + (r + -d)) == A || (!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0))) || (2 * d / 4 + 1 < 0 && !((2 * d / 4 + 1) % 2 == 0))))) || d % 2 == 0) && (((((2 * d / 4 % 2 == 0 || !(2 * d / 4 < 0)) || ((((2 * p / 4 + 1) % 2 == 0 || !(2 * p / 4 + 1 < 0)) || A == -1 + -(2 * d / 8) + (r + -d) + B * ((2 * p / 4 + 1) / 2 + 1 + (p + q))) && (B * (p + q + (2 * p / 4 + 1) / 2) + (-1 + -(2 * d / 8) + (r + -d)) == A || (!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0)))) && ((!(2 * d / 4 % 2 == 0) && 2 * d / 4 < 0) || ((((2 * p / 4 + 1) % 2 == 0 || -(2 * d / 8) + (r + -d) + B * ((2 * p / 4 + 1) / 2 + 1 + (p + q)) == A) || !(2 * p / 4 + 1 < 0)) && (-(2 * d / 8) + (r + -d) + B * (p + q + (2 * p / 4 + 1) / 2) == A || (!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0))))) || (!(d % 2 == 0) && d < 0)) || r + -d >= 2 * d / 4))) && (((((!(d < 0) || r + -d >= 2 * d / 4 + 1) || ((((((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || r + -d + (-1 + -((2 * d / 4 + 1) / 2)) + B * (2 * p / 8 + 1 + (p + q)) == A) && (r + -d + (-1 + -((2 * d / 4 + 1) / 2)) + (2 * p / 8 + (p + q)) * B == A || (!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0))) || (2 * d / 4 + 1) % 2 == 0) || !(2 * d / 4 + 1 < 0)) && ((2 * d / 4 + 1 < 0 && !((2 * d / 4 + 1) % 2 == 0)) || (((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || B * (2 * p / 8 + 1 + (p + q)) + (-((2 * d / 4 + 1) / 2) + (r + -d)) == A) && (-((2 * d / 4 + 1) / 2) + (r + -d) + (2 * p / 8 + (p + q)) * B == A || (!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0)))))) || d % 2 == 0) && ((((((((!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0) || A == -1 + -(2 * d / 8) + (r + -d) + (2 * p / 8 + (p + q)) * B) && ((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || A == -1 + -(2 * d / 8) + (r + -d) + B * (2 * p / 8 + 1 + (p + q)))) || 2 * d / 4 % 2 == 0) || !(2 * d / 4 < 0)) && ((!(2 * d / 4 % 2 == 0) && 2 * d / 4 < 0) || (((!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0) || -(2 * d / 8) + (r + -d) + (2 * p / 8 + (p + q)) * B == A) && ((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || -(2 * d / 8) + (r + -d) + B * (2 * p / 8 + 1 + (p + q)) == A)))) || (!(d % 2 == 0) && d < 0)) || r + -d >= 2 * d / 4)) || (p < 0 && !(p % 2 == 0)))))) && B == 1) && (A == B * q + r || (A == B * q + r && 1 <= d))) && ((((((!(d % 2 == 0) && d < 0) || r + -d + -(2 * d / 4) + 2 * d / 4 * (p + q + 1) == A) || !(r + -d >= 2 * d / 4)) && (((!(d < 0) || !(r + -d >= 2 * d / 4 + 1)) || -1 + -(2 * d / 4) + (r + -d) + (2 * d / 4 + 1) * (p + q + 1) == A) || d % 2 == 0)) || (((!(1 == 2 * p / 4 + 1) || p % 2 == 0) || !(p < 0)) && (!(2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))))) || r >= 2 * d))) || ((((((((((((((((((4 <= p && p == 4) && d + r == A) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && (!(p == 1) || d * q + r == A)) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && d == B * 4) && 2 <= d) && B * p == d) && A == r + -d + B * (p + q)) && A + -d == r) && A >= 2 * (2 * B)) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && B == 1) && (!(p == 1) || B == d)) && p + 0 == q) && d + r >= 2 * (2 * B))) || (((((((((((((((((((((((p % 2 == 0 || !(p < 0)) || ((((!(d < 0) || ((((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 2 + 1) / 2)) && (((p / 2 + 1) % 2 == 0 || B * ((p / 2 + 1) / 2 + 1 + q) + (-1 + -((d / 2 + 1) / 2) + r) == A) || !(p / 2 + 1 < 0))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + -((d / 2 + 1) / 2) + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == B * ((p / 2 + 1) / 2 + 1 + q) + (r + -((d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q)) || !(p / 2 + 1 < 0)))) && (((((A == -1 + -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -1 + -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A)) || d / 2 % 2 == 0) || !(d / 2 < 0)))) || (!(d % 2 == 0) && d < 0)))) && !(B * -4 + -1 * r + A + r >= 2 * B)) && (((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0))) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && p == 1) && ((p % 2 == 0 || !(p < 0)) || (((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || ((((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((((((p / 2 + 1) / 2 % 2 == 0 || -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A)) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0))) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((d / 4 % 2 == 0 || !(d / 4 < 0)) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A))) && ((!(d / 4 % 2 == 0) && d / 4 < 0) || ((((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || r + -(d / 2) + -(d / 8) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) && (r + -(d / 2) + -(d / 8) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)))))) || r + -(d / 2) >= d / 4))) && ((((((d / 2 % 2 == 0 || (((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + -(d / 2) + -((d / 4 + 1) / 2)) == A) || !((p / 2 + 1) / 2 + 1 < 0)))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || ((-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)))) || !((p / 2 + 1) / 2 + 1 < 0)))))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || r + -(d / 2) >= d / 4) || (((d / 4 % 2 == 0 || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-1 + -(d / 8) + (r + -(d / 2))) == A))) || !(d / 4 < 0)) && (((A == r + -(d / 2) + -(d / 8) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + -(d / 2) + -(d / 8) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A)) || (!(d / 4 % 2 == 0) && d / 4 < 0))))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((((((((((((p / 2 + 1) / 2 % 2 == 0 || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B)) || !((d / 2 + 1) / 2 + 1 < 0)) || ((d / 2 + 1) / 2 + 1) % 2 == 0) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || ((((p / 2 + 1) / 2 % 2 == 0 || A == r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (((!((d / 2 + 1) / 2 < 0) || (((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A || (p / 2 + 1) / 2 % 2 == 0) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B))) || (d / 2 + 1) / 2 % 2 == 0) && (((((p / 2 + 1) / 2 % 2 == 0 || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))))) || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))) && (((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || ((((((!((d / 2 + 1) / 2 < 0) || (((A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)))) || (d / 2 + 1) / 2 % 2 == 0) && ((((B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))))) || d % 2 == 0)))) && B * -4 + -1 * r + A == B) && p >= 1) && B == d) && q + -4 == 1) && ((p < 0 && !(p % 2 == 0)) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || ((B * (p / 4 + q) + (r + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == r + -((d / 2 + 1) / 2) + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (A == B * (p / 4 + q) + (-1 + -((d / 2 + 1) / 2) + r) || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || (((!(p / 2 < 0) || A == -1 + -(d / 4) + r + B * (q + (p / 4 + 1))) || p / 2 % 2 == 0) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == -1 + -(d / 4) + r + B * (p / 4 + q)))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((-(d / 4) + r + B * (q + (p / 4 + 1)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-(d / 4) + r + B * (p / 4 + q) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))))))) || (!(d % 2 == 0) && d < 0))))) && B * p == d) && A == r + -d + B * (p + q)) && B * 4 + (B * -4 + A) >= 2 * (2 * B)) && ((((!(d % 2 == 0) && d < 0) || ((((((((((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || ((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || (((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))))))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || r + -(d / 2) >= d / 4) || (((d / 4 % 2 == 0 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(d / 4 < 0)) && (((((p / 4 + 1) % 2 == 0 || r + -(d / 2) + -(d / 8) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + -(d / 2) + -(d / 8) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || (!(d / 4 % 2 == 0) && d / 4 < 0))))) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (((((d / 2 % 2 == 0 || (((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) || p / 4 % 2 == 0) || !(p / 4 < 0)))) && ((((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2))) && ((!(p / 4 % 2 == 0) && p / 4 < 0) || r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + p / 2 + p / 8) == A)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -(d / 8) + B * (p / 8 + 1 + (q + p / 2))) && (r + -(d / 2) + -(d / 8) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0))) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || ((-1 + -(d / 8) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((-1 + -(d / 8) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) == A || p / 4 % 2 == 0) || !(p / 4 < 0)))) || !(d / 4 < 0)))) || r + -(d / 2) >= d / 4)) || (p / 2 < 0 && !(p / 2 % 2 == 0))))) && ((!(d < 0) || (((((((((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || (((!(p / 4 % 2 == 0) && p / 4 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + p / 2 + p / 8) == A) && ((p / 4 % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2)) == A) || !(p / 4 < 0)))) && ((!((d / 2 + 1) / 2 + 1 < 0) || (((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((((!((d / 2 + 1) / 2 < 0) || ((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)))) || (d / 2 + 1) / 2 % 2 == 0) && (((A == B * (q + p / 2 + p / 8) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || B * (p / 8 + 1 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !(p / 4 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2)) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && (((((((((((r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || (!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0)) && ((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + p / 2 + (p / 4 + 1) / 2) * B)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((((((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) && ((B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && A >= 2 * (2 * B)) && !(B * -4 + A >= 2 * B)) && r == -d + (B * -4 + A)) && q == p + 4) && B == 1) && (((((!(d % 2 == 0) && d < 0) || ((((((!(p / 2 < 0) || p / 2 % 2 == 0) || (p + q + (p / 4 + 1)) * B + (r + -d + (-1 + -(d / 4))) == A) && (A == r + -d + (-1 + -(d / 4)) + (p / 4 + (p + q)) * B || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || d / 2 % 2 == 0) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 < 0 && !(p / 2 % 2 == 0)) || -(d / 4) + (r + -d) + (p / 4 + (p + q)) * B == A) && (((p + q + (p / 4 + 1)) * B + (-(d / 4) + (r + -d)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0))))) || r + -d >= d / 2) && (((!(d < 0) || ((((((-1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 4 + 1)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-1 + -((d / 2 + 1) / 2) + (r + -d) + (p / 4 + (p + q)) * B == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((((p / 4 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == (p + q + (p / 4 + 1)) * B + (r + -d + -((d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || r + -d >= d / 2 + 1) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && ((p % 2 == 0 || ((((!(d % 2 == 0) && d < 0) || r + -d >= d / 2) || (((d / 2 % 2 == 0 || ((((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || A == r + -d + (-1 + -(d / 4)) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) && (A == r + -d + (-1 + -(d / 4)) + (p + q + (p / 2 + 1) / 2) * B || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || ((((p / 2 + 1) % 2 == 0 || A == -(d / 4) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p + q + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -d)) == A || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))))) && (((!(d < 0) || r + -d >= d / 2 + 1) || (((((((p / 2 + 1) % 2 == 0 || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 2 + 1) / 2) * B)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((((A == ((p / 2 + 1) / 2 + 1 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p + q + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2)) == A)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || d % 2 == 0))) || !(p < 0)))) || ((((((d == 2 * B && d == 2 * 1) && q == 0) && B * p == d) && A == r) && B == 1) && p == 2 * 1)) || ((((((((((4 + 0 == q && A == B * q + r) && p == 1) && -1 * r + A == B * 4) && p >= 1) && (((!(r >= (A + -r) / 2) && (!(-1 * r + A < 0) || (A + r) % 2 == 0)) && ((((A + -r) / 2 < 0 && (A + -r) / 4 + 1 == d) && !((A + -r) / 2 % 2 == 0)) || (((A + -r) / 2 % 2 == 0 || !((A + -r) / 2 < 0)) && d == (A + -r) / 4))) || (((!(r >= (A + -r) / 2 + 1) && ((((A + -r) / 2 + 1 < 0 && !(((A + -r) / 2 + 1) % 2 == 0)) && ((A + -r) / 2 + 1) / 2 + 1 == d) || ((((A + -r) / 2 + 1) % 2 == 0 || !((A + -r) / 2 + 1 < 0)) && ((A + -r) / 2 + 1) / 2 == d))) && !((A + r) % 2 == 0)) && -1 * r + A < 0))) && ((!(p == 1) || r + -d + d * (p + q) == A) || !(r >= d))) && A >= 2 * (2 * B)) && B == 1) && (A == B * q + r || (A == B * q + r && 1 <= d))) && ((((((!(d % 2 == 0) && d < 0) || r + -d + -(2 * d / 4) + 2 * d / 4 * (p + q + 1) == A) || !(r + -d >= 2 * d / 4)) && (((!(d < 0) || !(r + -d >= 2 * d / 4 + 1)) || -1 + -(2 * d / 4) + (r + -d) + (2 * d / 4 + 1) * (p + q + 1) == A) || d % 2 == 0)) || (((!(1 == 2 * p / 4 + 1) || p % 2 == 0) || !(p < 0)) && (!(2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))))) || r >= 2 * d))) || (((((((d == (A + -r) / 2 && (!(-1 * r + A < 0) || (A + r) % 2 == 0)) || ((d == (A + -r) / 2 + 1 && !((A + r) % 2 == 0)) && -1 * r + A < 0)) && p == 1) && -1 * (2 * 1) + q == 0) && B == 1) && (A == B * q + r || (A == B * q + r && 1 <= d))) && -1 * r + A == 2 * B)) || ((((((((((((d + r == A && A == B * q + r) && (!(p == 1) || d * q + r == A)) && d == 2 * B) && 2 == p) && 2 <= d) && A == r + -d + B * (p + q)) && -1 * p + q == 0) && B == 1) && (!(p == 1) || B == d)) && 2 == d) && !(d + r >= 2 * (2 * 1))) && p == 2 * 1)) || (((((((((p % 2 == 0 || !(p < 0)) || ((((!(d < 0) || ((((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 2 + 1) / 2)) && (((p / 2 + 1) % 2 == 0 || B * ((p / 2 + 1) / 2 + 1 + q) + (-1 + -((d / 2 + 1) / 2) + r) == A) || !(p / 2 + 1 < 0))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + -((d / 2 + 1) / 2) + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == B * ((p / 2 + 1) / 2 + 1 + q) + (r + -((d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q)) || !(p / 2 + 1 < 0)))) && (((((A == -1 + -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -1 + -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A)) || d / 2 % 2 == 0) || !(d / 2 < 0)))) || (!(d % 2 == 0) && d < 0)))) && A == B * q + r) && (((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || r + B * 1 * q == A) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4)))) || (!(d % 2 == 0) && d < 0))))) && p >= 1) && ((!(p == 1) || !(B * p == d)) || d * q + r == A)) && ((p < 0 && !(p % 2 == 0)) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || ((B * (p / 4 + q) + (r + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == r + -((d / 2 + 1) / 2) + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (A == B * (p / 4 + q) + (-1 + -((d / 2 + 1) / 2) + r) || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || (((!(p / 2 < 0) || A == -1 + -(d / 4) + r + B * (q + (p / 4 + 1))) || p / 2 % 2 == 0) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == -1 + -(d / 4) + r + B * (p / 4 + q)))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((-(d / 4) + r + B * (q + (p / 4 + 1)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-(d / 4) + r + B * (p / 4 + q) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))))))) || (!(d % 2 == 0) && d < 0))))) && B * p == d) && B == 1)) || (((((((((((((((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || ((((!(d < 0) || r + -d >= d / 2 + 1) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0) && (((((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4))) || (!(d % 2 == 0) && d < 0)) || r + -d >= d / 2))) || A == B * 1 * (p + q) + (r + -d)) && (((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0))) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && p >= 1) && (((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || !(B * 1 == d / 2 + 1)) || d % 2 == 0) && (!(d / 2 == B * 1) || (!(d % 2 == 0) && d < 0)))) || p == 1) || r + B * 1 * q == A)) && ((!(p == 1) || !(B * p == d)) || d * q + r == A)) && (((((A == B * 1 * (q + 2 * p) + (-(2 * d) + r) || -(2 * d) + r >= d) || p == 1) || !(r >= 2 * d)) || ((!(p * 4 / 8 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p * 4 / 8 + 1 == 1)))) || ((!(B * 1 == d * 4 / 8) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || !(d * 4 / 8 + 1 == B * 1)) || d % 2 == 0)))) && B * p == d) && ((!(p == 1) || r + -d + d * (p + q) == A) || !(r >= d))) && B == 1) && (A == B * q + r || (A == B * q + r && 1 <= d))) && ((((((!(d % 2 == 0) && d < 0) || r + -d + -(2 * d / 4) + 2 * d / 4 * (p + q + 1) == A) || !(r + -d >= 2 * d / 4)) && (((!(d < 0) || !(r + -d >= 2 * d / 4 + 1)) || -1 + -(2 * d / 4) + (r + -d) + (2 * d / 4 + 1) * (p + q + 1) == A) || d % 2 == 0)) || (((!(1 == 2 * p / 4 + 1) || p % 2 == 0) || !(p < 0)) && (!(2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))))) || r >= 2 * d))) || (((((((((((((((((((4 + 0 == q && A == B * q + r) && ((d == (A + -r) / 2 && (!(-1 * r + A < 0) || (A + r) % 2 == 0)) || ((d == (A + -r) / 2 + 1 && !((A + r) % 2 == 0)) && -1 * r + A < 0))) && -1 * r + A == B * 4) && d == 2 * B) && r + B * 4 == A) && 2 == p) && 2 <= p) && r + B * 4 >= 2 * (2 * B)) && !(r >= d)) && B * p == d) && q == 4) && ((q / 2 == p && (q % 2 == 0 || !(q < 0))) || ((!(q % 2 == 0) && q < 0) && q / 2 + 1 == p))) && A == r + -d + B * (p + q)) && ((!(p == 1) || r + -d + d * (p + q) == A) || !(r >= d))) && A >= 2 * (2 * B)) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && B == 1) && (A == B * q + r || (A == B * q + r && 1 <= d))) && ((((((!(d % 2 == 0) && d < 0) || r + -d + -(2 * d / 4) + 2 * d / 4 * (p + q + 1) == A) || !(r + -d >= 2 * d / 4)) && (((!(d < 0) || !(r + -d >= 2 * d / 4 + 1)) || -1 + -(2 * d / 4) + (r + -d) + (2 * d / 4 + 1) * (p + q + 1) == A) || d % 2 == 0)) || (((!(1 == 2 * p / 4 + 1) || p % 2 == 0) || !(p < 0)) && (!(2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))))) || r >= 2 * d))) || ((((A == B * q + r && B * p == d) && (((((((((((((((((((((((((((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || ((((!(d < 0) || r + -d >= d / 2 + 1) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0) && (((((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4))) || (!(d % 2 == 0) && d < 0)) || r + -d >= d / 2))) || A == B * 1 * (p + q) + (r + -d)) && ((p % 2 == 0 || !(p < 0)) || ((((!(d < 0) || ((((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 2 + 1) / 2)) && (((p / 2 + 1) % 2 == 0 || B * ((p / 2 + 1) / 2 + 1 + q) + (-1 + -((d / 2 + 1) / 2) + r) == A) || !(p / 2 + 1 < 0))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + -((d / 2 + 1) / 2) + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == B * ((p / 2 + 1) / 2 + 1 + q) + (r + -((d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q)) || !(p / 2 + 1 < 0)))) && (((((A == -1 + -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -1 + -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A)) || d / 2 % 2 == 0) || !(d / 2 < 0)))) || (!(d % 2 == 0) && d < 0))))) && (((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0))) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && ((p % 2 == 0 || !(p < 0)) || (((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || ((((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((((((p / 2 + 1) / 2 % 2 == 0 || -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A)) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0))) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((d / 4 % 2 == 0 || !(d / 4 < 0)) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A))) && ((!(d / 4 % 2 == 0) && d / 4 < 0) || ((((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || r + -(d / 2) + -(d / 8) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) && (r + -(d / 2) + -(d / 8) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)))))) || r + -(d / 2) >= d / 4))) && ((((((d / 2 % 2 == 0 || (((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + -(d / 2) + -((d / 4 + 1) / 2)) == A) || !((p / 2 + 1) / 2 + 1 < 0)))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || ((-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)))) || !((p / 2 + 1) / 2 + 1 < 0)))))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || r + -(d / 2) >= d / 4) || (((d / 4 % 2 == 0 || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-1 + -(d / 8) + (r + -(d / 2))) == A))) || !(d / 4 < 0)) && (((A == r + -(d / 2) + -(d / 8) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + -(d / 2) + -(d / 8) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A)) || (!(d / 4 % 2 == 0) && d / 4 < 0))))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((((((((((((p / 2 + 1) / 2 % 2 == 0 || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B)) || !((d / 2 + 1) / 2 + 1 < 0)) || ((d / 2 + 1) / 2 + 1) % 2 == 0) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || ((((p / 2 + 1) / 2 % 2 == 0 || A == r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (((!((d / 2 + 1) / 2 < 0) || (((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A || (p / 2 + 1) / 2 % 2 == 0) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B))) || (d / 2 + 1) / 2 % 2 == 0) && (((((p / 2 + 1) / 2 % 2 == 0 || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))))) || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))) && (((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || ((((((!((d / 2 + 1) / 2 < 0) || (((A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)))) || (d / 2 + 1) / 2 % 2 == 0) && ((((B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))))) || d % 2 == 0)))) && (((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || r + B * 1 * q == A) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4)))) || (!(d % 2 == 0) && d < 0))))) && 8 <= p) && (((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || !(B * 1 == d / 2 + 1)) || d % 2 == 0) && (!(d / 2 == B * 1) || (!(d % 2 == 0) && d < 0)))) || p == 1) || r + B * 1 * q == A)) && ((-(2 * d * 2) + r >= 2 * d || -(2 * d * 2) + r + -d + (p + (q + 2 * (2 * p))) * B == A) || !(r >= 2 * d * 2))) && (((((A == B * 1 * (q + 2 * p) + (-(2 * d) + r) || -(2 * d) + r >= d) || p == 1) || !(r >= 2 * d)) || ((!(p * 4 / 8 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p * 4 / 8 + 1 == 1)))) || ((!(B * 1 == d * 4 / 8) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || !(d * 4 / 8 + 1 == B * 1)) || d % 2 == 0)))) && ((p < 0 && !(p % 2 == 0)) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || ((B * (p / 4 + q) + (r + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == r + -((d / 2 + 1) / 2) + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (A == B * (p / 4 + q) + (-1 + -((d / 2 + 1) / 2) + r) || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || (((!(p / 2 < 0) || A == -1 + -(d / 4) + r + B * (q + (p / 4 + 1))) || p / 2 % 2 == 0) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == -1 + -(d / 4) + r + B * (p / 4 + q)))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((-(d / 4) + r + B * (q + (p / 4 + 1)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-(d / 4) + r + B * (p / 4 + q) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))))))) || (!(d % 2 == 0) && d < 0))))) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && ((-(2 * d) + r >= d || (((((p % 2 == 0 || -(d * 4 / 8) + (-(2 * d) + r) + B * (q + 2 * p + (p * 4 / 8 + 1)) == A) || !(p < 0)) && (-(d * 4 / 8) + (-(2 * d) + r) + (q + 2 * p + p * 4 / 8) * B == A || (p < 0 && !(p % 2 == 0)))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || d % 2 == 0) || (((p % 2 == 0 || !(p < 0)) || -1 + -(d * 4 / 8) + (-(2 * d) + r) + B * (q + 2 * p + (p * 4 / 8 + 1)) == A) && (-1 + -(d * 4 / 8) + (-(2 * d) + r) + (q + 2 * p + p * 4 / 8) * B == A || (p < 0 && !(p % 2 == 0))))))) || !(r >= 2 * d))) && ((((((p / 4 + 1 == 1 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || !(1 + (p / 4 + 1) / 2 == 1)) && (!(1 == (p / 4 + 1) / 2) || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 == 1 || (((p / 4 % 2 == 0 || !(p / 8 + 1 == 1)) || !(p / 4 < 0)) && (!(p / 8 == 1) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (((B * 1 * (q + p / 2) + (r + -(d / 2)) == A || (!(d % 2 == 0) && d < 0)) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((!(B * 1 == d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || !(d / 4 < 0)) || !(B * 1 == d / 8 + 1)))) || r + -(d / 2) >= d / 4) && (((d / 2 % 2 == 0 || ((!(B * 1 == (d / 4 + 1) / 2) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || !(B * 1 == (d / 4 + 1) / 2 + 1)))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1))) && (((!(d < 0) || (((((!(B * 1 == (d / 2 + 1) / 4) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2 + 1)) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) || r + (-1 + -(d / 2)) + B * 1 * (q + p / 2) == A) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && ((((!(d % 2 == 0) && d < 0) || ((((((((((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || ((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || (((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))))))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || r + -(d / 2) >= d / 4) || (((d / 4 % 2 == 0 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(d / 4 < 0)) && (((((p / 4 + 1) % 2 == 0 || r + -(d / 2) + -(d / 8) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + -(d / 2) + -(d / 8) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || (!(d / 4 % 2 == 0) && d / 4 < 0))))) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (((((d / 2 % 2 == 0 || (((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) || p / 4 % 2 == 0) || !(p / 4 < 0)))) && ((((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2))) && ((!(p / 4 % 2 == 0) && p / 4 < 0) || r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + p / 2 + p / 8) == A)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -(d / 8) + B * (p / 8 + 1 + (q + p / 2))) && (r + -(d / 2) + -(d / 8) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0))) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || ((-1 + -(d / 8) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((-1 + -(d / 8) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) == A || p / 4 % 2 == 0) || !(p / 4 < 0)))) || !(d / 4 < 0)))) || r + -(d / 2) >= d / 4)) || (p / 2 < 0 && !(p / 2 % 2 == 0))))) && ((!(d < 0) || (((((((((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || (((!(p / 4 % 2 == 0) && p / 4 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + p / 2 + p / 8) == A) && ((p / 4 % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2)) == A) || !(p / 4 < 0)))) && ((!((d / 2 + 1) / 2 + 1 < 0) || (((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((((!((d / 2 + 1) / 2 < 0) || ((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)))) || (d / 2 + 1) / 2 % 2 == 0) && (((A == B * (q + p / 2 + p / 8) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || B * (p / 8 + 1 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !(p / 4 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2)) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && (((((((((((r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || (!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0)) && ((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + p / 2 + (p / 4 + 1) / 2) * B)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((((((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) && ((B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && d * q + r == A) && B == 1) && (((((((((((((((((((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0))) && (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) || ((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0) || ((((((((((((((((((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0))) && (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) || ((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && d * q + r == A) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0))) && (((((!(d % 2 == 0) && d < 0) || ((((((!(p / 2 < 0) || p / 2 % 2 == 0) || (p + q + (p / 4 + 1)) * B + (r + -d + (-1 + -(d / 4))) == A) && (A == r + -d + (-1 + -(d / 4)) + (p / 4 + (p + q)) * B || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || d / 2 % 2 == 0) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 < 0 && !(p / 2 % 2 == 0)) || -(d / 4) + (r + -d) + (p / 4 + (p + q)) * B == A) && (((p + q + (p / 4 + 1)) * B + (-(d / 4) + (r + -d)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0))))) || r + -d >= d / 2) && (((!(d < 0) || ((((((-1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 4 + 1)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-1 + -((d / 2 + 1) / 2) + (r + -d) + (p / 4 + (p + q)) * B == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((((p / 4 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == (p + q + (p / 4 + 1)) * B + (r + -d + -((d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || r + -d >= d / 2 + 1) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && ((((((((p / 2 + 1) % 2 == 0 || (p / 2 + 1) / 2 + 1 == 1) || !(p / 2 + 1 < 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || !(((p / 2 + 1) / 2 + 1) / 2 == 1)) && ((!(((p / 2 + 1) / 2 + 1) / 2 + 1 == 1) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)))) && (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p / 2 + 1) / 2 == 1) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || !((p / 2 + 1) / 4 == 1)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || !((p / 2 + 1) / 4 + 1 == 1))))) || p % 2 == 0) || ((((!(d < 0) || (((((!(B * 1 == (d / 2 + 1) / 4) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2 + 1)) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) || A == r + (-1 + -(d / 2)) + (q + (p / 2 + 1)) * (B * 1)) || d % 2 == 0) && (((!(d % 2 == 0) && d < 0) || r + -(d / 2) + (q + (p / 2 + 1)) * (B * 1) == A) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((!(B * 1 == d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || !(d / 4 < 0)) || !(B * 1 == d / 8 + 1)))) || r + -(d / 2) >= d / 4) && (((d / 2 % 2 == 0 || ((!(B * 1 == (d / 4 + 1) / 2) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || !(B * 1 == (d / 4 + 1) / 2 + 1)))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1))))) || !(p < 0))) && ((p % 2 == 0 || ((((!(d % 2 == 0) && d < 0) || r + -d >= d / 2) || (((d / 2 % 2 == 0 || ((((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || A == r + -d + (-1 + -(d / 4)) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) && (A == r + -d + (-1 + -(d / 4)) + (p + q + (p / 2 + 1) / 2) * B || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || ((((p / 2 + 1) % 2 == 0 || A == -(d / 4) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p + q + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -d)) == A || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))))) && (((!(d < 0) || r + -d >= d / 2 + 1) || (((((((p / 2 + 1) % 2 == 0 || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 2 + 1) / 2) * B)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((((A == ((p / 2 + 1) / 2 + 1 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p + q + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2)) == A)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || d % 2 == 0))) || !(p < 0))) || (((((((((((((((((((((((((p % 2 == 0 || !(p < 0)) || ((((!(d < 0) || ((((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 2 + 1) / 2)) && (((p / 2 + 1) % 2 == 0 || B * ((p / 2 + 1) / 2 + 1 + q) + (-1 + -((d / 2 + 1) / 2) + r) == A) || !(p / 2 + 1 < 0))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + -((d / 2 + 1) / 2) + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == B * ((p / 2 + 1) / 2 + 1 + q) + (r + -((d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q)) || !(p / 2 + 1 < 0)))) && (((((A == -1 + -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -1 + -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A)) || d / 2 % 2 == 0) || !(d / 2 < 0)))) || (!(d % 2 == 0) && d < 0)))) && (((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0))) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && ((p % 2 == 0 || !(p < 0)) || (((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || ((((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((((((p / 2 + 1) / 2 % 2 == 0 || -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A)) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0))) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((d / 4 % 2 == 0 || !(d / 4 < 0)) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A))) && ((!(d / 4 % 2 == 0) && d / 4 < 0) || ((((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || r + -(d / 2) + -(d / 8) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) && (r + -(d / 2) + -(d / 8) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)))))) || r + -(d / 2) >= d / 4))) && ((((((d / 2 % 2 == 0 || (((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + -(d / 2) + -((d / 4 + 1) / 2)) == A) || !((p / 2 + 1) / 2 + 1 < 0)))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || ((-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)))) || !((p / 2 + 1) / 2 + 1 < 0)))))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || r + -(d / 2) >= d / 4) || (((d / 4 % 2 == 0 || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-1 + -(d / 8) + (r + -(d / 2))) == A))) || !(d / 4 < 0)) && (((A == r + -(d / 2) + -(d / 8) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + -(d / 2) + -(d / 8) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A)) || (!(d / 4 % 2 == 0) && d / 4 < 0))))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((((((((((((p / 2 + 1) / 2 % 2 == 0 || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B)) || !((d / 2 + 1) / 2 + 1 < 0)) || ((d / 2 + 1) / 2 + 1) % 2 == 0) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || ((((p / 2 + 1) / 2 % 2 == 0 || A == r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (((!((d / 2 + 1) / 2 < 0) || (((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A || (p / 2 + 1) / 2 % 2 == 0) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B))) || (d / 2 + 1) / 2 % 2 == 0) && (((((p / 2 + 1) / 2 % 2 == 0 || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))))) || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))) && (((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || ((((((!((d / 2 + 1) / 2 < 0) || (((A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)))) || (d / 2 + 1) / 2 % 2 == 0) && ((((B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))))) || d % 2 == 0)))) && (((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || r + B * 1 * q == A) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4)))) || (!(d % 2 == 0) && d < 0))))) && 8 <= p) && (((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || !(B * 1 == d / 2 + 1)) || d % 2 == 0) && (!(d / 2 == B * 1) || (!(d % 2 == 0) && d < 0)))) || p == 1) || r + B * 1 * q == A)) && (((((((!(d < 0) || r + -d >= 2 * d / 4 + 1) || ((((2 * d / 4 + 1) % 2 == 0 || !((2 * d / 4 + 1) / 2 + 1 == B * 1)) || !(2 * d / 4 + 1 < 0)) && ((2 * d / 4 + 1 < 0 && !((2 * d / 4 + 1) % 2 == 0)) || !(B * 1 == (2 * d / 4 + 1) / 2)))) || d % 2 == 0) && (((((2 * d / 4 % 2 == 0 || !(2 * d / 8 + 1 == B * 1)) || !(2 * d / 4 < 0)) && ((!(2 * d / 4 % 2 == 0) && 2 * d / 4 < 0) || !(B * 1 == 2 * d / 8))) || (!(d % 2 == 0) && d < 0)) || r + -d >= 2 * d / 4)) || !(r >= d)) || ((((((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || !(2 * p / 8 + 1 == 1)) && (!(2 * p / 8 == 1) || (!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0))) || 2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))) && (((p % 2 == 0 || !(p < 0)) || (((!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0) || !((2 * p / 4 + 1) / 2 == 1)) && (((2 * p / 4 + 1) % 2 == 0 || !(2 * p / 4 + 1 < 0)) || !((2 * p / 4 + 1) / 2 + 1 == 1)))) || 1 == 2 * p / 4 + 1))) || A == B * 1 * (p + q) + (r + -d))) && ((-(2 * d * 2) + r >= 2 * d || -(2 * d * 2) + r + -d + (p + (q + 2 * (2 * p))) * B == A) || !(r >= 2 * d * 2))) && (((((A == B * 1 * (q + 2 * p) + (-(2 * d) + r) || -(2 * d) + r >= d) || p == 1) || !(r >= 2 * d)) || ((!(p * 4 / 8 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p * 4 / 8 + 1 == 1)))) || ((!(B * 1 == d * 4 / 8) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || !(d * 4 / 8 + 1 == B * 1)) || d % 2 == 0)))) && ((p < 0 && !(p % 2 == 0)) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || ((B * (p / 4 + q) + (r + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == r + -((d / 2 + 1) / 2) + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (A == B * (p / 4 + q) + (-1 + -((d / 2 + 1) / 2) + r) || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || (((!(p / 2 < 0) || A == -1 + -(d / 4) + r + B * (q + (p / 4 + 1))) || p / 2 % 2 == 0) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == -1 + -(d / 4) + r + B * (p / 4 + q)))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((-(d / 4) + r + B * (q + (p / 4 + 1)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-(d / 4) + r + B * (p / 4 + q) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))))))) || (!(d % 2 == 0) && d < 0))))) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && ((-(2 * d) + r >= d || (((((p % 2 == 0 || -(d * 4 / 8) + (-(2 * d) + r) + B * (q + 2 * p + (p * 4 / 8 + 1)) == A) || !(p < 0)) && (-(d * 4 / 8) + (-(2 * d) + r) + (q + 2 * p + p * 4 / 8) * B == A || (p < 0 && !(p % 2 == 0)))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || d % 2 == 0) || (((p % 2 == 0 || !(p < 0)) || -1 + -(d * 4 / 8) + (-(2 * d) + r) + B * (q + 2 * p + (p * 4 / 8 + 1)) == A) && (-1 + -(d * 4 / 8) + (-(2 * d) + r) + (q + 2 * p + p * 4 / 8) * B == A || (p < 0 && !(p % 2 == 0))))))) || !(r >= 2 * d))) && ((((((p / 4 + 1 == 1 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || !(1 + (p / 4 + 1) / 2 == 1)) && (!(1 == (p / 4 + 1) / 2) || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 == 1 || (((p / 4 % 2 == 0 || !(p / 8 + 1 == 1)) || !(p / 4 < 0)) && (!(p / 8 == 1) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (((B * 1 * (q + p / 2) + (r + -(d / 2)) == A || (!(d % 2 == 0) && d < 0)) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((!(B * 1 == d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || !(d / 4 < 0)) || !(B * 1 == d / 8 + 1)))) || r + -(d / 2) >= d / 4) && (((d / 2 % 2 == 0 || ((!(B * 1 == (d / 4 + 1) / 2) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || !(B * 1 == (d / 4 + 1) / 2 + 1)))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1))) && (((!(d < 0) || (((((!(B * 1 == (d / 2 + 1) / 4) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2 + 1)) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) || r + (-1 + -(d / 2)) + B * 1 * (q + p / 2) == A) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && ((((!(d % 2 == 0) && d < 0) || ((((((((((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || ((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || (((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))))))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || r + -(d / 2) >= d / 4) || (((d / 4 % 2 == 0 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(d / 4 < 0)) && (((((p / 4 + 1) % 2 == 0 || r + -(d / 2) + -(d / 8) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + -(d / 2) + -(d / 8) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || (!(d / 4 % 2 == 0) && d / 4 < 0))))) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (((((d / 2 % 2 == 0 || (((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) || p / 4 % 2 == 0) || !(p / 4 < 0)))) && ((((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2))) && ((!(p / 4 % 2 == 0) && p / 4 < 0) || r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + p / 2 + p / 8) == A)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -(d / 8) + B * (p / 8 + 1 + (q + p / 2))) && (r + -(d / 2) + -(d / 8) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0))) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || ((-1 + -(d / 8) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((-1 + -(d / 8) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) == A || p / 4 % 2 == 0) || !(p / 4 < 0)))) || !(d / 4 < 0)))) || r + -(d / 2) >= d / 4)) || (p / 2 < 0 && !(p / 2 % 2 == 0))))) && ((!(d < 0) || (((((((((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || (((!(p / 4 % 2 == 0) && p / 4 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + p / 2 + p / 8) == A) && ((p / 4 % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2)) == A) || !(p / 4 < 0)))) && ((!((d / 2 + 1) / 2 + 1 < 0) || (((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((((!((d / 2 + 1) / 2 < 0) || ((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)))) || (d / 2 + 1) / 2 % 2 == 0) && (((A == B * (q + p / 2 + p / 8) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || B * (p / 8 + 1 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !(p / 4 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2)) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && (((((((((((r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || (!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0)) && ((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + p / 2 + (p / 4 + 1) / 2) * B)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((((((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) && ((B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && B == 1) && (((((((((((((((((((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0))) && (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) || ((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0) || ((((((((((((((((((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0))) && (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) || ((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && d * q + r == A) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0))) && (((((!(d % 2 == 0) && d < 0) || ((((((!(p / 2 < 0) || p / 2 % 2 == 0) || (p + q + (p / 4 + 1)) * B + (r + -d + (-1 + -(d / 4))) == A) && (A == r + -d + (-1 + -(d / 4)) + (p / 4 + (p + q)) * B || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || d / 2 % 2 == 0) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 < 0 && !(p / 2 % 2 == 0)) || -(d / 4) + (r + -d) + (p / 4 + (p + q)) * B == A) && (((p + q + (p / 4 + 1)) * B + (-(d / 4) + (r + -d)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0))))) || r + -d >= d / 2) && (((!(d < 0) || ((((((-1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 4 + 1)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-1 + -((d / 2 + 1) / 2) + (r + -d) + (p / 4 + (p + q)) * B == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((((p / 4 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == (p + q + (p / 4 + 1)) * B + (r + -d + -((d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || r + -d >= d / 2 + 1) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && ((((((((p / 2 + 1) % 2 == 0 || (p / 2 + 1) / 2 + 1 == 1) || !(p / 2 + 1 < 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || !(((p / 2 + 1) / 2 + 1) / 2 == 1)) && ((!(((p / 2 + 1) / 2 + 1) / 2 + 1 == 1) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)))) && (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p / 2 + 1) / 2 == 1) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || !((p / 2 + 1) / 4 == 1)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || !((p / 2 + 1) / 4 + 1 == 1))))) || p % 2 == 0) || ((((!(d < 0) || (((((!(B * 1 == (d / 2 + 1) / 4) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2 + 1)) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) || A == r + (-1 + -(d / 2)) + (q + (p / 2 + 1)) * (B * 1)) || d % 2 == 0) && (((!(d % 2 == 0) && d < 0) || r + -(d / 2) + (q + (p / 2 + 1)) * (B * 1) == A) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((!(B * 1 == d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || !(d / 4 < 0)) || !(B * 1 == d / 8 + 1)))) || r + -(d / 2) >= d / 4) && (((d / 2 % 2 == 0 || ((!(B * 1 == (d / 4 + 1) / 2) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || !(B * 1 == (d / 4 + 1) / 2 + 1)))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1))))) || !(p < 0))) && ((p % 2 == 0 || ((((!(d % 2 == 0) && d < 0) || r + -d >= d / 2) || (((d / 2 % 2 == 0 || ((((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || A == r + -d + (-1 + -(d / 4)) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) && (A == r + -d + (-1 + -(d / 4)) + (p + q + (p / 2 + 1) / 2) * B || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || ((((p / 2 + 1) % 2 == 0 || A == -(d / 4) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p + q + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -d)) == A || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))))) && (((!(d < 0) || r + -d >= d / 2 + 1) || (((((((p / 2 + 1) % 2 == 0 || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 2 + 1) / 2) * B)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((((A == ((p / 2 + 1) / 2 + 1 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p + q + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2)) == A)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || d % 2 == 0))) || !(p < 0))))) && A == r) && B == 1)) || (((((((((((((((((p % 2 == 0 || !(p < 0)) || ((((!(d < 0) || ((((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 2 + 1) / 2)) && (((p / 2 + 1) % 2 == 0 || B * ((p / 2 + 1) / 2 + 1 + q) + (-1 + -((d / 2 + 1) / 2) + r) == A) || !(p / 2 + 1 < 0))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + -((d / 2 + 1) / 2) + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == B * ((p / 2 + 1) / 2 + 1 + q) + (r + -((d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q)) || !(p / 2 + 1 < 0)))) && (((((A == -1 + -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -1 + -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A)) || d / 2 % 2 == 0) || !(d / 2 < 0)))) || (!(d % 2 == 0) && d < 0)))) && 4 <= p) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && (!(p == 1) || d * q + r == A)) && (((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || r + B * 1 * q == A) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4)))) || (!(d % 2 == 0) && d < 0))))) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && ((!(p == 1) || !(B * p == d)) || d * q + r == A)) && 2 <= d) && ((p < 0 && !(p % 2 == 0)) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || ((B * (p / 4 + q) + (r + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == r + -((d / 2 + 1) / 2) + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (A == B * (p / 4 + q) + (-1 + -((d / 2 + 1) / 2) + r) || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || (((!(p / 2 < 0) || A == -1 + -(d / 4) + r + B * (q + (p / 4 + 1))) || p / 2 % 2 == 0) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == -1 + -(d / 4) + r + B * (p / 4 + q)))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((-(d / 4) + r + B * (q + (p / 4 + 1)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-(d / 4) + r + B * (p / 4 + q) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))))))) || (!(d % 2 == 0) && d < 0))))) && B * p == d) && A == r + -d + B * (p + q)) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && B == 1) && (!(p == 1) || B == d)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((((((((A == B * q + r && d == 2 * B) && d == 2 * 1) && 2 <= p) && 2 <= d) && q == 0) && B * p == d) && A == r) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) && p == 2 * 1) || ((((((((((((((4 <= p && ((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && r >= d / 2) && 2 * (2 * B) == d) && 2 <= d / 2) && p == 2 * (2 * 1)) && q == 0) && d == 2 * (2 * 1)) && B * p == d) && A == r) && B == 1) && (!(p == 1) || B == d)) && d % 2 == 0)) || ((((A == B * q + r && B * p == d) && A == r) && ((((((((((((((((((((((((((p % 2 == 0 || !(p < 0)) || ((((!(d < 0) || ((((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 2 + 1) / 2)) && (((p / 2 + 1) % 2 == 0 || B * ((p / 2 + 1) / 2 + 1 + q) + (-1 + -((d / 2 + 1) / 2) + r) == A) || !(p / 2 + 1 < 0))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + -((d / 2 + 1) / 2) + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == B * ((p / 2 + 1) / 2 + 1 + q) + (r + -((d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q)) || !(p / 2 + 1 < 0)))) && (((((A == -1 + -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -1 + -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A)) || d / 2 % 2 == 0) || !(d / 2 < 0)))) || (!(d % 2 == 0) && d < 0)))) && (((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0))) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && ((p % 2 == 0 || !(p < 0)) || (((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || ((((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((((((p / 2 + 1) / 2 % 2 == 0 || -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A)) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0))) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((d / 4 % 2 == 0 || !(d / 4 < 0)) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A))) && ((!(d / 4 % 2 == 0) && d / 4 < 0) || ((((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || r + -(d / 2) + -(d / 8) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) && (r + -(d / 2) + -(d / 8) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)))))) || r + -(d / 2) >= d / 4))) && ((((((d / 2 % 2 == 0 || (((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + -(d / 2) + -((d / 4 + 1) / 2)) == A) || !((p / 2 + 1) / 2 + 1 < 0)))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || ((-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)))) || !((p / 2 + 1) / 2 + 1 < 0)))))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || r + -(d / 2) >= d / 4) || (((d / 4 % 2 == 0 || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-1 + -(d / 8) + (r + -(d / 2))) == A))) || !(d / 4 < 0)) && (((A == r + -(d / 2) + -(d / 8) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + -(d / 2) + -(d / 8) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A)) || (!(d / 4 % 2 == 0) && d / 4 < 0))))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((((((((((((p / 2 + 1) / 2 % 2 == 0 || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B)) || !((d / 2 + 1) / 2 + 1 < 0)) || ((d / 2 + 1) / 2 + 1) % 2 == 0) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || ((((p / 2 + 1) / 2 % 2 == 0 || A == r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (((!((d / 2 + 1) / 2 < 0) || (((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A || (p / 2 + 1) / 2 % 2 == 0) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B))) || (d / 2 + 1) / 2 % 2 == 0) && (((((p / 2 + 1) / 2 % 2 == 0 || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))))) || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))) && (((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || ((((((!((d / 2 + 1) / 2 < 0) || (((A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)))) || (d / 2 + 1) / 2 % 2 == 0) && ((((B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))))) || d % 2 == 0)))) && (((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || r + B * 1 * q == A) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4)))) || (!(d % 2 == 0) && d < 0))))) && 8 <= p) && (((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || !(B * 1 == d / 2 + 1)) || d % 2 == 0) && (!(d / 2 == B * 1) || (!(d % 2 == 0) && d < 0)))) || p == 1) || r + B * 1 * q == A)) && (((((((!(d < 0) || r + -d >= 2 * d / 4 + 1) || ((((2 * d / 4 + 1) % 2 == 0 || !((2 * d / 4 + 1) / 2 + 1 == B * 1)) || !(2 * d / 4 + 1 < 0)) && ((2 * d / 4 + 1 < 0 && !((2 * d / 4 + 1) % 2 == 0)) || !(B * 1 == (2 * d / 4 + 1) / 2)))) || d % 2 == 0) && (((((2 * d / 4 % 2 == 0 || !(2 * d / 8 + 1 == B * 1)) || !(2 * d / 4 < 0)) && ((!(2 * d / 4 % 2 == 0) && 2 * d / 4 < 0) || !(B * 1 == 2 * d / 8))) || (!(d % 2 == 0) && d < 0)) || r + -d >= 2 * d / 4)) || !(r >= d)) || ((((((2 * p / 4 % 2 == 0 || !(2 * p / 4 < 0)) || !(2 * p / 8 + 1 == 1)) && (!(2 * p / 8 == 1) || (!(2 * p / 4 % 2 == 0) && 2 * p / 4 < 0))) || 2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))) && (((p % 2 == 0 || !(p < 0)) || (((!((2 * p / 4 + 1) % 2 == 0) && 2 * p / 4 + 1 < 0) || !((2 * p / 4 + 1) / 2 == 1)) && (((2 * p / 4 + 1) % 2 == 0 || !(2 * p / 4 + 1 < 0)) || !((2 * p / 4 + 1) / 2 + 1 == 1)))) || 1 == 2 * p / 4 + 1))) || A == B * 1 * (p + q) + (r + -d))) && ((-(2 * d * 2) + r >= 2 * d || -(2 * d * 2) + r + -d + (p + (q + 2 * (2 * p))) * B == A) || !(r >= 2 * d * 2))) && (((((A == B * 1 * (q + 2 * p) + (-(2 * d) + r) || -(2 * d) + r >= d) || p == 1) || !(r >= 2 * d)) || ((!(p * 4 / 8 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p * 4 / 8 + 1 == 1)))) || ((!(B * 1 == d * 4 / 8) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || !(d * 4 / 8 + 1 == B * 1)) || d % 2 == 0)))) && ((p < 0 && !(p % 2 == 0)) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || ((B * (p / 4 + q) + (r + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == r + -((d / 2 + 1) / 2) + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (A == B * (p / 4 + q) + (-1 + -((d / 2 + 1) / 2) + r) || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || (((!(p / 2 < 0) || A == -1 + -(d / 4) + r + B * (q + (p / 4 + 1))) || p / 2 % 2 == 0) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == -1 + -(d / 4) + r + B * (p / 4 + q)))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((-(d / 4) + r + B * (q + (p / 4 + 1)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-(d / 4) + r + B * (p / 4 + q) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))))))) || (!(d % 2 == 0) && d < 0))))) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && ((-(2 * d) + r >= d || (((((p % 2 == 0 || -(d * 4 / 8) + (-(2 * d) + r) + B * (q + 2 * p + (p * 4 / 8 + 1)) == A) || !(p < 0)) && (-(d * 4 / 8) + (-(2 * d) + r) + (q + 2 * p + p * 4 / 8) * B == A || (p < 0 && !(p % 2 == 0)))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || d % 2 == 0) || (((p % 2 == 0 || !(p < 0)) || -1 + -(d * 4 / 8) + (-(2 * d) + r) + B * (q + 2 * p + (p * 4 / 8 + 1)) == A) && (-1 + -(d * 4 / 8) + (-(2 * d) + r) + (q + 2 * p + p * 4 / 8) * B == A || (p < 0 && !(p % 2 == 0))))))) || !(r >= 2 * d))) && (((((((((((((((((((r >= d || (((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0))))) && ((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0) || (((((((((((((((((((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0)) || (((((((((((((((((((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && d * q + r == A) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0))) && ((((((p / 4 + 1 == 1 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || !(1 + (p / 4 + 1) / 2 == 1)) && (!(1 == (p / 4 + 1) / 2) || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 == 1 || (((p / 4 % 2 == 0 || !(p / 8 + 1 == 1)) || !(p / 4 < 0)) && (!(p / 8 == 1) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (((B * 1 * (q + p / 2) + (r + -(d / 2)) == A || (!(d % 2 == 0) && d < 0)) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((!(B * 1 == d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || !(d / 4 < 0)) || !(B * 1 == d / 8 + 1)))) || r + -(d / 2) >= d / 4) && (((d / 2 % 2 == 0 || ((!(B * 1 == (d / 4 + 1) / 2) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || !(B * 1 == (d / 4 + 1) / 2 + 1)))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1))) && (((!(d < 0) || (((((!(B * 1 == (d / 2 + 1) / 4) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2 + 1)) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) || r + (-1 + -(d / 2)) + B * 1 * (q + p / 2) == A) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && ((((!(d % 2 == 0) && d < 0) || ((((((((((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || ((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || (((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))))))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || r + -(d / 2) >= d / 4) || (((d / 4 % 2 == 0 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(d / 4 < 0)) && (((((p / 4 + 1) % 2 == 0 || r + -(d / 2) + -(d / 8) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + -(d / 2) + -(d / 8) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || (!(d / 4 % 2 == 0) && d / 4 < 0))))) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (((((d / 2 % 2 == 0 || (((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) || p / 4 % 2 == 0) || !(p / 4 < 0)))) && ((((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2))) && ((!(p / 4 % 2 == 0) && p / 4 < 0) || r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + p / 2 + p / 8) == A)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -(d / 8) + B * (p / 8 + 1 + (q + p / 2))) && (r + -(d / 2) + -(d / 8) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0))) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || ((-1 + -(d / 8) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((-1 + -(d / 8) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) == A || p / 4 % 2 == 0) || !(p / 4 < 0)))) || !(d / 4 < 0)))) || r + -(d / 2) >= d / 4)) || (p / 2 < 0 && !(p / 2 % 2 == 0))))) && ((!(d < 0) || (((((((((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || (((!(p / 4 % 2 == 0) && p / 4 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + p / 2 + p / 8) == A) && ((p / 4 % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2)) == A) || !(p / 4 < 0)))) && ((!((d / 2 + 1) / 2 + 1 < 0) || (((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((((!((d / 2 + 1) / 2 < 0) || ((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)))) || (d / 2 + 1) / 2 % 2 == 0) && (((A == B * (q + p / 2 + p / 8) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || B * (p / 8 + 1 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !(p / 4 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2)) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && (((((((((((r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || (!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0)) && ((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + p / 2 + (p / 4 + 1) / 2) * B)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((((((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) && ((B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && B == 1) && (((((!(d % 2 == 0) && d < 0) || ((((((!(p / 2 < 0) || p / 2 % 2 == 0) || (p + q + (p / 4 + 1)) * B + (r + -d + (-1 + -(d / 4))) == A) && (A == r + -d + (-1 + -(d / 4)) + (p / 4 + (p + q)) * B || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || d / 2 % 2 == 0) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 < 0 && !(p / 2 % 2 == 0)) || -(d / 4) + (r + -d) + (p / 4 + (p + q)) * B == A) && (((p + q + (p / 4 + 1)) * B + (-(d / 4) + (r + -d)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0))))) || r + -d >= d / 2) && (((!(d < 0) || ((((((-1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 4 + 1)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-1 + -((d / 2 + 1) / 2) + (r + -d) + (p / 4 + (p + q)) * B == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((((p / 4 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == (p + q + (p / 4 + 1)) * B + (r + -d + -((d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || r + -d >= d / 2 + 1) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && ((((((((p / 2 + 1) % 2 == 0 || (p / 2 + 1) / 2 + 1 == 1) || !(p / 2 + 1 < 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || !(((p / 2 + 1) / 2 + 1) / 2 == 1)) && ((!(((p / 2 + 1) / 2 + 1) / 2 + 1 == 1) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)))) && (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p / 2 + 1) / 2 == 1) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || !((p / 2 + 1) / 4 == 1)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || !((p / 2 + 1) / 4 + 1 == 1))))) || p % 2 == 0) || ((((!(d < 0) || (((((!(B * 1 == (d / 2 + 1) / 4) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2 + 1)) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) || A == r + (-1 + -(d / 2)) + (q + (p / 2 + 1)) * (B * 1)) || d % 2 == 0) && (((!(d % 2 == 0) && d < 0) || r + -(d / 2) + (q + (p / 2 + 1)) * (B * 1) == A) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((!(B * 1 == d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || !(d / 4 < 0)) || !(B * 1 == d / 8 + 1)))) || r + -(d / 2) >= d / 4) && (((d / 2 % 2 == 0 || ((!(B * 1 == (d / 4 + 1) / 2) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || !(B * 1 == (d / 4 + 1) / 2 + 1)))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1))))) || !(p < 0))) && ((p % 2 == 0 || ((((!(d % 2 == 0) && d < 0) || r + -d >= d / 2) || (((d / 2 % 2 == 0 || ((((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || A == r + -d + (-1 + -(d / 4)) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) && (A == r + -d + (-1 + -(d / 4)) + (p + q + (p / 2 + 1) / 2) * B || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || ((((p / 2 + 1) % 2 == 0 || A == -(d / 4) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p + q + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -d)) == A || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))))) && (((!(d < 0) || r + -d >= d / 2 + 1) || (((((((p / 2 + 1) % 2 == 0 || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 2 + 1) / 2) * B)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((((A == ((p / 2 + 1) / 2 + 1 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p + q + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2)) == A)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || d % 2 == 0))) || !(p < 0))) || ((((((((((((((((((((((((((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || ((((!(d < 0) || r + -d >= d / 2 + 1) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0) && (((((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4))) || (!(d % 2 == 0) && d < 0)) || r + -d >= d / 2))) || A == B * 1 * (p + q) + (r + -d)) && ((p % 2 == 0 || !(p < 0)) || ((((!(d < 0) || ((((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 2 + 1) / 2)) && (((p / 2 + 1) % 2 == 0 || B * ((p / 2 + 1) / 2 + 1 + q) + (-1 + -((d / 2 + 1) / 2) + r) == A) || !(p / 2 + 1 < 0))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + -((d / 2 + 1) / 2) + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == B * ((p / 2 + 1) / 2 + 1 + q) + (r + -((d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q)) || !(p / 2 + 1 < 0)))) && (((((A == -1 + -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -1 + -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A)) || d / 2 % 2 == 0) || !(d / 2 < 0)))) || (!(d % 2 == 0) && d < 0))))) && (((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0))) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && ((p % 2 == 0 || !(p < 0)) || (((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || ((((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((((((p / 2 + 1) / 2 % 2 == 0 || -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A)) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0))) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((d / 4 % 2 == 0 || !(d / 4 < 0)) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A))) && ((!(d / 4 % 2 == 0) && d / 4 < 0) || ((((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || r + -(d / 2) + -(d / 8) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) && (r + -(d / 2) + -(d / 8) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)))))) || r + -(d / 2) >= d / 4))) && ((((((d / 2 % 2 == 0 || (((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + -(d / 2) + -((d / 4 + 1) / 2)) == A) || !((p / 2 + 1) / 2 + 1 < 0)))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || ((-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)))) || !((p / 2 + 1) / 2 + 1 < 0)))))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || r + -(d / 2) >= d / 4) || (((d / 4 % 2 == 0 || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-1 + -(d / 8) + (r + -(d / 2))) == A))) || !(d / 4 < 0)) && (((A == r + -(d / 2) + -(d / 8) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + -(d / 2) + -(d / 8) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A)) || (!(d / 4 % 2 == 0) && d / 4 < 0))))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((((((((((((p / 2 + 1) / 2 % 2 == 0 || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B)) || !((d / 2 + 1) / 2 + 1 < 0)) || ((d / 2 + 1) / 2 + 1) % 2 == 0) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || ((((p / 2 + 1) / 2 % 2 == 0 || A == r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (((!((d / 2 + 1) / 2 < 0) || (((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A || (p / 2 + 1) / 2 % 2 == 0) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B))) || (d / 2 + 1) / 2 % 2 == 0) && (((((p / 2 + 1) / 2 % 2 == 0 || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))))) || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))) && (((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || ((((((!((d / 2 + 1) / 2 < 0) || (((A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)))) || (d / 2 + 1) / 2 % 2 == 0) && ((((B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))))) || d % 2 == 0)))) && (((((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p / 2 + 1 == 1) || p % 2 == 0) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || r + B * 1 * q == A) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || !(B * 1 == (d / 2 + 1) / 2)) && ((!(B * 1 == (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(B * 1 == d / 4 + 1)) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || !(B * 1 == d / 4)))) || (!(d % 2 == 0) && d < 0))))) && 8 <= p) && (((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || !(B * 1 == d / 2 + 1)) || d % 2 == 0) && (!(d / 2 == B * 1) || (!(d % 2 == 0) && d < 0)))) || p == 1) || r + B * 1 * q == A)) && ((-(2 * d * 2) + r >= 2 * d || -(2 * d * 2) + r + -d + (p + (q + 2 * (2 * p))) * B == A) || !(r >= 2 * d * 2))) && (((((A == B * 1 * (q + 2 * p) + (-(2 * d) + r) || -(2 * d) + r >= d) || p == 1) || !(r >= 2 * d)) || ((!(p * 4 / 8 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p * 4 / 8 + 1 == 1)))) || ((!(B * 1 == d * 4 / 8) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || !(d * 4 / 8 + 1 == B * 1)) || d % 2 == 0)))) && ((p < 0 && !(p % 2 == 0)) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || ((B * (p / 4 + q) + (r + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == r + -((d / 2 + 1) / 2) + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (A == B * (p / 4 + q) + (-1 + -((d / 2 + 1) / 2) + r) || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || (((!(p / 2 < 0) || A == -1 + -(d / 4) + r + B * (q + (p / 4 + 1))) || p / 2 % 2 == 0) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == -1 + -(d / 4) + r + B * (p / 4 + q)))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((-(d / 4) + r + B * (q + (p / 4 + 1)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-(d / 4) + r + B * (p / 4 + q) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))))))) || (!(d % 2 == 0) && d < 0))))) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && ((-(2 * d) + r >= d || (((((p % 2 == 0 || -(d * 4 / 8) + (-(2 * d) + r) + B * (q + 2 * p + (p * 4 / 8 + 1)) == A) || !(p < 0)) && (-(d * 4 / 8) + (-(2 * d) + r) + (q + 2 * p + p * 4 / 8) * B == A || (p < 0 && !(p % 2 == 0)))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || d % 2 == 0) || (((p % 2 == 0 || !(p < 0)) || -1 + -(d * 4 / 8) + (-(2 * d) + r) + B * (q + 2 * p + (p * 4 / 8 + 1)) == A) && (-1 + -(d * 4 / 8) + (-(2 * d) + r) + (q + 2 * p + p * 4 / 8) * B == A || (p < 0 && !(p % 2 == 0))))))) || !(r >= 2 * d))) && (((((((((((((((((((r >= d || (((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0))))) && ((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0) || (((((((((((((((((((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0)) || (((((((((((((((((((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && d * q + r == A) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0))) && ((((((p / 4 + 1 == 1 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || !(1 + (p / 4 + 1) / 2 == 1)) && (!(1 == (p / 4 + 1) / 2) || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 == 1 || (((p / 4 % 2 == 0 || !(p / 8 + 1 == 1)) || !(p / 4 < 0)) && (!(p / 8 == 1) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (((B * 1 * (q + p / 2) + (r + -(d / 2)) == A || (!(d % 2 == 0) && d < 0)) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((!(B * 1 == d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || !(d / 4 < 0)) || !(B * 1 == d / 8 + 1)))) || r + -(d / 2) >= d / 4) && (((d / 2 % 2 == 0 || ((!(B * 1 == (d / 4 + 1) / 2) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || !(B * 1 == (d / 4 + 1) / 2 + 1)))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1))) && (((!(d < 0) || (((((!(B * 1 == (d / 2 + 1) / 4) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2 + 1)) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) || r + (-1 + -(d / 2)) + B * 1 * (q + p / 2) == A) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && ((((!(d % 2 == 0) && d < 0) || ((((((((((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || ((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || (((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))))))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || r + -(d / 2) >= d / 4) || (((d / 4 % 2 == 0 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(d / 4 < 0)) && (((((p / 4 + 1) % 2 == 0 || r + -(d / 2) + -(d / 8) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + -(d / 2) + -(d / 8) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || (!(d / 4 % 2 == 0) && d / 4 < 0))))) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (((((d / 2 % 2 == 0 || (((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) || p / 4 % 2 == 0) || !(p / 4 < 0)))) && ((((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2))) && ((!(p / 4 % 2 == 0) && p / 4 < 0) || r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + p / 2 + p / 8) == A)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -(d / 8) + B * (p / 8 + 1 + (q + p / 2))) && (r + -(d / 2) + -(d / 8) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0))) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || ((-1 + -(d / 8) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((-1 + -(d / 8) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) == A || p / 4 % 2 == 0) || !(p / 4 < 0)))) || !(d / 4 < 0)))) || r + -(d / 2) >= d / 4)) || (p / 2 < 0 && !(p / 2 % 2 == 0))))) && ((!(d < 0) || (((((((((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || (((!(p / 4 % 2 == 0) && p / 4 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + p / 2 + p / 8) == A) && ((p / 4 % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2)) == A) || !(p / 4 < 0)))) && ((!((d / 2 + 1) / 2 + 1 < 0) || (((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((((!((d / 2 + 1) / 2 < 0) || ((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)))) || (d / 2 + 1) / 2 % 2 == 0) && (((A == B * (q + p / 2 + p / 8) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || B * (p / 8 + 1 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !(p / 4 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2)) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && (((((((((((r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || (!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0)) && ((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + p / 2 + (p / 4 + 1) / 2) * B)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((((((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) && ((B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && d * q + r == A) && B == 1) && (((((!(d % 2 == 0) && d < 0) || ((((((!(p / 2 < 0) || p / 2 % 2 == 0) || (p + q + (p / 4 + 1)) * B + (r + -d + (-1 + -(d / 4))) == A) && (A == r + -d + (-1 + -(d / 4)) + (p / 4 + (p + q)) * B || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || d / 2 % 2 == 0) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 < 0 && !(p / 2 % 2 == 0)) || -(d / 4) + (r + -d) + (p / 4 + (p + q)) * B == A) && (((p + q + (p / 4 + 1)) * B + (-(d / 4) + (r + -d)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0))))) || r + -d >= d / 2) && (((!(d < 0) || ((((((-1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 4 + 1)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-1 + -((d / 2 + 1) / 2) + (r + -d) + (p / 4 + (p + q)) * B == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((((p / 4 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == (p + q + (p / 4 + 1)) * B + (r + -d + -((d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || r + -d >= d / 2 + 1) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && ((((((((p / 2 + 1) % 2 == 0 || (p / 2 + 1) / 2 + 1 == 1) || !(p / 2 + 1 < 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || !(((p / 2 + 1) / 2 + 1) / 2 == 1)) && ((!(((p / 2 + 1) / 2 + 1) / 2 + 1 == 1) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)))) && (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p / 2 + 1) / 2 == 1) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || !((p / 2 + 1) / 4 == 1)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || !((p / 2 + 1) / 4 + 1 == 1))))) || p % 2 == 0) || ((((!(d < 0) || (((((!(B * 1 == (d / 2 + 1) / 4) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || !(B * 1 == (d / 2 + 1) / 4 + 1)) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2 + 1)) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || !(B * 1 == ((d / 2 + 1) / 2 + 1) / 2))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))) || A == r + (-1 + -(d / 2)) + (q + (p / 2 + 1)) * (B * 1)) || d % 2 == 0) && (((!(d % 2 == 0) && d < 0) || r + -(d / 2) + (q + (p / 2 + 1)) * (B * 1) == A) || ((((!(d / 2 % 2 == 0) && d / 2 < 0) || ((!(B * 1 == d / 8) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || !(d / 4 < 0)) || !(B * 1 == d / 8 + 1)))) || r + -(d / 2) >= d / 4) && (((d / 2 % 2 == 0 || ((!(B * 1 == (d / 4 + 1) / 2) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || !(B * 1 == (d / 4 + 1) / 2 + 1)))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1))))) || !(p < 0))) && ((p % 2 == 0 || ((((!(d % 2 == 0) && d < 0) || r + -d >= d / 2) || (((d / 2 % 2 == 0 || ((((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || A == r + -d + (-1 + -(d / 4)) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) && (A == r + -d + (-1 + -(d / 4)) + (p + q + (p / 2 + 1) / 2) * B || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || ((((p / 2 + 1) % 2 == 0 || A == -(d / 4) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p + q + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -d)) == A || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))))) && (((!(d < 0) || r + -d >= d / 2 + 1) || (((((((p / 2 + 1) % 2 == 0 || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 2 + 1) / 2) * B)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((((A == ((p / 2 + 1) / 2 + 1 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p + q + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2)) == A)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || d % 2 == 0))) || !(p < 0))))) && B == 1)) || ((((((((((d == 1 && A == B * q + r) && p == 1) && p >= 1) && B == d) && q == 0) && 1 <= d) && B * p == d) && A == r) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r))))) || (((((((((A == B * q + r && 8 <= p) && 2 * (2 * (2 * 1)) == p) && q == 0) && r >= 2 * (2 * B)) && B * p == d) && A == r) && (((((((((((((((((((r >= d || (((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0))))) && ((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0) || (((((((((((((((((((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0)) || (((((((((((((((((((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && d * q + r == A) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0))) && 2 * (2 * B) * 2 == d) && B == 1) RESULT: Ultimate proved your program to be correct! [2023-02-18 03:06:39,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE