./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e 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_valuebound50.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 63cd3e528fa28694be9f2ecbe948122395c3f48db5408253e949dc50f2a74038 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 18:25:56,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 18:25:56,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 18:25:56,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 18:25:56,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 18:25:56,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 18:25:56,691 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 18:25:56,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 18:25:56,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 18:25:56,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 18:25:56,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 18:25:56,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 18:25:56,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 18:25:56,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 18:25:56,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 18:25:56,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 18:25:56,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 18:25:56,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 18:25:56,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 18:25:56,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 18:25:56,718 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 18:25:56,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 18:25:56,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 18:25:56,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 18:25:56,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 18:25:56,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 18:25:56,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 18:25:56,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 18:25:56,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 18:25:56,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 18:25:56,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 18:25:56,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 18:25:56,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 18:25:56,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 18:25:56,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 18:25:56,734 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 18:25:56,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 18:25:56,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 18:25:56,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 18:25:56,735 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 18:25:56,736 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 18:25:56,736 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 18:25:56,754 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 18:25:56,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 18:25:56,754 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 18:25:56,754 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 18:25:56,755 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 18:25:56,755 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 18:25:56,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 18:25:56,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 18:25:56,756 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 18:25:56,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 18:25:56,757 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 18:25:56,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 18:25:56,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 18:25:56,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 18:25:56,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 18:25:56,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 18:25:56,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 18:25:56,758 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 18:25:56,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 18:25:56,758 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 18:25:56,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 18:25:56,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 18:25:56,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 18:25:56,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 18:25:56,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 18:25:56,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 18:25:56,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 18:25:56,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 18:25:56,759 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 18:25:56,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 18:25:56,760 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 18:25:56,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 18:25:56,760 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 18:25:56,760 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 18:25:56,760 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 18:25:56,760 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 -> 63cd3e528fa28694be9f2ecbe948122395c3f48db5408253e949dc50f2a74038 [2023-02-18 18:25:56,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 18:25:56,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 18:25:56,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 18:25:56,986 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 18:25:56,987 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 18:25:56,988 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound50.c [2023-02-18 18:25:57,965 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 18:25:58,119 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 18:25:58,119 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound50.c [2023-02-18 18:25:58,123 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/251c1b7a5/46a64353fcd042a785b0ea0b387dfe48/FLAG63361da82 [2023-02-18 18:25:58,131 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/251c1b7a5/46a64353fcd042a785b0ea0b387dfe48 [2023-02-18 18:25:58,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 18:25:58,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 18:25:58,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 18:25:58,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 18:25:58,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 18:25:58,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 06:25:58" (1/1) ... [2023-02-18 18:25:58,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39dfd682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:58, skipping insertion in model container [2023-02-18 18:25:58,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 06:25:58" (1/1) ... [2023-02-18 18:25:58,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 18:25:58,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 18:25:58,260 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_valuebound50.c[526,539] [2023-02-18 18:25:58,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 18:25:58,283 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 18:25:58,295 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_valuebound50.c[526,539] [2023-02-18 18:25:58,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 18:25:58,311 INFO L208 MainTranslator]: Completed translation [2023-02-18 18:25:58,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:58 WrapperNode [2023-02-18 18:25:58,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 18:25:58,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 18:25:58,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 18:25:58,313 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 18:25:58,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:58" (1/1) ... [2023-02-18 18:25:58,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:58" (1/1) ... [2023-02-18 18:25:58,335 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2023-02-18 18:25:58,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 18:25:58,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 18:25:58,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 18:25:58,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 18:25:58,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:58" (1/1) ... [2023-02-18 18:25:58,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:58" (1/1) ... [2023-02-18 18:25:58,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:58" (1/1) ... [2023-02-18 18:25:58,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:58" (1/1) ... [2023-02-18 18:25:58,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:58" (1/1) ... [2023-02-18 18:25:58,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:58" (1/1) ... [2023-02-18 18:25:58,361 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:58" (1/1) ... [2023-02-18 18:25:58,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:58" (1/1) ... [2023-02-18 18:25:58,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 18:25:58,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 18:25:58,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 18:25:58,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 18:25:58,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:58" (1/1) ... [2023-02-18 18:25:58,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 18:25:58,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:58,413 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 18:25:58,430 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 18:25:58,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 18:25:58,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 18:25:58,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 18:25:58,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 18:25:58,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 18:25:58,441 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 18:25:58,481 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 18:25:58,482 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 18:25:58,569 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 18:25:58,572 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 18:25:58,573 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 18:25:58,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 06:25:58 BoogieIcfgContainer [2023-02-18 18:25:58,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 18:25:58,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 18:25:58,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 18:25:58,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 18:25:58,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 06:25:58" (1/3) ... [2023-02-18 18:25:58,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1446264c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 06:25:58, skipping insertion in model container [2023-02-18 18:25:58,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:58" (2/3) ... [2023-02-18 18:25:58,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1446264c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 06:25:58, skipping insertion in model container [2023-02-18 18:25:58,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 06:25:58" (3/3) ... [2023-02-18 18:25:58,579 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound50.c [2023-02-18 18:25:58,589 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 18:25:58,590 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 18:25:58,627 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 18:25:58,633 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;@7ad80a5c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 18:25:58,633 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 18:25:58,636 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 18:25:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 18:25:58,640 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:58,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:58,642 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:58,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:58,646 INFO L85 PathProgramCache]: Analyzing trace with hash -586848446, now seen corresponding path program 1 times [2023-02-18 18:25:58,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:58,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898254213] [2023-02-18 18:25:58,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:58,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:58,768 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 18:25:58,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:58,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898254213] [2023-02-18 18:25:58,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898254213] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:25:58,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:25:58,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 18:25:58,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477455728] [2023-02-18 18:25:58,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:25:58,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 18:25:58,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:58,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 18:25:58,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 18:25:58,800 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 18:25:58,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:58,820 INFO L93 Difference]: Finished difference Result 49 states and 83 transitions. [2023-02-18 18:25:58,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 18:25:58,822 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 18:25:58,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:58,827 INFO L225 Difference]: With dead ends: 49 [2023-02-18 18:25:58,827 INFO L226 Difference]: Without dead ends: 22 [2023-02-18 18:25:58,830 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 18:25:58,845 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 18:25:58,846 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 18:25:58,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-18 18:25:58,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-18 18:25:58,881 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 18:25:58,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2023-02-18 18:25:58,886 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 9 [2023-02-18 18:25:58,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:58,887 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-02-18 18:25:58,888 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 18:25:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2023-02-18 18:25:58,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 18:25:58,889 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:58,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:58,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 18:25:58,890 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:58,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:58,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1188158916, now seen corresponding path program 1 times [2023-02-18 18:25:58,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:58,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381756135] [2023-02-18 18:25:58,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:58,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:59,014 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 18:25:59,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:59,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381756135] [2023-02-18 18:25:59,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381756135] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:25:59,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:25:59,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 18:25:59,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720505786] [2023-02-18 18:25:59,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:25:59,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 18:25:59,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:59,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 18:25:59,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 18:25:59,018 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 18:25:59,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:59,052 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2023-02-18 18:25:59,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 18:25:59,052 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 18:25:59,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:59,053 INFO L225 Difference]: With dead ends: 35 [2023-02-18 18:25:59,053 INFO L226 Difference]: Without dead ends: 33 [2023-02-18 18:25:59,053 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 18:25:59,054 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 18:25:59,055 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 18:25:59,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-18 18:25:59,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2023-02-18 18:25:59,060 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 18:25:59,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-02-18 18:25:59,061 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2023-02-18 18:25:59,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:59,061 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-02-18 18:25:59,061 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 18:25:59,061 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-02-18 18:25:59,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 18:25:59,062 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:59,062 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:59,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 18:25:59,062 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:59,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:59,063 INFO L85 PathProgramCache]: Analyzing trace with hash -697944935, now seen corresponding path program 1 times [2023-02-18 18:25:59,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:59,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132791978] [2023-02-18 18:25:59,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:59,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:59,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-18 18:25:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:59,247 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 18:25:59,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:59,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132791978] [2023-02-18 18:25:59,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132791978] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:25:59,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:25:59,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 18:25:59,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707161132] [2023-02-18 18:25:59,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:25:59,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 18:25:59,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:59,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 18:25:59,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 18:25:59,250 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 18:25:59,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:59,292 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2023-02-18 18:25:59,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 18:25:59,292 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 18:25:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:59,293 INFO L225 Difference]: With dead ends: 39 [2023-02-18 18:25:59,293 INFO L226 Difference]: Without dead ends: 37 [2023-02-18 18:25:59,294 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 18:25:59,295 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 18:25:59,295 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 18:25:59,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-18 18:25:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2023-02-18 18:25:59,306 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 18:25:59,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-02-18 18:25:59,308 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2023-02-18 18:25:59,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:59,309 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-02-18 18:25:59,309 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 18:25:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-02-18 18:25:59,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 18:25:59,310 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:59,311 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:59,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 18:25:59,311 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:59,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:59,312 INFO L85 PathProgramCache]: Analyzing trace with hash 262992548, now seen corresponding path program 1 times [2023-02-18 18:25:59,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:59,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711749302] [2023-02-18 18:25:59,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:59,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:59,325 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:25:59,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [42636633] [2023-02-18 18:25:59,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:59,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:59,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:59,361 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 18:25:59,401 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 18:25:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:59,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 18:25:59,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:25:59,500 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 18:25:59,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:25:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 18:25:59,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:59,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711749302] [2023-02-18 18:25:59,600 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:25:59,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42636633] [2023-02-18 18:25:59,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42636633] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:25:59,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:25:59,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 18:25:59,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838135282] [2023-02-18 18:25:59,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:25:59,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 18:25:59,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:59,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 18:25:59,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 18:25:59,603 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), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 18:25:59,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:59,712 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2023-02-18 18:25:59,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 18:25:59,713 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), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 19 [2023-02-18 18:25:59,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:59,715 INFO L225 Difference]: With dead ends: 65 [2023-02-18 18:25:59,715 INFO L226 Difference]: Without dead ends: 51 [2023-02-18 18:25:59,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 18:25:59,717 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 30 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:59,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 48 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 18:25:59,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-18 18:25:59,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-18 18:25:59,726 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 18:25:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2023-02-18 18:25:59,727 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 19 [2023-02-18 18:25:59,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:59,728 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-02-18 18:25:59,728 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), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 18:25:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2023-02-18 18:25:59,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 18:25:59,729 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:59,729 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 18:25:59,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-18 18:25:59,934 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 18:25:59,935 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:59,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:59,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1807142342, now seen corresponding path program 1 times [2023-02-18 18:25:59,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:59,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460088378] [2023-02-18 18:25:59,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:59,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:59,943 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:25:59,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1907845186] [2023-02-18 18:25:59,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:59,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:59,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:59,963 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 18:25:59,992 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 18:26:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:26:00,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 18:26:00,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:26:00,080 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 18:26:00,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:26:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 18:26:00,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:26:00,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460088378] [2023-02-18 18:26:00,159 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:26:00,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907845186] [2023-02-18 18:26:00,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907845186] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:26:00,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:26:00,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-02-18 18:26:00,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080602104] [2023-02-18 18:26:00,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:26:00,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 18:26:00,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:26:00,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 18:26:00,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-18 18:26:00,164 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), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 18:26:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:26:00,275 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2023-02-18 18:26:00,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 18:26:00,285 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), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 26 [2023-02-18 18:26:00,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:26:00,286 INFO L225 Difference]: With dead ends: 66 [2023-02-18 18:26:00,286 INFO L226 Difference]: Without dead ends: 59 [2023-02-18 18:26:00,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-02-18 18:26:00,287 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 18:26:00,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 67 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 18:26:00,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-18 18:26:00,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2023-02-18 18:26:00,295 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 18:26:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2023-02-18 18:26:00,296 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 26 [2023-02-18 18:26:00,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:26:00,296 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2023-02-18 18:26:00,296 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), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 18:26:00,297 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2023-02-18 18:26:00,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-18 18:26:00,298 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:26:00,298 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 18:26:00,319 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 18:26:00,516 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 18:26:00,517 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:26:00,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:26:00,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1034157389, now seen corresponding path program 1 times [2023-02-18 18:26:00,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:26:00,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254347722] [2023-02-18 18:26:00,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:26:00,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:26:00,539 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:26:00,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1784742394] [2023-02-18 18:26:00,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:26:00,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:26:00,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:26:00,547 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 18:26:00,574 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 18:26:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:26:00,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-18 18:26:00,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:26:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-18 18:26:00,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:26:00,884 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-18 18:26:00,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:26:00,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254347722] [2023-02-18 18:26:00,885 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:26:00,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784742394] [2023-02-18 18:26:00,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784742394] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:26:00,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:26:00,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-18 18:26:00,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562650160] [2023-02-18 18:26:00,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:26:00,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 18:26:00,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:26:00,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 18:26:00,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-02-18 18:26:00,893 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), 4 states have call predecessors, (16), 5 states have call successors, (16) [2023-02-18 18:26:01,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:26:01,567 INFO L93 Difference]: Finished difference Result 142 states and 193 transitions. [2023-02-18 18:26:01,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 18:26:01,568 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), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 56 [2023-02-18 18:26:01,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:26:01,569 INFO L225 Difference]: With dead ends: 142 [2023-02-18 18:26:01,569 INFO L226 Difference]: Without dead ends: 111 [2023-02-18 18:26:01,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-02-18 18:26:01,571 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 46 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 18:26:01,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 116 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 18:26:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-18 18:26:01,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2023-02-18 18:26:01,610 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 18:26:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 138 transitions. [2023-02-18 18:26:01,613 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 138 transitions. Word has length 56 [2023-02-18 18:26:01,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:26:01,614 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 138 transitions. [2023-02-18 18:26:01,614 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), 4 states have call predecessors, (16), 5 states have call successors, (16) [2023-02-18 18:26:01,614 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2023-02-18 18:26:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-18 18:26:01,619 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:26:01,620 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 18:26:01,631 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 18:26:01,825 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 18:26:01,825 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:26:01,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:26:01,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1199454569, now seen corresponding path program 1 times [2023-02-18 18:26:01,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:26:01,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022020194] [2023-02-18 18:26:01,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:26:01,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:26:01,840 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:26:01,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1628057526] [2023-02-18 18:26:01,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:26:01,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:26:01,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:26:01,842 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 18:26:01,844 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 18:26:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:26:01,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-18 18:26:01,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:26:01,923 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-18 18:26:01,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:26:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-18 18:26:02,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:26:02,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022020194] [2023-02-18 18:26:02,104 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:26:02,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628057526] [2023-02-18 18:26:02,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628057526] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:26:02,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:26:02,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-18 18:26:02,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899908222] [2023-02-18 18:26:02,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:26:02,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 18:26:02,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:26:02,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 18:26:02,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-02-18 18:26:02,108 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), 5 states have call predecessors, (20), 6 states have call successors, (20) [2023-02-18 18:26:02,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:26:02,871 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2023-02-18 18:26:02,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 18:26:02,871 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), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 67 [2023-02-18 18:26:02,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:26:02,872 INFO L225 Difference]: With dead ends: 161 [2023-02-18 18:26:02,873 INFO L226 Difference]: Without dead ends: 123 [2023-02-18 18:26:02,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 115 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2023-02-18 18:26:02,873 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 24 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-18 18:26:02,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 103 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-18 18:26:02,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-18 18:26:02,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 101. [2023-02-18 18:26:02,902 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 18:26:02,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2023-02-18 18:26:02,905 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 125 transitions. Word has length 67 [2023-02-18 18:26:02,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:26:02,905 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 125 transitions. [2023-02-18 18:26:02,905 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), 5 states have call predecessors, (20), 6 states have call successors, (20) [2023-02-18 18:26:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2023-02-18 18:26:02,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-18 18:26:02,907 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:26:02,907 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 18:26:02,927 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 18:26:03,127 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 18:26:03,127 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:26:03,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:26:03,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1728532070, now seen corresponding path program 1 times [2023-02-18 18:26:03,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:26:03,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853007915] [2023-02-18 18:26:03,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:26:03,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:26:03,148 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:26:03,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210809815] [2023-02-18 18:26:03,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:26:03,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:26:03,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:26:03,165 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 18:26:03,192 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 18:26:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:26:03,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-18 18:26:03,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:26:03,275 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-18 18:26:03,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:26:03,353 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-18 18:26:03,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:26:03,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853007915] [2023-02-18 18:26:03,354 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:26:03,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210809815] [2023-02-18 18:26:03,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210809815] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:26:03,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:26:03,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-18 18:26:03,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35877275] [2023-02-18 18:26:03,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:26:03,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 18:26:03,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:26:03,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 18:26:03,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 18:26:03,356 INFO L87 Difference]: Start difference. First operand 101 states and 125 transitions. Second operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-18 18:26:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:26:03,498 INFO L93 Difference]: Finished difference Result 120 states and 144 transitions. [2023-02-18 18:26:03,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 18:26:03,498 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 72 [2023-02-18 18:26:03,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:26:03,501 INFO L225 Difference]: With dead ends: 120 [2023-02-18 18:26:03,501 INFO L226 Difference]: Without dead ends: 93 [2023-02-18 18:26:03,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-02-18 18:26:03,505 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 18:26:03,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 187 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 18:26:03,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-18 18:26:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-02-18 18:26:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 61 states have internal predecessors, (65), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 18:26:03,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2023-02-18 18:26:03,530 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 72 [2023-02-18 18:26:03,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:26:03,530 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2023-02-18 18:26:03,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-18 18:26:03,531 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2023-02-18 18:26:03,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-18 18:26:03,533 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:26:03,533 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 18:26:03,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-18 18:26:03,742 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 18:26:03,742 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:26:03,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:26:03,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1412721000, now seen corresponding path program 1 times [2023-02-18 18:26:03,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:26:03,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913534563] [2023-02-18 18:26:03,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:26:03,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:26:03,750 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:26:03,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [155094191] [2023-02-18 18:26:03,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:26:03,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:26:03,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:26:03,751 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 18:26:03,757 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 18:26:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:26:03,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 18:26:03,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:26:03,877 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 18:26:03,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 18:26:03,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:26:03,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913534563] [2023-02-18 18:26:03,878 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:26:03,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155094191] [2023-02-18 18:26:03,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155094191] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:26:03,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:26:03,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 18:26:03,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181850772] [2023-02-18 18:26:03,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:26:03,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 18:26:03,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:26:03,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 18:26:03,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-18 18:26:03,881 INFO L87 Difference]: Start difference. First operand 93 states and 110 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 18:26:03,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:26:03,965 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2023-02-18 18:26:03,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 18:26:03,966 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 18:26:03,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:26:03,969 INFO L225 Difference]: With dead ends: 125 [2023-02-18 18:26:03,969 INFO L226 Difference]: Without dead ends: 88 [2023-02-18 18:26:03,969 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 18:26:03,971 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 18:26:03,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 101 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 18:26:03,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-18 18:26:03,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2023-02-18 18:26:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 18 states have call successors, (18), 10 states have call predecessors, (18), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-02-18 18:26:03,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2023-02-18 18:26:03,997 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 86 [2023-02-18 18:26:03,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:26:03,997 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2023-02-18 18:26:03,997 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 18:26:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2023-02-18 18:26:03,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-18 18:26:03,999 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:26:03,999 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 18:26:04,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-18 18:26:04,204 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 18:26:04,205 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:26:04,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:26:04,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1193302554, now seen corresponding path program 2 times [2023-02-18 18:26:04,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:26:04,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673278989] [2023-02-18 18:26:04,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:26:04,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:26:04,212 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:26:04,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1328233604] [2023-02-18 18:26:04,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 18:26:04,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:26:04,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:26:04,222 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 18:26:04,224 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 18:26:04,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 18:26:04,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 18:26:04,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-18 18:26:04,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:26:04,368 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 18:26:04,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:26:06,663 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 18:26:06,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:26:06,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673278989] [2023-02-18 18:26:06,663 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:26:06,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328233604] [2023-02-18 18:26:06,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328233604] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:26:06,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:26:06,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2023-02-18 18:26:06,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995804854] [2023-02-18 18:26:06,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:26:06,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-18 18:26:06,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:26:06,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-18 18:26:06,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2023-02-18 18:26:06,665 INFO L87 Difference]: Start difference. First operand 79 states and 89 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 18:26:10,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:26:11,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:26:13,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:26:14,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:26:17,946 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 18:26:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:26:19,712 INFO L93 Difference]: Finished difference Result 159 states and 203 transitions. [2023-02-18 18:26:19,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 18:26:19,713 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 18:26:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:26:19,714 INFO L225 Difference]: With dead ends: 159 [2023-02-18 18:26:19,714 INFO L226 Difference]: Without dead ends: 134 [2023-02-18 18:26:19,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 147 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2023-02-18 18:26:19,715 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 82 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 126 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2023-02-18 18:26:19,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 184 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 937 Invalid, 1 Unknown, 0 Unchecked, 11.4s Time] [2023-02-18 18:26:19,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-18 18:26:19,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2023-02-18 18:26:19,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.1375) internal successors, (91), 86 states have internal predecessors, (91), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-18 18:26:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2023-02-18 18:26:19,782 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 86 [2023-02-18 18:26:19,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:26:19,783 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2023-02-18 18:26:19,783 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 18:26:19,783 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2023-02-18 18:26:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-02-18 18:26:19,784 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:26:19,784 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 18:26:19,791 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 18:26:19,989 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 18:26:19,989 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:26:19,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:26:19,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1474759586, now seen corresponding path program 2 times [2023-02-18 18:26:19,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:26:19,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266328080] [2023-02-18 18:26:19,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:26:19,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:26:19,996 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:26:19,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2108252188] [2023-02-18 18:26:19,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 18:26:19,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:26:19,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:26:19,998 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 18:26:20,000 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 18:26:20,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 18:26:20,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 18:26:20,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-18 18:26:20,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:26:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 38 proven. 62 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-02-18 18:26:20,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:26:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 38 proven. 62 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-02-18 18:26:23,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:26:23,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266328080] [2023-02-18 18:26:23,195 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:26:23,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108252188] [2023-02-18 18:26:23,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108252188] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:26:23,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:26:23,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2023-02-18 18:26:23,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900855327] [2023-02-18 18:26:23,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:26:23,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-18 18:26:23,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:26:23,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-18 18:26:23,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2023-02-18 18:26:23,197 INFO L87 Difference]: Start difference. First operand 130 states and 162 transitions. Second operand has 22 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 13 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2023-02-18 18:26:27,643 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 18:26:30,305 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 18:26:31,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:26:31,879 INFO L93 Difference]: Finished difference Result 187 states and 238 transitions. [2023-02-18 18:26:31,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-18 18:26:31,880 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 13 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) Word has length 97 [2023-02-18 18:26:31,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:26:31,881 INFO L225 Difference]: With dead ends: 187 [2023-02-18 18:26:31,881 INFO L226 Difference]: Without dead ends: 142 [2023-02-18 18:26:31,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 168 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2023-02-18 18:26:31,882 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 36 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 84 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-02-18 18:26:31,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 153 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 779 Invalid, 2 Unknown, 0 Unchecked, 7.8s Time] [2023-02-18 18:26:31,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-02-18 18:26:31,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 126. [2023-02-18 18:26:31,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 83 states have internal predecessors, (86), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2023-02-18 18:26:31,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2023-02-18 18:26:31,943 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 97 [2023-02-18 18:26:31,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:26:31,944 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2023-02-18 18:26:31,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 13 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2023-02-18 18:26:31,944 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2023-02-18 18:26:31,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-02-18 18:26:31,945 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:26:31,945 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:26:31,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-18 18:26:32,149 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 18:26:32,150 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:26:32,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:26:32,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1149721345, now seen corresponding path program 2 times [2023-02-18 18:26:32,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:26:32,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021855316] [2023-02-18 18:26:32,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:26:32,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:26:32,162 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:26:32,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434493902] [2023-02-18 18:26:32,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 18:26:32,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:26:32,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:26:32,164 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 18:26:32,166 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 18:26:32,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 18:26:32,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 18:26:32,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-18 18:26:32,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:26:32,258 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 34 proven. 71 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-02-18 18:26:32,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:26:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 34 proven. 71 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-02-18 18:26:32,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:26:32,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021855316] [2023-02-18 18:26:32,563 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:26:32,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434493902] [2023-02-18 18:26:32,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434493902] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:26:32,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:26:32,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2023-02-18 18:26:32,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731854431] [2023-02-18 18:26:32,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:26:32,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 18:26:32,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:26:32,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 18:26:32,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2023-02-18 18:26:32,566 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand has 18 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 10 states have call successors, (32) [2023-02-18 18:26:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:26:33,186 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2023-02-18 18:26:33,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 18:26:33,186 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 10 states have call successors, (32) Word has length 102 [2023-02-18 18:26:33,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:26:33,187 INFO L225 Difference]: With dead ends: 150 [2023-02-18 18:26:33,187 INFO L226 Difference]: Without dead ends: 110 [2023-02-18 18:26:33,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 183 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2023-02-18 18:26:33,189 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 18:26:33,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 127 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 18:26:33,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-18 18:26:33,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-02-18 18:26:33,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 74 states have internal predecessors, (76), 23 states have call successors, (23), 15 states have call predecessors, (23), 15 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 18:26:33,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2023-02-18 18:26:33,225 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 102 [2023-02-18 18:26:33,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:26:33,225 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2023-02-18 18:26:33,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 10 states have call successors, (32) [2023-02-18 18:26:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2023-02-18 18:26:33,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-02-18 18:26:33,227 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:26:33,227 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 18:26:33,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-18 18:26:33,431 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 18:26:33,434 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:26:33,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:26:33,435 INFO L85 PathProgramCache]: Analyzing trace with hash 289773103, now seen corresponding path program 2 times [2023-02-18 18:26:33,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:26:33,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963053365] [2023-02-18 18:26:33,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:26:33,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:26:33,443 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:26:33,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [719720629] [2023-02-18 18:26:33,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 18:26:33,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:26:33,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:26:33,445 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 18:26:33,454 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 18:26:33,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 18:26:33,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 18:26:33,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 54 conjunts are in the unsatisfiable core [2023-02-18 18:26:33,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:26:33,597 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 18:26:33,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:26:41,409 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 18:26:41,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:26:41,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963053365] [2023-02-18 18:26:41,409 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:26:41,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719720629] [2023-02-18 18:26:41,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719720629] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:26:41,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:26:41,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2023-02-18 18:26:41,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379790468] [2023-02-18 18:26:41,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:26:41,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-18 18:26:41,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:26:41,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-18 18:26:41,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2023-02-18 18:26:41,412 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 23 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 18:26:45,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:26:49,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:26:51,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:26:53,485 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 18:26:58,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:27:06,262 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 18:27:07,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:27:08,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:27:08,317 INFO L93 Difference]: Finished difference Result 203 states and 254 transitions. [2023-02-18 18:27:08,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 18:27:08,318 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 23 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 18:27:08,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:27:08,319 INFO L225 Difference]: With dead ends: 203 [2023-02-18 18:27:08,319 INFO L226 Difference]: Without dead ends: 180 [2023-02-18 18:27:08,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 204 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2023-02-18 18:27:08,320 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 98 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 168 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.2s IncrementalHoareTripleChecker+Time [2023-02-18 18:27:08,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 179 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 902 Invalid, 4 Unknown, 0 Unchecked, 23.2s Time] [2023-02-18 18:27:08,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-02-18 18:27:08,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2023-02-18 18:27:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 118 states have internal predecessors, (125), 48 states have call successors, (48), 18 states have call predecessors, (48), 18 states have return successors, (47), 40 states have call predecessors, (47), 47 states have call successors, (47) [2023-02-18 18:27:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 220 transitions. [2023-02-18 18:27:08,620 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 220 transitions. Word has length 116 [2023-02-18 18:27:08,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:27:08,621 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 220 transitions. [2023-02-18 18:27:08,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 23 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 18:27:08,622 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 220 transitions. [2023-02-18 18:27:08,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-02-18 18:27:08,628 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:27:08,629 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 18:27:08,636 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 18:27:08,836 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 18:27:08,837 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:27:08,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:27:08,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1262824565, now seen corresponding path program 1 times [2023-02-18 18:27:08,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:27:08,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899559683] [2023-02-18 18:27:08,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:27:08,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:27:08,864 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:27:08,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319627711] [2023-02-18 18:27:08,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:27:08,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:27:08,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:27:08,869 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 18:27:08,870 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 18:27:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:27:08,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 57 conjunts are in the unsatisfiable core [2023-02-18 18:27:08,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:27:09,102 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 89 proven. 116 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2023-02-18 18:27:09,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:27:09,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:27:09,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899559683] [2023-02-18 18:27:09,260 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:27:09,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319627711] [2023-02-18 18:27:09,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319627711] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 18:27:09,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 18:27:09,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2023-02-18 18:27:09,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040734702] [2023-02-18 18:27:09,261 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 18:27:09,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 18:27:09,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:27:09,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 18:27:09,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2023-02-18 18:27:09,262 INFO L87 Difference]: Start difference. First operand 177 states and 220 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2023-02-18 18:27:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:27:09,910 INFO L93 Difference]: Finished difference Result 242 states and 299 transitions. [2023-02-18 18:27:09,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 18:27:09,910 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) Word has length 127 [2023-02-18 18:27:09,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:27:09,911 INFO L225 Difference]: With dead ends: 242 [2023-02-18 18:27:09,911 INFO L226 Difference]: Without dead ends: 169 [2023-02-18 18:27:09,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 118 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2023-02-18 18:27:09,912 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 18:27:09,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 189 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 18:27:09,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-02-18 18:27:10,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2023-02-18 18:27:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 107 states have (on average 1.102803738317757) internal successors, (118), 114 states have internal predecessors, (118), 41 states have call successors, (41), 20 states have call predecessors, (41), 20 states have return successors, (40), 34 states have call predecessors, (40), 40 states have call successors, (40) [2023-02-18 18:27:10,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 199 transitions. [2023-02-18 18:27:10,079 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 199 transitions. Word has length 127 [2023-02-18 18:27:10,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:27:10,080 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 199 transitions. [2023-02-18 18:27:10,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2023-02-18 18:27:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 199 transitions. [2023-02-18 18:27:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-02-18 18:27:10,081 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:27:10,081 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 18:27:10,091 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 18:27:10,286 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 18:27:10,287 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:27:10,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:27:10,287 INFO L85 PathProgramCache]: Analyzing trace with hash -348155591, now seen corresponding path program 2 times [2023-02-18 18:27:10,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:27:10,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268605999] [2023-02-18 18:27:10,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:27:10,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:27:10,293 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:27:10,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1808231444] [2023-02-18 18:27:10,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 18:27:10,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:27:10,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:27:10,297 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 18:27:10,298 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 18:27:10,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 18:27:10,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 18:27:10,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 61 conjunts are in the unsatisfiable core [2023-02-18 18:27:10,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:27:10,552 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 92 proven. 113 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2023-02-18 18:27:10,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:27:11,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:27:11,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268605999] [2023-02-18 18:27:11,125 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:27:11,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808231444] [2023-02-18 18:27:11,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808231444] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 18:27:11,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 18:27:11,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2023-02-18 18:27:11,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56639184] [2023-02-18 18:27:11,126 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 18:27:11,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 18:27:11,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:27:11,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 18:27:11,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2023-02-18 18:27:11,127 INFO L87 Difference]: Start difference. First operand 169 states and 199 transitions. Second operand has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 10 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 8 states have call predecessors, (20), 9 states have call successors, (20) [2023-02-18 18:27:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:27:11,773 INFO L93 Difference]: Finished difference Result 223 states and 263 transitions. [2023-02-18 18:27:11,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-18 18:27:11,773 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 10 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 8 states have call predecessors, (20), 9 states have call successors, (20) Word has length 127 [2023-02-18 18:27:11,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:27:11,774 INFO L225 Difference]: With dead ends: 223 [2023-02-18 18:27:11,774 INFO L226 Difference]: Without dead ends: 175 [2023-02-18 18:27:11,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 130 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=750, Unknown=0, NotChecked=0, Total=930 [2023-02-18 18:27:11,776 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 15 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 18:27:11,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 190 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 18:27:11,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-18 18:27:11,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-02-18 18:27:11,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 118 states have internal predecessors, (122), 40 states have call successors, (40), 22 states have call predecessors, (40), 22 states have return successors, (39), 34 states have call predecessors, (39), 39 states have call successors, (39) [2023-02-18 18:27:11,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 201 transitions. [2023-02-18 18:27:11,942 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 201 transitions. Word has length 127 [2023-02-18 18:27:11,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:27:11,943 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 201 transitions. [2023-02-18 18:27:11,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 10 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 8 states have call predecessors, (20), 9 states have call successors, (20) [2023-02-18 18:27:11,943 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 201 transitions. [2023-02-18 18:27:11,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-02-18 18:27:11,944 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:27:11,944 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:27:11,949 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 18:27:12,145 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 18:27:12,145 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:27:12,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:27:12,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1240192311, now seen corresponding path program 3 times [2023-02-18 18:27:12,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:27:12,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052833891] [2023-02-18 18:27:12,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:27:12,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:27:12,183 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:27:12,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [407196373] [2023-02-18 18:27:12,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 18:27:12,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:27:12,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:27:12,186 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 18:27:12,189 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 18:27:12,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-18 18:27:12,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 18:27:12,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-18 18:27:12,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:27:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 163 proven. 53 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2023-02-18 18:27:12,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:27:12,350 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-02-18 18:27:12,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:27:12,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052833891] [2023-02-18 18:27:12,351 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:27:12,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407196373] [2023-02-18 18:27:12,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407196373] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:27:12,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:27:12,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2023-02-18 18:27:12,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165219187] [2023-02-18 18:27:12,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:27:12,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 18:27:12,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:27:12,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 18:27:12,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-02-18 18:27:12,354 INFO L87 Difference]: Start difference. First operand 175 states and 201 transitions. Second operand has 16 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 7 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2023-02-18 18:27:12,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:27:12,655 INFO L93 Difference]: Finished difference Result 175 states and 201 transitions. [2023-02-18 18:27:12,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 18:27:12,656 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 7 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) Word has length 127 [2023-02-18 18:27:12,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:27:12,656 INFO L225 Difference]: With dead ends: 175 [2023-02-18 18:27:12,657 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 18:27:12,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 237 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-02-18 18:27:12,657 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 51 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 18:27:12,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 53 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 18:27:12,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 18:27:12,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 18:27:12,658 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 18:27:12,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 18:27:12,659 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2023-02-18 18:27:12,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:27:12,659 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 18:27:12,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 7 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2023-02-18 18:27:12,659 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 18:27:12,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 18:27:12,661 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 18:27:12,666 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 18:27:12,866 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 18:27:12,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 18:27:12,961 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2023-02-18 18:27:12,964 INFO L895 garLoopResultBuilder]: At program point L52-2(lines 44 56) the Hoare annotation is: (let ((.cse209 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse240 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse241 (+ 1 .cse240)) (.cse202 (- .cse209))) (let ((.cse170 (+ .cse209 1)) (.cse206 (+ (- 1) .cse202)) (.cse112 (+ |ULTIMATE.start_main_~q~0#1| .cse241)) (.cse99 (+ |ULTIMATE.start_main_~q~0#1| .cse240)) (.cse231 (mod |ULTIMATE.start_main_~d~0#1| 2)) (.cse238 (+ .cse240 1))) (let ((.cse212 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse211 (div .cse238 2)) (.cse106 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse38 (- |ULTIMATE.start_main_~d~0#1|)) (.cse71 (= 1 |ULTIMATE.start_main_~p~0#1|)) (.cse73 (= 0 .cse231)) (.cse243 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse78 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse107 (+ |ULTIMATE.start_main_~r~0#1| .cse202)) (.cse242 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse245 (* .cse99 |ULTIMATE.start_main_~B~0#1|)) (.cse244 (* .cse112 |ULTIMATE.start_main_~B~0#1|)) (.cse100 (+ |ULTIMATE.start_main_~r~0#1| .cse206)) (.cse207 (+ 1 .cse209)) (.cse104 (div .cse170 2))) (let ((.cse130 (- .cse104)) (.cse118 (= 0 (mod .cse240 2))) (.cse233 (< .cse240 0)) (.cse102 (= 0 (mod .cse170 2))) (.cse234 (< .cse207 0)) (.cse235 (< .cse241 0)) (.cse121 (= 0 (mod .cse238 2))) (.cse96 (= 1 .cse240)) (.cse111 (= 1 .cse241)) (.cse80 (= |ULTIMATE.start_main_~A~0#1| (+ .cse244 .cse100))) (.cse72 (= |ULTIMATE.start_main_~A~0#1| (+ .cse245 .cse100))) (.cse74 (not .cse242)) (.cse75 (= |ULTIMATE.start_main_~A~0#1| (+ .cse245 .cse107))) (.cse77 (and .cse243 (not .cse78))) (.cse79 (= |ULTIMATE.start_main_~A~0#1| (+ .cse244 .cse107))) (.cse81 (not .cse243)) (.cse76 (and .cse242 (not .cse73))) (.cse67 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse198 (not .cse71)) (.cse178 (+ |ULTIMATE.start_main_~r~0#1| .cse38)) (.cse126 (- .cse106)) (.cse110 (= 0 (mod .cse209 2))) (.cse236 (< .cse209 0)) (.cse210 (+ 1 .cse211)) (.cse237 (+ .cse211 1)) (.cse213 (+ 1 .cse212)) (.cse239 (+ .cse212 1)) (.cse208 (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse91 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse88 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse58 (* 2 |ULTIMATE.start_main_~B~0#1|))) (let ((.cse197 (* 2 1)) (.cse196 (* 2 .cse58)) (.cse85 (+ |ULTIMATE.start_main_~q~0#1| .cse88)) (.cse89 (+ |ULTIMATE.start_main_~r~0#1| (- .cse91))) (.cse199 (* (+ .cse208 .cse241) |ULTIMATE.start_main_~B~0#1|)) (.cse201 (* (+ .cse208 .cse240) |ULTIMATE.start_main_~B~0#1|)) (.cse214 (< .cse212 0)) (.cse155 (= 0 (mod .cse212 2))) (.cse215 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse163 (= 0 (mod .cse239 2))) (.cse216 (< .cse213 0)) (.cse217 (div .cse239 2)) (.cse218 (< .cse211 0)) (.cse144 (= 0 (mod .cse211 2))) (.cse219 (div .cse238 4)) (.cse140 (= 0 (mod .cse237 2))) (.cse221 (div .cse237 2)) (.cse220 (< .cse210 0)) (.cse154 (= 1 .cse212)) (.cse165 (= 1 .cse213)) (.cse132 (= 1 .cse210)) (.cse143 (= 1 .cse211)) (.cse105 (and (not .cse110) .cse236)) (.cse108 (not .cse236)) (.cse127 (+ (- 1) .cse126)) (.cse0 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse208 |ULTIMATE.start_main_~B~0#1|) .cse178))) (.cse8 (or .cse67 .cse198)) (.cse15 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse43 (or (and (or .cse75 .cse77) (or .cse78 .cse79 .cse81)) .cse76)) (.cse35 (or (and (or .cse78 .cse80 .cse81) (or .cse72 .cse77)) .cse73 .cse74)) (.cse16 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse2 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse17 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse203 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse207 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse73 .cse74) (or .cse76 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse209 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))))) (.cse204 (and (or .cse77 (not .cse96)) (or .cse78 (not .cse111) .cse81))) (.cse125 (and .cse235 (not .cse121))) (.cse222 (* (+ .cse112 .cse211) |ULTIMATE.start_main_~B~0#1|)) (.cse224 (* (+ .cse112 .cse210) |ULTIMATE.start_main_~B~0#1|)) (.cse122 (not .cse235)) (.cse101 (not .cse234)) (.cse103 (and (not .cse102) .cse234)) (.cse120 (not .cse233)) (.cse226 (* (+ .cse99 .cse213) |ULTIMATE.start_main_~B~0#1|)) (.cse117 (and .cse233 (not .cse118))) (.cse227 (* (+ .cse99 .cse212) |ULTIMATE.start_main_~B~0#1|)) (.cse131 (+ (- 1) .cse130)) (.cse232 (div .cse38 (- 2)))) (let ((.cse40 (+ |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~p~0#1| (- 1)))) (.cse27 (<= 2 .cse232)) (.cse30 (>= |ULTIMATE.start_main_~r~0#1| .cse232)) (.cse32 (= .cse231 0)) (.cse39 (or .cse73 (let ((.cse230 (+ .cse100 .cse131)) (.cse229 (+ .cse100 .cse130))) (and (or .cse78 (and (or .cse103 (and (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse222 .cse229))) (or .cse121 (= |ULTIMATE.start_main_~A~0#1| (+ .cse224 .cse229)) .cse122))) (or .cse101 .cse102 (and (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse222 .cse230))) (or .cse121 (= |ULTIMATE.start_main_~A~0#1| (+ .cse224 .cse230)) .cse122)))) .cse81) (or (and (or (and (or .cse117 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse230))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse226 .cse230)) .cse118 .cse120)) .cse101 .cse102) (or .cse103 (and (or .cse118 .cse120 (= |ULTIMATE.start_main_~A~0#1| (+ .cse226 .cse229))) (or .cse117 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse229)))))) .cse77))) .cse74)) (.cse28 (let ((.cse228 (or .cse203 .cse204))) (or (and .cse0 .cse228 .cse67 .cse15 .cse43 .cse35 .cse16 .cse2 .cse3 .cse17) (and .cse0 .cse8 .cse228 .cse15 .cse43 .cse35 .cse16 .cse2 .cse3 .cse17)))) (.cse29 (or (and (or .cse73 (= |ULTIMATE.start_main_~B~0#1| .cse207) .cse74) (or .cse76 (= |ULTIMATE.start_main_~B~0#1| .cse209))) .cse204)) (.cse44 (or .cse76 (let ((.cse223 (+ .cse107 .cse126)) (.cse225 (+ .cse107 .cse127))) (and (or .cse78 (and (or .cse105 (and (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse222 .cse223))) (or .cse121 .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse224 .cse223))))) (or .cse108 (and (or .cse121 (= |ULTIMATE.start_main_~A~0#1| (+ .cse224 .cse225)) .cse122) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse222 .cse225)) .cse125)) .cse110)) .cse81) (or .cse77 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse226 .cse223)) .cse118 .cse120) (or .cse117 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse223)))) .cse105) (or (and (or .cse118 .cse120 (= |ULTIMATE.start_main_~A~0#1| (+ .cse226 .cse225))) (or .cse117 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse225)))) .cse108 .cse110))))))) (.cse113 (and (or .cse121 (not .cse132) .cse122) (or (not .cse143) .cse125))) (.cse97 (and (or .cse117 (not .cse154)) (or .cse118 .cse120 (not .cse165)))) (.cse119 (* (+ |ULTIMATE.start_main_~q~0#1| .cse213) |ULTIMATE.start_main_~B~0#1|)) (.cse114 (* (+ |ULTIMATE.start_main_~q~0#1| .cse212) |ULTIMATE.start_main_~B~0#1|)) (.cse124 (* (+ |ULTIMATE.start_main_~q~0#1| .cse211) |ULTIMATE.start_main_~B~0#1|)) (.cse123 (* (+ |ULTIMATE.start_main_~q~0#1| .cse210) |ULTIMATE.start_main_~B~0#1|)) (.cse98 (+ 1 .cse104)) (.cse133 (not .cse220)) (.cse135 (* (+ .cse112 (+ 1 .cse221)) |ULTIMATE.start_main_~B~0#1|)) (.cse141 (* (+ .cse112 .cse221) |ULTIMATE.start_main_~B~0#1|)) (.cse142 (and .cse220 (not .cse140))) (.cse148 (* (+ .cse112 .cse219) |ULTIMATE.start_main_~B~0#1|)) (.cse147 (and .cse218 (not .cse144))) (.cse146 (* (+ .cse112 (+ 1 .cse219)) |ULTIMATE.start_main_~B~0#1|)) (.cse145 (not .cse218)) (.cse164 (* (+ .cse99 (+ 1 .cse217)) |ULTIMATE.start_main_~B~0#1|)) (.cse162 (not .cse216)) (.cse160 (* (+ .cse99 .cse217) |ULTIMATE.start_main_~B~0#1|)) (.cse161 (and (not .cse163) .cse216)) (.cse158 (* (+ .cse99 .cse215) |ULTIMATE.start_main_~B~0#1|)) (.cse159 (and .cse214 (not .cse155))) (.cse156 (* (+ .cse99 (+ 1 .cse215)) |ULTIMATE.start_main_~B~0#1|)) (.cse157 (not .cse214)) (.cse109 (+ 1 .cse106)) (.cse175 (* (+ .cse208 .cse213) |ULTIMATE.start_main_~B~0#1|)) (.cse172 (* (+ .cse208 .cse212) |ULTIMATE.start_main_~B~0#1|)) (.cse176 (* (+ .cse208 .cse211) |ULTIMATE.start_main_~B~0#1|)) (.cse177 (* (+ .cse208 .cse210) |ULTIMATE.start_main_~B~0#1|)) (.cse95 (or (and (or .cse73 .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse207 .cse208) .cse178))) (or .cse76 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse209 .cse208) .cse178)))) .cse71 .cse204)) (.cse6 (<= 2 |ULTIMATE.start_main_~d~0#1|)) (.cse34 (or (let ((.cse205 (+ .cse178 .cse206))) (and (or .cse78 (= |ULTIMATE.start_main_~A~0#1| (+ .cse199 .cse205)) .cse81) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse201 .cse205)) .cse77))) .cse73 .cse74)) (.cse21 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse85 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse89 .cse38)))) (.cse94 (or .cse71 .cse203 .cse204)) (.cse42 (or .cse76 (let ((.cse200 (+ .cse178 .cse202))) (and (or .cse78 .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse199 .cse200))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse201 .cse200)) .cse77))))) (.cse9 (or .cse198 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse53 (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse70 (* 2 .cse196)) (.cse62 (+ |ULTIMATE.start_main_~r~0#1| .cse196)) (.cse31 (* 2 .cse197)) (.cse55 (* |ULTIMATE.start_main_~B~0#1| 2))) (let ((.cse7 (= |ULTIMATE.start_main_~d~0#1| .cse197)) (.cse12 (= |ULTIMATE.start_main_~p~0#1| .cse197)) (.cse14 (= |ULTIMATE.start_main_~d~0#1| .cse58)) (.cse46 (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~B~0#1| (- 4)))) (.cse41 (* .cse197 (- 1))) (.cse47 (= |ULTIMATE.start_main_~p~0#1| 2)) (.cse49 (= |ULTIMATE.start_main_~d~0#1| .cse55)) (.cse63 (= (+ |ULTIMATE.start_main_~q~0#1| (* .cse31 (- 1))) 0)) (.cse64 (= .cse62 |ULTIMATE.start_main_~A~0#1|)) (.cse45 (not (>= |ULTIMATE.start_main_~A~0#1| .cse70))) (.cse33 (= |ULTIMATE.start_main_~p~0#1| .cse31)) (.cse26 (= |ULTIMATE.start_main_~d~0#1| .cse196)) (.cse13 (= .cse53 |ULTIMATE.start_main_~A~0#1|)) (.cse66 (or (and .cse6 .cse34 .cse0 .cse8 .cse21 .cse95 .cse94 .cse42 .cse43 .cse35 .cse9 .cse3) (and .cse6 .cse34 .cse0 .cse8 .cse21 .cse94 .cse42 .cse43 .cse35 .cse9 .cse3))) (.cse25 (or (let ((.cse195 (+ .cse178 .cse130)) (.cse194 (+ .cse178 .cse131))) (and (or .cse96 (and (or .cse118 (and (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse194)) .cse102) (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse195)))) .cse120) (or (and (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse194))) (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse195)))) .cse117)) .cse77) (or .cse78 (and (or .cse125 (and (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse195))) (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse194)) .cse102))) (or .cse121 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse195)) .cse103) (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse194)) .cse102)) .cse122)) .cse111 .cse81))) .cse73 .cse74)) (.cse48 (or .cse76 (let ((.cse193 (+ .cse106 1))) (let ((.cse186 (= 0 (mod .cse106 2))) (.cse190 (- (div |ULTIMATE.start_main_~d~0#1| 8))) (.cse189 (< .cse106 0)) (.cse180 (= 0 (mod .cse193 2))) (.cse192 (< .cse109 0)) (.cse191 (- (div .cse193 2)))) (let ((.cse179 (+ .cse107 (+ (- 1) .cse191))) (.cse181 (not .cse192)) (.cse182 (and .cse192 (not .cse180))) (.cse183 (+ .cse107 .cse191)) (.cse188 (not .cse189)) (.cse187 (+ .cse107 (+ (- 1) .cse190))) (.cse184 (+ .cse107 .cse190)) (.cse185 (and .cse189 (not .cse186)))) (and (or (and (or .cse108 (and (or .cse121 .cse132 .cse122 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse179)) .cse180 .cse181) (or .cse182 (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse183)))) .cse142) (or (and (or .cse180 (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse179)) .cse181) (or .cse182 (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse183)))) .cse133 .cse140))) (or .cse143 .cse125 (and (or .cse144 .cse145 (and (or .cse182 (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse183))) (or .cse180 .cse181 (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse179))))) (or (and (or .cse180 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse179)) .cse181) (or .cse182 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse183)))) .cse147)))) .cse110) (or .cse105 (and (or (and (or .cse133 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse184)) .cse185) (or .cse186 (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse187)) .cse188)) .cse140) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse184)) .cse185) (or .cse186 (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse187)) .cse188)) .cse142)) .cse121 .cse132 .cse122) (or .cse143 .cse125 (and (or (and (or .cse186 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse187)) .cse188) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse184)) .cse185)) .cse147) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse184)) .cse185) (or .cse186 (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse187)) .cse188)) .cse144 .cse145)))))) .cse78 .cse81) (or (and (or (and (or .cse154 .cse117 (and (or (and (or .cse182 (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse183))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse179)) .cse180 .cse181)) .cse159) (or .cse155 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse179)) .cse180 .cse181) (or .cse182 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse183)))) .cse157))) (or .cse118 .cse120 (and (or .cse162 .cse163 (and (or .cse180 .cse181 (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse179))) (or .cse182 (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse183))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse179)) .cse180 .cse181) (or .cse182 (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse183)))) .cse161)) .cse165)) .cse108 .cse110) (or .cse105 (and (or .cse118 (and (or (and (or .cse186 (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse187)) .cse188) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse184)) .cse185)) .cse162 .cse163) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse187)) .cse186 .cse188) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse184)) .cse185)) .cse161)) .cse120 .cse165) (or .cse154 .cse117 (and (or (and (or .cse186 (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse187)) .cse188) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse184)) .cse185)) .cse159) (or .cse155 (and (or .cse186 .cse188 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse187))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse184)) .cse185)) .cse157)))))) .cse77))))))) (.cse24 (or .cse76 (let ((.cse173 (+ .cse178 .cse126)) (.cse174 (+ .cse178 .cse127))) (and (or .cse96 .cse77 (and (or .cse117 (and (or .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse173))) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse174)) .cse110))) (or (and (or .cse108 .cse110 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse174))) (or .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse173)))) .cse118 .cse120))) (or .cse78 (and (or .cse125 (and (or .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse173))) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse174)) .cse110))) (or .cse121 (and (or .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse173))) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse174)) .cse110)) .cse122)) .cse111 .cse81))))) (.cse50 (or .cse73 (let ((.cse171 (+ .cse104 1))) (let ((.cse166 (< .cse98 0)) (.cse137 (= 0 (mod .cse171 2))) (.cse167 (- (div .cse171 2))) (.cse152 (= 0 (mod .cse104 2))) (.cse169 (- (div .cse170 4))) (.cse168 (< .cse104 0))) (let ((.cse151 (not .cse168)) (.cse153 (+ .cse100 (+ (- 1) .cse169))) (.cse149 (+ .cse100 .cse169)) (.cse150 (and .cse168 (not .cse152))) (.cse138 (+ .cse100 .cse167)) (.cse139 (and .cse166 (not .cse137))) (.cse136 (+ .cse100 (+ (- 1) .cse167))) (.cse134 (not .cse166))) (and (or (and (or .cse101 .cse102 (and (or .cse121 .cse132 .cse122 (and (or .cse133 (and (or .cse134 (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse136)) .cse137) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse138)) .cse139)) .cse140) (or (and (or .cse134 (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse136)) .cse137) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse138)) .cse139)) .cse142))) (or .cse143 .cse125 (and (or .cse144 .cse145 (and (or .cse134 (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse136)) .cse137) (or .cse139 (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse138))))) (or .cse147 (and (or .cse134 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse136)) .cse137) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse138)) .cse139))))))) (or .cse103 (and (or .cse143 .cse125 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse149)) .cse150) (or .cse151 .cse152 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse153)))) .cse147) (or .cse144 (and (or .cse151 .cse152 (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse153))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse149)) .cse150)) .cse145))) (or .cse121 .cse132 .cse122 (and (or .cse133 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse149)) .cse150) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse153)) .cse151 .cse152)) .cse140) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse149)) .cse150) (or .cse151 .cse152 (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse153)))) .cse142)))))) .cse78 .cse81) (or (and (or .cse103 (and (or .cse154 .cse117 (and (or .cse155 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse153)) .cse151 .cse152) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse149)) .cse150)) .cse157) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse149)) .cse150) (or .cse151 .cse152 (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse153)))) .cse159))) (or (and (or (and (or .cse150 (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse149))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse153)) .cse151 .cse152)) .cse161) (or .cse162 .cse163 (and (or .cse151 .cse152 (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse153))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse149)) .cse150)))) .cse118 .cse120 .cse165))) (or .cse101 .cse102 (and (or (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse138)) .cse139) (or .cse134 (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse136)) .cse137)) .cse159) (or (and (or .cse134 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse136)) .cse137) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse138)) .cse139)) .cse155 .cse157)) .cse154 .cse117) (or .cse118 (and (or (and (or .cse139 (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse138))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse136)) .cse134 .cse137)) .cse161) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse138)) .cse139) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse136)) .cse134 .cse137)) .cse162 .cse163)) .cse120 .cse165)))) .cse77))))) .cse74)) (.cse51 (or .cse73 (let ((.cse129 (+ |ULTIMATE.start_main_~r~0#1| .cse131)) (.cse128 (+ |ULTIMATE.start_main_~r~0#1| .cse130))) (and (or .cse96 (and (or .cse118 (and (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse119 .cse128))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse119 .cse129)) .cse101 .cse102)) .cse120) (or .cse117 (and (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse114 .cse128))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse114 .cse129)) .cse101 .cse102)))) .cse77) (or .cse78 (and (or .cse125 (and (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse124 .cse128))) (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse124 .cse129)) .cse102))) (or .cse121 (and (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse129))) (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse128)))) .cse122)) .cse111 .cse81))) .cse74)) (.cse52 (or (let ((.cse115 (+ |ULTIMATE.start_main_~r~0#1| .cse127)) (.cse116 (+ |ULTIMATE.start_main_~r~0#1| .cse126))) (and (or .cse96 (and (or (and (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse114 .cse115)) .cse110) (or .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse114 .cse116)))) .cse117) (or .cse118 (and (or .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse119 .cse116))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse119 .cse115)) .cse108 .cse110)) .cse120)) .cse77) (or .cse78 .cse111 (and (or .cse121 .cse122 (and (or .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse116))) (or .cse108 .cse110 (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse115))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse124 .cse115)) .cse108 .cse110) (or .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse124 .cse116)))) .cse125)) .cse81))) .cse76)) (.cse68 (or (and (or .cse76 (and (or .cse108 .cse110 (= |ULTIMATE.start_main_~B~0#1| .cse109)) (or .cse105 (= |ULTIMATE.start_main_~B~0#1| .cse106)))) (or .cse73 (and (or .cse103 (= |ULTIMATE.start_main_~B~0#1| .cse104)) (or (= |ULTIMATE.start_main_~B~0#1| .cse98) .cse101 .cse102)) .cse74)) (and (or .cse78 .cse81 .cse113) (or .cse97 .cse77)))) (.cse56 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse69 (let ((.cse92 (or .cse78 .cse111 (and (or .cse76 (and (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse109 .cse112) .cse107)) .cse110) (or .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse106 .cse112) .cse107))))) (or .cse73 (and (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse98 .cse112) .cse100))) (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse104 .cse112) .cse100)))) .cse74)) .cse81 .cse113)) (.cse93 (or .cse96 .cse97 (and (or .cse73 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse98 .cse99) .cse100)) .cse101 .cse102) (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse104 .cse99) .cse100)))) .cse74) (or .cse76 (and (or .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse106 .cse99) .cse107))) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse109 .cse99) .cse107)) .cse110)))) .cse77))) (or (and .cse34 .cse92 .cse27 .cse30 .cse21 .cse93 .cse94 .cse67 .cse35 .cse32 .cse3 .cse39 .cse0 .cse28 .cse29 .cse95 .cse42 .cse43 .cse9 .cse44) (and .cse34 .cse92 .cse27 .cse30 .cse21 .cse93 .cse94 .cse35 .cse32 .cse3 .cse39 .cse0 .cse8 .cse28 .cse29 .cse95 .cse42 .cse43 .cse9 .cse44)))) (.cse1 (or (= 1 .cse88) (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse88)) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ (+ |ULTIMATE.start_main_~r~0#1| (- (* 2 .cse91))) .cse38))))) (.cse22 (or (let ((.cse90 (- (div .cse91 4)))) (let ((.cse84 (+ .cse89 (+ (- 1) .cse90))) (.cse83 (+ .cse89 .cse90)) (.cse86 (div .cse88 4))) (and (or .cse77 (let ((.cse82 (* (+ .cse85 .cse86) |ULTIMATE.start_main_~B~0#1|))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse82 .cse83)) .cse76) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse82 .cse84)) .cse73 .cse74)))) (or .cse78 (let ((.cse87 (* (+ .cse85 (+ 1 .cse86)) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse73 (= |ULTIMATE.start_main_~A~0#1| (+ .cse87 .cse84)) .cse74) (or .cse76 (= |ULTIMATE.start_main_~A~0#1| (+ .cse87 .cse83))))) .cse81)))) .cse71)) (.cse18 (or .cse3 (and (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse3))) (.cse23 (or .cse71 (and (or (and (or .cse72 .cse73 .cse74) (or .cse75 .cse76)) .cse77) (or .cse78 (and (or .cse79 .cse76) (or .cse80 .cse73 .cse74)) .cse81)))) (.cse4 (= |ULTIMATE.start_main_~d~0#1| (* 1 |ULTIMATE.start_main_~p~0#1|))) (.cse5 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| 1) |ULTIMATE.start_main_~r~0#1|))) (.cse19 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse20 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse36 (- |ULTIMATE.start_main_~B~0#1|)) (.cse11 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse38))) (.cse10 (= .cse40 0)) (.cse37 (= |ULTIMATE.start_main_~d~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse2 .cse12 .cse3 .cse13 .cse14) (and .cse7 .cse15 .cse16 .cse2 .cse12 .cse17 .cse14) (and .cse2 .cse18 .cse3 .cse4 .cse5) (and .cse19 .cse15 .cse20 .cse16 .cse2) (and .cse15 .cse19 .cse20 .cse16 .cse2) (and .cse0 .cse8 .cse21 .cse1 .cse9 .cse22 .cse2 .cse23 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse21 .cse1 .cse9 .cse22 .cse2 .cse18 .cse23 .cse3 .cse4 .cse5) (and .cse0 .cse24 .cse25 .cse1 .cse22 .cse2 .cse23 .cse3 .cse4 .cse5) (and .cse26 .cse27 .cse28 .cse29 .cse30 .cse15 .cse9 .cse16 .cse2 (= |ULTIMATE.start_main_~d~0#1| .cse31) .cse32 .cse33) (and .cse34 .cse21 .cse19 .cse35 .cse2 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~B~0#1| (- 2))) .cse36)) .cse37 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (- 2)) .cse38)) .cse39 .cse0 (= (+ .cse40 .cse41) 0) .cse42 .cse43 .cse20 .cse44 (= (+ |ULTIMATE.start_main_~q~0#1| (- 2)) 1)) (and .cse45 (>= |ULTIMATE.start_main_~r~0#1| (+ .cse46 .cse38)) .cse21 .cse47 .cse25 .cse2 .cse23 .cse48 .cse49 .cse3 .cse4 .cse5 .cse0 .cse8 (>= .cse46 |ULTIMATE.start_main_~d~0#1|) .cse24 .cse50 .cse1 (<= 4 .cse40) .cse9 .cse22 .cse51 .cse52) (let ((.cse54 (+ .cse55 (- 1)))) (and (<= .cse53 .cse54) (<= .cse53 .cse46) .cse25 .cse19 (= |ULTIMATE.start_main_~r~0#1| (+ .cse46 .cse36)) .cse2 .cse23 .cse48 .cse0 .cse24 .cse50 .cse1 .cse20 .cse22 (= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 1) .cse51 (<= .cse40 4) (<= |ULTIMATE.start_main_~d~0#1| .cse54) (<= |ULTIMATE.start_main_~d~0#1| .cse46) .cse52)) (and .cse45 (>= |ULTIMATE.start_main_~r~0#1| (+ .cse46 (- .cse55))) (<= 4 (+ |ULTIMATE.start_main_~q~0#1| (* 2 (- 1)))) .cse25 .cse19 (>= .cse46 .cse55) .cse2 .cse23 .cse56 .cse3 .cse0 .cse24 .cse1 .cse20 .cse22 .cse18) (let ((.cse57 (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~r~0#1| (- 1))))) (and (= .cse57 .cse58) .cse19 .cse2 .cse18 (let ((.cse61 (= 0 (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2))) (.cse59 (div (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~r~0#1|)) 2)) (.cse60 (< .cse57 0))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse59) (or (not .cse60) .cse61)) (and (not .cse61) (= |ULTIMATE.start_main_~d~0#1| (+ 1 .cse59)) .cse60))) (= (+ |ULTIMATE.start_main_~q~0#1| .cse41) 0))) (and .cse0 .cse1 .cse22 .cse2 .cse23 .cse3 .cse4 .cse5) (and .cse2 .cse4 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse5) (and .cse21 .cse47 .cse2 .cse56 .cse49 .cse3 .cse0 .cse8 (<= .cse62 |ULTIMATE.start_main_~A~0#1|) .cse63 (<= |ULTIMATE.start_main_~q~0#1| (+ 0 .cse31)) .cse64 .cse9 .cse18) (and .cse63 .cse19 .cse64 .cse20 .cse2 .cse18 .cse3) (let ((.cse65 (+ 0 |ULTIMATE.start_main_~p~0#1|))) (and .cse45 (>= |ULTIMATE.start_main_~q~0#1| .cse65) (<= |ULTIMATE.start_main_~q~0#1| .cse65) .cse10 .cse2 .cse11 .cse4 .cse3 .cse66 (= |ULTIMATE.start_main_~p~0#1| 4) .cse33 .cse5 .cse26 .cse29 (<= .cse53 |ULTIMATE.start_main_~A~0#1|) .cse9 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) .cse13)) (and .cse25 .cse2 .cse23 .cse3 .cse4 .cse66 .cse5 .cse0 .cse24 .cse29 .cse1 .cse9 .cse22) (and .cse67 .cse25 .cse15 .cse68 .cse2 .cse23 .cse48 .cse3 .cse4 .cse69 .cse5 .cse0 .cse24 .cse29 .cse50 .cse1 .cse9 .cse22 .cse51 .cse52) (and (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) .cse67 .cse15 .cse68 .cse16 .cse2 .cse56 .cse4 .cse3 .cse69 (= |ULTIMATE.start_main_~p~0#1| (* 2 .cse31)) .cse5 .cse29 (= |ULTIMATE.start_main_~d~0#1| .cse70) .cse9) (and .cse0 .cse1 .cse22 .cse2 .cse18 .cse23 .cse3 .cse4 .cse5) (and .cse0 .cse43 .cse19 .cse35 .cse20 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse36)) .cse2 .cse11 .cse10 (= (+ |ULTIMATE.start_main_~q~0#1| (* 1 (- 1))) 0) .cse37)))))))))) [2023-02-18 18:27:12,965 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2023-02-18 18:27:12,967 INFO L895 garLoopResultBuilder]: At program point L44-1(lines 44 56) the Hoare annotation is: (let ((.cse197 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse217 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse218 (+ 1 .cse217)) (.cse212 (- .cse197))) (let ((.cse216 (+ (- 1) .cse212)) (.cse180 (+ |ULTIMATE.start_main_~q~0#1| .cse218)) (.cse175 (+ |ULTIMATE.start_main_~q~0#1| .cse217))) (let ((.cse94 (- |ULTIMATE.start_main_~d~0#1|)) (.cse73 (= 0 (mod |ULTIMATE.start_main_~d~0#1| 2))) (.cse228 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse62 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse156 (+ |ULTIMATE.start_main_~r~0#1| .cse212)) (.cse227 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse230 (* .cse175 |ULTIMATE.start_main_~B~0#1|)) (.cse229 (* .cse180 |ULTIMATE.start_main_~B~0#1|)) (.cse130 (+ |ULTIMATE.start_main_~r~0#1| .cse216)) (.cse185 (+ .cse217 1))) (let ((.cse172 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse171 (div .cse185 2)) (.cse135 (+ .cse197 1)) (.cse50 (= 1 .cse217)) (.cse63 (= 1 .cse218)) (.cse196 (+ 1 .cse197)) (.cse166 (= |ULTIMATE.start_main_~A~0#1| (+ .cse229 .cse130))) (.cse163 (= |ULTIMATE.start_main_~A~0#1| (+ .cse230 .cse130))) (.cse81 (not .cse227)) (.cse164 (= |ULTIMATE.start_main_~A~0#1| (+ .cse230 .cse156))) (.cse61 (and .cse228 (not .cse62))) (.cse165 (= |ULTIMATE.start_main_~A~0#1| (+ .cse229 .cse156))) (.cse69 (not .cse228)) (.cse72 (and .cse227 (not .cse73))) (.cse169 (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse144 (+ |ULTIMATE.start_main_~r~0#1| .cse94)) (.cse92 (= 1 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse221 (not (= 0 |ULTIMATE.start_main_~q~0#1|))) (.cse187 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse222 (not .cse92)) (.cse40 (- |ULTIMATE.start_main_~B~0#1|)) (.cse8 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse43 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse169 |ULTIMATE.start_main_~B~0#1|) .cse144))) (.cse192 (or (and (or .cse164 .cse61) (or .cse62 .cse165 .cse69)) .cse72)) (.cse193 (or (and (or .cse62 .cse166 .cse69) (or .cse163 .cse61)) .cse73 .cse81)) (.cse14 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse18 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse194 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse196 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse73 .cse81) (or .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse197 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))))) (.cse195 (and (or .cse61 (not .cse50)) (or .cse62 (not .cse63) .cse69))) (.cse162 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse134 (div .cse135 2)) (.cse64 (= 0 (mod .cse185 2))) (.cse225 (< .cse218 0)) (.cse170 (+ 1 .cse171)) (.cse173 (+ 1 .cse172)) (.cse226 (< .cse217 0)) (.cse58 (= 0 (mod .cse217 2)))) (let ((.cse57 (and .cse226 (not .cse58))) (.cse117 (= 1 .cse172)) (.cse60 (not .cse226)) (.cse128 (= 1 .cse173)) (.cse95 (= 1 .cse170)) (.cse65 (not .cse225)) (.cse106 (= 1 .cse171)) (.cse68 (and .cse225 (not .cse64))) (.cse78 (= 0 (mod .cse135 2))) (.cse223 (< .cse196 0)) (.cse54 (= 0 (mod .cse197 2))) (.cse224 (< .cse197 0)) (.cse91 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse88 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse79 (- .cse134)) (.cse70 (- .cse162)) (.cse188 (or .cse194 .cse195)) (.cse0 (or (and (or .cse73 (= |ULTIMATE.start_main_~B~0#1| .cse196) .cse81) (or .cse72 (= |ULTIMATE.start_main_~B~0#1| .cse197))) .cse195)) (.cse190 (or (and .cse43 .cse192 .cse193 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse40)) .cse8 .cse14 (= (+ |ULTIMATE.start_main_~q~0#1| (* 1 (- 1))) 0) .cse18) (and .cse43 .cse14 .cse18) (and .cse43 .cse192 .cse193 .cse14 .cse18))) (.cse191 (or .cse221 .cse187 .cse222))) (let ((.cse4 (or (and .cse188 .cse0 .cse190 .cse191) (and .cse188 .cse0 .cse190 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse191))) (.cse71 (+ (- 1) .cse70)) (.cse80 (+ (- 1) .cse79)) (.cse34 (* 2 1)) (.cse93 (= 1 .cse88)) (.cse85 (+ |ULTIMATE.start_main_~q~0#1| .cse88)) (.cse89 (+ |ULTIMATE.start_main_~r~0#1| (- .cse91))) (.cse51 (not .cse224)) (.cse161 (+ 1 .cse162)) (.cse55 (and (not .cse54) .cse224)) (.cse74 (and (not .cse78) .cse223)) (.cse137 (+ 1 .cse134)) (.cse77 (not .cse223)) (.cse220 (and (or .cse64 (not .cse95) .cse65) (or (not .cse106) .cse68))) (.cse219 (and (or .cse57 (not .cse117)) (or .cse58 .cse60 (not .cse128))))) (let ((.cse22 (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~B~0#1| (- 4)))) (.cse2 (or (and (or .cse72 (and (or .cse51 .cse54 (= |ULTIMATE.start_main_~B~0#1| .cse161)) (or .cse55 (= |ULTIMATE.start_main_~B~0#1| .cse162)))) (or .cse73 (and (or .cse74 (= |ULTIMATE.start_main_~B~0#1| .cse134)) (or (= |ULTIMATE.start_main_~B~0#1| .cse137) .cse77 .cse78)) .cse81)) (and (or .cse62 .cse69 .cse220) (or .cse219 .cse61)))) (.cse3 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse31 (or .cse221 .cse93 .cse222 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| .cse85) .cse89)))) (.cse27 (* 2 .cse91)) (.cse6 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse12 (* .cse34 (- 1))) (.cse28 (or .cse62 .cse63 (and (or .cse72 (and (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse161 .cse180) .cse156)) .cse54) (or .cse55 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse162 .cse180) .cse156))))) (or .cse73 (and (or .cse77 .cse78 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse137 .cse180) .cse130))) (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse134 .cse180) .cse130)))) .cse81)) .cse69 .cse220)) (.cse29 (or .cse50 .cse219 (and (or .cse73 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse137 .cse175) .cse130)) .cse77 .cse78) (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse134 .cse175) .cse130)))) .cse81) (or .cse72 (and (or .cse55 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse162 .cse175) .cse156))) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse161 .cse175) .cse156)) .cse54)))) .cse61)) (.cse32 (let ((.cse203 (* (+ .cse180 .cse171) |ULTIMATE.start_main_~B~0#1|)) (.cse205 (* (+ .cse180 .cse170) |ULTIMATE.start_main_~B~0#1|)) (.cse207 (* (+ .cse175 .cse173) |ULTIMATE.start_main_~B~0#1|)) (.cse208 (* (+ .cse175 .cse172) |ULTIMATE.start_main_~B~0#1|)) (.cse209 (* (+ .cse169 .cse218) |ULTIMATE.start_main_~B~0#1|)) (.cse211 (* (+ .cse169 .cse217) |ULTIMATE.start_main_~B~0#1|))) (let ((.cse198 (or (let ((.cse215 (+ .cse144 .cse216))) (and (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse209 .cse215)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse215)) .cse61))) .cse73 .cse81)) (.cse199 (or .cse73 (let ((.cse214 (+ .cse130 .cse80)) (.cse213 (+ .cse130 .cse79))) (and (or .cse62 (and (or .cse74 (and (or .cse68 (= |ULTIMATE.start_main_~A~0#1| (+ .cse203 .cse213))) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse205 .cse213)) .cse65))) (or .cse77 .cse78 (and (or .cse68 (= |ULTIMATE.start_main_~A~0#1| (+ .cse203 .cse214))) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse205 .cse214)) .cse65)))) .cse69) (or (and (or (and (or .cse57 (= |ULTIMATE.start_main_~A~0#1| (+ .cse208 .cse214))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse207 .cse214)) .cse58 .cse60)) .cse77 .cse78) (or .cse74 (and (or .cse58 .cse60 (= |ULTIMATE.start_main_~A~0#1| (+ .cse207 .cse213))) (or .cse57 (= |ULTIMATE.start_main_~A~0#1| (+ .cse208 .cse213)))))) .cse61))) .cse81)) (.cse201 (or .cse72 (let ((.cse210 (+ .cse144 .cse212))) (and (or .cse62 .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse209 .cse210))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse210)) .cse61))))) (.cse202 (or .cse72 (let ((.cse204 (+ .cse156 .cse70)) (.cse206 (+ .cse156 .cse71))) (and (or .cse62 (and (or .cse55 (and (or .cse68 (= |ULTIMATE.start_main_~A~0#1| (+ .cse203 .cse204))) (or .cse64 .cse65 (= |ULTIMATE.start_main_~A~0#1| (+ .cse205 .cse204))))) (or .cse51 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse205 .cse206)) .cse65) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse203 .cse206)) .cse68)) .cse54)) .cse69) (or .cse61 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse207 .cse204)) .cse58 .cse60) (or .cse57 (= |ULTIMATE.start_main_~A~0#1| (+ .cse208 .cse204)))) .cse55) (or (and (or .cse58 .cse60 (= |ULTIMATE.start_main_~A~0#1| (+ .cse207 .cse206))) (or .cse57 (= |ULTIMATE.start_main_~A~0#1| (+ .cse208 .cse206)))) .cse51 .cse54))))))) (.cse200 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse85 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse89 .cse94))))) (or (and .cse4 .cse198 .cse199 .cse43 .cse200 .cse201 .cse192 .cse193 .cse202 .cse14) (and .cse4 .cse198 .cse199 .cse43 .cse200 .cse201 .cse192 .cse193 .cse8 .cse202 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~B~0#1| (- 2))) .cse40)) (= (+ |ULTIMATE.start_main_~q~0#1| (- 2)) 1)) (and .cse4 .cse43 .cse200 .cse14))))) (.cse33 (or (and (or .cse73 .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse196 .cse169) .cse144))) (or .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse197 .cse169) .cse144)))) .cse92 .cse195)) (.cse30 (or .cse92 .cse194 .cse195)) (.cse7 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse38 (+ |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~p~0#1| (- 1)))) (.cse26 (= |ULTIMATE.start_main_~d~0#1| 1)) (.cse15 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse17 (= |ULTIMATE.start_main_~q~0#1| 0))) (let ((.cse19 (let ((.cse189 (or (and .cse43 .cse15 .cse192 .cse193 .cse17 .cse8 .cse14 .cse18) (and .cse43 .cse15 .cse17 .cse8 .cse14 .cse18)))) (or (and .cse188 .cse187 .cse189) (and .cse190 .cse7 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse94)) (= .cse38 0) .cse26) (and .cse188 .cse191 .cse189) (and .cse188 .cse190 .cse187)))) (.cse1 (or (and (= (+ .cse38 .cse12) 0) .cse32 .cse7 .cse26 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (- 2)) .cse94))) (and .cse28 .cse29 .cse32 .cse33 .cse30 .cse187))) (.cse20 (* 2 .cse6)) (.cse21 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~d~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse13 (let ((.cse184 (+ .cse171 1)) (.cse186 (+ .cse172 1))) (let ((.cse174 (< .cse172 0)) (.cse118 (= 0 (mod .cse172 2))) (.cse176 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse126 (= 0 (mod .cse186 2))) (.cse177 (< .cse173 0)) (.cse178 (div .cse186 2)) (.cse179 (< .cse171 0)) (.cse107 (= 0 (mod .cse171 2))) (.cse181 (div .cse185 4)) (.cse103 (= 0 (mod .cse184 2))) (.cse183 (div .cse184 2)) (.cse182 (< .cse170 0))) (let ((.cse59 (* (+ |ULTIMATE.start_main_~q~0#1| .cse173) |ULTIMATE.start_main_~B~0#1|)) (.cse52 (* (+ |ULTIMATE.start_main_~q~0#1| .cse172) |ULTIMATE.start_main_~B~0#1|)) (.cse67 (* (+ |ULTIMATE.start_main_~q~0#1| .cse171) |ULTIMATE.start_main_~B~0#1|)) (.cse66 (* (+ |ULTIMATE.start_main_~q~0#1| .cse170) |ULTIMATE.start_main_~B~0#1|)) (.cse96 (not .cse182)) (.cse98 (* (+ .cse180 (+ 1 .cse183)) |ULTIMATE.start_main_~B~0#1|)) (.cse104 (* (+ .cse180 .cse183) |ULTIMATE.start_main_~B~0#1|)) (.cse105 (and .cse182 (not .cse103))) (.cse111 (* (+ .cse180 .cse181) |ULTIMATE.start_main_~B~0#1|)) (.cse110 (and .cse179 (not .cse107))) (.cse109 (* (+ .cse180 (+ 1 .cse181)) |ULTIMATE.start_main_~B~0#1|)) (.cse108 (not .cse179)) (.cse127 (* (+ .cse175 (+ 1 .cse178)) |ULTIMATE.start_main_~B~0#1|)) (.cse125 (not .cse177)) (.cse123 (* (+ .cse175 .cse178) |ULTIMATE.start_main_~B~0#1|)) (.cse124 (and (not .cse126) .cse177)) (.cse121 (* (+ .cse175 .cse176) |ULTIMATE.start_main_~B~0#1|)) (.cse122 (and .cse174 (not .cse118))) (.cse119 (* (+ .cse175 (+ 1 .cse176)) |ULTIMATE.start_main_~B~0#1|)) (.cse120 (not .cse174)) (.cse141 (* (+ .cse169 .cse173) |ULTIMATE.start_main_~B~0#1|)) (.cse138 (* (+ .cse169 .cse172) |ULTIMATE.start_main_~B~0#1|)) (.cse142 (* (+ .cse169 .cse171) |ULTIMATE.start_main_~B~0#1|)) (.cse143 (* (+ .cse169 .cse170) |ULTIMATE.start_main_~B~0#1|))) (let ((.cse39 (or (let ((.cse168 (+ .cse144 .cse79)) (.cse167 (+ .cse144 .cse80))) (and (or .cse50 (and (or .cse58 (and (or .cse77 (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse167)) .cse78) (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse168)))) .cse60) (or (and (or .cse77 .cse78 (= |ULTIMATE.start_main_~A~0#1| (+ .cse138 .cse167))) (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse138 .cse168)))) .cse57)) .cse61) (or .cse62 (and (or .cse68 (and (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse142 .cse168))) (or .cse77 (= |ULTIMATE.start_main_~A~0#1| (+ .cse142 .cse167)) .cse78))) (or .cse64 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse143 .cse168)) .cse74) (or .cse77 (= |ULTIMATE.start_main_~A~0#1| (+ .cse143 .cse167)) .cse78)) .cse65)) .cse63 .cse69))) .cse73 .cse81)) (.cse41 (or .cse92 (and (or (and (or .cse163 .cse73 .cse81) (or .cse164 .cse72)) .cse61) (or .cse62 (and (or .cse165 .cse72) (or .cse166 .cse73 .cse81)) .cse69)))) (.cse42 (or .cse72 (let ((.cse160 (+ .cse162 1))) (let ((.cse152 (= 0 (mod .cse162 2))) (.cse157 (- (div |ULTIMATE.start_main_~d~0#1| 8))) (.cse155 (< .cse162 0)) (.cse146 (= 0 (mod .cse160 2))) (.cse159 (< .cse161 0)) (.cse158 (- (div .cse160 2)))) (let ((.cse145 (+ .cse156 (+ (- 1) .cse158))) (.cse147 (not .cse159)) (.cse148 (and .cse159 (not .cse146))) (.cse149 (+ .cse156 .cse158)) (.cse154 (not .cse155)) (.cse153 (+ .cse156 (+ (- 1) .cse157))) (.cse150 (+ .cse156 .cse157)) (.cse151 (and .cse155 (not .cse152)))) (and (or (and (or .cse51 (and (or .cse64 .cse95 .cse65 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse145)) .cse146 .cse147) (or .cse148 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse149)))) .cse105) (or (and (or .cse146 (= |ULTIMATE.start_main_~A~0#1| (+ .cse98 .cse145)) .cse147) (or .cse148 (= |ULTIMATE.start_main_~A~0#1| (+ .cse98 .cse149)))) .cse96 .cse103))) (or .cse106 .cse68 (and (or .cse107 .cse108 (and (or .cse148 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse149))) (or .cse146 .cse147 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse145))))) (or (and (or .cse146 (= |ULTIMATE.start_main_~A~0#1| (+ .cse111 .cse145)) .cse147) (or .cse148 (= |ULTIMATE.start_main_~A~0#1| (+ .cse111 .cse149)))) .cse110)))) .cse54) (or .cse55 (and (or (and (or .cse96 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse98 .cse150)) .cse151) (or .cse152 (= |ULTIMATE.start_main_~A~0#1| (+ .cse98 .cse153)) .cse154)) .cse103) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse150)) .cse151) (or .cse152 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse153)) .cse154)) .cse105)) .cse64 .cse95 .cse65) (or .cse106 .cse68 (and (or (and (or .cse152 (= |ULTIMATE.start_main_~A~0#1| (+ .cse111 .cse153)) .cse154) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse111 .cse150)) .cse151)) .cse110) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse150)) .cse151) (or .cse152 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse153)) .cse154)) .cse107 .cse108)))))) .cse62 .cse69) (or (and (or (and (or .cse117 .cse57 (and (or (and (or .cse148 (= |ULTIMATE.start_main_~A~0#1| (+ .cse121 .cse149))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse121 .cse145)) .cse146 .cse147)) .cse122) (or .cse118 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse119 .cse145)) .cse146 .cse147) (or .cse148 (= |ULTIMATE.start_main_~A~0#1| (+ .cse119 .cse149)))) .cse120))) (or .cse58 .cse60 (and (or .cse125 .cse126 (and (or .cse146 .cse147 (= |ULTIMATE.start_main_~A~0#1| (+ .cse127 .cse145))) (or .cse148 (= |ULTIMATE.start_main_~A~0#1| (+ .cse127 .cse149))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse145)) .cse146 .cse147) (or .cse148 (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse149)))) .cse124)) .cse128)) .cse51 .cse54) (or .cse55 (and (or .cse58 (and (or (and (or .cse152 (= |ULTIMATE.start_main_~A~0#1| (+ .cse127 .cse153)) .cse154) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse127 .cse150)) .cse151)) .cse125 .cse126) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse153)) .cse152 .cse154) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse150)) .cse151)) .cse124)) .cse60 .cse128) (or .cse117 .cse57 (and (or (and (or .cse152 (= |ULTIMATE.start_main_~A~0#1| (+ .cse121 .cse153)) .cse154) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse121 .cse150)) .cse151)) .cse122) (or .cse118 (and (or .cse152 .cse154 (= |ULTIMATE.start_main_~A~0#1| (+ .cse119 .cse153))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse119 .cse150)) .cse151)) .cse120)))))) .cse61))))))) (.cse44 (or .cse72 (let ((.cse139 (+ .cse144 .cse70)) (.cse140 (+ .cse144 .cse71))) (and (or .cse50 .cse61 (and (or .cse57 (and (or .cse55 (= |ULTIMATE.start_main_~A~0#1| (+ .cse138 .cse139))) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse138 .cse140)) .cse54))) (or (and (or .cse51 .cse54 (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse140))) (or .cse55 (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse139)))) .cse58 .cse60))) (or .cse62 (and (or .cse68 (and (or .cse55 (= |ULTIMATE.start_main_~A~0#1| (+ .cse142 .cse139))) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse142 .cse140)) .cse54))) (or .cse64 (and (or .cse55 (= |ULTIMATE.start_main_~A~0#1| (+ .cse143 .cse139))) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse143 .cse140)) .cse54)) .cse65)) .cse63 .cse69))))) (.cse45 (or .cse73 (let ((.cse136 (+ .cse134 1))) (let ((.cse129 (< .cse137 0)) (.cse100 (= 0 (mod .cse136 2))) (.cse131 (- (div .cse136 2))) (.cse115 (= 0 (mod .cse134 2))) (.cse133 (- (div .cse135 4))) (.cse132 (< .cse134 0))) (let ((.cse114 (not .cse132)) (.cse116 (+ .cse130 (+ (- 1) .cse133))) (.cse112 (+ .cse130 .cse133)) (.cse113 (and .cse132 (not .cse115))) (.cse101 (+ .cse130 .cse131)) (.cse102 (and .cse129 (not .cse100))) (.cse99 (+ .cse130 (+ (- 1) .cse131))) (.cse97 (not .cse129))) (and (or (and (or .cse77 .cse78 (and (or .cse64 .cse95 .cse65 (and (or .cse96 (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse98 .cse99)) .cse100) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse98 .cse101)) .cse102)) .cse103) (or (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse99)) .cse100) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse101)) .cse102)) .cse105))) (or .cse106 .cse68 (and (or .cse107 .cse108 (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse99)) .cse100) (or .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse101))))) (or .cse110 (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse111 .cse99)) .cse100) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse111 .cse101)) .cse102))))))) (or .cse74 (and (or .cse106 .cse68 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse111 .cse112)) .cse113) (or .cse114 .cse115 (= |ULTIMATE.start_main_~A~0#1| (+ .cse111 .cse116)))) .cse110) (or .cse107 (and (or .cse114 .cse115 (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse116))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse109 .cse112)) .cse113)) .cse108))) (or .cse64 .cse95 .cse65 (and (or .cse96 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse98 .cse112)) .cse113) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse98 .cse116)) .cse114 .cse115)) .cse103) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse112)) .cse113) (or .cse114 .cse115 (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse116)))) .cse105)))))) .cse62 .cse69) (or (and (or .cse74 (and (or .cse117 .cse57 (and (or .cse118 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse119 .cse116)) .cse114 .cse115) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse119 .cse112)) .cse113)) .cse120) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse121 .cse112)) .cse113) (or .cse114 .cse115 (= |ULTIMATE.start_main_~A~0#1| (+ .cse121 .cse116)))) .cse122))) (or (and (or (and (or .cse113 (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse112))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse116)) .cse114 .cse115)) .cse124) (or .cse125 .cse126 (and (or .cse114 .cse115 (= |ULTIMATE.start_main_~A~0#1| (+ .cse127 .cse116))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse127 .cse112)) .cse113)))) .cse58 .cse60 .cse128))) (or .cse77 .cse78 (and (or (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse121 .cse101)) .cse102) (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse121 .cse99)) .cse100)) .cse122) (or (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse119 .cse99)) .cse100) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse119 .cse101)) .cse102)) .cse118 .cse120)) .cse117 .cse57) (or .cse58 (and (or (and (or .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse101))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse99)) .cse97 .cse100)) .cse124) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse127 .cse101)) .cse102) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse127 .cse99)) .cse97 .cse100)) .cse125 .cse126)) .cse60 .cse128)))) .cse61))))) .cse81)) (.cse46 (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse88)) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ (+ |ULTIMATE.start_main_~r~0#1| (- .cse27)) .cse94))))) (.cse47 (or (let ((.cse90 (- (div .cse91 4)))) (let ((.cse84 (+ .cse89 (+ (- 1) .cse90))) (.cse83 (+ .cse89 .cse90)) (.cse86 (div .cse88 4))) (and (or .cse61 (let ((.cse82 (* (+ .cse85 .cse86) |ULTIMATE.start_main_~B~0#1|))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse82 .cse83)) .cse72) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse82 .cse84)) .cse73 .cse81)))) (or .cse62 (let ((.cse87 (* (+ .cse85 (+ 1 .cse86)) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse73 (= |ULTIMATE.start_main_~A~0#1| (+ .cse87 .cse84)) .cse81) (or .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ .cse87 .cse83))))) .cse69)))) .cse92)) (.cse48 (or .cse73 (let ((.cse76 (+ |ULTIMATE.start_main_~r~0#1| .cse80)) (.cse75 (+ |ULTIMATE.start_main_~r~0#1| .cse79))) (and (or .cse50 (and (or .cse58 (and (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse59 .cse75))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse59 .cse76)) .cse77 .cse78)) .cse60) (or .cse57 (and (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse52 .cse75))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse52 .cse76)) .cse77 .cse78)))) .cse61) (or .cse62 (and (or .cse68 (and (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse75))) (or .cse77 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse76)) .cse78))) (or .cse64 (and (or .cse77 .cse78 (= |ULTIMATE.start_main_~A~0#1| (+ .cse66 .cse76))) (or .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ .cse66 .cse75)))) .cse65)) .cse63 .cse69))) .cse81)) (.cse49 (or (let ((.cse53 (+ |ULTIMATE.start_main_~r~0#1| .cse71)) (.cse56 (+ |ULTIMATE.start_main_~r~0#1| .cse70))) (and (or .cse50 (and (or (and (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse52 .cse53)) .cse54) (or .cse55 (= |ULTIMATE.start_main_~A~0#1| (+ .cse52 .cse56)))) .cse57) (or .cse58 (and (or .cse55 (= |ULTIMATE.start_main_~A~0#1| (+ .cse59 .cse56))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse59 .cse53)) .cse51 .cse54)) .cse60)) .cse61) (or .cse62 .cse63 (and (or .cse64 .cse65 (and (or .cse55 (= |ULTIMATE.start_main_~A~0#1| (+ .cse66 .cse56))) (or .cse51 .cse54 (= |ULTIMATE.start_main_~A~0#1| (+ .cse66 .cse53))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse53)) .cse51 .cse54) (or .cse55 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse56)))) .cse68)) .cse69))) .cse72))) (or (and .cse28 .cse29 .cse30 .cse39 .cse2 (= |ULTIMATE.start_main_~r~0#1| (+ .cse22 .cse40)) .cse8 .cse41 .cse42 .cse3 .cse43 .cse44 .cse31 .cse0 .cse32 .cse33 .cse45 .cse46 .cse47 (= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 1) .cse48 .cse49) (and .cse28 .cse29 .cse30 .cse39 .cse2 .cse41 .cse3 .cse14 .cse43 .cse44 .cse31 .cse0 .cse32 .cse33 .cse46 .cse47) (and .cse28 .cse29 .cse30 .cse2 .cse41 .cse3 .cse14 .cse43 .cse31 .cse0 .cse32 .cse33 .cse46 .cse47) (and .cse28 .cse29 .cse30 .cse39 .cse2 .cse41 .cse42 .cse3 .cse14 .cse43 .cse44 .cse31 .cse0 .cse32 .cse33 .cse45 .cse46 .cse47 .cse48 .cse49))))))) (.cse24 (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~d~0#1| (- 4)))) (.cse16 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse23 (* |ULTIMATE.start_main_~B~0#1| 2)) (.cse25 (* |ULTIMATE.start_main_~d~0#1| 2))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~r~0#1| (- 1))))) (and .cse4 (= .cse5 .cse6) .cse7 .cse8 (let ((.cse11 (= 0 (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2))) (.cse9 (div (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~r~0#1|)) 2)) (.cse10 (< .cse5 0))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse9) (or (not .cse10) .cse11)) (and (not .cse11) (= |ULTIMATE.start_main_~d~0#1| (+ 1 .cse9)) .cse10))) (= (+ |ULTIMATE.start_main_~q~0#1| .cse12) 0))) (and .cse13 (= |ULTIMATE.start_main_~d~0#1| (* 1 1)) .cse8 (= |ULTIMATE.start_main_~d~0#1| (* 1 |ULTIMATE.start_main_~p~0#1|)) .cse14 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse15 .cse7 .cse16 .cse17 .cse8 .cse18) (and .cse7 .cse15 .cse16 .cse17 .cse8) (and .cse19 .cse7 .cse16 .cse8) (and .cse19 .cse0 .cse3) (and .cse7 .cse1 .cse16 .cse8) (and (not (>= |ULTIMATE.start_main_~A~0#1| (* 2 .cse20))) .cse21 (>= |ULTIMATE.start_main_~r~0#1| (+ .cse22 (- .cse23))) .cse13 (<= 4 (+ |ULTIMATE.start_main_~q~0#1| (* 2 (- 1)))) .cse7 (>= .cse22 .cse23) .cse8 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (>= .cse24 .cse25) .cse26 .cse16 (not (>= |ULTIMATE.start_main_~A~0#1| (* 2 .cse27))) (>= |ULTIMATE.start_main_~r~0#1| (+ .cse24 (- .cse25)))) (and .cse28 .cse29 .cse30 .cse7 .cse2 .cse8 .cse3 .cse31 .cse0 .cse32 .cse33 (= (+ |ULTIMATE.start_main_~q~0#1| (* (* 2 .cse34) (- 1))) 0) (= (+ |ULTIMATE.start_main_~r~0#1| .cse20) |ULTIMATE.start_main_~A~0#1|) .cse16) (let ((.cse35 (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse37 (+ .cse25 (- 1))) (.cse36 (+ .cse23 (- 1)))) (and (<= .cse35 .cse36) .cse21 (<= .cse35 .cse22) .cse13 .cse7 .cse8 (<= |ULTIMATE.start_main_~d~0#1| .cse24) .cse26 (<= .cse35 .cse37) (<= .cse35 .cse24) .cse16 (<= |ULTIMATE.start_main_~d~0#1| .cse37) (<= .cse38 4) (<= |ULTIMATE.start_main_~d~0#1| .cse36) (<= |ULTIMATE.start_main_~d~0#1| .cse22)))))))))))))) [2023-02-18 18:27:12,968 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 61) the Hoare annotation is: true [2023-02-18 18:27:12,970 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse183 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse192 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse193 (+ 1 .cse192)) (.cse181 (- .cse183))) (let ((.cse191 (+ (- 1) .cse181)) (.cse146 (+ |ULTIMATE.start_main_~q~0#1| .cse193)) (.cse141 (+ |ULTIMATE.start_main_~q~0#1| .cse192)) (.cse197 (mod |ULTIMATE.start_main_~d~0#1| 2)) (.cse151 (+ .cse192 1))) (let ((.cse139 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse136 (div .cse151 2)) (.cse113 (+ .cse183 1)) (.cse39 (= 1 |ULTIMATE.start_main_~p~0#1|)) (.cse118 (- |ULTIMATE.start_main_~d~0#1|)) (.cse36 (= 0 .cse197)) (.cse203 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse25 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse83 (+ |ULTIMATE.start_main_~r~0#1| .cse181)) (.cse202 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse205 (* .cse141 |ULTIMATE.start_main_~B~0#1|)) (.cse204 (* .cse146 |ULTIMATE.start_main_~B~0#1|)) (.cse108 (+ |ULTIMATE.start_main_~r~0#1| .cse191))) (let ((.cse13 (= 1 .cse192)) (.cse31 (= 1 .cse193)) (.cse44 (= |ULTIMATE.start_main_~A~0#1| (+ .cse204 .cse108))) (.cse40 (= |ULTIMATE.start_main_~A~0#1| (+ .cse205 .cse108))) (.cse37 (not .cse202)) (.cse41 (= |ULTIMATE.start_main_~A~0#1| (+ .cse205 .cse83))) (.cse24 (and .cse203 (not .cse25))) (.cse43 (= |ULTIMATE.start_main_~A~0#1| (+ .cse204 .cse83))) (.cse32 (not .cse203)) (.cse42 (and .cse202 (not .cse36))) (.cse150 (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse33 (+ |ULTIMATE.start_main_~r~0#1| .cse118)) (.cse3 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse2 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse196 (not .cse39)) (.cse89 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse112 (div .cse113 2)) (.cse182 (+ 1 .cse183)) (.cse28 (= 0 (mod .cse151 2))) (.cse200 (< .cse193 0)) (.cse137 (+ 1 .cse136)) (.cse138 (+ 1 .cse139)) (.cse201 (< .cse192 0)) (.cse14 (= 0 (mod .cse192 2)))) (let ((.cse23 (and .cse201 (not .cse14))) (.cse70 (= 1 .cse139)) (.cse21 (not .cse201)) (.cse81 (= 1 .cse138)) (.cse46 (= 1 .cse137)) (.cse30 (not .cse200)) (.cse57 (= 1 .cse136)) (.cse26 (and .cse200 (not .cse28))) (.cse18 (= 0 (mod .cse113 2))) (.cse194 (< .cse182 0)) (.cse63 (= 0 (mod .cse183 2))) (.cse195 (< .cse183 0)) (.cse117 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse116 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse35 (- .cse112)) (.cse95 (- .cse89)) (.cse198 (div .cse118 (- 2))) (.cse171 (or .cse2 .cse196)) (.cse9 (or .cse3 (= (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~r~0#1|)) 0))) (.cse90 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse150 |ULTIMATE.start_main_~B~0#1|) .cse33))) (.cse10 (= 0 |ULTIMATE.start_main_~q~0#1|)) (.cse169 (or (and (or .cse41 .cse24) (or .cse25 .cse43 .cse32)) .cse42)) (.cse165 (or (and (or .cse25 .cse44 .cse32) (or .cse40 .cse24)) .cse36 .cse37)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse5 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse7 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse11 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse187 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse182 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse36 .cse37) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse183 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))))) (.cse184 (and (or .cse24 (not .cse13)) (or .cse25 (not .cse31) .cse32)))) (let ((.cse12 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse154 (let ((.cse199 (or .cse187 .cse184))) (or (and .cse9 .cse90 .cse171 .cse199 .cse10 .cse3 .cse169 .cse165 .cse4 .cse5 .cse7 .cse11) (and .cse9 .cse90 .cse199 .cse10 .cse2 .cse3 .cse169 .cse165 .cse4 .cse5 .cse7 .cse11)))) (.cse155 (<= 2 .cse198)) (.cse156 (>= |ULTIMATE.start_main_~r~0#1| .cse198)) (.cse158 (= .cse197 0)) (.cse96 (or (and (or .cse36 (= |ULTIMATE.start_main_~B~0#1| .cse182) .cse37) (or .cse42 (= |ULTIMATE.start_main_~B~0#1| .cse183))) .cse184)) (.cse119 (or .cse196 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse94 (+ (- 1) .cse95)) (.cse34 (+ (- 1) .cse35)) (.cse123 (+ |ULTIMATE.start_main_~q~0#1| .cse116)) (.cse126 (+ |ULTIMATE.start_main_~r~0#1| (- .cse117))) (.cse0 (* 2 1)) (.cse45 (not .cse195)) (.cse88 (+ 1 .cse89)) (.cse64 (and (not .cse63) .cse195)) (.cse19 (and (not .cse18) .cse194)) (.cse115 (+ 1 .cse112)) (.cse15 (not .cse194)) (.cse189 (and (or .cse28 (not .cse46) .cse30) (or (not .cse57) .cse26))) (.cse188 (and (or .cse23 (not .cse70)) (or .cse14 .cse21 (not .cse81))))) (let ((.cse1 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse38 (or (and (or .cse42 (and (or .cse45 .cse63 (= |ULTIMATE.start_main_~B~0#1| .cse88)) (or .cse64 (= |ULTIMATE.start_main_~B~0#1| .cse89)))) (or .cse36 (and (or .cse19 (= |ULTIMATE.start_main_~B~0#1| .cse112)) (or (= |ULTIMATE.start_main_~B~0#1| .cse115) .cse15 .cse18)) .cse37)) (and (or .cse25 .cse32 .cse189) (or .cse188 .cse24)))) (.cse6 (= |ULTIMATE.start_main_~d~0#1| (* 1 |ULTIMATE.start_main_~p~0#1|))) (.cse157 (* 2 .cse0)) (.cse8 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| 1) |ULTIMATE.start_main_~r~0#1|))) (.cse91 (let ((.cse172 (* (+ .cse146 .cse136) |ULTIMATE.start_main_~B~0#1|)) (.cse174 (* (+ .cse146 .cse137) |ULTIMATE.start_main_~B~0#1|)) (.cse176 (* (+ .cse141 .cse138) |ULTIMATE.start_main_~B~0#1|)) (.cse177 (* (+ .cse141 .cse139) |ULTIMATE.start_main_~B~0#1|)) (.cse178 (* (+ .cse150 .cse193) |ULTIMATE.start_main_~B~0#1|)) (.cse180 (* (+ .cse150 .cse192) |ULTIMATE.start_main_~B~0#1|))) (let ((.cse160 (or (let ((.cse190 (+ .cse33 .cse191))) (and (or .cse25 (= |ULTIMATE.start_main_~A~0#1| (+ .cse178 .cse190)) .cse32) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse180 .cse190)) .cse24))) .cse36 .cse37)) (.cse161 (or .cse25 .cse31 (and (or .cse42 (and (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse88 .cse146) .cse83)) .cse63) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse89 .cse146) .cse83))))) (or .cse36 (and (or .cse15 .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse115 .cse146) .cse108))) (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse112 .cse146) .cse108)))) .cse37)) .cse32 .cse189)) (.cse162 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse123 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse126 .cse118)))) (.cse163 (or .cse13 .cse188 (and (or .cse36 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse115 .cse141) .cse108)) .cse15 .cse18) (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse112 .cse141) .cse108)))) .cse37) (or .cse42 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse89 .cse141) .cse83))) (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse88 .cse141) .cse83)) .cse63)))) .cse24)) (.cse164 (or .cse39 .cse187 .cse184)) (.cse166 (or .cse36 (let ((.cse186 (+ .cse108 .cse34)) (.cse185 (+ .cse108 .cse35))) (and (or .cse25 (and (or .cse19 (and (or .cse26 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse185))) (or .cse28 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse185)) .cse30))) (or .cse15 .cse18 (and (or .cse26 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse186))) (or .cse28 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse186)) .cse30)))) .cse32) (or (and (or (and (or .cse23 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse186))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse186)) .cse14 .cse21)) .cse15 .cse18) (or .cse19 (and (or .cse14 .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse185))) (or .cse23 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse185)))))) .cse24))) .cse37)) (.cse167 (or (and (or .cse36 .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse182 .cse150) .cse33))) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse183 .cse150) .cse33)))) .cse39 .cse184)) (.cse168 (or .cse42 (let ((.cse179 (+ .cse33 .cse181))) (and (or .cse25 .cse32 (= |ULTIMATE.start_main_~A~0#1| (+ .cse178 .cse179))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse180 .cse179)) .cse24))))) (.cse170 (or .cse42 (let ((.cse173 (+ .cse83 .cse95)) (.cse175 (+ .cse83 .cse94))) (and (or .cse25 (and (or .cse64 (and (or .cse26 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse173))) (or .cse28 .cse30 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse173))))) (or .cse45 (and (or .cse28 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse175)) .cse30) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse175)) .cse26)) .cse63)) .cse32) (or .cse24 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse173)) .cse14 .cse21) (or .cse23 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse173)))) .cse64) (or (and (or .cse14 .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse175))) (or .cse23 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse175)))) .cse45 .cse63)))))))) (or (and .cse160 .cse161 .cse154 .cse155 .cse156 .cse162 .cse163 .cse164 .cse2 .cse165 .cse158 .cse7 .cse166 .cse90 .cse96 .cse167 .cse168 .cse169 .cse119 .cse170) (and .cse160 .cse161 .cse154 .cse155 .cse156 .cse162 .cse163 .cse164 .cse165 .cse158 .cse7 .cse166 .cse90 .cse171 .cse96 .cse167 .cse168 .cse169 .cse119 .cse170))))) (.cse159 (* 2 .cse12))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse9 .cse10 (= |ULTIMATE.start_main_~p~0#1| .cse0) .cse11 (= |ULTIMATE.start_main_~d~0#1| .cse12)) (let ((.cse152 (+ .cse136 1)) (.cse153 (+ .cse139 1))) (let ((.cse77 (= 0 (mod .cse153 2))) (.cse140 (< .cse138 0)) (.cse142 (div .cse153 2)) (.cse143 (< .cse139 0)) (.cse73 (= 0 (mod .cse139 2))) (.cse144 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse56 (= 0 (mod .cse152 2))) (.cse147 (div .cse152 2)) (.cse145 (< .cse137 0)) (.cse148 (< .cse136 0)) (.cse58 (= 0 (mod .cse136 2))) (.cse149 (div .cse151 4))) (let ((.cse22 (* (+ .cse150 .cse139) |ULTIMATE.start_main_~B~0#1|)) (.cse16 (* (+ .cse150 .cse138) |ULTIMATE.start_main_~B~0#1|)) (.cse27 (* (+ .cse150 .cse136) |ULTIMATE.start_main_~B~0#1|)) (.cse29 (* (+ .cse150 .cse137) |ULTIMATE.start_main_~B~0#1|)) (.cse61 (* (+ .cse146 .cse149) |ULTIMATE.start_main_~B~0#1|)) (.cse62 (and .cse148 (not .cse58))) (.cse60 (* (+ .cse146 (+ 1 .cse149)) |ULTIMATE.start_main_~B~0#1|)) (.cse59 (not .cse148)) (.cse55 (not .cse145)) (.cse54 (* (+ .cse146 (+ 1 .cse147)) |ULTIMATE.start_main_~B~0#1|)) (.cse47 (* (+ .cse146 .cse147) |ULTIMATE.start_main_~B~0#1|)) (.cse53 (and .cse145 (not .cse56))) (.cse71 (* (+ .cse141 .cse144) |ULTIMATE.start_main_~B~0#1|)) (.cse72 (and .cse143 (not .cse73))) (.cse74 (* (+ .cse141 (+ 1 .cse144)) |ULTIMATE.start_main_~B~0#1|)) (.cse75 (not .cse143)) (.cse79 (* (+ .cse141 .cse142) |ULTIMATE.start_main_~B~0#1|)) (.cse80 (and (not .cse77) .cse140)) (.cse78 (* (+ .cse141 (+ 1 .cse142)) |ULTIMATE.start_main_~B~0#1|)) (.cse76 (not .cse140)) (.cse131 (* (+ |ULTIMATE.start_main_~q~0#1| .cse139) |ULTIMATE.start_main_~B~0#1|)) (.cse128 (* (+ |ULTIMATE.start_main_~q~0#1| .cse138) |ULTIMATE.start_main_~B~0#1|)) (.cse133 (* (+ |ULTIMATE.start_main_~q~0#1| .cse137) |ULTIMATE.start_main_~B~0#1|)) (.cse132 (* (+ |ULTIMATE.start_main_~q~0#1| .cse136) |ULTIMATE.start_main_~B~0#1|))) (and .cse2 (or (let ((.cse20 (+ .cse33 .cse35)) (.cse17 (+ .cse33 .cse34))) (and (or .cse13 (and (or .cse14 (and (or .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse16 .cse17)) .cse18) (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse16 .cse20)))) .cse21) (or (and (or .cse15 .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ .cse22 .cse17))) (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse22 .cse20)))) .cse23)) .cse24) (or .cse25 (and (or .cse26 (and (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse27 .cse20))) (or .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse27 .cse17)) .cse18))) (or .cse28 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse29 .cse20)) .cse19) (or .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse29 .cse17)) .cse18)) .cse30)) .cse31 .cse32))) .cse36 .cse37) .cse3 .cse38 .cse5 (or .cse39 (and (or (and (or .cse40 .cse36 .cse37) (or .cse41 .cse42)) .cse24) (or .cse25 (and (or .cse43 .cse42) (or .cse44 .cse36 .cse37)) .cse32))) (or .cse42 (let ((.cse87 (+ .cse89 1))) (let ((.cse67 (= 0 (mod .cse89 2))) (.cse84 (- (div |ULTIMATE.start_main_~d~0#1| 8))) (.cse82 (< .cse89 0)) (.cse49 (= 0 (mod .cse87 2))) (.cse86 (< .cse88 0)) (.cse85 (- (div .cse87 2)))) (let ((.cse48 (+ .cse83 (+ (- 1) .cse85))) (.cse50 (not .cse86)) (.cse51 (and .cse86 (not .cse49))) (.cse52 (+ .cse83 .cse85)) (.cse69 (not .cse82)) (.cse68 (+ .cse83 (+ (- 1) .cse84))) (.cse65 (+ .cse83 .cse84)) (.cse66 (and .cse82 (not .cse67)))) (and (or (and (or .cse45 (and (or .cse28 .cse46 .cse30 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse48)) .cse49 .cse50) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse52)))) .cse53) (or (and (or .cse49 (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse48)) .cse50) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse52)))) .cse55 .cse56))) (or .cse57 .cse26 (and (or .cse58 .cse59 (and (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse52))) (or .cse49 .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse48))))) (or (and (or .cse49 (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse48)) .cse50) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse52)))) .cse62)))) .cse63) (or .cse64 (and (or (and (or .cse55 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse65)) .cse66) (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse68)) .cse69)) .cse56) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse65)) .cse66) (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse68)) .cse69)) .cse53)) .cse28 .cse46 .cse30) (or .cse57 .cse26 (and (or (and (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse65)) .cse66)) .cse62) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse65)) .cse66) (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse68)) .cse69)) .cse58 .cse59)))))) .cse25 .cse32) (or (and (or (and (or .cse70 .cse23 (and (or (and (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse52))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse48)) .cse49 .cse50)) .cse72) (or .cse73 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse48)) .cse49 .cse50) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse52)))) .cse75))) (or .cse14 .cse21 (and (or .cse76 .cse77 (and (or .cse49 .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse48))) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse52))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse48)) .cse49 .cse50) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse52)))) .cse80)) .cse81)) .cse45 .cse63) (or .cse64 (and (or .cse14 (and (or (and (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse65)) .cse66)) .cse76 .cse77) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse68)) .cse67 .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse65)) .cse66)) .cse80)) .cse21 .cse81) (or .cse70 .cse23 (and (or (and (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse65)) .cse66)) .cse72) (or .cse73 (and (or .cse67 .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse68))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse65)) .cse66)) .cse75)))))) .cse24)))))) .cse7 .cse6 .cse8 .cse90 .cse91 (or .cse42 (let ((.cse92 (+ .cse33 .cse95)) (.cse93 (+ .cse33 .cse94))) (and (or .cse13 .cse24 (and (or .cse23 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse22 .cse92))) (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse22 .cse93)) .cse63))) (or (and (or .cse45 .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse16 .cse93))) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse16 .cse92)))) .cse14 .cse21))) (or .cse25 (and (or .cse26 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse27 .cse92))) (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse27 .cse93)) .cse63))) (or .cse28 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse29 .cse92))) (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse29 .cse93)) .cse63)) .cse30)) .cse31 .cse32)))) .cse96 (or .cse36 (let ((.cse114 (+ .cse112 1))) (let ((.cse107 (< .cse115 0)) (.cse99 (= 0 (mod .cse114 2))) (.cse109 (- (div .cse114 2))) (.cse105 (= 0 (mod .cse112 2))) (.cse111 (- (div .cse113 4))) (.cse110 (< .cse112 0))) (let ((.cse104 (not .cse110)) (.cse106 (+ .cse108 (+ (- 1) .cse111))) (.cse102 (+ .cse108 .cse111)) (.cse103 (and .cse110 (not .cse105))) (.cse100 (+ .cse108 .cse109)) (.cse101 (and .cse107 (not .cse99))) (.cse98 (+ .cse108 (+ (- 1) .cse109))) (.cse97 (not .cse107))) (and (or (and (or .cse15 .cse18 (and (or .cse28 .cse46 .cse30 (and (or .cse55 (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse98)) .cse99) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse100)) .cse101)) .cse56) (or (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse98)) .cse99) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse100)) .cse101)) .cse53))) (or .cse57 .cse26 (and (or .cse58 .cse59 (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse98)) .cse99) (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse100))))) (or .cse62 (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse98)) .cse99) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse100)) .cse101))))))) (or .cse19 (and (or .cse57 .cse26 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse102)) .cse103) (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse106)))) .cse62) (or .cse58 (and (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse106))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse102)) .cse103)) .cse59))) (or .cse28 .cse46 .cse30 (and (or .cse55 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse102)) .cse103) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse106)) .cse104 .cse105)) .cse56) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse102)) .cse103) (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse106)))) .cse53)))))) .cse25 .cse32) (or (and (or .cse19 (and (or .cse70 .cse23 (and (or .cse73 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse106)) .cse104 .cse105) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse102)) .cse103)) .cse75) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse102)) .cse103) (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse106)))) .cse72))) (or (and (or (and (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse102))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse106)) .cse104 .cse105)) .cse80) (or .cse76 .cse77 (and (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse106))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse102)) .cse103)))) .cse14 .cse21 .cse81))) (or .cse15 .cse18 (and (or (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse100)) .cse101) (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse98)) .cse99)) .cse72) (or (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse98)) .cse99) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse100)) .cse101)) .cse73 .cse75)) .cse70 .cse23) (or .cse14 (and (or (and (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse100))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse98)) .cse97 .cse99)) .cse80) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse100)) .cse101) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse98)) .cse97 .cse99)) .cse76 .cse77)) .cse21 .cse81)))) .cse24))))) .cse37) (or (= 1 .cse116) (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse116)) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ (+ |ULTIMATE.start_main_~r~0#1| (- (* 2 .cse117))) .cse118)))) .cse119 (or (let ((.cse127 (- (div .cse117 4)))) (let ((.cse122 (+ .cse126 (+ (- 1) .cse127))) (.cse121 (+ .cse126 .cse127)) (.cse124 (div .cse116 4))) (and (or .cse24 (let ((.cse120 (* (+ .cse123 .cse124) |ULTIMATE.start_main_~B~0#1|))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse120 .cse121)) .cse42) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse120 .cse122)) .cse36 .cse37)))) (or .cse25 (let ((.cse125 (* (+ .cse123 (+ 1 .cse124)) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse125 .cse122)) .cse37) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse125 .cse121))))) .cse32)))) .cse39) (or .cse36 (let ((.cse130 (+ |ULTIMATE.start_main_~r~0#1| .cse34)) (.cse129 (+ |ULTIMATE.start_main_~r~0#1| .cse35))) (and (or .cse13 (and (or .cse14 (and (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse129))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse130)) .cse15 .cse18)) .cse21) (or .cse23 (and (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse129))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse130)) .cse15 .cse18)))) .cse24) (or .cse25 (and (or .cse26 (and (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse132 .cse129))) (or .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse132 .cse130)) .cse18))) (or .cse28 (and (or .cse15 .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse130))) (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse129)))) .cse30)) .cse31 .cse32))) .cse37) (or (let ((.cse134 (+ |ULTIMATE.start_main_~r~0#1| .cse94)) (.cse135 (+ |ULTIMATE.start_main_~r~0#1| .cse95))) (and (or .cse13 (and (or (and (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse134)) .cse63) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse135)))) .cse23) (or .cse14 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse135))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse134)) .cse45 .cse63)) .cse21)) .cse24) (or .cse25 .cse31 (and (or .cse28 .cse30 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse135))) (or .cse45 .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse134))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse132 .cse134)) .cse45 .cse63) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse132 .cse135)))) .cse26)) .cse32))) .cse42))))) (and .cse1 (= |ULTIMATE.start_main_~p~0#1| 1) .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~d~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~d~0#1| (* 1 1)) (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (<= 1 |ULTIMATE.start_main_~d~0#1|)) (and .cse154 .cse1 .cse155 .cse156 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~d~0#1| .cse157) .cse158 .cse6 .cse7 (= |ULTIMATE.start_main_~p~0#1| .cse157) .cse8 (= |ULTIMATE.start_main_~d~0#1| .cse159) .cse96 .cse119) (and .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~p~0#1| (* 2 .cse157)) .cse8 .cse91 .cse96 (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse159)) .cse119)))))))))) [2023-02-18 18:27:12,970 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 18:27:12,971 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 18:27:12,973 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (let ((.cse209 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse240 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse241 (+ 1 .cse240)) (.cse202 (- .cse209))) (let ((.cse170 (+ .cse209 1)) (.cse206 (+ (- 1) .cse202)) (.cse112 (+ |ULTIMATE.start_main_~q~0#1| .cse241)) (.cse99 (+ |ULTIMATE.start_main_~q~0#1| .cse240)) (.cse231 (mod |ULTIMATE.start_main_~d~0#1| 2)) (.cse238 (+ .cse240 1))) (let ((.cse212 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse211 (div .cse238 2)) (.cse106 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse38 (- |ULTIMATE.start_main_~d~0#1|)) (.cse71 (= 1 |ULTIMATE.start_main_~p~0#1|)) (.cse73 (= 0 .cse231)) (.cse243 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse78 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse107 (+ |ULTIMATE.start_main_~r~0#1| .cse202)) (.cse242 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse245 (* .cse99 |ULTIMATE.start_main_~B~0#1|)) (.cse244 (* .cse112 |ULTIMATE.start_main_~B~0#1|)) (.cse100 (+ |ULTIMATE.start_main_~r~0#1| .cse206)) (.cse207 (+ 1 .cse209)) (.cse104 (div .cse170 2))) (let ((.cse130 (- .cse104)) (.cse118 (= 0 (mod .cse240 2))) (.cse233 (< .cse240 0)) (.cse102 (= 0 (mod .cse170 2))) (.cse234 (< .cse207 0)) (.cse235 (< .cse241 0)) (.cse121 (= 0 (mod .cse238 2))) (.cse96 (= 1 .cse240)) (.cse111 (= 1 .cse241)) (.cse80 (= |ULTIMATE.start_main_~A~0#1| (+ .cse244 .cse100))) (.cse72 (= |ULTIMATE.start_main_~A~0#1| (+ .cse245 .cse100))) (.cse74 (not .cse242)) (.cse75 (= |ULTIMATE.start_main_~A~0#1| (+ .cse245 .cse107))) (.cse77 (and .cse243 (not .cse78))) (.cse79 (= |ULTIMATE.start_main_~A~0#1| (+ .cse244 .cse107))) (.cse81 (not .cse243)) (.cse76 (and .cse242 (not .cse73))) (.cse67 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse198 (not .cse71)) (.cse178 (+ |ULTIMATE.start_main_~r~0#1| .cse38)) (.cse126 (- .cse106)) (.cse110 (= 0 (mod .cse209 2))) (.cse236 (< .cse209 0)) (.cse210 (+ 1 .cse211)) (.cse237 (+ .cse211 1)) (.cse213 (+ 1 .cse212)) (.cse239 (+ .cse212 1)) (.cse208 (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse91 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse88 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse58 (* 2 |ULTIMATE.start_main_~B~0#1|))) (let ((.cse197 (* 2 1)) (.cse196 (* 2 .cse58)) (.cse85 (+ |ULTIMATE.start_main_~q~0#1| .cse88)) (.cse89 (+ |ULTIMATE.start_main_~r~0#1| (- .cse91))) (.cse199 (* (+ .cse208 .cse241) |ULTIMATE.start_main_~B~0#1|)) (.cse201 (* (+ .cse208 .cse240) |ULTIMATE.start_main_~B~0#1|)) (.cse214 (< .cse212 0)) (.cse155 (= 0 (mod .cse212 2))) (.cse215 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse163 (= 0 (mod .cse239 2))) (.cse216 (< .cse213 0)) (.cse217 (div .cse239 2)) (.cse218 (< .cse211 0)) (.cse144 (= 0 (mod .cse211 2))) (.cse219 (div .cse238 4)) (.cse140 (= 0 (mod .cse237 2))) (.cse221 (div .cse237 2)) (.cse220 (< .cse210 0)) (.cse154 (= 1 .cse212)) (.cse165 (= 1 .cse213)) (.cse132 (= 1 .cse210)) (.cse143 (= 1 .cse211)) (.cse105 (and (not .cse110) .cse236)) (.cse108 (not .cse236)) (.cse127 (+ (- 1) .cse126)) (.cse0 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse208 |ULTIMATE.start_main_~B~0#1|) .cse178))) (.cse13 (or .cse67 .cse198)) (.cse7 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse43 (or (and (or .cse75 .cse77) (or .cse78 .cse79 .cse81)) .cse76)) (.cse35 (or (and (or .cse78 .cse80 .cse81) (or .cse72 .cse77)) .cse73 .cse74)) (.cse8 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse2 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse10 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse203 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse207 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse73 .cse74) (or .cse76 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse209 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))))) (.cse204 (and (or .cse77 (not .cse96)) (or .cse78 (not .cse111) .cse81))) (.cse125 (and .cse235 (not .cse121))) (.cse222 (* (+ .cse112 .cse211) |ULTIMATE.start_main_~B~0#1|)) (.cse224 (* (+ .cse112 .cse210) |ULTIMATE.start_main_~B~0#1|)) (.cse122 (not .cse235)) (.cse101 (not .cse234)) (.cse103 (and (not .cse102) .cse234)) (.cse120 (not .cse233)) (.cse226 (* (+ .cse99 .cse213) |ULTIMATE.start_main_~B~0#1|)) (.cse117 (and .cse233 (not .cse118))) (.cse227 (* (+ .cse99 .cse212) |ULTIMATE.start_main_~B~0#1|)) (.cse131 (+ (- 1) .cse130)) (.cse232 (div .cse38 (- 2)))) (let ((.cse40 (+ |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~p~0#1| (- 1)))) (.cse27 (<= 2 .cse232)) (.cse30 (>= |ULTIMATE.start_main_~r~0#1| .cse232)) (.cse32 (= .cse231 0)) (.cse39 (or .cse73 (let ((.cse230 (+ .cse100 .cse131)) (.cse229 (+ .cse100 .cse130))) (and (or .cse78 (and (or .cse103 (and (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse222 .cse229))) (or .cse121 (= |ULTIMATE.start_main_~A~0#1| (+ .cse224 .cse229)) .cse122))) (or .cse101 .cse102 (and (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse222 .cse230))) (or .cse121 (= |ULTIMATE.start_main_~A~0#1| (+ .cse224 .cse230)) .cse122)))) .cse81) (or (and (or (and (or .cse117 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse230))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse226 .cse230)) .cse118 .cse120)) .cse101 .cse102) (or .cse103 (and (or .cse118 .cse120 (= |ULTIMATE.start_main_~A~0#1| (+ .cse226 .cse229))) (or .cse117 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse229)))))) .cse77))) .cse74)) (.cse28 (let ((.cse228 (or .cse203 .cse204))) (or (and .cse0 .cse228 .cse67 .cse7 .cse43 .cse35 .cse8 .cse2 .cse3 .cse10) (and .cse0 .cse13 .cse228 .cse7 .cse43 .cse35 .cse8 .cse2 .cse3 .cse10)))) (.cse29 (or (and (or .cse73 (= |ULTIMATE.start_main_~B~0#1| .cse207) .cse74) (or .cse76 (= |ULTIMATE.start_main_~B~0#1| .cse209))) .cse204)) (.cse44 (or .cse76 (let ((.cse223 (+ .cse107 .cse126)) (.cse225 (+ .cse107 .cse127))) (and (or .cse78 (and (or .cse105 (and (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse222 .cse223))) (or .cse121 .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse224 .cse223))))) (or .cse108 (and (or .cse121 (= |ULTIMATE.start_main_~A~0#1| (+ .cse224 .cse225)) .cse122) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse222 .cse225)) .cse125)) .cse110)) .cse81) (or .cse77 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse226 .cse223)) .cse118 .cse120) (or .cse117 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse223)))) .cse105) (or (and (or .cse118 .cse120 (= |ULTIMATE.start_main_~A~0#1| (+ .cse226 .cse225))) (or .cse117 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse225)))) .cse108 .cse110))))))) (.cse113 (and (or .cse121 (not .cse132) .cse122) (or (not .cse143) .cse125))) (.cse97 (and (or .cse117 (not .cse154)) (or .cse118 .cse120 (not .cse165)))) (.cse119 (* (+ |ULTIMATE.start_main_~q~0#1| .cse213) |ULTIMATE.start_main_~B~0#1|)) (.cse114 (* (+ |ULTIMATE.start_main_~q~0#1| .cse212) |ULTIMATE.start_main_~B~0#1|)) (.cse124 (* (+ |ULTIMATE.start_main_~q~0#1| .cse211) |ULTIMATE.start_main_~B~0#1|)) (.cse123 (* (+ |ULTIMATE.start_main_~q~0#1| .cse210) |ULTIMATE.start_main_~B~0#1|)) (.cse98 (+ 1 .cse104)) (.cse133 (not .cse220)) (.cse135 (* (+ .cse112 (+ 1 .cse221)) |ULTIMATE.start_main_~B~0#1|)) (.cse141 (* (+ .cse112 .cse221) |ULTIMATE.start_main_~B~0#1|)) (.cse142 (and .cse220 (not .cse140))) (.cse148 (* (+ .cse112 .cse219) |ULTIMATE.start_main_~B~0#1|)) (.cse147 (and .cse218 (not .cse144))) (.cse146 (* (+ .cse112 (+ 1 .cse219)) |ULTIMATE.start_main_~B~0#1|)) (.cse145 (not .cse218)) (.cse164 (* (+ .cse99 (+ 1 .cse217)) |ULTIMATE.start_main_~B~0#1|)) (.cse162 (not .cse216)) (.cse160 (* (+ .cse99 .cse217) |ULTIMATE.start_main_~B~0#1|)) (.cse161 (and (not .cse163) .cse216)) (.cse158 (* (+ .cse99 .cse215) |ULTIMATE.start_main_~B~0#1|)) (.cse159 (and .cse214 (not .cse155))) (.cse156 (* (+ .cse99 (+ 1 .cse215)) |ULTIMATE.start_main_~B~0#1|)) (.cse157 (not .cse214)) (.cse109 (+ 1 .cse106)) (.cse175 (* (+ .cse208 .cse213) |ULTIMATE.start_main_~B~0#1|)) (.cse172 (* (+ .cse208 .cse212) |ULTIMATE.start_main_~B~0#1|)) (.cse176 (* (+ .cse208 .cse211) |ULTIMATE.start_main_~B~0#1|)) (.cse177 (* (+ .cse208 .cse210) |ULTIMATE.start_main_~B~0#1|)) (.cse95 (or (and (or .cse73 .cse74 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse207 .cse208) .cse178))) (or .cse76 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse209 .cse208) .cse178)))) .cse71 .cse204)) (.cse12 (<= 2 |ULTIMATE.start_main_~d~0#1|)) (.cse34 (or (let ((.cse205 (+ .cse178 .cse206))) (and (or .cse78 (= |ULTIMATE.start_main_~A~0#1| (+ .cse199 .cse205)) .cse81) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse201 .cse205)) .cse77))) .cse73 .cse74)) (.cse21 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse85 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse89 .cse38)))) (.cse94 (or .cse71 .cse203 .cse204)) (.cse42 (or .cse76 (let ((.cse200 (+ .cse178 .cse202))) (and (or .cse78 .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse199 .cse200))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse201 .cse200)) .cse77))))) (.cse14 (or .cse198 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse53 (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse70 (* 2 .cse196)) (.cse62 (+ |ULTIMATE.start_main_~r~0#1| .cse196)) (.cse31 (* 2 .cse197)) (.cse55 (* |ULTIMATE.start_main_~B~0#1| 2))) (let ((.cse6 (= |ULTIMATE.start_main_~d~0#1| .cse197)) (.cse9 (= |ULTIMATE.start_main_~p~0#1| .cse197)) (.cse11 (= |ULTIMATE.start_main_~d~0#1| .cse58)) (.cse46 (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~B~0#1| (- 4)))) (.cse41 (* .cse197 (- 1))) (.cse47 (= |ULTIMATE.start_main_~p~0#1| 2)) (.cse49 (= |ULTIMATE.start_main_~d~0#1| .cse55)) (.cse63 (= (+ |ULTIMATE.start_main_~q~0#1| (* .cse31 (- 1))) 0)) (.cse64 (= .cse62 |ULTIMATE.start_main_~A~0#1|)) (.cse45 (not (>= |ULTIMATE.start_main_~A~0#1| .cse70))) (.cse33 (= |ULTIMATE.start_main_~p~0#1| .cse31)) (.cse26 (= |ULTIMATE.start_main_~d~0#1| .cse196)) (.cse17 (= .cse53 |ULTIMATE.start_main_~A~0#1|)) (.cse66 (or (and .cse12 .cse34 .cse0 .cse13 .cse21 .cse95 .cse94 .cse42 .cse43 .cse35 .cse14 .cse3) (and .cse12 .cse34 .cse0 .cse13 .cse21 .cse94 .cse42 .cse43 .cse35 .cse14 .cse3))) (.cse25 (or (let ((.cse195 (+ .cse178 .cse130)) (.cse194 (+ .cse178 .cse131))) (and (or .cse96 (and (or .cse118 (and (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse194)) .cse102) (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse195)))) .cse120) (or (and (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse194))) (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse195)))) .cse117)) .cse77) (or .cse78 (and (or .cse125 (and (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse195))) (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse194)) .cse102))) (or .cse121 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse195)) .cse103) (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse194)) .cse102)) .cse122)) .cse111 .cse81))) .cse73 .cse74)) (.cse48 (or .cse76 (let ((.cse193 (+ .cse106 1))) (let ((.cse186 (= 0 (mod .cse106 2))) (.cse190 (- (div |ULTIMATE.start_main_~d~0#1| 8))) (.cse189 (< .cse106 0)) (.cse180 (= 0 (mod .cse193 2))) (.cse192 (< .cse109 0)) (.cse191 (- (div .cse193 2)))) (let ((.cse179 (+ .cse107 (+ (- 1) .cse191))) (.cse181 (not .cse192)) (.cse182 (and .cse192 (not .cse180))) (.cse183 (+ .cse107 .cse191)) (.cse188 (not .cse189)) (.cse187 (+ .cse107 (+ (- 1) .cse190))) (.cse184 (+ .cse107 .cse190)) (.cse185 (and .cse189 (not .cse186)))) (and (or (and (or .cse108 (and (or .cse121 .cse132 .cse122 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse179)) .cse180 .cse181) (or .cse182 (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse183)))) .cse142) (or (and (or .cse180 (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse179)) .cse181) (or .cse182 (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse183)))) .cse133 .cse140))) (or .cse143 .cse125 (and (or .cse144 .cse145 (and (or .cse182 (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse183))) (or .cse180 .cse181 (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse179))))) (or (and (or .cse180 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse179)) .cse181) (or .cse182 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse183)))) .cse147)))) .cse110) (or .cse105 (and (or (and (or .cse133 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse184)) .cse185) (or .cse186 (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse187)) .cse188)) .cse140) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse184)) .cse185) (or .cse186 (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse187)) .cse188)) .cse142)) .cse121 .cse132 .cse122) (or .cse143 .cse125 (and (or (and (or .cse186 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse187)) .cse188) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse184)) .cse185)) .cse147) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse184)) .cse185) (or .cse186 (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse187)) .cse188)) .cse144 .cse145)))))) .cse78 .cse81) (or (and (or (and (or .cse154 .cse117 (and (or (and (or .cse182 (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse183))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse179)) .cse180 .cse181)) .cse159) (or .cse155 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse179)) .cse180 .cse181) (or .cse182 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse183)))) .cse157))) (or .cse118 .cse120 (and (or .cse162 .cse163 (and (or .cse180 .cse181 (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse179))) (or .cse182 (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse183))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse179)) .cse180 .cse181) (or .cse182 (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse183)))) .cse161)) .cse165)) .cse108 .cse110) (or .cse105 (and (or .cse118 (and (or (and (or .cse186 (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse187)) .cse188) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse184)) .cse185)) .cse162 .cse163) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse187)) .cse186 .cse188) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse184)) .cse185)) .cse161)) .cse120 .cse165) (or .cse154 .cse117 (and (or (and (or .cse186 (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse187)) .cse188) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse184)) .cse185)) .cse159) (or .cse155 (and (or .cse186 .cse188 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse187))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse184)) .cse185)) .cse157)))))) .cse77))))))) (.cse24 (or .cse76 (let ((.cse173 (+ .cse178 .cse126)) (.cse174 (+ .cse178 .cse127))) (and (or .cse96 .cse77 (and (or .cse117 (and (or .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse173))) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse174)) .cse110))) (or (and (or .cse108 .cse110 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse174))) (or .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse173)))) .cse118 .cse120))) (or .cse78 (and (or .cse125 (and (or .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse173))) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse174)) .cse110))) (or .cse121 (and (or .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse173))) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse174)) .cse110)) .cse122)) .cse111 .cse81))))) (.cse50 (or .cse73 (let ((.cse171 (+ .cse104 1))) (let ((.cse166 (< .cse98 0)) (.cse137 (= 0 (mod .cse171 2))) (.cse167 (- (div .cse171 2))) (.cse152 (= 0 (mod .cse104 2))) (.cse169 (- (div .cse170 4))) (.cse168 (< .cse104 0))) (let ((.cse151 (not .cse168)) (.cse153 (+ .cse100 (+ (- 1) .cse169))) (.cse149 (+ .cse100 .cse169)) (.cse150 (and .cse168 (not .cse152))) (.cse138 (+ .cse100 .cse167)) (.cse139 (and .cse166 (not .cse137))) (.cse136 (+ .cse100 (+ (- 1) .cse167))) (.cse134 (not .cse166))) (and (or (and (or .cse101 .cse102 (and (or .cse121 .cse132 .cse122 (and (or .cse133 (and (or .cse134 (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse136)) .cse137) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse138)) .cse139)) .cse140) (or (and (or .cse134 (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse136)) .cse137) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse138)) .cse139)) .cse142))) (or .cse143 .cse125 (and (or .cse144 .cse145 (and (or .cse134 (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse136)) .cse137) (or .cse139 (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse138))))) (or .cse147 (and (or .cse134 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse136)) .cse137) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse138)) .cse139))))))) (or .cse103 (and (or .cse143 .cse125 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse149)) .cse150) (or .cse151 .cse152 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse153)))) .cse147) (or .cse144 (and (or .cse151 .cse152 (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse153))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse146 .cse149)) .cse150)) .cse145))) (or .cse121 .cse132 .cse122 (and (or .cse133 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse149)) .cse150) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse153)) .cse151 .cse152)) .cse140) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse149)) .cse150) (or .cse151 .cse152 (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse153)))) .cse142)))))) .cse78 .cse81) (or (and (or .cse103 (and (or .cse154 .cse117 (and (or .cse155 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse153)) .cse151 .cse152) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse149)) .cse150)) .cse157) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse149)) .cse150) (or .cse151 .cse152 (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse153)))) .cse159))) (or (and (or (and (or .cse150 (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse149))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse153)) .cse151 .cse152)) .cse161) (or .cse162 .cse163 (and (or .cse151 .cse152 (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse153))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse149)) .cse150)))) .cse118 .cse120 .cse165))) (or .cse101 .cse102 (and (or (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse138)) .cse139) (or .cse134 (= |ULTIMATE.start_main_~A~0#1| (+ .cse158 .cse136)) .cse137)) .cse159) (or (and (or .cse134 (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse136)) .cse137) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse138)) .cse139)) .cse155 .cse157)) .cse154 .cse117) (or .cse118 (and (or (and (or .cse139 (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse138))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse160 .cse136)) .cse134 .cse137)) .cse161) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse138)) .cse139) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse136)) .cse134 .cse137)) .cse162 .cse163)) .cse120 .cse165)))) .cse77))))) .cse74)) (.cse51 (or .cse73 (let ((.cse129 (+ |ULTIMATE.start_main_~r~0#1| .cse131)) (.cse128 (+ |ULTIMATE.start_main_~r~0#1| .cse130))) (and (or .cse96 (and (or .cse118 (and (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse119 .cse128))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse119 .cse129)) .cse101 .cse102)) .cse120) (or .cse117 (and (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse114 .cse128))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse114 .cse129)) .cse101 .cse102)))) .cse77) (or .cse78 (and (or .cse125 (and (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse124 .cse128))) (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse124 .cse129)) .cse102))) (or .cse121 (and (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse129))) (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse128)))) .cse122)) .cse111 .cse81))) .cse74)) (.cse52 (or (let ((.cse115 (+ |ULTIMATE.start_main_~r~0#1| .cse127)) (.cse116 (+ |ULTIMATE.start_main_~r~0#1| .cse126))) (and (or .cse96 (and (or (and (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse114 .cse115)) .cse110) (or .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse114 .cse116)))) .cse117) (or .cse118 (and (or .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse119 .cse116))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse119 .cse115)) .cse108 .cse110)) .cse120)) .cse77) (or .cse78 .cse111 (and (or .cse121 .cse122 (and (or .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse116))) (or .cse108 .cse110 (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse115))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse124 .cse115)) .cse108 .cse110) (or .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse124 .cse116)))) .cse125)) .cse81))) .cse76)) (.cse68 (or (and (or .cse76 (and (or .cse108 .cse110 (= |ULTIMATE.start_main_~B~0#1| .cse109)) (or .cse105 (= |ULTIMATE.start_main_~B~0#1| .cse106)))) (or .cse73 (and (or .cse103 (= |ULTIMATE.start_main_~B~0#1| .cse104)) (or (= |ULTIMATE.start_main_~B~0#1| .cse98) .cse101 .cse102)) .cse74)) (and (or .cse78 .cse81 .cse113) (or .cse97 .cse77)))) (.cse56 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse69 (let ((.cse92 (or .cse78 .cse111 (and (or .cse76 (and (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse109 .cse112) .cse107)) .cse110) (or .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse106 .cse112) .cse107))))) (or .cse73 (and (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse98 .cse112) .cse100))) (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse104 .cse112) .cse100)))) .cse74)) .cse81 .cse113)) (.cse93 (or .cse96 .cse97 (and (or .cse73 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse98 .cse99) .cse100)) .cse101 .cse102) (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse104 .cse99) .cse100)))) .cse74) (or .cse76 (and (or .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse106 .cse99) .cse107))) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse109 .cse99) .cse107)) .cse110)))) .cse77))) (or (and .cse34 .cse92 .cse27 .cse30 .cse21 .cse93 .cse94 .cse67 .cse35 .cse32 .cse3 .cse39 .cse0 .cse28 .cse29 .cse95 .cse42 .cse43 .cse14 .cse44) (and .cse34 .cse92 .cse27 .cse30 .cse21 .cse93 .cse94 .cse35 .cse32 .cse3 .cse39 .cse0 .cse13 .cse28 .cse29 .cse95 .cse42 .cse43 .cse14 .cse44)))) (.cse1 (or (= 1 .cse88) (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse88)) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ (+ |ULTIMATE.start_main_~r~0#1| (- (* 2 .cse91))) .cse38))))) (.cse22 (or (let ((.cse90 (- (div .cse91 4)))) (let ((.cse84 (+ .cse89 (+ (- 1) .cse90))) (.cse83 (+ .cse89 .cse90)) (.cse86 (div .cse88 4))) (and (or .cse77 (let ((.cse82 (* (+ .cse85 .cse86) |ULTIMATE.start_main_~B~0#1|))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse82 .cse83)) .cse76) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse82 .cse84)) .cse73 .cse74)))) (or .cse78 (let ((.cse87 (* (+ .cse85 (+ 1 .cse86)) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse73 (= |ULTIMATE.start_main_~A~0#1| (+ .cse87 .cse84)) .cse74) (or .cse76 (= |ULTIMATE.start_main_~A~0#1| (+ .cse87 .cse83))))) .cse81)))) .cse71)) (.cse18 (or .cse3 (and (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse3))) (.cse23 (or .cse71 (and (or (and (or .cse72 .cse73 .cse74) (or .cse75 .cse76)) .cse77) (or .cse78 (and (or .cse79 .cse76) (or .cse80 .cse73 .cse74)) .cse81)))) (.cse4 (= |ULTIMATE.start_main_~d~0#1| (* 1 |ULTIMATE.start_main_~p~0#1|))) (.cse5 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| 1) |ULTIMATE.start_main_~r~0#1|))) (.cse19 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse20 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse36 (- |ULTIMATE.start_main_~B~0#1|)) (.cse16 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse38))) (.cse15 (= .cse40 0)) (.cse37 (= |ULTIMATE.start_main_~d~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse11) (and .cse12 .cse6 .cse0 .cse13 .cse14 .cse15 .cse16 .cse2 .cse9 .cse3 .cse17 .cse11) (and .cse2 .cse18 .cse3 .cse4 .cse5) (and .cse19 .cse7 .cse20 .cse8 .cse2) (and .cse7 .cse19 .cse20 .cse8 .cse2) (and .cse0 .cse13 .cse21 .cse1 .cse14 .cse22 .cse2 .cse23 .cse3 .cse4 .cse5) (and .cse0 .cse13 .cse21 .cse1 .cse14 .cse22 .cse2 .cse18 .cse23 .cse3 .cse4 .cse5) (and .cse0 .cse24 .cse25 .cse1 .cse22 .cse2 .cse23 .cse3 .cse4 .cse5) (and .cse26 .cse27 .cse28 .cse29 .cse30 .cse7 .cse14 .cse8 .cse2 (= |ULTIMATE.start_main_~d~0#1| .cse31) .cse32 .cse33) (and .cse34 .cse21 .cse19 .cse35 .cse2 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~B~0#1| (- 2))) .cse36)) .cse37 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (- 2)) .cse38)) .cse39 .cse0 (= (+ .cse40 .cse41) 0) .cse42 .cse43 .cse20 .cse44 (= (+ |ULTIMATE.start_main_~q~0#1| (- 2)) 1)) (and .cse45 (>= |ULTIMATE.start_main_~r~0#1| (+ .cse46 .cse38)) .cse21 .cse47 .cse25 .cse2 .cse23 .cse48 .cse49 .cse3 .cse4 .cse5 .cse0 .cse13 (>= .cse46 |ULTIMATE.start_main_~d~0#1|) .cse24 .cse50 .cse1 (<= 4 .cse40) .cse14 .cse22 .cse51 .cse52) (let ((.cse54 (+ .cse55 (- 1)))) (and (<= .cse53 .cse54) (<= .cse53 .cse46) .cse25 .cse19 (= |ULTIMATE.start_main_~r~0#1| (+ .cse46 .cse36)) .cse2 .cse23 .cse48 .cse0 .cse24 .cse50 .cse1 .cse20 .cse22 (= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 1) .cse51 (<= .cse40 4) (<= |ULTIMATE.start_main_~d~0#1| .cse54) (<= |ULTIMATE.start_main_~d~0#1| .cse46) .cse52)) (and .cse45 (>= |ULTIMATE.start_main_~r~0#1| (+ .cse46 (- .cse55))) (<= 4 (+ |ULTIMATE.start_main_~q~0#1| (* 2 (- 1)))) .cse25 .cse19 (>= .cse46 .cse55) .cse2 .cse23 .cse56 .cse3 .cse0 .cse24 .cse1 .cse20 .cse22 .cse18) (let ((.cse57 (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~r~0#1| (- 1))))) (and (= .cse57 .cse58) .cse19 .cse2 .cse18 (let ((.cse61 (= 0 (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2))) (.cse59 (div (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~r~0#1|)) 2)) (.cse60 (< .cse57 0))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse59) (or (not .cse60) .cse61)) (and (not .cse61) (= |ULTIMATE.start_main_~d~0#1| (+ 1 .cse59)) .cse60))) (= (+ |ULTIMATE.start_main_~q~0#1| .cse41) 0))) (and .cse0 .cse1 .cse22 .cse2 .cse23 .cse3 .cse4 .cse5) (and .cse2 .cse4 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse5) (and .cse21 .cse47 .cse2 .cse56 .cse49 .cse3 .cse0 .cse13 (<= .cse62 |ULTIMATE.start_main_~A~0#1|) .cse63 (<= |ULTIMATE.start_main_~q~0#1| (+ 0 .cse31)) .cse64 .cse14 .cse18) (and .cse63 .cse19 .cse64 .cse20 .cse2 .cse18 .cse3) (let ((.cse65 (+ 0 |ULTIMATE.start_main_~p~0#1|))) (and .cse45 (>= |ULTIMATE.start_main_~q~0#1| .cse65) (<= |ULTIMATE.start_main_~q~0#1| .cse65) .cse15 .cse2 .cse16 .cse4 .cse3 .cse66 (= |ULTIMATE.start_main_~p~0#1| 4) .cse33 .cse5 .cse26 .cse29 (<= .cse53 |ULTIMATE.start_main_~A~0#1|) .cse14 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) .cse17)) (and .cse25 .cse2 .cse23 .cse3 .cse4 .cse66 .cse5 .cse0 .cse24 .cse29 .cse1 .cse14 .cse22) (and .cse67 .cse25 .cse7 .cse68 .cse2 .cse23 .cse48 .cse3 .cse4 .cse69 .cse5 .cse0 .cse24 .cse29 .cse50 .cse1 .cse14 .cse22 .cse51 .cse52) (and (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) .cse67 .cse7 .cse68 .cse8 .cse2 .cse56 .cse4 .cse3 .cse69 (= |ULTIMATE.start_main_~p~0#1| (* 2 .cse31)) .cse5 .cse29 (= |ULTIMATE.start_main_~d~0#1| .cse70) .cse14) (and .cse0 .cse1 .cse22 .cse2 .cse18 .cse23 .cse3 .cse4 .cse5) (and .cse0 .cse43 .cse19 .cse35 .cse20 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse36)) .cse2 .cse16 .cse15 (= (+ |ULTIMATE.start_main_~q~0#1| (* 1 (- 1))) 0) .cse37)))))))))) [2023-02-18 18:27:12,973 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-02-18 18:27:12,976 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse219 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse245 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse246 (+ 1 .cse245)) (.cse217 (- .cse219))) (let ((.cse243 (+ .cse245 1)) (.cse179 (+ .cse219 1)) (.cse228 (+ (- 1) .cse217)) (.cse206 (+ |ULTIMATE.start_main_~q~0#1| .cse246)) (.cse205 (+ |ULTIMATE.start_main_~q~0#1| .cse245)) (.cse225 (mod |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse199 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse45 (- |ULTIMATE.start_main_~d~0#1|)) (.cse77 (= 1 |ULTIMATE.start_main_~p~0#1|)) (.cse79 (= 0 .cse225)) (.cse252 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse84 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse193 (+ |ULTIMATE.start_main_~r~0#1| .cse217)) (.cse251 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse254 (* .cse205 |ULTIMATE.start_main_~B~0#1|)) (.cse253 (* .cse206 |ULTIMATE.start_main_~B~0#1|)) (.cse174 (+ |ULTIMATE.start_main_~r~0#1| .cse228)) (.cse218 (+ 1 .cse219)) (.cse178 (div .cse179 2)) (.cse232 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse231 (div .cse243 2))) (let ((.cse55 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse242 (+ .cse231 1)) (.cse244 (+ .cse232 1)) (.cse102 (= 1 .cse245)) (.cse118 (= 1 .cse246)) (.cse97 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse94 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse121 (- .cse178)) (.cse103 (= 0 (mod .cse245 2))) (.cse247 (< .cse245 0)) (.cse107 (= 0 (mod .cse179 2))) (.cse248 (< .cse218 0)) (.cse249 (< .cse246 0)) (.cse115 (= 0 (mod .cse243 2))) (.cse86 (= |ULTIMATE.start_main_~A~0#1| (+ .cse253 .cse174))) (.cse78 (= |ULTIMATE.start_main_~A~0#1| (+ .cse254 .cse174))) (.cse80 (not .cse251)) (.cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse254 .cse193))) (.cse83 (and .cse252 (not .cse84))) (.cse85 (= |ULTIMATE.start_main_~A~0#1| (+ .cse253 .cse193))) (.cse87 (not .cse252)) (.cse82 (and .cse251 (not .cse79))) (.cse35 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse100 (not .cse77)) (.cse229 (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse119 (+ |ULTIMATE.start_main_~r~0#1| .cse45)) (.cse128 (- .cse199)) (.cse126 (= 0 (mod .cse219 2))) (.cse250 (< .cse219 0)) (.cse230 (+ 1 .cse231)) (.cse233 (+ 1 .cse232))) (let ((.cse161 (= 1 .cse232)) (.cse172 (= 1 .cse233)) (.cse139 (= 1 .cse230)) (.cse150 (= 1 .cse231)) (.cse122 (and (not .cse126) .cse250)) (.cse124 (not .cse250)) (.cse127 (+ (- 1) .cse128)) (.cse13 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse229 |ULTIMATE.start_main_~B~0#1|) .cse119))) (.cse14 (or .cse35 .cse100)) (.cse7 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse75 (or (and (or .cse81 .cse83) (or .cse84 .cse85 .cse87)) .cse82)) (.cse72 (or (and (or .cse84 .cse86 .cse87) (or .cse78 .cse83)) .cse79 .cse80)) (.cse8 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse2 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse10 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse113 (and .cse249 (not .cse115))) (.cse208 (* (+ .cse206 .cse231) |ULTIMATE.start_main_~B~0#1|)) (.cse210 (* (+ .cse206 .cse230) |ULTIMATE.start_main_~B~0#1|)) (.cse117 (not .cse249)) (.cse104 (not .cse248)) (.cse108 (and (not .cse107) .cse248)) (.cse110 (not .cse247)) (.cse212 (* (+ .cse205 .cse233) |ULTIMATE.start_main_~B~0#1|)) (.cse112 (and .cse247 (not .cse103))) (.cse213 (* (+ .cse205 .cse232) |ULTIMATE.start_main_~B~0#1|)) (.cse120 (+ (- 1) .cse121)) (.cse222 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse218 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse79 .cse80) (or .cse82 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse219 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))))) (.cse91 (+ |ULTIMATE.start_main_~q~0#1| .cse94)) (.cse95 (+ |ULTIMATE.start_main_~r~0#1| (- .cse97))) (.cse226 (div .cse45 (- 2))) (.cse214 (* (+ .cse229 .cse246) |ULTIMATE.start_main_~B~0#1|)) (.cse216 (* (+ .cse229 .cse245) |ULTIMATE.start_main_~B~0#1|)) (.cse220 (and (or .cse83 (not .cse102)) (or .cse84 (not .cse118) .cse87))) (.cse234 (< .cse232 0)) (.cse162 (= 0 (mod .cse232 2))) (.cse235 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse170 (= 0 (mod .cse244 2))) (.cse236 (< .cse233 0)) (.cse237 (div .cse244 2)) (.cse238 (< .cse231 0)) (.cse151 (= 0 (mod .cse231 2))) (.cse239 (div .cse243 4)) (.cse147 (= 0 (mod .cse242 2))) (.cse241 (div .cse242 2)) (.cse240 (< .cse230 0)) (.cse129 (* 2 1)) (.cse132 (* 2 .cse55))) (let ((.cse34 (* 2 .cse97)) (.cse99 (not (= 0 |ULTIMATE.start_main_~q~0#1|))) (.cse101 (= 1 .cse94)) (.cse111 (* (+ .cse229 .cse232) |ULTIMATE.start_main_~B~0#1|)) (.cse105 (* (+ .cse229 .cse233) |ULTIMATE.start_main_~B~0#1|)) (.cse114 (* (+ .cse229 .cse231) |ULTIMATE.start_main_~B~0#1|)) (.cse116 (* (+ .cse229 .cse230) |ULTIMATE.start_main_~B~0#1|)) (.cse49 (+ |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~p~0#1| (- 1)))) (.cse12 (<= 2 |ULTIMATE.start_main_~d~0#1|)) (.cse66 (+ |ULTIMATE.start_main_~r~0#1| .cse132)) (.cse38 (* 2 .cse129)) (.cse27 (* |ULTIMATE.start_main_~B~0#1| 2)) (.cse51 (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse40 (* 2 .cse132)) (.cse140 (not .cse240)) (.cse142 (* (+ .cse206 (+ 1 .cse241)) |ULTIMATE.start_main_~B~0#1|)) (.cse148 (* (+ .cse206 .cse241) |ULTIMATE.start_main_~B~0#1|)) (.cse149 (and .cse240 (not .cse147))) (.cse155 (* (+ .cse206 .cse239) |ULTIMATE.start_main_~B~0#1|)) (.cse154 (and .cse238 (not .cse151))) (.cse153 (* (+ .cse206 (+ 1 .cse239)) |ULTIMATE.start_main_~B~0#1|)) (.cse152 (not .cse238)) (.cse171 (* (+ .cse205 (+ 1 .cse237)) |ULTIMATE.start_main_~B~0#1|)) (.cse169 (not .cse236)) (.cse167 (* (+ .cse205 .cse237) |ULTIMATE.start_main_~B~0#1|)) (.cse168 (and (not .cse170) .cse236)) (.cse165 (* (+ .cse205 .cse235) |ULTIMATE.start_main_~B~0#1|)) (.cse166 (and .cse234 (not .cse162))) (.cse163 (* (+ .cse205 (+ 1 .cse235)) |ULTIMATE.start_main_~B~0#1|)) (.cse164 (not .cse234)) (.cse136 (* (+ |ULTIMATE.start_main_~q~0#1| .cse233) |ULTIMATE.start_main_~B~0#1|)) (.cse133 (* (+ |ULTIMATE.start_main_~q~0#1| .cse232) |ULTIMATE.start_main_~B~0#1|)) (.cse138 (* (+ |ULTIMATE.start_main_~q~0#1| .cse231) |ULTIMATE.start_main_~B~0#1|)) (.cse137 (* (+ |ULTIMATE.start_main_~q~0#1| .cse230) |ULTIMATE.start_main_~B~0#1|)) (.cse130 (or (and (or .cse79 .cse80 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse218 .cse229) .cse119))) (or .cse82 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse219 .cse229) .cse119)))) .cse77 .cse220)) (.cse71 (or (let ((.cse227 (+ .cse119 .cse228))) (and (or .cse84 (= |ULTIMATE.start_main_~A~0#1| (+ .cse214 .cse227)) .cse87) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse216 .cse227)) .cse83))) .cse79 .cse80)) (.cse67 (<= 2 .cse226)) (.cse69 (>= |ULTIMATE.start_main_~r~0#1| .cse226)) (.cse46 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse91 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse95 .cse45)))) (.cse131 (or .cse77 .cse222 .cse220)) (.cse70 (= .cse225 0)) (.cse73 (or .cse79 (let ((.cse224 (+ .cse174 .cse120)) (.cse223 (+ .cse174 .cse121))) (and (or .cse84 (and (or .cse108 (and (or .cse113 (= |ULTIMATE.start_main_~A~0#1| (+ .cse208 .cse223))) (or .cse115 (= |ULTIMATE.start_main_~A~0#1| (+ .cse210 .cse223)) .cse117))) (or .cse104 .cse107 (and (or .cse113 (= |ULTIMATE.start_main_~A~0#1| (+ .cse208 .cse224))) (or .cse115 (= |ULTIMATE.start_main_~A~0#1| (+ .cse210 .cse224)) .cse117)))) .cse87) (or (and (or (and (or .cse112 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse224))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse212 .cse224)) .cse103 .cse110)) .cse104 .cse107) (or .cse108 (and (or .cse103 .cse110 (= |ULTIMATE.start_main_~A~0#1| (+ .cse212 .cse223))) (or .cse112 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse223)))))) .cse83))) .cse80)) (.cse68 (let ((.cse221 (or .cse222 .cse220))) (or (and .cse13 .cse221 .cse35 .cse7 .cse75 .cse72 .cse8 .cse2 .cse3 .cse10) (and .cse13 .cse14 .cse221 .cse7 .cse75 .cse72 .cse8 .cse2 .cse3 .cse10)))) (.cse39 (or (and (or .cse79 (= |ULTIMATE.start_main_~B~0#1| .cse218) .cse80) (or .cse82 (= |ULTIMATE.start_main_~B~0#1| .cse219))) .cse220)) (.cse74 (or .cse82 (let ((.cse215 (+ .cse119 .cse217))) (and (or .cse84 .cse87 (= |ULTIMATE.start_main_~A~0#1| (+ .cse214 .cse215))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse216 .cse215)) .cse83))))) (.cse15 (or .cse100 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse76 (or .cse82 (let ((.cse209 (+ .cse193 .cse128)) (.cse211 (+ .cse193 .cse127))) (and (or .cse84 (and (or .cse122 (and (or .cse113 (= |ULTIMATE.start_main_~A~0#1| (+ .cse208 .cse209))) (or .cse115 .cse117 (= |ULTIMATE.start_main_~A~0#1| (+ .cse210 .cse209))))) (or .cse124 (and (or .cse115 (= |ULTIMATE.start_main_~A~0#1| (+ .cse210 .cse211)) .cse117) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse208 .cse211)) .cse113)) .cse126)) .cse87) (or .cse83 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse212 .cse209)) .cse103 .cse110) (or .cse112 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse209)))) .cse122) (or (and (or .cse103 .cse110 (= |ULTIMATE.start_main_~A~0#1| (+ .cse212 .cse211))) (or .cse112 (= |ULTIMATE.start_main_~A~0#1| (+ .cse213 .cse211)))) .cse124 .cse126))))))) (.cse198 (+ 1 .cse199)) (.cse181 (+ 1 .cse178)) (.cse207 (and (or .cse115 (not .cse139) .cse117) (or (not .cse150) .cse113))) (.cse204 (and (or .cse112 (not .cse161)) (or .cse103 .cse110 (not .cse172))))) (let ((.cse6 (= |ULTIMATE.start_main_~d~0#1| .cse129)) (.cse9 (= |ULTIMATE.start_main_~p~0#1| .cse129)) (.cse11 (= |ULTIMATE.start_main_~d~0#1| .cse55)) (.cse36 (or (and (or .cse82 (and (or .cse124 .cse126 (= |ULTIMATE.start_main_~B~0#1| .cse198)) (or .cse122 (= |ULTIMATE.start_main_~B~0#1| .cse199)))) (or .cse79 (and (or .cse108 (= |ULTIMATE.start_main_~B~0#1| .cse178)) (or (= |ULTIMATE.start_main_~B~0#1| .cse181) .cse104 .cse107)) .cse80)) (and (or .cse84 .cse87 .cse207) (or .cse204 .cse83)))) (.cse37 (let ((.cse202 (or .cse84 .cse118 (and (or .cse82 (and (or .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse198 .cse206) .cse193)) .cse126) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse199 .cse206) .cse193))))) (or .cse79 (and (or .cse104 .cse107 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse181 .cse206) .cse174))) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse178 .cse206) .cse174)))) .cse80)) .cse87 .cse207)) (.cse203 (or .cse102 .cse204 (and (or .cse79 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse181 .cse205) .cse174)) .cse104 .cse107) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse178 .cse205) .cse174)))) .cse80) (or .cse82 (and (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse199 .cse205) .cse193))) (or .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse198 .cse205) .cse193)) .cse126)))) .cse83))) (or (and .cse71 .cse202 .cse67 .cse69 .cse46 .cse203 .cse131 .cse35 .cse72 .cse70 .cse3 .cse73 .cse13 .cse68 .cse39 .cse130 .cse74 .cse75 .cse15 .cse76) (and .cse71 .cse202 .cse67 .cse69 .cse46 .cse203 .cse131 .cse72 .cse70 .cse3 .cse73 .cse13 .cse14 .cse68 .cse39 .cse74 .cse75 .cse15 .cse76)))) (.cse43 (or .cse79 (let ((.cse201 (+ |ULTIMATE.start_main_~r~0#1| .cse120)) (.cse200 (+ |ULTIMATE.start_main_~r~0#1| .cse121))) (and (or .cse102 (and (or .cse103 (and (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse200))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse201)) .cse104 .cse107)) .cse110) (or .cse112 (and (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse200))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse201)) .cse104 .cse107)))) .cse83) (or .cse84 (and (or .cse113 (and (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse138 .cse200))) (or .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse138 .cse201)) .cse107))) (or .cse115 (and (or .cse104 .cse107 (= |ULTIMATE.start_main_~A~0#1| (+ .cse137 .cse201))) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse137 .cse200)))) .cse117)) .cse118 .cse87))) .cse80)) (.cse25 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~d~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse26 (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~B~0#1| (- 4)))) (.cse41 (or .cse82 (let ((.cse197 (+ .cse199 1))) (let ((.cse189 (= 0 (mod .cse199 2))) (.cse194 (- (div |ULTIMATE.start_main_~d~0#1| 8))) (.cse192 (< .cse199 0)) (.cse183 (= 0 (mod .cse197 2))) (.cse196 (< .cse198 0)) (.cse195 (- (div .cse197 2)))) (let ((.cse182 (+ .cse193 (+ (- 1) .cse195))) (.cse184 (not .cse196)) (.cse185 (and .cse196 (not .cse183))) (.cse186 (+ .cse193 .cse195)) (.cse191 (not .cse192)) (.cse190 (+ .cse193 (+ (- 1) .cse194))) (.cse187 (+ .cse193 .cse194)) (.cse188 (and .cse192 (not .cse189)))) (and (or (and (or .cse124 (and (or .cse115 .cse139 .cse117 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse182)) .cse183 .cse184) (or .cse185 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse186)))) .cse149) (or (and (or .cse183 (= |ULTIMATE.start_main_~A~0#1| (+ .cse142 .cse182)) .cse184) (or .cse185 (= |ULTIMATE.start_main_~A~0#1| (+ .cse142 .cse186)))) .cse140 .cse147))) (or .cse150 .cse113 (and (or .cse151 .cse152 (and (or .cse185 (= |ULTIMATE.start_main_~A~0#1| (+ .cse153 .cse186))) (or .cse183 .cse184 (= |ULTIMATE.start_main_~A~0#1| (+ .cse153 .cse182))))) (or (and (or .cse183 (= |ULTIMATE.start_main_~A~0#1| (+ .cse155 .cse182)) .cse184) (or .cse185 (= |ULTIMATE.start_main_~A~0#1| (+ .cse155 .cse186)))) .cse154)))) .cse126) (or .cse122 (and (or (and (or .cse140 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse142 .cse187)) .cse188) (or .cse189 (= |ULTIMATE.start_main_~A~0#1| (+ .cse142 .cse190)) .cse191)) .cse147) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse187)) .cse188) (or .cse189 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse190)) .cse191)) .cse149)) .cse115 .cse139 .cse117) (or .cse150 .cse113 (and (or (and (or .cse189 (= |ULTIMATE.start_main_~A~0#1| (+ .cse155 .cse190)) .cse191) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse155 .cse187)) .cse188)) .cse154) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse153 .cse187)) .cse188) (or .cse189 (= |ULTIMATE.start_main_~A~0#1| (+ .cse153 .cse190)) .cse191)) .cse151 .cse152)))))) .cse84 .cse87) (or (and (or (and (or .cse161 .cse112 (and (or (and (or .cse185 (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse186))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse182)) .cse183 .cse184)) .cse166) (or .cse162 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse182)) .cse183 .cse184) (or .cse185 (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse186)))) .cse164))) (or .cse103 .cse110 (and (or .cse169 .cse170 (and (or .cse183 .cse184 (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse182))) (or .cse185 (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse186))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse182)) .cse183 .cse184) (or .cse185 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse186)))) .cse168)) .cse172)) .cse124 .cse126) (or .cse122 (and (or .cse103 (and (or (and (or .cse189 (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse190)) .cse191) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse187)) .cse188)) .cse169 .cse170) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse190)) .cse189 .cse191) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse187)) .cse188)) .cse168)) .cse110 .cse172) (or .cse161 .cse112 (and (or (and (or .cse189 (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse190)) .cse191) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse187)) .cse188)) .cse166) (or .cse162 (and (or .cse189 .cse191 (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse190))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse187)) .cse188)) .cse164)))))) .cse83))))))) (.cse30 (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~d~0#1| (- 4)))) (.cse42 (or .cse79 (let ((.cse180 (+ .cse178 1))) (let ((.cse173 (< .cse181 0)) (.cse144 (= 0 (mod .cse180 2))) (.cse175 (- (div .cse180 2))) (.cse159 (= 0 (mod .cse178 2))) (.cse177 (- (div .cse179 4))) (.cse176 (< .cse178 0))) (let ((.cse158 (not .cse176)) (.cse160 (+ .cse174 (+ (- 1) .cse177))) (.cse156 (+ .cse174 .cse177)) (.cse157 (and .cse176 (not .cse159))) (.cse145 (+ .cse174 .cse175)) (.cse146 (and .cse173 (not .cse144))) (.cse143 (+ .cse174 (+ (- 1) .cse175))) (.cse141 (not .cse173))) (and (or (and (or .cse104 .cse107 (and (or .cse115 .cse139 .cse117 (and (or .cse140 (and (or .cse141 (= |ULTIMATE.start_main_~A~0#1| (+ .cse142 .cse143)) .cse144) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse142 .cse145)) .cse146)) .cse147) (or (and (or .cse141 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse143)) .cse144) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse145)) .cse146)) .cse149))) (or .cse150 .cse113 (and (or .cse151 .cse152 (and (or .cse141 (= |ULTIMATE.start_main_~A~0#1| (+ .cse153 .cse143)) .cse144) (or .cse146 (= |ULTIMATE.start_main_~A~0#1| (+ .cse153 .cse145))))) (or .cse154 (and (or .cse141 (= |ULTIMATE.start_main_~A~0#1| (+ .cse155 .cse143)) .cse144) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse155 .cse145)) .cse146))))))) (or .cse108 (and (or .cse150 .cse113 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse155 .cse156)) .cse157) (or .cse158 .cse159 (= |ULTIMATE.start_main_~A~0#1| (+ .cse155 .cse160)))) .cse154) (or .cse151 (and (or .cse158 .cse159 (= |ULTIMATE.start_main_~A~0#1| (+ .cse153 .cse160))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse153 .cse156)) .cse157)) .cse152))) (or .cse115 .cse139 .cse117 (and (or .cse140 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse142 .cse156)) .cse157) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse142 .cse160)) .cse158 .cse159)) .cse147) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse156)) .cse157) (or .cse158 .cse159 (= |ULTIMATE.start_main_~A~0#1| (+ .cse148 .cse160)))) .cse149)))))) .cse84 .cse87) (or (and (or .cse108 (and (or .cse161 .cse112 (and (or .cse162 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse160)) .cse158 .cse159) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse156)) .cse157)) .cse164) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse156)) .cse157) (or .cse158 .cse159 (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse160)))) .cse166))) (or (and (or (and (or .cse157 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse156))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse160)) .cse158 .cse159)) .cse168) (or .cse169 .cse170 (and (or .cse158 .cse159 (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse160))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse156)) .cse157)))) .cse103 .cse110 .cse172))) (or .cse104 .cse107 (and (or (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse145)) .cse146) (or .cse141 (= |ULTIMATE.start_main_~A~0#1| (+ .cse165 .cse143)) .cse144)) .cse166) (or (and (or .cse141 (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse143)) .cse144) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse145)) .cse146)) .cse162 .cse164)) .cse161 .cse112) (or .cse103 (and (or (and (or .cse146 (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse145))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse143)) .cse141 .cse144)) .cse168) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse145)) .cse146) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse171 .cse143)) .cse141 .cse144)) .cse169 .cse170)) .cse110 .cse172)))) .cse83))))) .cse80)) (.cse44 (or (let ((.cse134 (+ |ULTIMATE.start_main_~r~0#1| .cse127)) (.cse135 (+ |ULTIMATE.start_main_~r~0#1| .cse128))) (and (or .cse102 (and (or (and (or .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse134)) .cse126) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse135)))) .cse112) (or .cse103 (and (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse135))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse136 .cse134)) .cse124 .cse126)) .cse110)) .cse83) (or .cse84 .cse118 (and (or .cse115 .cse117 (and (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse137 .cse135))) (or .cse124 .cse126 (= |ULTIMATE.start_main_~A~0#1| (+ .cse137 .cse134))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse138 .cse134)) .cse124 .cse126) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse138 .cse135)))) .cse113)) .cse87))) .cse82)) (.cse31 (* |ULTIMATE.start_main_~d~0#1| 2)) (.cse24 (not (>= |ULTIMATE.start_main_~A~0#1| .cse40))) (.cse18 (= .cse51 |ULTIMATE.start_main_~A~0#1|)) (.cse47 (= |ULTIMATE.start_main_~p~0#1| 2)) (.cse29 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse48 (= |ULTIMATE.start_main_~d~0#1| .cse27)) (.cse60 (= (+ |ULTIMATE.start_main_~q~0#1| (* .cse38 (- 1))) 0)) (.cse61 (= .cse66 |ULTIMATE.start_main_~A~0#1|)) (.cse65 (= |ULTIMATE.start_main_~d~0#1| .cse132)) (.cse64 (= |ULTIMATE.start_main_~p~0#1| .cse38)) (.cse63 (or (and .cse12 .cse71 .cse13 .cse14 .cse46 .cse130 .cse131 .cse74 .cse75 .cse72 .cse15 .cse3) (and .cse12 .cse71 .cse13 .cse14 .cse46 .cse131 .cse74 .cse75 .cse72 .cse15 .cse3))) (.cse59 (* .cse129 (- 1))) (.cse22 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse23 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse50 (- |ULTIMATE.start_main_~B~0#1|)) (.cse17 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse45))) (.cse16 (= .cse49 0)) (.cse32 (= |ULTIMATE.start_main_~d~0#1| 1)) (.cse33 (or .cse82 (let ((.cse123 (+ .cse119 .cse128)) (.cse125 (+ .cse119 .cse127))) (and (or .cse102 .cse83 (and (or .cse112 (and (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse111 .cse123))) (or .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ .cse111 .cse125)) .cse126))) (or (and (or .cse124 .cse126 (= |ULTIMATE.start_main_~A~0#1| (+ .cse105 .cse125))) (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse105 .cse123)))) .cse103 .cse110))) (or .cse84 (and (or .cse113 (and (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse114 .cse123))) (or .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ .cse114 .cse125)) .cse126))) (or .cse115 (and (or .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse116 .cse123))) (or .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ .cse116 .cse125)) .cse126)) .cse117)) .cse118 .cse87))))) (.cse0 (or .cse99 .cse101 .cse100 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| .cse91) .cse95)))) (.cse28 (or (let ((.cse109 (+ .cse119 .cse121)) (.cse106 (+ .cse119 .cse120))) (and (or .cse102 (and (or .cse103 (and (or .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse105 .cse106)) .cse107) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse105 .cse109)))) .cse110) (or (and (or .cse104 .cse107 (= |ULTIMATE.start_main_~A~0#1| (+ .cse111 .cse106))) (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse111 .cse109)))) .cse112)) .cse83) (or .cse84 (and (or .cse113 (and (or .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse114 .cse109))) (or .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse114 .cse106)) .cse107))) (or .cse115 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse116 .cse109)) .cse108) (or .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse116 .cse106)) .cse107)) .cse117)) .cse118 .cse87))) .cse79 .cse80)) (.cse19 (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse94)) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ (+ |ULTIMATE.start_main_~r~0#1| (- .cse34)) .cse45))))) (.cse1 (let ((.cse98 (or .cse99 .cse35 .cse100))) (or (and .cse98 .cse3) (and (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse98 .cse3)))) (.cse20 (or (let ((.cse96 (- (div .cse97 4)))) (let ((.cse90 (+ .cse95 (+ (- 1) .cse96))) (.cse89 (+ .cse95 .cse96)) (.cse92 (div .cse94 4))) (and (or .cse83 (let ((.cse88 (* (+ .cse91 .cse92) |ULTIMATE.start_main_~B~0#1|))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse88 .cse89)) .cse82) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse88 .cse90)) .cse79 .cse80)))) (or .cse84 (let ((.cse93 (* (+ .cse91 (+ 1 .cse92)) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse79 (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse90)) .cse80) (or .cse82 (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse89))))) .cse87)))) .cse77)) (.cse21 (or .cse77 (and (or (and (or .cse78 .cse79 .cse80) (or .cse81 .cse82)) .cse83) (or .cse84 (and (or .cse85 .cse82) (or .cse86 .cse79 .cse80)) .cse87)))) (.cse4 (= |ULTIMATE.start_main_~d~0#1| (* 1 |ULTIMATE.start_main_~p~0#1|))) (.cse5 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| 1) |ULTIMATE.start_main_~r~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse11) (and .cse12 .cse6 .cse13 .cse14 .cse15 .cse16 .cse17 .cse2 .cse9 .cse3 .cse18 .cse11) (and .cse13 .cse0 .cse19 .cse1 .cse20 .cse2 .cse21 .cse3 .cse4 .cse5) (and .cse22 .cse7 .cse23 .cse8 .cse2) (and .cse24 .cse25 (>= |ULTIMATE.start_main_~r~0#1| (+ .cse26 (- .cse27))) (<= 4 (+ |ULTIMATE.start_main_~q~0#1| (* 2 (- 1)))) .cse28 .cse22 (>= .cse26 .cse27) .cse2 .cse21 .cse29 (>= .cse30 .cse31) .cse3 .cse32 .cse13 .cse33 .cse0 .cse19 .cse1 .cse23 (not (>= |ULTIMATE.start_main_~A~0#1| (* 2 .cse34))) .cse20 (>= |ULTIMATE.start_main_~r~0#1| (+ .cse30 (- .cse31)))) (and (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) .cse35 .cse7 .cse36 .cse8 .cse2 .cse29 .cse4 .cse3 .cse37 (= |ULTIMATE.start_main_~p~0#1| (* 2 .cse38)) .cse5 .cse39 (= |ULTIMATE.start_main_~d~0#1| .cse40) .cse15) (and .cse7 .cse22 .cse23 .cse8 .cse2) (and .cse35 .cse28 .cse7 .cse36 .cse2 .cse21 .cse41 .cse3 .cse4 .cse37 .cse5 .cse13 .cse33 .cse39 .cse42 .cse19 .cse15 .cse20 .cse43 .cse44) (and .cse24 (>= |ULTIMATE.start_main_~r~0#1| (+ .cse26 .cse45)) .cse46 .cse47 .cse28 .cse2 .cse21 .cse41 .cse48 .cse3 .cse4 .cse5 .cse13 .cse14 (>= .cse26 |ULTIMATE.start_main_~d~0#1|) .cse33 .cse42 .cse19 .cse1 (<= 4 .cse49) .cse15 .cse20 .cse43 .cse44) (let ((.cse52 (+ .cse31 (- 1))) (.cse53 (+ .cse27 (- 1)))) (and .cse28 (= |ULTIMATE.start_main_~r~0#1| (+ .cse26 .cse50)) .cse32 (<= .cse51 .cse52) .cse13 (<= .cse51 .cse30) .cse19 .cse20 (= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 1) .cse43 (<= .cse49 4) (<= |ULTIMATE.start_main_~d~0#1| .cse26) (<= .cse51 .cse53) .cse25 (<= .cse51 .cse26) .cse22 .cse2 .cse21 .cse41 (<= |ULTIMATE.start_main_~d~0#1| .cse30) .cse3 .cse33 .cse0 .cse42 .cse1 .cse23 (<= |ULTIMATE.start_main_~d~0#1| .cse52) (<= |ULTIMATE.start_main_~d~0#1| .cse53) .cse44)) (and .cse13 .cse14 .cse46 .cse19 .cse1 .cse15 .cse20 .cse2 .cse21 .cse3 .cse4 .cse5) (let ((.cse54 (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~r~0#1| (- 1))))) (and (= .cse54 .cse55) .cse22 .cse1 .cse2 (let ((.cse58 (= 0 (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2))) (.cse56 (div (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~r~0#1|)) 2)) (.cse57 (< .cse54 0))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse56) (or (not .cse57) .cse58)) (and (not .cse58) (= |ULTIMATE.start_main_~d~0#1| (+ 1 .cse56)) .cse57))) (= (+ |ULTIMATE.start_main_~q~0#1| .cse59) 0))) (and .cse0 .cse60 .cse22 .cse1 .cse61 .cse23 .cse2 .cse3) (let ((.cse62 (+ 0 |ULTIMATE.start_main_~p~0#1|))) (and .cse24 (>= |ULTIMATE.start_main_~q~0#1| .cse62) (<= |ULTIMATE.start_main_~q~0#1| .cse62) .cse16 .cse2 .cse17 .cse4 .cse3 .cse63 (= |ULTIMATE.start_main_~p~0#1| 4) .cse64 .cse5 .cse65 .cse39 (<= .cse51 |ULTIMATE.start_main_~A~0#1|) .cse15 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) .cse18)) (and .cse46 .cse47 .cse2 .cse29 .cse48 .cse3 .cse13 .cse14 (<= .cse66 |ULTIMATE.start_main_~A~0#1|) .cse60 (<= |ULTIMATE.start_main_~q~0#1| (+ 0 .cse38)) .cse1 .cse61 .cse15) (and .cse65 .cse67 .cse68 .cse39 .cse69 .cse7 .cse15 .cse8 .cse2 (= |ULTIMATE.start_main_~d~0#1| .cse38) .cse70 .cse64) (and .cse28 .cse2 .cse21 .cse3 .cse4 .cse63 .cse5 .cse13 .cse33 .cse39 .cse19 .cse15 .cse20) (and .cse71 .cse46 .cse22 .cse72 .cse2 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~B~0#1| (- 2))) .cse50)) .cse32 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (- 2)) .cse45)) .cse73 .cse13 (= (+ .cse49 .cse59) 0) .cse74 .cse75 .cse1 .cse23 .cse76 (= (+ |ULTIMATE.start_main_~q~0#1| (- 2)) 1)) (and .cse13 .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse13 .cse75 .cse22 .cse72 .cse23 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse50)) .cse2 .cse17 .cse16 .cse3 (= (+ |ULTIMATE.start_main_~q~0#1| (* 1 (- 1))) 0) .cse32) (and .cse13 .cse33 .cse0 .cse28 .cse19 .cse1 .cse20 .cse2 .cse21 .cse3 .cse4 .cse5)))))))))) [2023-02-18 18:27:12,976 INFO L899 garLoopResultBuilder]: For program point L37(lines 34 42) no Hoare annotation was computed. [2023-02-18 18:27:12,976 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 18:27:12,977 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse84 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse44 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse78 (- .cse44)) (.cse85 (+ 1 .cse84))) (let ((.cse20 (= 0 (mod |ULTIMATE.start_main_~d~0#1| 2))) (.cse100 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse51 (- |ULTIMATE.start_main_~d~0#1|)) (.cse35 (+ |ULTIMATE.start_main_~q~0#1| .cse85)) (.cse101 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse27 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse39 (+ |ULTIMATE.start_main_~q~0#1| .cse84)) (.cse83 (+ (- 1) .cse78))) (let ((.cse38 (= 1 .cse84)) (.cse34 (= 1 .cse85)) (.cse37 (+ |ULTIMATE.start_main_~r~0#1| .cse83)) (.cse97 (* .cse39 |ULTIMATE.start_main_~B~0#1|)) (.cse31 (and .cse101 (not .cse27))) (.cse96 (* .cse35 |ULTIMATE.start_main_~B~0#1|)) (.cse36 (+ |ULTIMATE.start_main_~r~0#1| .cse78)) (.cse28 (not .cse101)) (.cse54 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse9 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse11 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse42 (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse43 (+ |ULTIMATE.start_main_~r~0#1| .cse51)) (.cse41 (+ 1 .cse44)) (.cse26 (not .cse100)) (.cse14 (and .cse100 (not .cse20))) (.cse99 (+ .cse84 1))) (let ((.cse65 (= 0 (mod .cse99 2))) (.cse92 (< .cse85 0)) (.cse89 (div .cse99 2)) (.cse86 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse93 (< .cse84 0)) (.cse70 (= 0 (mod .cse84 2))) (.cse47 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse41 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse20 .cse26) (or .cse14 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse44 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))))) (.cse48 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse2 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse49 (+ |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~p~0#1| (- 1)))) (.cse50 (= |ULTIMATE.start_main_~d~0#1| 1)) (.cse52 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse42 |ULTIMATE.start_main_~B~0#1|) .cse43))) (.cse8 (let ((.cse98 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|)))) (or (and .cse54 .cse98) (and .cse9 .cse11 .cse3 .cse98)))) (.cse58 (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse36)) .cse31) (or .cse27 (= |ULTIMATE.start_main_~A~0#1| (+ .cse96 .cse36)) .cse28)) .cse14)) (.cse59 (or (and (or .cse27 (= |ULTIMATE.start_main_~A~0#1| (+ .cse96 .cse37)) .cse28) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse97 .cse37)) .cse31)) .cse20 .cse26)) (.cse61 (- |ULTIMATE.start_main_~B~0#1|)) (.cse46 (and (or .cse31 (not .cse38)) (or .cse27 (not .cse34) .cse28))) (.cse94 (+ .cse44 1))) (let ((.cse25 (= 0 (mod .cse94 2))) (.cse90 (< .cse41 0)) (.cse16 (= 0 (mod .cse44 2))) (.cse91 (< .cse44 0)) (.cse13 (or (and (or .cse20 (= |ULTIMATE.start_main_~B~0#1| .cse41) .cse26) (or .cse14 (= |ULTIMATE.start_main_~B~0#1| .cse44))) .cse46)) (.cse12 (let ((.cse95 (or (and .cse52 .cse8 .cse54) (and .cse52 .cse8 .cse58 .cse59 .cse54) (and .cse52 .cse8 .cse58 .cse59 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse61)) .cse3 (= (+ |ULTIMATE.start_main_~q~0#1| (* 1 (- 1))) 0))))) (or (and (or .cse47 .cse46) .cse48 .cse95) (and .cse2 (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| .cse51)) (= .cse49 0) .cse50 .cse95)))) (.cse19 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse22 (div .cse94 2)) (.cse72 (and .cse93 (not .cse70))) (.cse71 (not .cse93)) (.cse87 (+ 1 .cse86)) (.cse88 (+ 1 .cse89)) (.cse66 (not .cse92)) (.cse62 (and .cse92 (not .cse65)))) (let ((.cse29 (and (or .cse65 (not (= 1 .cse88)) .cse66) (or (not (= 1 .cse89)) .cse62))) (.cse30 (and (or .cse72 (not (= 1 .cse86))) (or .cse70 .cse71 (not (= 1 .cse87))))) (.cse23 (+ 1 .cse22)) (.cse17 (+ 1 .cse19)) (.cse7 (* (* 2 1) (- 1))) (.cse0 (or (and .cse13 .cse12 (<= 1 |ULTIMATE.start_main_~d~0#1|)) (and .cse13 .cse12))) (.cse18 (and (not .cse16) .cse91)) (.cse15 (not .cse91)) (.cse24 (not .cse90)) (.cse21 (and (not .cse25) .cse90))) (let ((.cse10 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse32 (let ((.cse40 (let ((.cse63 (* (+ .cse35 .cse89) |ULTIMATE.start_main_~B~0#1|)) (.cse67 (* (+ .cse35 .cse88) |ULTIMATE.start_main_~B~0#1|)) (.cse69 (* (+ .cse39 .cse87) |ULTIMATE.start_main_~B~0#1|)) (.cse73 (* (+ .cse39 .cse86) |ULTIMATE.start_main_~B~0#1|)) (.cse75 (* (+ .cse42 .cse85) |ULTIMATE.start_main_~B~0#1|)) (.cse77 (* (+ .cse42 .cse84) |ULTIMATE.start_main_~B~0#1|))) (let ((.cse55 (or (let ((.cse82 (+ .cse43 .cse83))) (and (or .cse27 (= |ULTIMATE.start_main_~A~0#1| (+ .cse75 .cse82)) .cse28) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse77 .cse82)) .cse31))) .cse20 .cse26)) (.cse56 (or .cse20 (let ((.cse81 (- .cse22))) (let ((.cse80 (+ .cse37 (+ (- 1) .cse81))) (.cse79 (+ .cse37 .cse81))) (and (or .cse27 (and (or .cse21 (and (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse63 .cse79))) (or .cse65 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse79)) .cse66))) (or .cse24 .cse25 (and (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse63 .cse80))) (or .cse65 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse80)) .cse66)))) .cse28) (or (and (or (and (or .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse80))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse69 .cse80)) .cse70 .cse71)) .cse24 .cse25) (or .cse21 (and (or .cse70 .cse71 (= |ULTIMATE.start_main_~A~0#1| (+ .cse69 .cse79))) (or .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse79)))))) .cse31)))) .cse26)) (.cse53 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ (+ |ULTIMATE.start_main_~r~0#1| (- (* 2 |ULTIMATE.start_main_~d~0#1|))) .cse51)))) (.cse57 (or .cse14 (let ((.cse76 (+ .cse43 .cse78))) (and (or .cse27 .cse28 (= |ULTIMATE.start_main_~A~0#1| (+ .cse75 .cse76))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse77 .cse76)) .cse31))))) (.cse60 (or .cse14 (let ((.cse74 (- .cse19))) (let ((.cse64 (+ .cse36 .cse74)) (.cse68 (+ .cse36 (+ (- 1) .cse74)))) (and (or .cse27 (and (or .cse18 (and (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse63 .cse64))) (or .cse65 .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse64))))) (or .cse15 (and (or .cse65 (= |ULTIMATE.start_main_~A~0#1| (+ .cse67 .cse68)) .cse66) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse63 .cse68)) .cse62)) .cse16)) .cse28) (or .cse31 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse69 .cse64)) .cse70 .cse71) (or .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse64)))) .cse18) (or (and (or .cse70 .cse71 (= |ULTIMATE.start_main_~A~0#1| (+ .cse69 .cse68))) (or .cse72 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse68)))) .cse15 .cse16))))))))) (or (and .cse52 .cse0 .cse53 .cse54) (and .cse55 .cse56 .cse52 .cse0 .cse53 .cse57 .cse58 .cse59 .cse3 .cse60 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~B~0#1| (- 2))) .cse61)) (= (+ |ULTIMATE.start_main_~q~0#1| (- 2)) 1)) (and .cse55 .cse56 .cse52 .cse0 .cse53 .cse57 .cse58 .cse59 .cse60 .cse54)))))) (or (let ((.cse45 (= 1 |ULTIMATE.start_main_~p~0#1|))) (and (or .cse27 .cse34 (and (or .cse14 (and (or .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse17 .cse35) .cse36)) .cse16) (or .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse19 .cse35) .cse36))))) (or .cse20 (and (or .cse24 .cse25 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse23 .cse35) .cse37))) (or .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse22 .cse35) .cse37)))) .cse26)) .cse28 .cse29) (or .cse38 .cse30 (and (or .cse20 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse23 .cse39) .cse37)) .cse24 .cse25) (or .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse22 .cse39) .cse37)))) .cse26) (or .cse14 (and (or .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse19 .cse39) .cse36))) (or .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse17 .cse39) .cse36)) .cse16)))) .cse31) .cse40 (or (and (or .cse20 .cse26 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse41 .cse42) .cse43))) (or .cse14 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse44 .cse42) .cse43)))) .cse45 .cse46) (or .cse45 .cse47 .cse46) .cse48)) (and (= (+ .cse49 .cse7) 0) .cse40 .cse2 .cse50 (= |ULTIMATE.start_main_~r~0#1| (+ (+ |ULTIMATE.start_main_~A~0#1| (- 2)) .cse51)))))) (.cse33 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (or (let ((.cse1 (+ |ULTIMATE.start_main_~A~0#1| (* |ULTIMATE.start_main_~r~0#1| (- 1))))) (and .cse0 (= .cse1 (* 2 |ULTIMATE.start_main_~B~0#1|)) .cse2 .cse3 (let ((.cse6 (= 0 (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2))) (.cse4 (div (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~r~0#1|)) 2)) (.cse5 (< .cse1 0))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse4) (or (not .cse5) .cse6)) (and (not .cse6) (= |ULTIMATE.start_main_~d~0#1| (+ 1 .cse4)) .cse5))) (= (+ |ULTIMATE.start_main_~q~0#1| .cse7) 0))) (and .cse8 .cse2 .cse9 .cse10 .cse11 .cse3) (and .cse2 .cse10 .cse12 .cse3) (and .cse13 (or (and (or .cse14 (and (or .cse15 .cse16 (= |ULTIMATE.start_main_~B~0#1| .cse17)) (or .cse18 (= |ULTIMATE.start_main_~B~0#1| .cse19)))) (or .cse20 (and (or .cse21 (= |ULTIMATE.start_main_~B~0#1| .cse22)) (or (= |ULTIMATE.start_main_~B~0#1| .cse23) .cse24 .cse25)) .cse26)) (and (or .cse27 .cse28 .cse29) (or .cse30 .cse31))) .cse32 .cse33) (and .cse2 .cse10 .cse11 .cse3) (and .cse2 .cse10 .cse3 .cse32) (and .cse13 .cse12 .cse33)))))))))) [2023-02-18 18:27:12,977 INFO L899 garLoopResultBuilder]: For program point L46(lines 44 56) no Hoare annotation was computed. [2023-02-18 18:27:12,977 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 18:27:12,980 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 42) the Hoare annotation is: (let ((.cse183 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse192 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse193 (+ 1 .cse192)) (.cse181 (- .cse183))) (let ((.cse191 (+ (- 1) .cse181)) (.cse146 (+ |ULTIMATE.start_main_~q~0#1| .cse193)) (.cse141 (+ |ULTIMATE.start_main_~q~0#1| .cse192)) (.cse197 (mod |ULTIMATE.start_main_~d~0#1| 2)) (.cse151 (+ .cse192 1))) (let ((.cse139 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse136 (div .cse151 2)) (.cse113 (+ .cse183 1)) (.cse39 (= 1 |ULTIMATE.start_main_~p~0#1|)) (.cse118 (- |ULTIMATE.start_main_~d~0#1|)) (.cse36 (= 0 .cse197)) (.cse203 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse25 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse83 (+ |ULTIMATE.start_main_~r~0#1| .cse181)) (.cse202 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse205 (* .cse141 |ULTIMATE.start_main_~B~0#1|)) (.cse204 (* .cse146 |ULTIMATE.start_main_~B~0#1|)) (.cse108 (+ |ULTIMATE.start_main_~r~0#1| .cse191))) (let ((.cse13 (= 1 .cse192)) (.cse31 (= 1 .cse193)) (.cse44 (= |ULTIMATE.start_main_~A~0#1| (+ .cse204 .cse108))) (.cse40 (= |ULTIMATE.start_main_~A~0#1| (+ .cse205 .cse108))) (.cse37 (not .cse202)) (.cse41 (= |ULTIMATE.start_main_~A~0#1| (+ .cse205 .cse83))) (.cse24 (and .cse203 (not .cse25))) (.cse43 (= |ULTIMATE.start_main_~A~0#1| (+ .cse204 .cse83))) (.cse32 (not .cse203)) (.cse42 (and .cse202 (not .cse36))) (.cse150 (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse33 (+ |ULTIMATE.start_main_~r~0#1| .cse118)) (.cse3 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse2 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse196 (not .cse39)) (.cse89 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse112 (div .cse113 2)) (.cse182 (+ 1 .cse183)) (.cse28 (= 0 (mod .cse151 2))) (.cse200 (< .cse193 0)) (.cse137 (+ 1 .cse136)) (.cse138 (+ 1 .cse139)) (.cse201 (< .cse192 0)) (.cse14 (= 0 (mod .cse192 2)))) (let ((.cse23 (and .cse201 (not .cse14))) (.cse70 (= 1 .cse139)) (.cse21 (not .cse201)) (.cse81 (= 1 .cse138)) (.cse46 (= 1 .cse137)) (.cse30 (not .cse200)) (.cse57 (= 1 .cse136)) (.cse26 (and .cse200 (not .cse28))) (.cse18 (= 0 (mod .cse113 2))) (.cse194 (< .cse182 0)) (.cse63 (= 0 (mod .cse183 2))) (.cse195 (< .cse183 0)) (.cse117 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse116 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse35 (- .cse112)) (.cse95 (- .cse89)) (.cse198 (div .cse118 (- 2))) (.cse171 (or .cse2 .cse196)) (.cse9 (or .cse3 (= (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~r~0#1|)) 0))) (.cse90 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse150 |ULTIMATE.start_main_~B~0#1|) .cse33))) (.cse10 (= 0 |ULTIMATE.start_main_~q~0#1|)) (.cse169 (or (and (or .cse41 .cse24) (or .cse25 .cse43 .cse32)) .cse42)) (.cse165 (or (and (or .cse25 .cse44 .cse32) (or .cse40 .cse24)) .cse36 .cse37)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse5 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse7 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse11 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse187 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse182 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse36 .cse37) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse183 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))))) (.cse184 (and (or .cse24 (not .cse13)) (or .cse25 (not .cse31) .cse32)))) (let ((.cse12 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse0 (* 2 1)) (.cse156 (let ((.cse199 (or .cse187 .cse184))) (or (and .cse9 .cse90 .cse171 .cse199 .cse10 .cse3 .cse169 .cse165 .cse4 .cse5 .cse7 .cse11) (and .cse9 .cse90 .cse199 .cse10 .cse2 .cse3 .cse169 .cse165 .cse4 .cse5 .cse7 .cse11)))) (.cse157 (<= 2 .cse198)) (.cse158 (>= |ULTIMATE.start_main_~r~0#1| .cse198)) (.cse159 (= .cse197 0)) (.cse96 (or (and (or .cse36 (= |ULTIMATE.start_main_~B~0#1| .cse182) .cse37) (or .cse42 (= |ULTIMATE.start_main_~B~0#1| .cse183))) .cse184)) (.cse119 (or .cse196 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse94 (+ (- 1) .cse95)) (.cse34 (+ (- 1) .cse35)) (.cse123 (+ |ULTIMATE.start_main_~q~0#1| .cse116)) (.cse126 (+ |ULTIMATE.start_main_~r~0#1| (- .cse117))) (.cse45 (not .cse195)) (.cse88 (+ 1 .cse89)) (.cse64 (and (not .cse63) .cse195)) (.cse19 (and (not .cse18) .cse194)) (.cse115 (+ 1 .cse112)) (.cse15 (not .cse194)) (.cse189 (and (or .cse28 (not .cse46) .cse30) (or (not .cse57) .cse26))) (.cse188 (and (or .cse23 (not .cse70)) (or .cse14 .cse21 (not .cse81))))) (let ((.cse38 (or (and (or .cse42 (and (or .cse45 .cse63 (= |ULTIMATE.start_main_~B~0#1| .cse88)) (or .cse64 (= |ULTIMATE.start_main_~B~0#1| .cse89)))) (or .cse36 (and (or .cse19 (= |ULTIMATE.start_main_~B~0#1| .cse112)) (or (= |ULTIMATE.start_main_~B~0#1| .cse115) .cse15 .cse18)) .cse37)) (and (or .cse25 .cse32 .cse189) (or .cse188 .cse24)))) (.cse91 (let ((.cse172 (* (+ .cse146 .cse136) |ULTIMATE.start_main_~B~0#1|)) (.cse174 (* (+ .cse146 .cse137) |ULTIMATE.start_main_~B~0#1|)) (.cse176 (* (+ .cse141 .cse138) |ULTIMATE.start_main_~B~0#1|)) (.cse177 (* (+ .cse141 .cse139) |ULTIMATE.start_main_~B~0#1|)) (.cse178 (* (+ .cse150 .cse193) |ULTIMATE.start_main_~B~0#1|)) (.cse180 (* (+ .cse150 .cse192) |ULTIMATE.start_main_~B~0#1|))) (let ((.cse160 (or (let ((.cse190 (+ .cse33 .cse191))) (and (or .cse25 (= |ULTIMATE.start_main_~A~0#1| (+ .cse178 .cse190)) .cse32) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse180 .cse190)) .cse24))) .cse36 .cse37)) (.cse161 (or .cse25 .cse31 (and (or .cse42 (and (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse88 .cse146) .cse83)) .cse63) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse89 .cse146) .cse83))))) (or .cse36 (and (or .cse15 .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse115 .cse146) .cse108))) (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse112 .cse146) .cse108)))) .cse37)) .cse32 .cse189)) (.cse162 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse123 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse126 .cse118)))) (.cse163 (or .cse13 .cse188 (and (or .cse36 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse115 .cse141) .cse108)) .cse15 .cse18) (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse112 .cse141) .cse108)))) .cse37) (or .cse42 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse89 .cse141) .cse83))) (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse88 .cse141) .cse83)) .cse63)))) .cse24)) (.cse164 (or .cse39 .cse187 .cse184)) (.cse166 (or .cse36 (let ((.cse186 (+ .cse108 .cse34)) (.cse185 (+ .cse108 .cse35))) (and (or .cse25 (and (or .cse19 (and (or .cse26 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse185))) (or .cse28 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse185)) .cse30))) (or .cse15 .cse18 (and (or .cse26 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse186))) (or .cse28 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse186)) .cse30)))) .cse32) (or (and (or (and (or .cse23 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse186))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse186)) .cse14 .cse21)) .cse15 .cse18) (or .cse19 (and (or .cse14 .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse185))) (or .cse23 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse185)))))) .cse24))) .cse37)) (.cse167 (or (and (or .cse36 .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse182 .cse150) .cse33))) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse183 .cse150) .cse33)))) .cse39 .cse184)) (.cse168 (or .cse42 (let ((.cse179 (+ .cse33 .cse181))) (and (or .cse25 .cse32 (= |ULTIMATE.start_main_~A~0#1| (+ .cse178 .cse179))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse180 .cse179)) .cse24))))) (.cse170 (or .cse42 (let ((.cse173 (+ .cse83 .cse95)) (.cse175 (+ .cse83 .cse94))) (and (or .cse25 (and (or .cse64 (and (or .cse26 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse173))) (or .cse28 .cse30 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse173))))) (or .cse45 (and (or .cse28 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse175)) .cse30) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse175)) .cse26)) .cse63)) .cse32) (or .cse24 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse173)) .cse14 .cse21) (or .cse23 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse173)))) .cse64) (or (and (or .cse14 .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse175))) (or .cse23 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse175)))) .cse45 .cse63)))))))) (or (and .cse160 .cse161 .cse156 .cse157 .cse158 .cse162 .cse163 .cse164 .cse2 .cse165 .cse159 .cse7 .cse166 .cse90 .cse96 .cse167 .cse168 .cse169 .cse119 .cse170) (and .cse160 .cse161 .cse156 .cse157 .cse158 .cse162 .cse163 .cse164 .cse165 .cse159 .cse7 .cse166 .cse90 .cse171 .cse96 .cse167 .cse168 .cse169 .cse119 .cse170))))) (.cse1 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse6 (= |ULTIMATE.start_main_~d~0#1| (* 1 |ULTIMATE.start_main_~p~0#1|))) (.cse154 (* 2 .cse0)) (.cse8 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| 1) |ULTIMATE.start_main_~r~0#1|))) (.cse155 (* 2 .cse12))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse9 .cse10 (= |ULTIMATE.start_main_~p~0#1| .cse0) .cse11 (= |ULTIMATE.start_main_~d~0#1| .cse12)) (let ((.cse152 (+ .cse136 1)) (.cse153 (+ .cse139 1))) (let ((.cse77 (= 0 (mod .cse153 2))) (.cse140 (< .cse138 0)) (.cse142 (div .cse153 2)) (.cse143 (< .cse139 0)) (.cse73 (= 0 (mod .cse139 2))) (.cse144 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse56 (= 0 (mod .cse152 2))) (.cse147 (div .cse152 2)) (.cse145 (< .cse137 0)) (.cse148 (< .cse136 0)) (.cse58 (= 0 (mod .cse136 2))) (.cse149 (div .cse151 4))) (let ((.cse22 (* (+ .cse150 .cse139) |ULTIMATE.start_main_~B~0#1|)) (.cse16 (* (+ .cse150 .cse138) |ULTIMATE.start_main_~B~0#1|)) (.cse27 (* (+ .cse150 .cse136) |ULTIMATE.start_main_~B~0#1|)) (.cse29 (* (+ .cse150 .cse137) |ULTIMATE.start_main_~B~0#1|)) (.cse61 (* (+ .cse146 .cse149) |ULTIMATE.start_main_~B~0#1|)) (.cse62 (and .cse148 (not .cse58))) (.cse60 (* (+ .cse146 (+ 1 .cse149)) |ULTIMATE.start_main_~B~0#1|)) (.cse59 (not .cse148)) (.cse55 (not .cse145)) (.cse54 (* (+ .cse146 (+ 1 .cse147)) |ULTIMATE.start_main_~B~0#1|)) (.cse47 (* (+ .cse146 .cse147) |ULTIMATE.start_main_~B~0#1|)) (.cse53 (and .cse145 (not .cse56))) (.cse71 (* (+ .cse141 .cse144) |ULTIMATE.start_main_~B~0#1|)) (.cse72 (and .cse143 (not .cse73))) (.cse74 (* (+ .cse141 (+ 1 .cse144)) |ULTIMATE.start_main_~B~0#1|)) (.cse75 (not .cse143)) (.cse79 (* (+ .cse141 .cse142) |ULTIMATE.start_main_~B~0#1|)) (.cse80 (and (not .cse77) .cse140)) (.cse78 (* (+ .cse141 (+ 1 .cse142)) |ULTIMATE.start_main_~B~0#1|)) (.cse76 (not .cse140)) (.cse131 (* (+ |ULTIMATE.start_main_~q~0#1| .cse139) |ULTIMATE.start_main_~B~0#1|)) (.cse128 (* (+ |ULTIMATE.start_main_~q~0#1| .cse138) |ULTIMATE.start_main_~B~0#1|)) (.cse133 (* (+ |ULTIMATE.start_main_~q~0#1| .cse137) |ULTIMATE.start_main_~B~0#1|)) (.cse132 (* (+ |ULTIMATE.start_main_~q~0#1| .cse136) |ULTIMATE.start_main_~B~0#1|))) (and .cse2 (or (let ((.cse20 (+ .cse33 .cse35)) (.cse17 (+ .cse33 .cse34))) (and (or .cse13 (and (or .cse14 (and (or .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse16 .cse17)) .cse18) (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse16 .cse20)))) .cse21) (or (and (or .cse15 .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ .cse22 .cse17))) (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse22 .cse20)))) .cse23)) .cse24) (or .cse25 (and (or .cse26 (and (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse27 .cse20))) (or .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse27 .cse17)) .cse18))) (or .cse28 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse29 .cse20)) .cse19) (or .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse29 .cse17)) .cse18)) .cse30)) .cse31 .cse32))) .cse36 .cse37) .cse3 .cse38 .cse5 (or .cse39 (and (or (and (or .cse40 .cse36 .cse37) (or .cse41 .cse42)) .cse24) (or .cse25 (and (or .cse43 .cse42) (or .cse44 .cse36 .cse37)) .cse32))) (or .cse42 (let ((.cse87 (+ .cse89 1))) (let ((.cse67 (= 0 (mod .cse89 2))) (.cse84 (- (div |ULTIMATE.start_main_~d~0#1| 8))) (.cse82 (< .cse89 0)) (.cse49 (= 0 (mod .cse87 2))) (.cse86 (< .cse88 0)) (.cse85 (- (div .cse87 2)))) (let ((.cse48 (+ .cse83 (+ (- 1) .cse85))) (.cse50 (not .cse86)) (.cse51 (and .cse86 (not .cse49))) (.cse52 (+ .cse83 .cse85)) (.cse69 (not .cse82)) (.cse68 (+ .cse83 (+ (- 1) .cse84))) (.cse65 (+ .cse83 .cse84)) (.cse66 (and .cse82 (not .cse67)))) (and (or (and (or .cse45 (and (or .cse28 .cse46 .cse30 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse48)) .cse49 .cse50) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse52)))) .cse53) (or (and (or .cse49 (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse48)) .cse50) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse52)))) .cse55 .cse56))) (or .cse57 .cse26 (and (or .cse58 .cse59 (and (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse52))) (or .cse49 .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse48))))) (or (and (or .cse49 (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse48)) .cse50) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse52)))) .cse62)))) .cse63) (or .cse64 (and (or (and (or .cse55 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse65)) .cse66) (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse68)) .cse69)) .cse56) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse65)) .cse66) (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse68)) .cse69)) .cse53)) .cse28 .cse46 .cse30) (or .cse57 .cse26 (and (or (and (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse65)) .cse66)) .cse62) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse65)) .cse66) (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse68)) .cse69)) .cse58 .cse59)))))) .cse25 .cse32) (or (and (or (and (or .cse70 .cse23 (and (or (and (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse52))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse48)) .cse49 .cse50)) .cse72) (or .cse73 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse48)) .cse49 .cse50) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse52)))) .cse75))) (or .cse14 .cse21 (and (or .cse76 .cse77 (and (or .cse49 .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse48))) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse52))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse48)) .cse49 .cse50) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse52)))) .cse80)) .cse81)) .cse45 .cse63) (or .cse64 (and (or .cse14 (and (or (and (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse65)) .cse66)) .cse76 .cse77) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse68)) .cse67 .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse65)) .cse66)) .cse80)) .cse21 .cse81) (or .cse70 .cse23 (and (or (and (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse65)) .cse66)) .cse72) (or .cse73 (and (or .cse67 .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse68))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse65)) .cse66)) .cse75)))))) .cse24)))))) .cse7 .cse6 .cse8 .cse90 .cse91 (or .cse42 (let ((.cse92 (+ .cse33 .cse95)) (.cse93 (+ .cse33 .cse94))) (and (or .cse13 .cse24 (and (or .cse23 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse22 .cse92))) (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse22 .cse93)) .cse63))) (or (and (or .cse45 .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse16 .cse93))) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse16 .cse92)))) .cse14 .cse21))) (or .cse25 (and (or .cse26 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse27 .cse92))) (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse27 .cse93)) .cse63))) (or .cse28 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse29 .cse92))) (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse29 .cse93)) .cse63)) .cse30)) .cse31 .cse32)))) .cse96 (or .cse36 (let ((.cse114 (+ .cse112 1))) (let ((.cse107 (< .cse115 0)) (.cse99 (= 0 (mod .cse114 2))) (.cse109 (- (div .cse114 2))) (.cse105 (= 0 (mod .cse112 2))) (.cse111 (- (div .cse113 4))) (.cse110 (< .cse112 0))) (let ((.cse104 (not .cse110)) (.cse106 (+ .cse108 (+ (- 1) .cse111))) (.cse102 (+ .cse108 .cse111)) (.cse103 (and .cse110 (not .cse105))) (.cse100 (+ .cse108 .cse109)) (.cse101 (and .cse107 (not .cse99))) (.cse98 (+ .cse108 (+ (- 1) .cse109))) (.cse97 (not .cse107))) (and (or (and (or .cse15 .cse18 (and (or .cse28 .cse46 .cse30 (and (or .cse55 (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse98)) .cse99) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse100)) .cse101)) .cse56) (or (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse98)) .cse99) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse100)) .cse101)) .cse53))) (or .cse57 .cse26 (and (or .cse58 .cse59 (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse98)) .cse99) (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse100))))) (or .cse62 (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse98)) .cse99) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse100)) .cse101))))))) (or .cse19 (and (or .cse57 .cse26 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse102)) .cse103) (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse106)))) .cse62) (or .cse58 (and (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse106))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse102)) .cse103)) .cse59))) (or .cse28 .cse46 .cse30 (and (or .cse55 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse102)) .cse103) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse106)) .cse104 .cse105)) .cse56) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse102)) .cse103) (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse106)))) .cse53)))))) .cse25 .cse32) (or (and (or .cse19 (and (or .cse70 .cse23 (and (or .cse73 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse106)) .cse104 .cse105) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse102)) .cse103)) .cse75) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse102)) .cse103) (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse106)))) .cse72))) (or (and (or (and (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse102))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse106)) .cse104 .cse105)) .cse80) (or .cse76 .cse77 (and (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse106))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse102)) .cse103)))) .cse14 .cse21 .cse81))) (or .cse15 .cse18 (and (or (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse100)) .cse101) (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse98)) .cse99)) .cse72) (or (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse98)) .cse99) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse100)) .cse101)) .cse73 .cse75)) .cse70 .cse23) (or .cse14 (and (or (and (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse100))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse98)) .cse97 .cse99)) .cse80) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse100)) .cse101) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse98)) .cse97 .cse99)) .cse76 .cse77)) .cse21 .cse81)))) .cse24))))) .cse37) (or (= 1 .cse116) (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse116)) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ (+ |ULTIMATE.start_main_~r~0#1| (- (* 2 .cse117))) .cse118)))) .cse119 (or (let ((.cse127 (- (div .cse117 4)))) (let ((.cse122 (+ .cse126 (+ (- 1) .cse127))) (.cse121 (+ .cse126 .cse127)) (.cse124 (div .cse116 4))) (and (or .cse24 (let ((.cse120 (* (+ .cse123 .cse124) |ULTIMATE.start_main_~B~0#1|))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse120 .cse121)) .cse42) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse120 .cse122)) .cse36 .cse37)))) (or .cse25 (let ((.cse125 (* (+ .cse123 (+ 1 .cse124)) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse125 .cse122)) .cse37) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse125 .cse121))))) .cse32)))) .cse39) (or .cse36 (let ((.cse130 (+ |ULTIMATE.start_main_~r~0#1| .cse34)) (.cse129 (+ |ULTIMATE.start_main_~r~0#1| .cse35))) (and (or .cse13 (and (or .cse14 (and (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse129))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse130)) .cse15 .cse18)) .cse21) (or .cse23 (and (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse129))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse130)) .cse15 .cse18)))) .cse24) (or .cse25 (and (or .cse26 (and (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse132 .cse129))) (or .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse132 .cse130)) .cse18))) (or .cse28 (and (or .cse15 .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse130))) (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse129)))) .cse30)) .cse31 .cse32))) .cse37) (or (let ((.cse134 (+ |ULTIMATE.start_main_~r~0#1| .cse94)) (.cse135 (+ |ULTIMATE.start_main_~r~0#1| .cse95))) (and (or .cse13 (and (or (and (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse134)) .cse63) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse135)))) .cse23) (or .cse14 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse135))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse134)) .cse45 .cse63)) .cse21)) .cse24) (or .cse25 .cse31 (and (or .cse28 .cse30 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse135))) (or .cse45 .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse134))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse132 .cse134)) .cse45 .cse63) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse132 .cse135)))) .cse26)) .cse32))) .cse42))))) (and .cse1 (= |ULTIMATE.start_main_~p~0#1| 1) .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~d~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~d~0#1| (* 1 1)) (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (<= 1 |ULTIMATE.start_main_~d~0#1|)) (and .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~p~0#1| (* 2 .cse154)) .cse8 .cse91 .cse96 (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse155)) .cse119) (and .cse156 .cse1 .cse157 .cse158 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~d~0#1| .cse154) .cse159 .cse6 .cse7 (= |ULTIMATE.start_main_~p~0#1| .cse154) .cse8 (= |ULTIMATE.start_main_~d~0#1| .cse155) .cse96 .cse119)))))))))) [2023-02-18 18:27:12,980 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-02-18 18:27:12,982 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse183 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse192 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse193 (+ 1 .cse192)) (.cse181 (- .cse183))) (let ((.cse191 (+ (- 1) .cse181)) (.cse146 (+ |ULTIMATE.start_main_~q~0#1| .cse193)) (.cse141 (+ |ULTIMATE.start_main_~q~0#1| .cse192)) (.cse197 (mod |ULTIMATE.start_main_~d~0#1| 2)) (.cse151 (+ .cse192 1))) (let ((.cse139 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse136 (div .cse151 2)) (.cse113 (+ .cse183 1)) (.cse39 (= 1 |ULTIMATE.start_main_~p~0#1|)) (.cse118 (- |ULTIMATE.start_main_~d~0#1|)) (.cse36 (= 0 .cse197)) (.cse203 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse25 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse83 (+ |ULTIMATE.start_main_~r~0#1| .cse181)) (.cse202 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse205 (* .cse141 |ULTIMATE.start_main_~B~0#1|)) (.cse204 (* .cse146 |ULTIMATE.start_main_~B~0#1|)) (.cse108 (+ |ULTIMATE.start_main_~r~0#1| .cse191))) (let ((.cse13 (= 1 .cse192)) (.cse31 (= 1 .cse193)) (.cse44 (= |ULTIMATE.start_main_~A~0#1| (+ .cse204 .cse108))) (.cse40 (= |ULTIMATE.start_main_~A~0#1| (+ .cse205 .cse108))) (.cse37 (not .cse202)) (.cse41 (= |ULTIMATE.start_main_~A~0#1| (+ .cse205 .cse83))) (.cse24 (and .cse203 (not .cse25))) (.cse43 (= |ULTIMATE.start_main_~A~0#1| (+ .cse204 .cse83))) (.cse32 (not .cse203)) (.cse42 (and .cse202 (not .cse36))) (.cse150 (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse33 (+ |ULTIMATE.start_main_~r~0#1| .cse118)) (.cse3 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse2 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse196 (not .cse39)) (.cse89 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse112 (div .cse113 2)) (.cse182 (+ 1 .cse183)) (.cse28 (= 0 (mod .cse151 2))) (.cse200 (< .cse193 0)) (.cse137 (+ 1 .cse136)) (.cse138 (+ 1 .cse139)) (.cse201 (< .cse192 0)) (.cse14 (= 0 (mod .cse192 2)))) (let ((.cse23 (and .cse201 (not .cse14))) (.cse70 (= 1 .cse139)) (.cse21 (not .cse201)) (.cse81 (= 1 .cse138)) (.cse46 (= 1 .cse137)) (.cse30 (not .cse200)) (.cse57 (= 1 .cse136)) (.cse26 (and .cse200 (not .cse28))) (.cse18 (= 0 (mod .cse113 2))) (.cse194 (< .cse182 0)) (.cse63 (= 0 (mod .cse183 2))) (.cse195 (< .cse183 0)) (.cse117 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse116 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse35 (- .cse112)) (.cse95 (- .cse89)) (.cse198 (div .cse118 (- 2))) (.cse171 (or .cse2 .cse196)) (.cse9 (or .cse3 (= (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~r~0#1|)) 0))) (.cse90 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse150 |ULTIMATE.start_main_~B~0#1|) .cse33))) (.cse10 (= 0 |ULTIMATE.start_main_~q~0#1|)) (.cse169 (or (and (or .cse41 .cse24) (or .cse25 .cse43 .cse32)) .cse42)) (.cse165 (or (and (or .cse25 .cse44 .cse32) (or .cse40 .cse24)) .cse36 .cse37)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse5 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse7 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse11 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse187 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse182 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse36 .cse37) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse183 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))))) (.cse184 (and (or .cse24 (not .cse13)) (or .cse25 (not .cse31) .cse32)))) (let ((.cse12 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse0 (* 2 1)) (.cse156 (let ((.cse199 (or .cse187 .cse184))) (or (and .cse9 .cse90 .cse171 .cse199 .cse10 .cse3 .cse169 .cse165 .cse4 .cse5 .cse7 .cse11) (and .cse9 .cse90 .cse199 .cse10 .cse2 .cse3 .cse169 .cse165 .cse4 .cse5 .cse7 .cse11)))) (.cse157 (<= 2 .cse198)) (.cse158 (>= |ULTIMATE.start_main_~r~0#1| .cse198)) (.cse159 (= .cse197 0)) (.cse96 (or (and (or .cse36 (= |ULTIMATE.start_main_~B~0#1| .cse182) .cse37) (or .cse42 (= |ULTIMATE.start_main_~B~0#1| .cse183))) .cse184)) (.cse119 (or .cse196 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse94 (+ (- 1) .cse95)) (.cse34 (+ (- 1) .cse35)) (.cse123 (+ |ULTIMATE.start_main_~q~0#1| .cse116)) (.cse126 (+ |ULTIMATE.start_main_~r~0#1| (- .cse117))) (.cse45 (not .cse195)) (.cse88 (+ 1 .cse89)) (.cse64 (and (not .cse63) .cse195)) (.cse19 (and (not .cse18) .cse194)) (.cse115 (+ 1 .cse112)) (.cse15 (not .cse194)) (.cse189 (and (or .cse28 (not .cse46) .cse30) (or (not .cse57) .cse26))) (.cse188 (and (or .cse23 (not .cse70)) (or .cse14 .cse21 (not .cse81))))) (let ((.cse38 (or (and (or .cse42 (and (or .cse45 .cse63 (= |ULTIMATE.start_main_~B~0#1| .cse88)) (or .cse64 (= |ULTIMATE.start_main_~B~0#1| .cse89)))) (or .cse36 (and (or .cse19 (= |ULTIMATE.start_main_~B~0#1| .cse112)) (or (= |ULTIMATE.start_main_~B~0#1| .cse115) .cse15 .cse18)) .cse37)) (and (or .cse25 .cse32 .cse189) (or .cse188 .cse24)))) (.cse91 (let ((.cse172 (* (+ .cse146 .cse136) |ULTIMATE.start_main_~B~0#1|)) (.cse174 (* (+ .cse146 .cse137) |ULTIMATE.start_main_~B~0#1|)) (.cse176 (* (+ .cse141 .cse138) |ULTIMATE.start_main_~B~0#1|)) (.cse177 (* (+ .cse141 .cse139) |ULTIMATE.start_main_~B~0#1|)) (.cse178 (* (+ .cse150 .cse193) |ULTIMATE.start_main_~B~0#1|)) (.cse180 (* (+ .cse150 .cse192) |ULTIMATE.start_main_~B~0#1|))) (let ((.cse160 (or (let ((.cse190 (+ .cse33 .cse191))) (and (or .cse25 (= |ULTIMATE.start_main_~A~0#1| (+ .cse178 .cse190)) .cse32) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse180 .cse190)) .cse24))) .cse36 .cse37)) (.cse161 (or .cse25 .cse31 (and (or .cse42 (and (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse88 .cse146) .cse83)) .cse63) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse89 .cse146) .cse83))))) (or .cse36 (and (or .cse15 .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse115 .cse146) .cse108))) (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse112 .cse146) .cse108)))) .cse37)) .cse32 .cse189)) (.cse162 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse123 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse126 .cse118)))) (.cse163 (or .cse13 .cse188 (and (or .cse36 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse115 .cse141) .cse108)) .cse15 .cse18) (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse112 .cse141) .cse108)))) .cse37) (or .cse42 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse89 .cse141) .cse83))) (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse88 .cse141) .cse83)) .cse63)))) .cse24)) (.cse164 (or .cse39 .cse187 .cse184)) (.cse166 (or .cse36 (let ((.cse186 (+ .cse108 .cse34)) (.cse185 (+ .cse108 .cse35))) (and (or .cse25 (and (or .cse19 (and (or .cse26 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse185))) (or .cse28 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse185)) .cse30))) (or .cse15 .cse18 (and (or .cse26 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse186))) (or .cse28 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse186)) .cse30)))) .cse32) (or (and (or (and (or .cse23 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse186))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse186)) .cse14 .cse21)) .cse15 .cse18) (or .cse19 (and (or .cse14 .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse185))) (or .cse23 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse185)))))) .cse24))) .cse37)) (.cse167 (or (and (or .cse36 .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse182 .cse150) .cse33))) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse183 .cse150) .cse33)))) .cse39 .cse184)) (.cse168 (or .cse42 (let ((.cse179 (+ .cse33 .cse181))) (and (or .cse25 .cse32 (= |ULTIMATE.start_main_~A~0#1| (+ .cse178 .cse179))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse180 .cse179)) .cse24))))) (.cse170 (or .cse42 (let ((.cse173 (+ .cse83 .cse95)) (.cse175 (+ .cse83 .cse94))) (and (or .cse25 (and (or .cse64 (and (or .cse26 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse173))) (or .cse28 .cse30 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse173))))) (or .cse45 (and (or .cse28 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse175)) .cse30) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse175)) .cse26)) .cse63)) .cse32) (or .cse24 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse173)) .cse14 .cse21) (or .cse23 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse173)))) .cse64) (or (and (or .cse14 .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse175))) (or .cse23 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse175)))) .cse45 .cse63)))))))) (or (and .cse160 .cse161 .cse156 .cse157 .cse158 .cse162 .cse163 .cse164 .cse2 .cse165 .cse159 .cse7 .cse166 .cse90 .cse96 .cse167 .cse168 .cse169 .cse119 .cse170) (and .cse160 .cse161 .cse156 .cse157 .cse158 .cse162 .cse163 .cse164 .cse165 .cse159 .cse7 .cse166 .cse90 .cse171 .cse96 .cse167 .cse168 .cse169 .cse119 .cse170))))) (.cse1 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse6 (= |ULTIMATE.start_main_~d~0#1| (* 1 |ULTIMATE.start_main_~p~0#1|))) (.cse154 (* 2 .cse0)) (.cse8 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| 1) |ULTIMATE.start_main_~r~0#1|))) (.cse155 (* 2 .cse12))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse9 .cse10 (= |ULTIMATE.start_main_~p~0#1| .cse0) .cse11 (= |ULTIMATE.start_main_~d~0#1| .cse12)) (let ((.cse152 (+ .cse136 1)) (.cse153 (+ .cse139 1))) (let ((.cse77 (= 0 (mod .cse153 2))) (.cse140 (< .cse138 0)) (.cse142 (div .cse153 2)) (.cse143 (< .cse139 0)) (.cse73 (= 0 (mod .cse139 2))) (.cse144 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse56 (= 0 (mod .cse152 2))) (.cse147 (div .cse152 2)) (.cse145 (< .cse137 0)) (.cse148 (< .cse136 0)) (.cse58 (= 0 (mod .cse136 2))) (.cse149 (div .cse151 4))) (let ((.cse22 (* (+ .cse150 .cse139) |ULTIMATE.start_main_~B~0#1|)) (.cse16 (* (+ .cse150 .cse138) |ULTIMATE.start_main_~B~0#1|)) (.cse27 (* (+ .cse150 .cse136) |ULTIMATE.start_main_~B~0#1|)) (.cse29 (* (+ .cse150 .cse137) |ULTIMATE.start_main_~B~0#1|)) (.cse61 (* (+ .cse146 .cse149) |ULTIMATE.start_main_~B~0#1|)) (.cse62 (and .cse148 (not .cse58))) (.cse60 (* (+ .cse146 (+ 1 .cse149)) |ULTIMATE.start_main_~B~0#1|)) (.cse59 (not .cse148)) (.cse55 (not .cse145)) (.cse54 (* (+ .cse146 (+ 1 .cse147)) |ULTIMATE.start_main_~B~0#1|)) (.cse47 (* (+ .cse146 .cse147) |ULTIMATE.start_main_~B~0#1|)) (.cse53 (and .cse145 (not .cse56))) (.cse71 (* (+ .cse141 .cse144) |ULTIMATE.start_main_~B~0#1|)) (.cse72 (and .cse143 (not .cse73))) (.cse74 (* (+ .cse141 (+ 1 .cse144)) |ULTIMATE.start_main_~B~0#1|)) (.cse75 (not .cse143)) (.cse79 (* (+ .cse141 .cse142) |ULTIMATE.start_main_~B~0#1|)) (.cse80 (and (not .cse77) .cse140)) (.cse78 (* (+ .cse141 (+ 1 .cse142)) |ULTIMATE.start_main_~B~0#1|)) (.cse76 (not .cse140)) (.cse131 (* (+ |ULTIMATE.start_main_~q~0#1| .cse139) |ULTIMATE.start_main_~B~0#1|)) (.cse128 (* (+ |ULTIMATE.start_main_~q~0#1| .cse138) |ULTIMATE.start_main_~B~0#1|)) (.cse133 (* (+ |ULTIMATE.start_main_~q~0#1| .cse137) |ULTIMATE.start_main_~B~0#1|)) (.cse132 (* (+ |ULTIMATE.start_main_~q~0#1| .cse136) |ULTIMATE.start_main_~B~0#1|))) (and .cse2 (or (let ((.cse20 (+ .cse33 .cse35)) (.cse17 (+ .cse33 .cse34))) (and (or .cse13 (and (or .cse14 (and (or .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse16 .cse17)) .cse18) (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse16 .cse20)))) .cse21) (or (and (or .cse15 .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ .cse22 .cse17))) (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse22 .cse20)))) .cse23)) .cse24) (or .cse25 (and (or .cse26 (and (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse27 .cse20))) (or .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse27 .cse17)) .cse18))) (or .cse28 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse29 .cse20)) .cse19) (or .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse29 .cse17)) .cse18)) .cse30)) .cse31 .cse32))) .cse36 .cse37) .cse3 .cse38 .cse5 (or .cse39 (and (or (and (or .cse40 .cse36 .cse37) (or .cse41 .cse42)) .cse24) (or .cse25 (and (or .cse43 .cse42) (or .cse44 .cse36 .cse37)) .cse32))) (or .cse42 (let ((.cse87 (+ .cse89 1))) (let ((.cse67 (= 0 (mod .cse89 2))) (.cse84 (- (div |ULTIMATE.start_main_~d~0#1| 8))) (.cse82 (< .cse89 0)) (.cse49 (= 0 (mod .cse87 2))) (.cse86 (< .cse88 0)) (.cse85 (- (div .cse87 2)))) (let ((.cse48 (+ .cse83 (+ (- 1) .cse85))) (.cse50 (not .cse86)) (.cse51 (and .cse86 (not .cse49))) (.cse52 (+ .cse83 .cse85)) (.cse69 (not .cse82)) (.cse68 (+ .cse83 (+ (- 1) .cse84))) (.cse65 (+ .cse83 .cse84)) (.cse66 (and .cse82 (not .cse67)))) (and (or (and (or .cse45 (and (or .cse28 .cse46 .cse30 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse48)) .cse49 .cse50) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse52)))) .cse53) (or (and (or .cse49 (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse48)) .cse50) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse52)))) .cse55 .cse56))) (or .cse57 .cse26 (and (or .cse58 .cse59 (and (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse52))) (or .cse49 .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse48))))) (or (and (or .cse49 (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse48)) .cse50) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse52)))) .cse62)))) .cse63) (or .cse64 (and (or (and (or .cse55 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse65)) .cse66) (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse68)) .cse69)) .cse56) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse65)) .cse66) (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse68)) .cse69)) .cse53)) .cse28 .cse46 .cse30) (or .cse57 .cse26 (and (or (and (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse65)) .cse66)) .cse62) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse65)) .cse66) (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse68)) .cse69)) .cse58 .cse59)))))) .cse25 .cse32) (or (and (or (and (or .cse70 .cse23 (and (or (and (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse52))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse48)) .cse49 .cse50)) .cse72) (or .cse73 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse48)) .cse49 .cse50) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse52)))) .cse75))) (or .cse14 .cse21 (and (or .cse76 .cse77 (and (or .cse49 .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse48))) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse52))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse48)) .cse49 .cse50) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse52)))) .cse80)) .cse81)) .cse45 .cse63) (or .cse64 (and (or .cse14 (and (or (and (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse65)) .cse66)) .cse76 .cse77) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse68)) .cse67 .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse65)) .cse66)) .cse80)) .cse21 .cse81) (or .cse70 .cse23 (and (or (and (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse65)) .cse66)) .cse72) (or .cse73 (and (or .cse67 .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse68))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse65)) .cse66)) .cse75)))))) .cse24)))))) .cse7 .cse6 .cse8 .cse90 .cse91 (or .cse42 (let ((.cse92 (+ .cse33 .cse95)) (.cse93 (+ .cse33 .cse94))) (and (or .cse13 .cse24 (and (or .cse23 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse22 .cse92))) (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse22 .cse93)) .cse63))) (or (and (or .cse45 .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse16 .cse93))) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse16 .cse92)))) .cse14 .cse21))) (or .cse25 (and (or .cse26 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse27 .cse92))) (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse27 .cse93)) .cse63))) (or .cse28 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse29 .cse92))) (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse29 .cse93)) .cse63)) .cse30)) .cse31 .cse32)))) .cse96 (or .cse36 (let ((.cse114 (+ .cse112 1))) (let ((.cse107 (< .cse115 0)) (.cse99 (= 0 (mod .cse114 2))) (.cse109 (- (div .cse114 2))) (.cse105 (= 0 (mod .cse112 2))) (.cse111 (- (div .cse113 4))) (.cse110 (< .cse112 0))) (let ((.cse104 (not .cse110)) (.cse106 (+ .cse108 (+ (- 1) .cse111))) (.cse102 (+ .cse108 .cse111)) (.cse103 (and .cse110 (not .cse105))) (.cse100 (+ .cse108 .cse109)) (.cse101 (and .cse107 (not .cse99))) (.cse98 (+ .cse108 (+ (- 1) .cse109))) (.cse97 (not .cse107))) (and (or (and (or .cse15 .cse18 (and (or .cse28 .cse46 .cse30 (and (or .cse55 (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse98)) .cse99) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse100)) .cse101)) .cse56) (or (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse98)) .cse99) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse100)) .cse101)) .cse53))) (or .cse57 .cse26 (and (or .cse58 .cse59 (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse98)) .cse99) (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse100))))) (or .cse62 (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse98)) .cse99) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse100)) .cse101))))))) (or .cse19 (and (or .cse57 .cse26 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse102)) .cse103) (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse106)))) .cse62) (or .cse58 (and (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse106))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse102)) .cse103)) .cse59))) (or .cse28 .cse46 .cse30 (and (or .cse55 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse102)) .cse103) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse106)) .cse104 .cse105)) .cse56) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse102)) .cse103) (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse106)))) .cse53)))))) .cse25 .cse32) (or (and (or .cse19 (and (or .cse70 .cse23 (and (or .cse73 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse106)) .cse104 .cse105) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse102)) .cse103)) .cse75) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse102)) .cse103) (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse106)))) .cse72))) (or (and (or (and (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse102))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse106)) .cse104 .cse105)) .cse80) (or .cse76 .cse77 (and (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse106))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse102)) .cse103)))) .cse14 .cse21 .cse81))) (or .cse15 .cse18 (and (or (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse100)) .cse101) (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse98)) .cse99)) .cse72) (or (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse98)) .cse99) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse100)) .cse101)) .cse73 .cse75)) .cse70 .cse23) (or .cse14 (and (or (and (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse100))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse98)) .cse97 .cse99)) .cse80) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse100)) .cse101) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse98)) .cse97 .cse99)) .cse76 .cse77)) .cse21 .cse81)))) .cse24))))) .cse37) (or (= 1 .cse116) (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse116)) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ (+ |ULTIMATE.start_main_~r~0#1| (- (* 2 .cse117))) .cse118)))) .cse119 (or (let ((.cse127 (- (div .cse117 4)))) (let ((.cse122 (+ .cse126 (+ (- 1) .cse127))) (.cse121 (+ .cse126 .cse127)) (.cse124 (div .cse116 4))) (and (or .cse24 (let ((.cse120 (* (+ .cse123 .cse124) |ULTIMATE.start_main_~B~0#1|))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse120 .cse121)) .cse42) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse120 .cse122)) .cse36 .cse37)))) (or .cse25 (let ((.cse125 (* (+ .cse123 (+ 1 .cse124)) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse125 .cse122)) .cse37) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse125 .cse121))))) .cse32)))) .cse39) (or .cse36 (let ((.cse130 (+ |ULTIMATE.start_main_~r~0#1| .cse34)) (.cse129 (+ |ULTIMATE.start_main_~r~0#1| .cse35))) (and (or .cse13 (and (or .cse14 (and (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse129))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse130)) .cse15 .cse18)) .cse21) (or .cse23 (and (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse129))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse130)) .cse15 .cse18)))) .cse24) (or .cse25 (and (or .cse26 (and (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse132 .cse129))) (or .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse132 .cse130)) .cse18))) (or .cse28 (and (or .cse15 .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse130))) (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse129)))) .cse30)) .cse31 .cse32))) .cse37) (or (let ((.cse134 (+ |ULTIMATE.start_main_~r~0#1| .cse94)) (.cse135 (+ |ULTIMATE.start_main_~r~0#1| .cse95))) (and (or .cse13 (and (or (and (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse134)) .cse63) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse135)))) .cse23) (or .cse14 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse135))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse134)) .cse45 .cse63)) .cse21)) .cse24) (or .cse25 .cse31 (and (or .cse28 .cse30 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse135))) (or .cse45 .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse134))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse132 .cse134)) .cse45 .cse63) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse132 .cse135)))) .cse26)) .cse32))) .cse42))))) (and .cse1 (= |ULTIMATE.start_main_~p~0#1| 1) .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~d~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~d~0#1| (* 1 1)) (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (<= 1 |ULTIMATE.start_main_~d~0#1|)) (and .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~p~0#1| (* 2 .cse154)) .cse8 .cse91 .cse96 (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse155)) .cse119) (and .cse156 .cse1 .cse157 .cse158 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~d~0#1| .cse154) .cse159 .cse6 .cse7 (= |ULTIMATE.start_main_~p~0#1| .cse154) .cse8 (= |ULTIMATE.start_main_~d~0#1| .cse155) .cse96 .cse119)))))))))) [2023-02-18 18:27:12,985 INFO L895 garLoopResultBuilder]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse183 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse192 (div |ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse193 (+ 1 .cse192)) (.cse181 (- .cse183))) (let ((.cse191 (+ (- 1) .cse181)) (.cse146 (+ |ULTIMATE.start_main_~q~0#1| .cse193)) (.cse141 (+ |ULTIMATE.start_main_~q~0#1| .cse192)) (.cse197 (mod |ULTIMATE.start_main_~d~0#1| 2)) (.cse151 (+ .cse192 1))) (let ((.cse139 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse136 (div .cse151 2)) (.cse113 (+ .cse183 1)) (.cse39 (= 1 |ULTIMATE.start_main_~p~0#1|)) (.cse118 (- |ULTIMATE.start_main_~d~0#1|)) (.cse36 (= 0 .cse197)) (.cse203 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse25 (= 0 (mod |ULTIMATE.start_main_~p~0#1| 2))) (.cse83 (+ |ULTIMATE.start_main_~r~0#1| .cse181)) (.cse202 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse205 (* .cse141 |ULTIMATE.start_main_~B~0#1|)) (.cse204 (* .cse146 |ULTIMATE.start_main_~B~0#1|)) (.cse108 (+ |ULTIMATE.start_main_~r~0#1| .cse191))) (let ((.cse13 (= 1 .cse192)) (.cse31 (= 1 .cse193)) (.cse44 (= |ULTIMATE.start_main_~A~0#1| (+ .cse204 .cse108))) (.cse40 (= |ULTIMATE.start_main_~A~0#1| (+ .cse205 .cse108))) (.cse37 (not .cse202)) (.cse41 (= |ULTIMATE.start_main_~A~0#1| (+ .cse205 .cse83))) (.cse24 (and .cse203 (not .cse25))) (.cse43 (= |ULTIMATE.start_main_~A~0#1| (+ .cse204 .cse83))) (.cse32 (not .cse203)) (.cse42 (and .cse202 (not .cse36))) (.cse150 (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse33 (+ |ULTIMATE.start_main_~r~0#1| .cse118)) (.cse3 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse2 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse196 (not .cse39)) (.cse89 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse112 (div .cse113 2)) (.cse182 (+ 1 .cse183)) (.cse28 (= 0 (mod .cse151 2))) (.cse200 (< .cse193 0)) (.cse137 (+ 1 .cse136)) (.cse138 (+ 1 .cse139)) (.cse201 (< .cse192 0)) (.cse14 (= 0 (mod .cse192 2)))) (let ((.cse23 (and .cse201 (not .cse14))) (.cse70 (= 1 .cse139)) (.cse21 (not .cse201)) (.cse81 (= 1 .cse138)) (.cse46 (= 1 .cse137)) (.cse30 (not .cse200)) (.cse57 (= 1 .cse136)) (.cse26 (and .cse200 (not .cse28))) (.cse18 (= 0 (mod .cse113 2))) (.cse194 (< .cse182 0)) (.cse63 (= 0 (mod .cse183 2))) (.cse195 (< .cse183 0)) (.cse117 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse116 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse35 (- .cse112)) (.cse95 (- .cse89)) (.cse198 (div .cse118 (- 2))) (.cse171 (or .cse2 .cse196)) (.cse9 (or .cse3 (= (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~r~0#1|)) 0))) (.cse90 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse150 |ULTIMATE.start_main_~B~0#1|) .cse33))) (.cse10 (= 0 |ULTIMATE.start_main_~q~0#1|)) (.cse169 (or (and (or .cse41 .cse24) (or .cse25 .cse43 .cse32)) .cse42)) (.cse165 (or (and (or .cse25 .cse44 .cse32) (or .cse40 .cse24)) .cse36 .cse37)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse5 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse7 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse11 (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|))) (.cse187 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse182 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse36 .cse37) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse183 |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))))) (.cse184 (and (or .cse24 (not .cse13)) (or .cse25 (not .cse31) .cse32)))) (let ((.cse12 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse154 (let ((.cse199 (or .cse187 .cse184))) (or (and .cse9 .cse90 .cse171 .cse199 .cse10 .cse3 .cse169 .cse165 .cse4 .cse5 .cse7 .cse11) (and .cse9 .cse90 .cse199 .cse10 .cse2 .cse3 .cse169 .cse165 .cse4 .cse5 .cse7 .cse11)))) (.cse155 (<= 2 .cse198)) (.cse156 (>= |ULTIMATE.start_main_~r~0#1| .cse198)) (.cse158 (= .cse197 0)) (.cse96 (or (and (or .cse36 (= |ULTIMATE.start_main_~B~0#1| .cse182) .cse37) (or .cse42 (= |ULTIMATE.start_main_~B~0#1| .cse183))) .cse184)) (.cse119 (or .cse196 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse94 (+ (- 1) .cse95)) (.cse34 (+ (- 1) .cse35)) (.cse123 (+ |ULTIMATE.start_main_~q~0#1| .cse116)) (.cse126 (+ |ULTIMATE.start_main_~r~0#1| (- .cse117))) (.cse0 (* 2 1)) (.cse45 (not .cse195)) (.cse88 (+ 1 .cse89)) (.cse64 (and (not .cse63) .cse195)) (.cse19 (and (not .cse18) .cse194)) (.cse115 (+ 1 .cse112)) (.cse15 (not .cse194)) (.cse189 (and (or .cse28 (not .cse46) .cse30) (or (not .cse57) .cse26))) (.cse188 (and (or .cse23 (not .cse70)) (or .cse14 .cse21 (not .cse81))))) (let ((.cse1 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse38 (or (and (or .cse42 (and (or .cse45 .cse63 (= |ULTIMATE.start_main_~B~0#1| .cse88)) (or .cse64 (= |ULTIMATE.start_main_~B~0#1| .cse89)))) (or .cse36 (and (or .cse19 (= |ULTIMATE.start_main_~B~0#1| .cse112)) (or (= |ULTIMATE.start_main_~B~0#1| .cse115) .cse15 .cse18)) .cse37)) (and (or .cse25 .cse32 .cse189) (or .cse188 .cse24)))) (.cse6 (= |ULTIMATE.start_main_~d~0#1| (* 1 |ULTIMATE.start_main_~p~0#1|))) (.cse157 (* 2 .cse0)) (.cse8 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~q~0#1| 1) |ULTIMATE.start_main_~r~0#1|))) (.cse91 (let ((.cse172 (* (+ .cse146 .cse136) |ULTIMATE.start_main_~B~0#1|)) (.cse174 (* (+ .cse146 .cse137) |ULTIMATE.start_main_~B~0#1|)) (.cse176 (* (+ .cse141 .cse138) |ULTIMATE.start_main_~B~0#1|)) (.cse177 (* (+ .cse141 .cse139) |ULTIMATE.start_main_~B~0#1|)) (.cse178 (* (+ .cse150 .cse193) |ULTIMATE.start_main_~B~0#1|)) (.cse180 (* (+ .cse150 .cse192) |ULTIMATE.start_main_~B~0#1|))) (let ((.cse160 (or (let ((.cse190 (+ .cse33 .cse191))) (and (or .cse25 (= |ULTIMATE.start_main_~A~0#1| (+ .cse178 .cse190)) .cse32) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse180 .cse190)) .cse24))) .cse36 .cse37)) (.cse161 (or .cse25 .cse31 (and (or .cse42 (and (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse88 .cse146) .cse83)) .cse63) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse89 .cse146) .cse83))))) (or .cse36 (and (or .cse15 .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse115 .cse146) .cse108))) (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse112 .cse146) .cse108)))) .cse37)) .cse32 .cse189)) (.cse162 (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ .cse123 |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ .cse126 .cse118)))) (.cse163 (or .cse13 .cse188 (and (or .cse36 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse115 .cse141) .cse108)) .cse15 .cse18) (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse112 .cse141) .cse108)))) .cse37) (or .cse42 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse89 .cse141) .cse83))) (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse88 .cse141) .cse83)) .cse63)))) .cse24)) (.cse164 (or .cse39 .cse187 .cse184)) (.cse166 (or .cse36 (let ((.cse186 (+ .cse108 .cse34)) (.cse185 (+ .cse108 .cse35))) (and (or .cse25 (and (or .cse19 (and (or .cse26 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse185))) (or .cse28 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse185)) .cse30))) (or .cse15 .cse18 (and (or .cse26 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse186))) (or .cse28 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse186)) .cse30)))) .cse32) (or (and (or (and (or .cse23 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse186))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse186)) .cse14 .cse21)) .cse15 .cse18) (or .cse19 (and (or .cse14 .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse185))) (or .cse23 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse185)))))) .cse24))) .cse37)) (.cse167 (or (and (or .cse36 .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse182 .cse150) .cse33))) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse183 .cse150) .cse33)))) .cse39 .cse184)) (.cse168 (or .cse42 (let ((.cse179 (+ .cse33 .cse181))) (and (or .cse25 .cse32 (= |ULTIMATE.start_main_~A~0#1| (+ .cse178 .cse179))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse180 .cse179)) .cse24))))) (.cse170 (or .cse42 (let ((.cse173 (+ .cse83 .cse95)) (.cse175 (+ .cse83 .cse94))) (and (or .cse25 (and (or .cse64 (and (or .cse26 (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse173))) (or .cse28 .cse30 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse173))))) (or .cse45 (and (or .cse28 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse175)) .cse30) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse172 .cse175)) .cse26)) .cse63)) .cse32) (or .cse24 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse173)) .cse14 .cse21) (or .cse23 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse173)))) .cse64) (or (and (or .cse14 .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse175))) (or .cse23 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse175)))) .cse45 .cse63)))))))) (or (and .cse160 .cse161 .cse154 .cse155 .cse156 .cse162 .cse163 .cse164 .cse2 .cse165 .cse158 .cse7 .cse166 .cse90 .cse96 .cse167 .cse168 .cse169 .cse119 .cse170) (and .cse160 .cse161 .cse154 .cse155 .cse156 .cse162 .cse163 .cse164 .cse165 .cse158 .cse7 .cse166 .cse90 .cse171 .cse96 .cse167 .cse168 .cse169 .cse119 .cse170))))) (.cse159 (* 2 .cse12))) (or (and (= |ULTIMATE.start_main_~d~0#1| .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse9 .cse10 (= |ULTIMATE.start_main_~p~0#1| .cse0) .cse11 (= |ULTIMATE.start_main_~d~0#1| .cse12)) (let ((.cse152 (+ .cse136 1)) (.cse153 (+ .cse139 1))) (let ((.cse77 (= 0 (mod .cse153 2))) (.cse140 (< .cse138 0)) (.cse142 (div .cse153 2)) (.cse143 (< .cse139 0)) (.cse73 (= 0 (mod .cse139 2))) (.cse144 (div |ULTIMATE.start_main_~p~0#1| 8)) (.cse56 (= 0 (mod .cse152 2))) (.cse147 (div .cse152 2)) (.cse145 (< .cse137 0)) (.cse148 (< .cse136 0)) (.cse58 (= 0 (mod .cse136 2))) (.cse149 (div .cse151 4))) (let ((.cse22 (* (+ .cse150 .cse139) |ULTIMATE.start_main_~B~0#1|)) (.cse16 (* (+ .cse150 .cse138) |ULTIMATE.start_main_~B~0#1|)) (.cse27 (* (+ .cse150 .cse136) |ULTIMATE.start_main_~B~0#1|)) (.cse29 (* (+ .cse150 .cse137) |ULTIMATE.start_main_~B~0#1|)) (.cse61 (* (+ .cse146 .cse149) |ULTIMATE.start_main_~B~0#1|)) (.cse62 (and .cse148 (not .cse58))) (.cse60 (* (+ .cse146 (+ 1 .cse149)) |ULTIMATE.start_main_~B~0#1|)) (.cse59 (not .cse148)) (.cse55 (not .cse145)) (.cse54 (* (+ .cse146 (+ 1 .cse147)) |ULTIMATE.start_main_~B~0#1|)) (.cse47 (* (+ .cse146 .cse147) |ULTIMATE.start_main_~B~0#1|)) (.cse53 (and .cse145 (not .cse56))) (.cse71 (* (+ .cse141 .cse144) |ULTIMATE.start_main_~B~0#1|)) (.cse72 (and .cse143 (not .cse73))) (.cse74 (* (+ .cse141 (+ 1 .cse144)) |ULTIMATE.start_main_~B~0#1|)) (.cse75 (not .cse143)) (.cse79 (* (+ .cse141 .cse142) |ULTIMATE.start_main_~B~0#1|)) (.cse80 (and (not .cse77) .cse140)) (.cse78 (* (+ .cse141 (+ 1 .cse142)) |ULTIMATE.start_main_~B~0#1|)) (.cse76 (not .cse140)) (.cse131 (* (+ |ULTIMATE.start_main_~q~0#1| .cse139) |ULTIMATE.start_main_~B~0#1|)) (.cse128 (* (+ |ULTIMATE.start_main_~q~0#1| .cse138) |ULTIMATE.start_main_~B~0#1|)) (.cse133 (* (+ |ULTIMATE.start_main_~q~0#1| .cse137) |ULTIMATE.start_main_~B~0#1|)) (.cse132 (* (+ |ULTIMATE.start_main_~q~0#1| .cse136) |ULTIMATE.start_main_~B~0#1|))) (and .cse2 (or (let ((.cse20 (+ .cse33 .cse35)) (.cse17 (+ .cse33 .cse34))) (and (or .cse13 (and (or .cse14 (and (or .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse16 .cse17)) .cse18) (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse16 .cse20)))) .cse21) (or (and (or .cse15 .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ .cse22 .cse17))) (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse22 .cse20)))) .cse23)) .cse24) (or .cse25 (and (or .cse26 (and (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse27 .cse20))) (or .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse27 .cse17)) .cse18))) (or .cse28 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse29 .cse20)) .cse19) (or .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse29 .cse17)) .cse18)) .cse30)) .cse31 .cse32))) .cse36 .cse37) .cse3 .cse38 .cse5 (or .cse39 (and (or (and (or .cse40 .cse36 .cse37) (or .cse41 .cse42)) .cse24) (or .cse25 (and (or .cse43 .cse42) (or .cse44 .cse36 .cse37)) .cse32))) (or .cse42 (let ((.cse87 (+ .cse89 1))) (let ((.cse67 (= 0 (mod .cse89 2))) (.cse84 (- (div |ULTIMATE.start_main_~d~0#1| 8))) (.cse82 (< .cse89 0)) (.cse49 (= 0 (mod .cse87 2))) (.cse86 (< .cse88 0)) (.cse85 (- (div .cse87 2)))) (let ((.cse48 (+ .cse83 (+ (- 1) .cse85))) (.cse50 (not .cse86)) (.cse51 (and .cse86 (not .cse49))) (.cse52 (+ .cse83 .cse85)) (.cse69 (not .cse82)) (.cse68 (+ .cse83 (+ (- 1) .cse84))) (.cse65 (+ .cse83 .cse84)) (.cse66 (and .cse82 (not .cse67)))) (and (or (and (or .cse45 (and (or .cse28 .cse46 .cse30 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse48)) .cse49 .cse50) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse52)))) .cse53) (or (and (or .cse49 (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse48)) .cse50) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse52)))) .cse55 .cse56))) (or .cse57 .cse26 (and (or .cse58 .cse59 (and (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse52))) (or .cse49 .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse48))))) (or (and (or .cse49 (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse48)) .cse50) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse52)))) .cse62)))) .cse63) (or .cse64 (and (or (and (or .cse55 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse65)) .cse66) (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse68)) .cse69)) .cse56) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse65)) .cse66) (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse68)) .cse69)) .cse53)) .cse28 .cse46 .cse30) (or .cse57 .cse26 (and (or (and (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse65)) .cse66)) .cse62) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse65)) .cse66) (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse68)) .cse69)) .cse58 .cse59)))))) .cse25 .cse32) (or (and (or (and (or .cse70 .cse23 (and (or (and (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse52))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse48)) .cse49 .cse50)) .cse72) (or .cse73 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse48)) .cse49 .cse50) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse52)))) .cse75))) (or .cse14 .cse21 (and (or .cse76 .cse77 (and (or .cse49 .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse48))) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse52))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse48)) .cse49 .cse50) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse52)))) .cse80)) .cse81)) .cse45 .cse63) (or .cse64 (and (or .cse14 (and (or (and (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse65)) .cse66)) .cse76 .cse77) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse68)) .cse67 .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse65)) .cse66)) .cse80)) .cse21 .cse81) (or .cse70 .cse23 (and (or (and (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse68)) .cse69) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse65)) .cse66)) .cse72) (or .cse73 (and (or .cse67 .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse68))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse65)) .cse66)) .cse75)))))) .cse24)))))) .cse7 .cse6 .cse8 .cse90 .cse91 (or .cse42 (let ((.cse92 (+ .cse33 .cse95)) (.cse93 (+ .cse33 .cse94))) (and (or .cse13 .cse24 (and (or .cse23 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse22 .cse92))) (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse22 .cse93)) .cse63))) (or (and (or .cse45 .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse16 .cse93))) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse16 .cse92)))) .cse14 .cse21))) (or .cse25 (and (or .cse26 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse27 .cse92))) (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse27 .cse93)) .cse63))) (or .cse28 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse29 .cse92))) (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse29 .cse93)) .cse63)) .cse30)) .cse31 .cse32)))) .cse96 (or .cse36 (let ((.cse114 (+ .cse112 1))) (let ((.cse107 (< .cse115 0)) (.cse99 (= 0 (mod .cse114 2))) (.cse109 (- (div .cse114 2))) (.cse105 (= 0 (mod .cse112 2))) (.cse111 (- (div .cse113 4))) (.cse110 (< .cse112 0))) (let ((.cse104 (not .cse110)) (.cse106 (+ .cse108 (+ (- 1) .cse111))) (.cse102 (+ .cse108 .cse111)) (.cse103 (and .cse110 (not .cse105))) (.cse100 (+ .cse108 .cse109)) (.cse101 (and .cse107 (not .cse99))) (.cse98 (+ .cse108 (+ (- 1) .cse109))) (.cse97 (not .cse107))) (and (or (and (or .cse15 .cse18 (and (or .cse28 .cse46 .cse30 (and (or .cse55 (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse98)) .cse99) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse100)) .cse101)) .cse56) (or (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse98)) .cse99) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse100)) .cse101)) .cse53))) (or .cse57 .cse26 (and (or .cse58 .cse59 (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse98)) .cse99) (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse100))))) (or .cse62 (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse98)) .cse99) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse100)) .cse101))))))) (or .cse19 (and (or .cse57 .cse26 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse102)) .cse103) (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse106)))) .cse62) (or .cse58 (and (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse106))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse102)) .cse103)) .cse59))) (or .cse28 .cse46 .cse30 (and (or .cse55 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse102)) .cse103) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse54 .cse106)) .cse104 .cse105)) .cse56) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse102)) .cse103) (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse106)))) .cse53)))))) .cse25 .cse32) (or (and (or .cse19 (and (or .cse70 .cse23 (and (or .cse73 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse106)) .cse104 .cse105) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse102)) .cse103)) .cse75) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse102)) .cse103) (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse106)))) .cse72))) (or (and (or (and (or .cse103 (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse102))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse106)) .cse104 .cse105)) .cse80) (or .cse76 .cse77 (and (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse106))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse102)) .cse103)))) .cse14 .cse21 .cse81))) (or .cse15 .cse18 (and (or (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse100)) .cse101) (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse71 .cse98)) .cse99)) .cse72) (or (and (or .cse97 (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse98)) .cse99) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse100)) .cse101)) .cse73 .cse75)) .cse70 .cse23) (or .cse14 (and (or (and (or .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse100))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse79 .cse98)) .cse97 .cse99)) .cse80) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse100)) .cse101) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse98)) .cse97 .cse99)) .cse76 .cse77)) .cse21 .cse81)))) .cse24))))) .cse37) (or (= 1 .cse116) (= |ULTIMATE.start_main_~A~0#1| (+ (* (+ (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse116)) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~B~0#1|) (+ (+ |ULTIMATE.start_main_~r~0#1| (- (* 2 .cse117))) .cse118)))) .cse119 (or (let ((.cse127 (- (div .cse117 4)))) (let ((.cse122 (+ .cse126 (+ (- 1) .cse127))) (.cse121 (+ .cse126 .cse127)) (.cse124 (div .cse116 4))) (and (or .cse24 (let ((.cse120 (* (+ .cse123 .cse124) |ULTIMATE.start_main_~B~0#1|))) (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse120 .cse121)) .cse42) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse120 .cse122)) .cse36 .cse37)))) (or .cse25 (let ((.cse125 (* (+ .cse123 (+ 1 .cse124)) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse125 .cse122)) .cse37) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse125 .cse121))))) .cse32)))) .cse39) (or .cse36 (let ((.cse130 (+ |ULTIMATE.start_main_~r~0#1| .cse34)) (.cse129 (+ |ULTIMATE.start_main_~r~0#1| .cse35))) (and (or .cse13 (and (or .cse14 (and (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse129))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse130)) .cse15 .cse18)) .cse21) (or .cse23 (and (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse129))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse130)) .cse15 .cse18)))) .cse24) (or .cse25 (and (or .cse26 (and (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse132 .cse129))) (or .cse15 (= |ULTIMATE.start_main_~A~0#1| (+ .cse132 .cse130)) .cse18))) (or .cse28 (and (or .cse15 .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse130))) (or .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse129)))) .cse30)) .cse31 .cse32))) .cse37) (or (let ((.cse134 (+ |ULTIMATE.start_main_~r~0#1| .cse94)) (.cse135 (+ |ULTIMATE.start_main_~r~0#1| .cse95))) (and (or .cse13 (and (or (and (or .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse134)) .cse63) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse135)))) .cse23) (or .cse14 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse135))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse134)) .cse45 .cse63)) .cse21)) .cse24) (or .cse25 .cse31 (and (or .cse28 .cse30 (and (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse135))) (or .cse45 .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 .cse134))))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse132 .cse134)) .cse45 .cse63) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse132 .cse135)))) .cse26)) .cse32))) .cse42))))) (and .cse1 (= |ULTIMATE.start_main_~p~0#1| 1) .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~d~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~d~0#1| (* 1 1)) (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (<= 1 |ULTIMATE.start_main_~d~0#1|)) (and .cse154 .cse1 .cse155 .cse156 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~d~0#1| .cse157) .cse158 .cse6 .cse7 (= |ULTIMATE.start_main_~p~0#1| .cse157) .cse8 (= |ULTIMATE.start_main_~d~0#1| .cse159) .cse96 .cse119) (and .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~p~0#1| (* 2 .cse157)) .cse8 .cse91 .cse96 (= |ULTIMATE.start_main_~d~0#1| (* 2 .cse159)) .cse119)))))))))) [2023-02-18 18:27:12,985 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-18 18:27:12,985 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-18 18:27:12,986 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-18 18:27:12,986 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-18 18:27:12,986 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-02-18 18:27:12,986 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-18 18:27:12,988 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-02-18 18:27:12,990 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 18:27:13,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 06:27:13 BoogieIcfgContainer [2023-02-18 18:27:13,085 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 18:27:13,085 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 18:27:13,085 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 18:27:13,086 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 18:27:13,086 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 06:25:58" (3/4) ... [2023-02-18 18:27:13,088 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 18:27:13,092 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 18:27:13,094 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-02-18 18:27:13,094 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-02-18 18:27:13,095 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-02-18 18:27:13,095 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 18:27:13,095 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 18:27:13,138 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 18:27:13,138 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 18:27:13,138 INFO L158 Benchmark]: Toolchain (without parser) took 75004.77ms. Allocated memory was 153.1MB in the beginning and 310.4MB in the end (delta: 157.3MB). Free memory was 115.6MB in the beginning and 176.7MB in the end (delta: -61.1MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. [2023-02-18 18:27:13,139 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 153.1MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 18:27:13,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.33ms. Allocated memory is still 153.1MB. Free memory was 115.1MB in the beginning and 104.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 18:27:13,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.24ms. Allocated memory is still 153.1MB. Free memory was 104.6MB in the beginning and 103.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 18:27:13,139 INFO L158 Benchmark]: Boogie Preprocessor took 29.70ms. Allocated memory is still 153.1MB. Free memory was 103.0MB in the beginning and 101.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 18:27:13,139 INFO L158 Benchmark]: RCFGBuilder took 207.69ms. Allocated memory is still 153.1MB. Free memory was 101.9MB in the beginning and 91.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 18:27:13,140 INFO L158 Benchmark]: TraceAbstraction took 74509.85ms. Allocated memory was 153.1MB in the beginning and 310.4MB in the end (delta: 157.3MB). Free memory was 90.5MB in the beginning and 183.0MB in the end (delta: -92.5MB). Peak memory consumption was 156.8MB. Max. memory is 16.1GB. [2023-02-18 18:27:13,140 INFO L158 Benchmark]: Witness Printer took 52.78ms. Allocated memory is still 310.4MB. Free memory was 183.0MB in the beginning and 176.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-18 18:27:13,141 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.13ms. Allocated memory is still 153.1MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.33ms. Allocated memory is still 153.1MB. Free memory was 115.1MB in the beginning and 104.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.24ms. Allocated memory is still 153.1MB. Free memory was 104.6MB in the beginning and 103.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.70ms. Allocated memory is still 153.1MB. Free memory was 103.0MB in the beginning and 101.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 207.69ms. Allocated memory is still 153.1MB. Free memory was 101.9MB in the beginning and 91.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 74509.85ms. Allocated memory was 153.1MB in the beginning and 310.4MB in the end (delta: 157.3MB). Free memory was 90.5MB in the beginning and 183.0MB in the end (delta: -92.5MB). Peak memory consumption was 156.8MB. Max. memory is 16.1GB. * Witness Printer took 52.78ms. Allocated memory is still 310.4MB. Free memory was 183.0MB in the beginning and 176.7MB in the end (delta: 6.3MB). 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: 74.4s, OverallIterations: 16, TraceHistogramMax: 21, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 53.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 533 SdHoareTripleChecker+Valid, 45.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 476 mSDsluCounter, 1911 SdHoareTripleChecker+Invalid, 44.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1427 mSDsCounter, 735 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6438 IncrementalHoareTripleChecker+Invalid, 7180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 735 mSolverCounterUnsat, 484 mSDtfsCounter, 6438 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1979 GetRequests, 1676 SyntacticMatches, 39 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 16.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=13, InterpolantAutomatonStates: 185, 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, 74 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 183 PreInvPairs, 296 NumberOfFragments, 418789 HoareAnnotationTreeSize, 183 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 1140 NumberOfCodeBlocks, 1070 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1882 ConstructedInterpolants, 1 QuantifiedInterpolants, 86327 SizeOfPredicates, 70 NumberOfNonLiveVariables, 2680 ConjunctsInSsa, 469 ConjunctsInUnsatCore, 26 InterpolantComputations, 4 PerfectInterpolantSequences, 8154/9192 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: (((((((((((((((((((((((((((((A == (q + p) * B + (r + -d) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && B == 1) && A == q * B + r) && d == 1 * p) && A == q * 1 + r) || (((((((((((2 <= d && d == 2 * 1) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && (!(1 == p) || B == d)) && q + p * -1 == 0) && r == A + -d) && B == 1) && p == 2 * 1) && A == q * B + r) && r + d == A) && d == 2 * B)) || ((((((d == 2 * 1 && r == A) && q == 0) && B == 1) && p == 2 * 1) && d == B * p) && d == 2 * B)) || ((((B == 1 && (A == q * B + r || (1 <= d && A == q * B + r))) && A == q * B + r) && d == 1 * p) && A == q * 1 + r)) || ((((p == 1 && r == A) && d == B) && q == 0) && B == 1)) || ((((r == A && p == 1) && d == B) && q == 0) && B == 1)) || ((((((((((A == (q + p) * B + (r + -d) && (A == d * q + r || !(1 == p))) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && (!(1 == p) || B == d)) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p)) && B == 1) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && A == q * B + r) && d == 1 * p) && A == q * 1 + r)) || (((((((((((A == (q + p) * B + (r + -d) && (A == d * q + r || !(1 == p))) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && (!(1 == p) || B == d)) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p)) && B == 1) && (A == q * B + r || (1 <= d && A == q * B + r))) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && A == q * B + r) && d == 1 * p) && A == q * 1 + r)) || (((((((((A == (q + p) * B + (r + -d) && ((d < 0 && !(0 == d % 2)) || (((1 == p / 2 || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && (((((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -(d / 4)))) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -(d / 4)))) || 0 == p / 2 % 2) || !(p / 2 < 0)))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))))) && (((((1 == p / 2 || (((0 == p / 2 % 2 || (((!(1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -((d / 2 + 1) / 2))))) || !(p / 2 < 0)) && ((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + p + p / 4) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -((d / 2 + 1) / 2)))) || (p / 2 < 0 && !(0 == p / 2 % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || ((A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -((d / 2 + 1) / 2)) || (!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0)) && ((!(1 + d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))) || 0 == d % 2) || !(d < 0))) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p)) && B == 1) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && A == q * B + r) && d == 1 * p) && A == q * 1 + r)) || (((((((((((d == 2 * (2 * B) && 2 <= -d / -2) && ((((((((((A == (q + p) * B + (r + -d) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || (((((((((A == (q + p) * B + (r + -d) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && r >= -d / -2) && r == A) && (!(1 == p) || B == d)) && q == 0) && B == 1) && d == 2 * (2 * 1)) && d % 2 == 0) && p == 2 * (2 * 1))) || ((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && p == 1) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && B == 1) && r == A + B * -2 + -B) && d == 1) && r == A + -2 + -d) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && q + p * -1 + 2 * 1 * -1 == 0) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && d == B) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))) && q + -2 == 1)) || ((((((((((((((((((((((!(A >= 2 * (2 * (2 * B))) && r >= A + B * -4 + -d) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && p == 2) && (((((1 == p / 2 || (((0 == p / 2 % 2 || (((!(1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -((d / 2 + 1) / 2))))) || !(p / 2 < 0)) && ((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + p + p / 4) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -((d / 2 + 1) / 2)))) || (p / 2 < 0 && !(0 == p / 2 % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || ((A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -((d / 2 + 1) / 2)) || (!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0)) && ((!(1 + d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))) || 0 == d % 2) || !(d < 0))) && B == 1) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || ((((((!(d / 2 < 0) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))) && (((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || !(1 + (p / 2 + 1) / 2 < 0)) || 0 == ((p / 2 + 1) / 2 + 1) % 2))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))))) && ((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))))))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((((((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))) || 0 == (p / 2 + 1) % 2) || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((((A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || 0 == (p / 2 + 1) / 2 % 2) || !((p / 2 + 1) / 2 < 0))))))) || 0 == p % 2) || !(p < 0)) && (((((((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) || !(p / 4 < 0)))) && (((0 == p / 2 % 2 || !(p / 2 < 0)) || (((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || 1 == 1 + p / 4)) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || ((((0 == p / 2 % 2 || ((((((0 == d / 4 % 2 || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8))) || 0 == d / 4 % 2) || !(d / 4 < 0)) && (A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || !(p / 2 < 0)) || 1 == 1 + p / 4) && ((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((0 == d / 4 % 2 || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((0 == d / 4 % 2 || !(d / 4 < 0)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))))) || !(p / 4 < 0))))))) || (p < 0 && !(0 == p % 2)))))) && d == B * 2) && A == q * B + r) && d == 1 * p) && A == q * 1 + r) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && A + B * -4 >= d) && ((d < 0 && !(0 == d % 2)) || (((1 == p / 2 || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && (((((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -(d / 4)))) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -(d / 4)))) || 0 == p / 2 % 2) || !(p / 2 < 0)))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))))) && ((0 == d % 2 || ((((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && ((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))))) && (((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))))))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || ((((A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((0 == (p / 2 + 1) / 2 % 2 || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !((p / 2 + 1) / 2 < 0)))) && (((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))))))) || 0 == p % 2) || !(p < 0)) && ((((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !(p / 4 < 0)) && (((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (p / 4 < 0 && !(0 == p / 4 % 2))))) && (((((((((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)))))) || 0 == p / 2 % 2) || !(p / 2 < 0)) || 1 == 1 + p / 4))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((((((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (p / 4 < 0 && !(0 == p / 4 % 2))) && (((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || 0 == p / 4 % 2) || !(p / 4 < 0))) || 1 == p / 4) || (p / 2 < 0 && !(0 == p / 2 % 2))) && (((0 == p / 2 % 2 || (((((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2))) || !(p / 2 < 0)) || 1 == 1 + p / 4)))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && 4 <= q + p * -1) && (!(1 == p) || B == d)) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p)) && ((0 == d % 2 || (((1 == p / 2 || (((0 == p / 2 % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p / 4) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + p / 4) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -((d / 2 + 1) / 2))))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0)))) || !(d < 0))) && ((((1 == p / 2 || (((((!(d / 2 < 0) || A == (q + p / 4) * B + (r + (-1 + -(d / 4)))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p / 4) * B + (r + -(d / 4)))) || (p / 2 < 0 && !(0 == p / 2 % 2))) && ((0 == p / 2 % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -(d / 4))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2))) || !(p / 2 < 0)))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || 1 == 1 + p / 2) || (((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 4))) && ((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 4)))))) && ((((A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -(d / 4)))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || !(p < 0))) || (d < 0 && !(0 == d % 2))))) || (((((((((((((((((((r + d <= B * 2 + -1 && r + d <= A + B * -4) && (((((1 == p / 2 || (((0 == p / 2 % 2 || (((!(1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -((d / 2 + 1) / 2))))) || !(p / 2 < 0)) && ((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + p + p / 4) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -((d / 2 + 1) / 2)))) || (p / 2 < 0 && !(0 == p / 2 % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || ((A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -((d / 2 + 1) / 2)) || (!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0)) && ((!(1 + d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))) || 0 == d % 2) || !(d < 0))) && p == 1) && r == A + B * -4 + -B) && B == 1) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || ((((((!(d / 2 < 0) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))) && (((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || !(1 + (p / 2 + 1) / 2 < 0)) || 0 == ((p / 2 + 1) / 2 + 1) % 2))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))))) && ((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))))))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((((((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))) || 0 == (p / 2 + 1) % 2) || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((((A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || 0 == (p / 2 + 1) / 2 % 2) || !((p / 2 + 1) / 2 < 0))))))) || 0 == p % 2) || !(p < 0)) && (((((((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) || !(p / 4 < 0)))) && (((0 == p / 2 % 2 || !(p / 2 < 0)) || (((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || 1 == 1 + p / 4)) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || ((((0 == p / 2 % 2 || ((((((0 == d / 4 % 2 || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8))) || 0 == d / 4 % 2) || !(d / 4 < 0)) && (A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || !(p / 2 < 0)) || 1 == 1 + p / 4) && ((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((0 == d / 4 % 2 || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((0 == d / 4 % 2 || !(d / 4 < 0)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))))) || !(p / 4 < 0))))))) || (p < 0 && !(0 == p % 2)))))) && A == (q + p) * B + (r + -d)) && ((d < 0 && !(0 == d % 2)) || (((1 == p / 2 || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && (((((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -(d / 4)))) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -(d / 4)))) || 0 == p / 2 % 2) || !(p / 2 < 0)))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))))) && ((0 == d % 2 || ((((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && ((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))))) && (((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))))))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || ((((A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((0 == (p / 2 + 1) / 2 % 2 || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !((p / 2 + 1) / 2 < 0)))) && (((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))))))) || 0 == p % 2) || !(p < 0)) && ((((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !(p / 4 < 0)) && (((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (p / 4 < 0 && !(0 == p / 4 % 2))))) && (((((((((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)))))) || 0 == p / 2 % 2) || !(p / 2 < 0)) || 1 == 1 + p / 4))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((((((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (p / 4 < 0 && !(0 == p / 4 % 2))) && (((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || 0 == p / 4 % 2) || !(p / 4 < 0))) || 1 == p / 4) || (p / 2 < 0 && !(0 == p / 2 % 2))) && (((0 == p / 2 % 2 || (((((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2))) || !(p / 2 < 0)) || 1 == 1 + p / 4)))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && d == B) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p)) && q + -4 == 1) && ((0 == d % 2 || (((1 == p / 2 || (((0 == p / 2 % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p / 4) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + p / 4) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -((d / 2 + 1) / 2))))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0)))) || !(d < 0))) && q + p * -1 <= 4) && d <= B * 2 + -1) && d <= A + B * -4) && ((((1 == p / 2 || (((((!(d / 2 < 0) || A == (q + p / 4) * B + (r + (-1 + -(d / 4)))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p / 4) * B + (r + -(d / 4)))) || (p / 2 < 0 && !(0 == p / 2 % 2))) && ((0 == p / 2 % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -(d / 4))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2))) || !(p / 2 < 0)))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || 1 == 1 + p / 2) || (((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 4))) && ((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 4)))))) && ((((A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -(d / 4)))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || !(p < 0))) || (d < 0 && !(0 == d % 2))))) || (((((((((((((((!(A >= 2 * (2 * (2 * B))) && r >= A + B * -4 + -(B * 2)) && 4 <= q + 2 * -1) && (((((1 == p / 2 || (((0 == p / 2 % 2 || (((!(1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -((d / 2 + 1) / 2))))) || !(p / 2 < 0)) && ((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + p + p / 4) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -((d / 2 + 1) / 2)))) || (p / 2 < 0 && !(0 == p / 2 % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || ((A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -((d / 2 + 1) / 2)) || (!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0)) && ((!(1 + d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))) || 0 == d % 2) || !(d < 0))) && p == 1) && A + B * -4 >= B * 2) && B == 1) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && !(r >= d)) && A == q * B + r) && A == (q + p) * B + (r + -d)) && ((d < 0 && !(0 == d % 2)) || (((1 == p / 2 || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && (((((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -(d / 4)))) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -(d / 4)))) || 0 == p / 2 % 2) || !(p / 2 < 0)))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))))) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && d == B) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p)) && (A == q * B + r || (1 <= d && A == q * B + r)))) || (((((A + r * -1 == 2 * B && p == 1) && B == 1) && (A == q * B + r || (1 <= d && A == q * B + r))) && ((d == (A + -r) / 2 && (!(A + r * -1 < 0) || 0 == (A + r) % 2)) || ((!(0 == (A + r) % 2) && d == 1 + (A + -r) / 2) && A + r * -1 < 0))) && q + 2 * 1 * -1 == 0)) || (((((((A == (q + p) * B + (r + -d) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p)) && B == 1) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && A == q * B + r) && d == 1 * p) && A == q * 1 + r)) || (((B == 1 && d == 1 * p) && A == q * B + r) && A == q * 1 + r)) || ((((((A == (q + p) * B + (r + -d) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && B == 1) && (A == q * B + r || (1 <= d && A == q * B + r))) && A == q * B + r) && d == 1 * p) && A == q * 1 + r)) || (((((((((((((A == (q + 2 * p + p) * B + (r + -(2 * d) + -d) && p == 2) && B == 1) && !(r >= d)) && d == B * 2) && A == q * B + r) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && r + 2 * (2 * B) <= A) && q + 2 * (2 * 1) * -1 == 0) && q <= 0 + 2 * (2 * 1)) && r + 2 * (2 * B) == A) && (!(1 == p) || B == d)) && (A == q * B + r || (1 <= d && A == q * B + r)))) || ((((((q + 2 * (2 * 1) * -1 == 0 && p == 1) && r + 2 * (2 * B) == A) && d == B) && B == 1) && (A == q * B + r || (1 <= d && A == q * B + r))) && A == q * B + r)) || (((((((((((((((((!(A >= 2 * (2 * (2 * B))) && q >= 0 + p) && q <= 0 + p) && q + p * -1 == 0) && B == 1) && r == A + -d) && d == 1 * p) && A == q * B + r) && ((((((((((((2 <= d && (((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && (!(1 == p) || B == d)) && A == q * B + r) || ((((((((((2 <= d && (((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && (!(1 == p) || B == d)) && A == q * B + r))) && p == 4) && p == 2 * (2 * 1)) && A == q * 1 + r) && d == 2 * (2 * B)) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && r + d <= A) && (!(1 == p) || B == d)) && d == B * 4) && r + d == A)) || (((((((((((((((((1 == p / 2 || (((0 == p / 2 % 2 || (((!(1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -((d / 2 + 1) / 2))))) || !(p / 2 < 0)) && ((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + p + p / 4) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -((d / 2 + 1) / 2)))) || (p / 2 < 0 && !(0 == p / 2 % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || ((A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -((d / 2 + 1) / 2)) || (!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0)) && ((!(1 + d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))) || 0 == d % 2) || !(d < 0)) && B == 1) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && A == q * B + r) && d == 1 * p) && ((((((((((((2 <= d && (((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && (!(1 == p) || B == d)) && A == q * B + r) || ((((((((((2 <= d && (((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && (!(1 == p) || B == d)) && A == q * B + r))) && A == q * 1 + r) && A == (q + p) * B + (r + -d)) && ((d < 0 && !(0 == d % 2)) || (((1 == p / 2 || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && (((((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -(d / 4)))) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -(d / 4)))) || 0 == p / 2 % 2) || !(p / 2 < 0)))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && (!(1 == p) || B == d)) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p))) || (((((((((((((((((((A == d * q + r && (((((1 == p / 2 || (((0 == p / 2 % 2 || (((!(1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -((d / 2 + 1) / 2))))) || !(p / 2 < 0)) && ((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + p + p / 4) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -((d / 2 + 1) / 2)))) || (p / 2 < 0 && !(0 == p / 2 % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || ((A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -((d / 2 + 1) / 2)) || (!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0)) && ((!(1 + d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))) || 0 == d % 2) || !(d < 0))) && r == A) && ((((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || 0 == d / 2 % 2) || B == 1 + d / 4) && ((!(0 == d / 2 % 2) && d / 2 < 0) || B == d / 4))) && ((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || B == (d / 2 + 1) / 2) && ((B == 1 + (d / 2 + 1) / 2 || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(d < 0))) || (((0 == p % 2 || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) && ((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4))) || (p < 0 && !(0 == p % 2)))))) && B == 1) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || ((((((!(d / 2 < 0) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))) && (((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || !(1 + (p / 2 + 1) / 2 < 0)) || 0 == ((p / 2 + 1) / 2 + 1) % 2))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))))) && ((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))))))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((((((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))) || 0 == (p / 2 + 1) % 2) || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((((A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || 0 == (p / 2 + 1) / 2 % 2) || !((p / 2 + 1) / 2 < 0))))))) || 0 == p % 2) || !(p < 0)) && (((((((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) || !(p / 4 < 0)))) && (((0 == p / 2 % 2 || !(p / 2 < 0)) || (((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || 1 == 1 + p / 4)) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || ((((0 == p / 2 % 2 || ((((((0 == d / 4 % 2 || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8))) || 0 == d / 4 % 2) || !(d / 4 < 0)) && (A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || !(p / 2 < 0)) || 1 == 1 + p / 4) && ((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((0 == d / 4 % 2 || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((0 == d / 4 % 2 || !(d / 4 < 0)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))))) || !(p / 4 < 0))))))) || (p < 0 && !(0 == p % 2)))))) && A == q * B + r) && d == 1 * p) && (((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && ((((((((((A == (q + p) * B + (r + -d) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || (((((((((A == (q + p) * B + (r + -d) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))) || ((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((((((((A == (q + p) * B + (r + -d) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || (((((((((A == (q + p) * B + (r + -d) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))))) && A == q * 1 + r) && A == (q + p) * B + (r + -d)) && ((d < 0 && !(0 == d % 2)) || (((1 == p / 2 || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && (((((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -(d / 4)))) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -(d / 4)))) || 0 == p / 2 % 2) || !(p / 2 < 0)))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((0 == d % 2 || ((((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && ((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))))) && (((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))))))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || ((((A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((0 == (p / 2 + 1) / 2 % 2 || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !((p / 2 + 1) / 2 < 0)))) && (((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))))))) || 0 == p % 2) || !(p < 0)) && ((((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !(p / 4 < 0)) && (((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (p / 4 < 0 && !(0 == p / 4 % 2))))) && (((((((((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)))))) || 0 == p / 2 % 2) || !(p / 2 < 0)) || 1 == 1 + p / 4))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((((((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (p / 4 < 0 && !(0 == p / 4 % 2))) && (((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || 0 == p / 4 % 2) || !(p / 4 < 0))) || 1 == p / 4) || (p / 2 < 0 && !(0 == p / 2 % 2))) && (((0 == p / 2 % 2 || (((((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2))) || !(p / 2 < 0)) || 1 == 1 + p / 4)))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && (!(1 == p) || B == d)) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p)) && ((0 == d % 2 || (((1 == p / 2 || (((0 == p / 2 % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p / 4) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + p / 4) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -((d / 2 + 1) / 2))))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0)))) || !(d < 0))) && ((((1 == p / 2 || (((((!(d / 2 < 0) || A == (q + p / 4) * B + (r + (-1 + -(d / 4)))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p / 4) * B + (r + -(d / 4)))) || (p / 2 < 0 && !(0 == p / 2 % 2))) && ((0 == p / 2 % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -(d / 4))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2))) || !(p / 2 < 0)))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || 1 == 1 + p / 2) || (((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 4))) && ((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 4)))))) && ((((A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -(d / 4)))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || !(p < 0))) || (d < 0 && !(0 == d % 2))))) || ((((((((((((((r <= A && A == d * q + r) && r == A) && ((((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || 0 == d / 2 % 2) || B == 1 + d / 4) && ((!(0 == d / 2 % 2) && d / 2 < 0) || B == d / 4))) && ((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || B == (d / 2 + 1) / 2) && ((B == 1 + (d / 2 + 1) / 2 || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(d < 0))) || (((0 == p % 2 || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) && ((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4))) || (p < 0 && !(0 == p % 2)))))) && q == 0) && B == 1) && !(r >= d)) && d == 1 * p) && A == q * B + r) && (((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && ((((((((((A == (q + p) * B + (r + -d) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || (((((((((A == (q + p) * B + (r + -d) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))) || ((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((((((((A == (q + p) * B + (r + -d) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || (((((((((A == (q + p) * B + (r + -d) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))))) && p == 2 * (2 * (2 * 1))) && A == q * 1 + r) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && d == 2 * (2 * (2 * B))) && (!(1 == p) || B == d))) || ((((((((A == (q + p) * B + (r + -d) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p)) && B == 1) && (A == q * B + r || (1 <= d && A == q * B + r))) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && A == q * B + r) && d == 1 * p) && A == q * 1 + r)) || ((((((((((A == (q + p) * B + (r + -d) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && p == 1) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d == B) && r == A + -B) && B == 1) && r == A + -d) && q + p * -1 == 0) && q + 1 * -1 == 0) && d == 1) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((((((((((((d == 2 * 1 && r <= A) && A == d * q + r) && r == A) && q == 0) && B == 1) && d == 1 * p) && A == q * B + r) && A == q * 1 + r) && 2 <= d) && (r == A || A + -1 * r == 0)) && 0 == q) && p == 2 * 1) && d == B * p) && d == 2 * B) || (((((((((((((((((((A == d * q + r && (((((1 == p / 2 || (((0 == p / 2 % 2 || (((!(1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -((d / 2 + 1) / 2))))) || !(p / 2 < 0)) && ((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + p + p / 4) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -((d / 2 + 1) / 2)))) || (p / 2 < 0 && !(0 == p / 2 % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || ((A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -((d / 2 + 1) / 2)) || (!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0)) && ((!(1 + d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))) || 0 == d % 2) || !(d < 0))) && r == A) && ((((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || 0 == d / 2 % 2) || B == 1 + d / 4) && ((!(0 == d / 2 % 2) && d / 2 < 0) || B == d / 4))) && ((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || B == (d / 2 + 1) / 2) && ((B == 1 + (d / 2 + 1) / 2 || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(d < 0))) || (((0 == p % 2 || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) && ((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4))) || (p < 0 && !(0 == p % 2)))))) && B == 1) && (1 == p || (((((A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)) && (A == (q + p / 2) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2)))) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || ((A == (q + (1 + p / 2)) * B + (r + -(d / 2)) || (d < 0 && !(0 == d % 2))) && ((A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2))) || 0 == d % 2) || !(d < 0)))) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || ((((((!(d / 2 < 0) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))) && (((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || !(1 + (p / 2 + 1) / 2 < 0)) || 0 == ((p / 2 + 1) / 2 + 1) % 2))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))))) && ((((0 == (d / 4 + 1) % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))))))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || (((((((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))) || 0 == (p / 2 + 1) % 2) || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((((A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))) && ((0 == d / 4 % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0))) || 0 == (p / 2 + 1) / 2 % 2) || !((p / 2 + 1) / 2 < 0))))))) || 0 == p % 2) || !(p < 0)) && (((((((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))) && ((A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) || !(p / 4 < 0)))) && (((0 == p / 2 % 2 || !(p / 2 < 0)) || (((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((0 == (d / 4 + 1) % 2 || !(1 + d / 4 < 0)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2)))) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -((d / 4 + 1) / 2))))) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -((d / 4 + 1) / 2))) || 0 == (d / 4 + 1) % 2) || !(1 + d / 4 < 0)) && ((1 + d / 4 < 0 && !(0 == (d / 4 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -((d / 4 + 1) / 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || 1 == 1 + p / 4)) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || ((((0 == p / 2 % 2 || ((((((0 == d / 4 % 2 || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2) && ((((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 8))) || 0 == d / 4 % 2) || !(d / 4 < 0)) && (A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)))) || !(p / 2 < 0)) || 1 == 1 + p / 4) && ((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((((0 == d / 4 % 2 || A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + (-1 + -(d / 8)))) || !(d / 4 < 0)) && (A == (q + p / 2 + p / 8) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2)))) || (p / 4 < 0 && !(0 == p / 4 % 2))) && ((0 == p / 4 % 2 || (((0 == d / 4 % 2 || !(d / 4 < 0)) || A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + (-1 + -(d / 8)))) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + -(d / 2) + -(d / 8)) || (d / 4 < 0 && !(0 == d / 4 % 2))))) || !(p / 4 < 0))))))) || (p < 0 && !(0 == p % 2)))))) && A == q * B + r) && d == 1 * p) && A == q * 1 + r) && A == (q + p) * B + (r + -d)) && (((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && (((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || ((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))) || ((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && (((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || ((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))))) && ((d < 0 && !(0 == d % 2)) || (((1 == p / 2 || (p < 0 && !(0 == p % 2))) || (((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + p / 4) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && (((((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + p + (1 + p / 4)) * B + (r + -d + (-1 + -(d / 4)))) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + p / 4)) * B + (r + -d + -(d / 4)))) || 0 == p / 2 % 2) || !(p / 2 < 0)))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (p / 2 + 1) / 2) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + -(d / 4))) && ((!(d / 2 < 0) || A == (q + p + (1 + (p / 2 + 1) / 2)) * B + (r + -d + (-1 + -(d / 4)))) || 0 == d / 2 % 2))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0))))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((0 == d % 2 || ((((((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || ((((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && ((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2))))) && ((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || (((0 == (p / 2 + 1) / 2 % 2 || !((p / 2 + 1) / 2 < 0)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && ((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))))) && (((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2)) || (((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))))))))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == (p / 2 + 1) / 2 || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))) || ((((A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (p / 2 + 1) / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || ((p / 2 + 1) / 2 < 0 && !(0 == (p / 2 + 1) / 2 % 2))) && ((0 == (p / 2 + 1) / 2 % 2 || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !((p / 2 + 1) / 2 < 0)))) && (((0 == (p / 2 + 1) % 2 || 1 == 1 + (p / 2 + 1) / 2) || !(1 + p / 2 < 0)) || (((!(1 + (p / 2 + 1) / 2 < 0) || ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((A == (q + (1 + p / 2) + (1 + ((p / 2 + 1) / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2))) || 0 == ((p / 2 + 1) / 2 + 1) % 2) && (((A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + (1 + p / 2) + ((p / 2 + 1) / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (1 + (p / 2 + 1) / 2 < 0 && !(0 == ((p / 2 + 1) / 2 + 1) % 2)))))))) || 0 == p % 2) || !(p < 0)) && ((((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 == p / 4 || (p / 2 < 0 && !(0 == p / 2 % 2))) || (((0 == p / 4 % 2 || (((A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))))) || !(p / 4 < 0)) && (((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2))) && ((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))))) || (p / 4 < 0 && !(0 == p / 4 % 2))))) && (((((((((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || !((d / 2 + 1) / 2 < 0)) || 0 == (d / 2 + 1) / 2 % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((!(1 + p / 4 < 0) || 0 == (p / 4 + 1) % 2) || (((!((d / 2 + 1) / 2 < 0) || 0 == (d / 2 + 1) / 2 % 2) || A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)))) && (A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 4)) || ((d / 2 + 1) / 2 < 0 && !(0 == (d / 2 + 1) / 2 % 2)))))) || 0 == p / 2 % 2) || !(p / 2 < 0)) || 1 == 1 + p / 4))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((((((A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + p / 8) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (p / 4 < 0 && !(0 == p / 4 % 2))) && (((((!(1 + (d / 2 + 1) / 2 < 0) || A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)))) || 0 == ((d / 2 + 1) / 2 + 1) % 2) && (A == (q + p / 2 + (1 + p / 8)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)))) || 0 == p / 4 % 2) || !(p / 4 < 0))) || 1 == p / 4) || (p / 2 < 0 && !(0 == p / 2 % 2))) && (((0 == p / 2 % 2 || (((((1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2)) || A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2))) && ((A == (q + p / 2 + (p / 4 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || (!(0 == (p / 4 + 1) % 2) && 1 + p / 4 < 0)) && ((((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2)) || (1 + (d / 2 + 1) / 2 < 0 && !(0 == ((d / 2 + 1) / 2 + 1) % 2))) && ((A == (q + p / 2 + (1 + (p / 4 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2))) || !(1 + (d / 2 + 1) / 2 < 0)) || 0 == ((d / 2 + 1) / 2 + 1) % 2)) || !(1 + p / 4 < 0)) || 0 == (p / 4 + 1) % 2))) || !(p / 2 < 0)) || 1 == 1 + p / 4)))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && (1 == 2 * p || A == (q + 2 * (2 * p) + p) * B + (r + -(2 * (2 * d)) + -d))) && (!(1 == p) || B == d)) && ((((p < 0 && !(0 == p % 2)) || ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + -(2 * d / 4)) || (d < 0 && !(0 == d % 2))) && ((A == (q + 2 * p + 2 * p / 4) * B + (r + -(2 * d) + (-1 + -(2 * d / 4))) || 0 == d % 2) || !(d < 0)))) && ((0 == p % 2 || (((0 == d % 2 || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + (-1 + -(2 * d / 4)))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == (q + 2 * p + (1 + 2 * p / 4)) * B + (r + -(2 * d) + -(2 * d / 4))))) || !(p < 0))) || 1 == p)) && ((0 == d % 2 || (((1 == p / 2 || (((0 == p / 2 % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + p / 4) * B + (r + -((d / 2 + 1) / 2))) && ((A == (q + p / 4) * B + (r + (-1 + -((d / 2 + 1) / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -((d / 2 + 1) / 2))) && ((!(1 + d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -((d / 2 + 1) / 2)))) || 0 == (d / 2 + 1) % 2))) && ((0 == (p / 2 + 1) % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -((d / 2 + 1) / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -((d / 2 + 1) / 2))))) || !(1 + p / 2 < 0)))) || 1 == 1 + p / 2) || !(p < 0)))) || !(d < 0))) && ((((1 == p / 2 || (((((!(d / 2 < 0) || A == (q + p / 4) * B + (r + (-1 + -(d / 4)))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + p / 4) * B + (r + -(d / 4)))) || (p / 2 < 0 && !(0 == p / 2 % 2))) && ((0 == p / 2 % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + p / 4)) * B + (r + -(d / 4))) && ((A == (q + (1 + p / 4)) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2))) || !(p / 2 < 0)))) || (p < 0 && !(0 == p % 2))) && (((0 == p % 2 || 1 == 1 + p / 2) || (((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 4))) && ((!(d / 2 < 0) || 0 == d / 2 % 2) || A == (q + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 4)))))) && ((((A == (q + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 4))) || !(d / 2 < 0)) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == (q + (p / 2 + 1) / 2) * B + (r + -(d / 4)))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || !(p < 0))) || (d < 0 && !(0 == d % 2))))) || (((((((((((((r <= A && p == 1) && r == A) && q == 0) && B == 1) && d == 1) && d == 1 * p) && A == q * B + r) && A == q * 1 + r) && (r == A || A + -1 * r == 0)) && 0 == q) && d == 1 * 1) && d == B) && 1 <= d)) || (((((((((((((r <= A && A == d * q + r) && r == A) && ((((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || 0 == d / 2 % 2) || B == 1 + d / 4) && ((!(0 == d / 2 % 2) && d / 2 < 0) || B == d / 4))) && ((0 == d % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || B == (d / 2 + 1) / 2) && ((B == 1 + (d / 2 + 1) / 2 || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2))) || !(d < 0))) || (((0 == p % 2 || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) && ((((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4))) || (p < 0 && !(0 == p % 2)))))) && q == 0) && B == 1) && d == 1 * p) && A == q * B + r) && p == 2 * (2 * (2 * 1))) && A == q * 1 + r) && (((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && (((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || ((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && A == d * q + r) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))) || ((((((((((((((((((((((((0 == p % 2 || A == (q + p + (1 + p / 2)) * B + (r + -d + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p + p / 2) * B + (r + -d + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0)) && ((((0 == p % 2 || 1 == 1 + p / 2) || (((d < 0 && !(0 == d % 2)) || (((!(d / 2 < 0) || A == (1 + d / 4) * (q + (1 + p / 2)) + (r + -(d / 2))) || 0 == d / 2 % 2) && ((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + (1 + p / 2)) + (r + -(d / 2))))) && ((0 == d % 2 || (((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || A == (1 + (d / 2 + 1) / 2) * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + (1 + p / 2)) + (r + (-1 + -(d / 2)))))) || !(d < 0)))) || !(p < 0)) || (((0 == (p / 2 + 1) % 2 || !(1 == 1 + (p / 2 + 1) / 2)) || !(1 + p / 2 < 0)) && (!(1 == (p / 2 + 1) / 2) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)))))) && (((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || ((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p))) && 2 <= -d / -2) && r >= -d / -2) && A == (q + 2 * p + p) * B + (r + -(2 * d) + -d)) && (((1 == p / 2 || (((p / 2 < 0 && !(0 == p / 2 % 2)) || !(1 == p / 4)) && ((0 == p / 2 % 2 || !(p / 2 < 0)) || !(1 == 1 + p / 4)))) || (((0 == d % 2 || (((A == (1 + (d / 2 + 1) / 2) * (q + p / 2) + (r + (-1 + -(d / 2))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || A == (d / 2 + 1) / 2 * (q + p / 2) + (r + (-1 + -(d / 2)))))) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || (((!(0 == d / 2 % 2) && d / 2 < 0) || A == d / 4 * (q + p / 2) + (r + -(d / 2))) && ((!(d / 2 < 0) || A == (1 + d / 4) * (q + p / 2) + (r + -(d / 2))) || 0 == d / 2 % 2))))) || (p < 0 && !(0 == p % 2)))) && ((1 == p || (((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r))) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && d % 2 == 0) && A == q * B + r) && ((0 == d % 2 || (((0 == p % 2 || (((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) || !(1 + p / 2 < 0)))) && ((!(1 + d / 2 < 0) || 0 == (d / 2 + 1) % 2) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) || !(1 + p / 2 < 0)))))) || !(p < 0)) && (((((((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))) && ((A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || 0 == p / 2 % 2) || !(p / 2 < 0))) || !(1 + d / 2 < 0)) || 0 == (d / 2 + 1) % 2) && ((!(0 == (d / 2 + 1) % 2) && 1 + d / 2 < 0) || (((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2)))))) || (p < 0 && !(0 == p % 2))))) || !(d < 0))) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (((((0 == d % 2 || !(d < 0)) || A == (1 + d / 2) * (q + p) + (r + -d)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * (q + p) + (r + -d))) || 1 == p) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || !(p < 0)) || A == (q + p + (1 + p / 2)) * B + (r + -d + -(d / 2))) && (A == (q + p + p / 2) * B + (r + -d + -(d / 2)) || (p < 0 && !(0 == p % 2)))))) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (!(1 == p) || B == d)) && ((d < 0 && !(0 == d % 2)) || (((0 == p % 2 || (((!(0 == d / 2 % 2) && d / 2 < 0) || (((1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2)) || A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + -(d / 4))) && ((0 == (p / 2 + 1) % 2 || !(1 + p / 2 < 0)) || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + -(d / 4))))) && ((!(d / 2 < 0) || (((0 == (p / 2 + 1) % 2 || A == (q + (1 + p / 2) + (1 + (p / 2 + 1) / 2)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) || !(1 + p / 2 < 0)) && (A == (q + (1 + p / 2) + (p / 2 + 1) / 2) * B + (r + -(d / 2) + (-1 + -(d / 4))) || (1 + p / 2 < 0 && !(0 == (p / 2 + 1) % 2))))) || 0 == d / 2 % 2))) || !(p < 0)) && ((p < 0 && !(0 == p % 2)) || (((((A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + -(d / 4)) || 0 == p / 2 % 2) || !(p / 2 < 0)) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + -(d / 4)))) || (!(0 == d / 2 % 2) && d / 2 < 0)) && (((((0 == p / 2 % 2 || !(p / 2 < 0)) || A == (q + p / 2 + (1 + p / 4)) * B + (r + -(d / 2) + (-1 + -(d / 4)))) && ((p / 2 < 0 && !(0 == p / 2 % 2)) || A == (q + p / 2 + p / 4) * B + (r + -(d / 2) + (-1 + -(d / 4))))) || !(d / 2 < 0)) || 0 == d / 2 % 2)))))))) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && d == 2 * (2 * (2 * B))) && (!(1 == p) || B == d))) || (((((((((((((((((((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && (A == d * q + r || !(1 == p))) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p) || ((((((((((((r == A || A + -1 * r == 0) && A == (q + p) * B + (r + -d)) && ((((A == (1 + d / 2) * q + r || 0 == d % 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || A == d / 2 * q + r)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && 0 == q) && A == d * q + r) && r == A) && (((A == (q + p / 2) * B + (r + -(d / 2)) || (p < 0 && !(0 == p % 2))) && ((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + -(d / 2))) || !(p < 0))) || (d < 0 && !(0 == d % 2)))) && (((((0 == p % 2 || A == (q + (1 + p / 2)) * B + (r + (-1 + -(d / 2)))) || !(p < 0)) && (A == (q + p / 2) * B + (r + (-1 + -(d / 2))) || (p < 0 && !(0 == p % 2)))) || 0 == d % 2) || !(d < 0))) && q == 0) && B == 1) && A == q * B + r) && d == B * p)) && r <= A) && 2 <= -d / -2) && r >= -d / -2) && A == d * q + r) && r == A) && q == 0) && B == 1) && d == 2 * (2 * 1)) && d % 2 == 0) && d == 1 * p) && A == q * B + r) && p == 2 * (2 * 1)) && A == q * 1 + r) && d == 2 * (2 * B)) && ((((0 == d % 2 || B == 1 + d / 2) || !(d < 0)) && ((d < 0 && !(0 == d % 2)) || B == d / 2)) || (((p < 0 && !(0 == p % 2)) || !(1 == p / 2)) && ((0 == p % 2 || !(1 == 1 + p / 2)) || !(p < 0))))) && (!(1 == p) || B == d)) RESULT: Ultimate proved your program to be correct! [2023-02-18 18:27:13,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE