./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound5.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 a077c1334c11d8329da2d0c58ca917b2036581fa7e949d1d304e3346ec54a811 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 02:07:57,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 02:07:57,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 02:07:57,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 02:07:57,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 02:07:57,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 02:07:57,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 02:07:57,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 02:07:57,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 02:07:57,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 02:07:57,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 02:07:57,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 02:07:57,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 02:07:57,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 02:07:57,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 02:07:57,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 02:07:57,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 02:07:57,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 02:07:57,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 02:07:57,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 02:07:57,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 02:07:58,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 02:07:58,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 02:07:58,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 02:07:58,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 02:07:58,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 02:07:58,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 02:07:58,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 02:07:58,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 02:07:58,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 02:07:58,016 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 02:07:58,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 02:07:58,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 02:07:58,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 02:07:58,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 02:07:58,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 02:07:58,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 02:07:58,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 02:07:58,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 02:07:58,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 02:07:58,021 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 02:07:58,021 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 02:07:58,048 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 02:07:58,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 02:07:58,049 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 02:07:58,049 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 02:07:58,050 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 02:07:58,050 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 02:07:58,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 02:07:58,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 02:07:58,051 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 02:07:58,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 02:07:58,052 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 02:07:58,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 02:07:58,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 02:07:58,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 02:07:58,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 02:07:58,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 02:07:58,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 02:07:58,053 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 02:07:58,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 02:07:58,054 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 02:07:58,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 02:07:58,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 02:07:58,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 02:07:58,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 02:07:58,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:07:58,055 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 02:07:58,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 02:07:58,056 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 02:07:58,056 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 02:07:58,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 02:07:58,056 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 02:07:58,056 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 02:07:58,057 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 02:07:58,057 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 02:07:58,057 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 02:07:58,057 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 -> a077c1334c11d8329da2d0c58ca917b2036581fa7e949d1d304e3346ec54a811 [2023-02-17 02:07:58,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 02:07:58,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 02:07:58,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 02:07:58,311 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 02:07:58,312 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 02:07:58,313 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound5.c [2023-02-17 02:07:59,492 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 02:07:59,630 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 02:07:59,630 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound5.c [2023-02-17 02:07:59,635 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3ab7a24a/6ea1e4f9c9c5466fa0f1316f293e9a2c/FLAG591d7346c [2023-02-17 02:07:59,648 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3ab7a24a/6ea1e4f9c9c5466fa0f1316f293e9a2c [2023-02-17 02:07:59,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 02:07:59,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 02:07:59,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 02:07:59,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 02:07:59,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 02:07:59,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:07:59" (1/1) ... [2023-02-17 02:07:59,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f41cb7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:59, skipping insertion in model container [2023-02-17 02:07:59,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:07:59" (1/1) ... [2023-02-17 02:07:59,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 02:07:59,677 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:07:59,789 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_valuebound5.c[526,539] [2023-02-17 02:07:59,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:07:59,825 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 02:07:59,841 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_valuebound5.c[526,539] [2023-02-17 02:07:59,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:07:59,864 INFO L208 MainTranslator]: Completed translation [2023-02-17 02:07:59,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:59 WrapperNode [2023-02-17 02:07:59,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 02:07:59,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 02:07:59,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 02:07:59,867 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 02:07:59,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:59" (1/1) ... [2023-02-17 02:07:59,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:59" (1/1) ... [2023-02-17 02:07:59,900 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2023-02-17 02:07:59,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 02:07:59,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 02:07:59,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 02:07:59,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 02:07:59,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:59" (1/1) ... [2023-02-17 02:07:59,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:59" (1/1) ... [2023-02-17 02:07:59,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:59" (1/1) ... [2023-02-17 02:07:59,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:59" (1/1) ... [2023-02-17 02:07:59,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:59" (1/1) ... [2023-02-17 02:07:59,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:59" (1/1) ... [2023-02-17 02:07:59,934 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:59" (1/1) ... [2023-02-17 02:07:59,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:59" (1/1) ... [2023-02-17 02:07:59,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 02:07:59,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 02:07:59,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 02:07:59,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 02:07:59,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:59" (1/1) ... [2023-02-17 02:07:59,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:07:59,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:07:59,973 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-17 02:08:00,004 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-17 02:08:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 02:08:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 02:08:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 02:08:00,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 02:08:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 02:08:00,026 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 02:08:00,074 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 02:08:00,076 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 02:08:00,225 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 02:08:00,230 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 02:08:00,233 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 02:08:00,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:08:00 BoogieIcfgContainer [2023-02-17 02:08:00,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 02:08:00,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 02:08:00,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 02:08:00,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 02:08:00,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 02:07:59" (1/3) ... [2023-02-17 02:08:00,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e90a650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:08:00, skipping insertion in model container [2023-02-17 02:08:00,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:07:59" (2/3) ... [2023-02-17 02:08:00,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e90a650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:08:00, skipping insertion in model container [2023-02-17 02:08:00,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:08:00" (3/3) ... [2023-02-17 02:08:00,242 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound5.c [2023-02-17 02:08:00,277 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 02:08:00,278 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 02:08:00,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 02:08:00,318 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;@39fdc3fc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 02:08:00,318 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 02:08:00,321 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-17 02:08:00,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 02:08:00,327 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:08:00,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:08:00,328 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:08:00,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:08:00,332 INFO L85 PathProgramCache]: Analyzing trace with hash -586848446, now seen corresponding path program 1 times [2023-02-17 02:08:00,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:08:00,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129963776] [2023-02-17 02:08:00,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:00,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:08:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:08:00,510 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-17 02:08:00,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:08:00,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129963776] [2023-02-17 02:08:00,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129963776] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:08:00,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:08:00,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:08:00,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457410939] [2023-02-17 02:08:00,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:08:00,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 02:08:00,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:08:00,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 02:08:00,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 02:08:00,543 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-17 02:08:00,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:08:00,562 INFO L93 Difference]: Finished difference Result 49 states and 83 transitions. [2023-02-17 02:08:00,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 02:08:00,564 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-17 02:08:00,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:08:00,569 INFO L225 Difference]: With dead ends: 49 [2023-02-17 02:08:00,569 INFO L226 Difference]: Without dead ends: 22 [2023-02-17 02:08:00,572 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-17 02:08:00,575 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-17 02:08:00,576 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-17 02:08:00,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-17 02:08:00,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-17 02:08:00,604 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-17 02:08:00,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2023-02-17 02:08:00,606 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 9 [2023-02-17 02:08:00,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:08:00,606 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-02-17 02:08:00,607 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-17 02:08:00,607 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2023-02-17 02:08:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 02:08:00,608 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:08:00,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:08:00,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 02:08:00,609 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:08:00,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:08:00,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1188158916, now seen corresponding path program 1 times [2023-02-17 02:08:00,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:08:00,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137695481] [2023-02-17 02:08:00,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:00,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:08:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:08:00,752 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-17 02:08:00,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:08:00,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137695481] [2023-02-17 02:08:00,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137695481] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:08:00,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:08:00,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:08:00,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130838199] [2023-02-17 02:08:00,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:08:00,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:08:00,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:08:00,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:08:00,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:08:00,757 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-17 02:08:00,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:08:00,804 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2023-02-17 02:08:00,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:08:00,805 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-17 02:08:00,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:08:00,806 INFO L225 Difference]: With dead ends: 35 [2023-02-17 02:08:00,806 INFO L226 Difference]: Without dead ends: 33 [2023-02-17 02:08:00,807 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-17 02:08:00,808 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-17 02:08:00,809 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-17 02:08:00,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-17 02:08:00,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2023-02-17 02:08:00,817 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-17 02:08:00,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-02-17 02:08:00,818 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2023-02-17 02:08:00,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:08:00,819 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-02-17 02:08:00,819 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-17 02:08:00,819 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-02-17 02:08:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 02:08:00,820 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:08:00,820 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:08:00,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 02:08:00,821 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:08:00,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:08:00,822 INFO L85 PathProgramCache]: Analyzing trace with hash -697944935, now seen corresponding path program 1 times [2023-02-17 02:08:00,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:08:00,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791199214] [2023-02-17 02:08:00,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:00,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:08:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:08:00,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 02:08:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:08:00,958 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-17 02:08:00,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:08:00,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791199214] [2023-02-17 02:08:00,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791199214] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:08:00,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:08:00,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:08:00,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902623285] [2023-02-17 02:08:00,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:08:00,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:08:00,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:08:00,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:08:00,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:08:00,962 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-17 02:08:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:08:01,061 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2023-02-17 02:08:01,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:08:01,064 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-17 02:08:01,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:08:01,065 INFO L225 Difference]: With dead ends: 39 [2023-02-17 02:08:01,065 INFO L226 Difference]: Without dead ends: 37 [2023-02-17 02:08:01,066 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-17 02:08:01,067 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:08:01,067 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.1s Time] [2023-02-17 02:08:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-17 02:08:01,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2023-02-17 02:08:01,078 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-17 02:08:01,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-02-17 02:08:01,079 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2023-02-17 02:08:01,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:08:01,079 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-02-17 02:08:01,080 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-17 02:08:01,080 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-02-17 02:08:01,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 02:08:01,081 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:08:01,081 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:08:01,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 02:08:01,081 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:08:01,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:08:01,082 INFO L85 PathProgramCache]: Analyzing trace with hash 262992548, now seen corresponding path program 1 times [2023-02-17 02:08:01,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:08:01,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614298040] [2023-02-17 02:08:01,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:01,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:08:01,099 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:08:01,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [345344210] [2023-02-17 02:08:01,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:01,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:08:01,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:08:01,107 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-17 02:08:01,110 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-17 02:08:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:08:01,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 02:08:01,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:08:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:08:01,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:08:01,378 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:08:01,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:08:01,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614298040] [2023-02-17 02:08:01,379 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:08:01,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345344210] [2023-02-17 02:08:01,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345344210] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:08:01,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:08:01,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-17 02:08:01,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233984465] [2023-02-17 02:08:01,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:08:01,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 02:08:01,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:08:01,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 02:08:01,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-17 02:08:01,382 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 02:08:01,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:08:01,602 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2023-02-17 02:08:01,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:08:01,603 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2023-02-17 02:08:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:08:01,605 INFO L225 Difference]: With dead ends: 65 [2023-02-17 02:08:01,605 INFO L226 Difference]: Without dead ends: 51 [2023-02-17 02:08:01,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-17 02:08:01,607 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:08:01,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 60 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:08:01,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-17 02:08:01,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-17 02:08:01,627 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-17 02:08:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2023-02-17 02:08:01,630 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 19 [2023-02-17 02:08:01,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:08:01,630 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-02-17 02:08:01,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 02:08:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2023-02-17 02:08:01,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 02:08:01,633 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:08:01,634 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-17 02:08:01,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 02:08:01,844 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-17 02:08:01,845 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:08:01,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:08:01,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1807142342, now seen corresponding path program 1 times [2023-02-17 02:08:01,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:08:01,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860855216] [2023-02-17 02:08:01,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:01,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:08:01,857 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:08:01,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [183425925] [2023-02-17 02:08:01,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:01,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:08:01,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:08:01,870 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-17 02:08:01,873 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-17 02:08:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:08:01,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 02:08:01,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:08:01,971 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 02:08:01,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:08:02,073 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 02:08:02,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:08:02,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860855216] [2023-02-17 02:08:02,079 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:08:02,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183425925] [2023-02-17 02:08:02,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183425925] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:08:02,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:08:02,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-02-17 02:08:02,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477951883] [2023-02-17 02:08:02,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:08:02,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 02:08:02,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:08:02,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 02:08:02,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-17 02:08:02,087 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 02:08:02,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:08:02,220 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2023-02-17 02:08:02,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:08:02,221 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 26 [2023-02-17 02:08:02,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:08:02,223 INFO L225 Difference]: With dead ends: 66 [2023-02-17 02:08:02,224 INFO L226 Difference]: Without dead ends: 59 [2023-02-17 02:08:02,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-02-17 02:08:02,227 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:08:02,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 80 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:08:02,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-17 02:08:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2023-02-17 02:08:02,244 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-17 02:08:02,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2023-02-17 02:08:02,248 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 26 [2023-02-17 02:08:02,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:08:02,248 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2023-02-17 02:08:02,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 02:08:02,249 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2023-02-17 02:08:02,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-17 02:08:02,252 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:08:02,252 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-17 02:08:02,263 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-17 02:08:02,458 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-17 02:08:02,459 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:08:02,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:08:02,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1034157389, now seen corresponding path program 1 times [2023-02-17 02:08:02,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:08:02,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020467920] [2023-02-17 02:08:02,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:02,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:08:02,479 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:08:02,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1971903121] [2023-02-17 02:08:02,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:02,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:08:02,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:08:02,484 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-17 02:08:02,495 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-17 02:08:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:08:02,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-17 02:08:02,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:08:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-17 02:08:02,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:08:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-17 02:08:02,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:08:02,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020467920] [2023-02-17 02:08:02,858 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:08:02,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971903121] [2023-02-17 02:08:02,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971903121] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:08:02,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:08:02,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-17 02:08:02,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388414043] [2023-02-17 02:08:02,861 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:08:02,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 02:08:02,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:08:02,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 02:08:02,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-02-17 02:08:02,865 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-02-17 02:08:04,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:08:04,315 INFO L93 Difference]: Finished difference Result 142 states and 193 transitions. [2023-02-17 02:08:04,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 02:08:04,317 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 56 [2023-02-17 02:08:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:08:04,318 INFO L225 Difference]: With dead ends: 142 [2023-02-17 02:08:04,318 INFO L226 Difference]: Without dead ends: 111 [2023-02-17 02:08:04,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-02-17 02:08:04,320 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 48 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:08:04,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 94 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-17 02:08:04,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-17 02:08:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2023-02-17 02:08:04,356 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-17 02:08:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 138 transitions. [2023-02-17 02:08:04,357 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 138 transitions. Word has length 56 [2023-02-17 02:08:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:08:04,358 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 138 transitions. [2023-02-17 02:08:04,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-02-17 02:08:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2023-02-17 02:08:04,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-17 02:08:04,360 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:08:04,360 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-17 02:08:04,369 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-17 02:08:04,566 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-17 02:08:04,566 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:08:04,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:08:04,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1199454569, now seen corresponding path program 1 times [2023-02-17 02:08:04,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:08:04,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057949037] [2023-02-17 02:08:04,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:04,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:08:04,576 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:08:04,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2011539312] [2023-02-17 02:08:04,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:04,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:08:04,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:08:04,577 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-17 02:08:04,595 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-17 02:08:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:08:04,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-17 02:08:04,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:08:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-17 02:08:04,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:08:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-17 02:08:04,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:08:04,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057949037] [2023-02-17 02:08:04,908 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:08:04,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011539312] [2023-02-17 02:08:04,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011539312] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:08:04,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:08:04,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-17 02:08:04,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258944161] [2023-02-17 02:08:04,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:08:04,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 02:08:04,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:08:04,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 02:08:04,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-02-17 02:08:04,915 INFO L87 Difference]: Start difference. First operand 106 states and 138 transitions. Second operand has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2023-02-17 02:08:05,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:08:05,729 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2023-02-17 02:08:05,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 02:08:05,730 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 67 [2023-02-17 02:08:05,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:08:05,731 INFO L225 Difference]: With dead ends: 161 [2023-02-17 02:08:05,731 INFO L226 Difference]: Without dead ends: 123 [2023-02-17 02:08:05,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2023-02-17 02:08:05,733 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 02:08:05,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 87 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-17 02:08:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-17 02:08:05,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 101. [2023-02-17 02:08:05,768 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-17 02:08:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2023-02-17 02:08:05,771 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 125 transitions. Word has length 67 [2023-02-17 02:08:05,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:08:05,771 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 125 transitions. [2023-02-17 02:08:05,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2023-02-17 02:08:05,771 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2023-02-17 02:08:05,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-17 02:08:05,777 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:08:05,777 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-17 02:08:05,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-17 02:08:05,982 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-17 02:08:05,982 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:08:05,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:08:05,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1728532070, now seen corresponding path program 1 times [2023-02-17 02:08:05,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:08:05,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221672943] [2023-02-17 02:08:05,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:05,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:08:05,990 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:08:05,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [975877816] [2023-02-17 02:08:05,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:05,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:08:05,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:08:05,992 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-17 02:08:06,002 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-17 02:08:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:08:06,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 02:08:06,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:08:06,093 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 24 proven. 37 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-17 02:08:06,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:08:06,236 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 24 proven. 37 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-17 02:08:06,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:08:06,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221672943] [2023-02-17 02:08:06,237 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:08:06,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975877816] [2023-02-17 02:08:06,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975877816] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:08:06,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:08:06,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-17 02:08:06,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439142344] [2023-02-17 02:08:06,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:08:06,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 02:08:06,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:08:06,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 02:08:06,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-02-17 02:08:06,240 INFO L87 Difference]: Start difference. First operand 101 states and 125 transitions. Second operand has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2023-02-17 02:08:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:08:06,539 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2023-02-17 02:08:06,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 02:08:06,539 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) Word has length 72 [2023-02-17 02:08:06,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:08:06,540 INFO L225 Difference]: With dead ends: 117 [2023-02-17 02:08:06,540 INFO L226 Difference]: Without dead ends: 86 [2023-02-17 02:08:06,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2023-02-17 02:08:06,541 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:08:06,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 92 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:08:06,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-17 02:08:06,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-02-17 02:08:06,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 21 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-17 02:08:06,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2023-02-17 02:08:06,559 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 72 [2023-02-17 02:08:06,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:08:06,559 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2023-02-17 02:08:06,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2023-02-17 02:08:06,559 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2023-02-17 02:08:06,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-17 02:08:06,560 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:08:06,561 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-17 02:08:06,569 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-17 02:08:06,767 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-17 02:08:06,767 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:08:06,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:08:06,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1412721000, now seen corresponding path program 1 times [2023-02-17 02:08:06,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:08:06,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285052524] [2023-02-17 02:08:06,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:06,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:08:06,782 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:08:06,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2014911671] [2023-02-17 02:08:06,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:06,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:08:06,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:08:06,784 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-17 02:08:06,786 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-17 02:08:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:08:06,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 02:08:06,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:08:06,887 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-17 02:08:06,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:08:06,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:08:06,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285052524] [2023-02-17 02:08:06,888 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:08:06,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014911671] [2023-02-17 02:08:06,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014911671] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:08:06,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:08:06,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 02:08:06,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048072721] [2023-02-17 02:08:06,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:08:06,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:08:06,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:08:06,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:08:06,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:08:06,891 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-02-17 02:08:07,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:08:07,058 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2023-02-17 02:08:07,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:08:07,059 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-17 02:08:07,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:08:07,060 INFO L225 Difference]: With dead ends: 116 [2023-02-17 02:08:07,060 INFO L226 Difference]: Without dead ends: 86 [2023-02-17 02:08:07,060 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-17 02:08:07,061 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:08:07,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 95 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:08:07,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-17 02:08:07,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2023-02-17 02:08:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-17 02:08:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2023-02-17 02:08:07,084 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 86 [2023-02-17 02:08:07,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:08:07,084 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2023-02-17 02:08:07,084 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-17 02:08:07,085 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2023-02-17 02:08:07,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-17 02:08:07,086 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:08:07,086 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-17 02:08:07,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 02:08:07,296 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-17 02:08:07,297 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:08:07,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:08:07,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1193302554, now seen corresponding path program 2 times [2023-02-17 02:08:07,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:08:07,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730285062] [2023-02-17 02:08:07,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:07,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:08:07,305 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:08:07,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [641524022] [2023-02-17 02:08:07,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:08:07,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:08:07,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:08:07,307 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-17 02:08:07,329 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-17 02:08:07,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:08:07,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:08:07,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-17 02:08:07,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:08:07,457 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-17 02:08:07,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:08:11,405 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-17 02:08:11,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:08:11,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730285062] [2023-02-17 02:08:11,405 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:08:11,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641524022] [2023-02-17 02:08:11,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641524022] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:08:11,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:08:11,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2023-02-17 02:08:11,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308572125] [2023-02-17 02:08:11,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:08:11,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-17 02:08:11,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:08:11,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-17 02:08:11,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2023-02-17 02:08:11,408 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 11 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2023-02-17 02:08:17,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:08:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:08:17,881 INFO L93 Difference]: Finished difference Result 154 states and 193 transitions. [2023-02-17 02:08:17,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-17 02:08:17,881 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-17 02:08:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:08:17,883 INFO L225 Difference]: With dead ends: 154 [2023-02-17 02:08:17,883 INFO L226 Difference]: Without dead ends: 131 [2023-02-17 02:08:17,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2023-02-17 02:08:17,884 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 82 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-02-17 02:08:17,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 168 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2023-02-17 02:08:17,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-17 02:08:17,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2023-02-17 02:08:17,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 80 states have (on average 1.1375) internal successors, (91), 86 states have internal predecessors, (91), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (34), 29 states have call predecessors, (34), 34 states have call successors, (34) [2023-02-17 02:08:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 160 transitions. [2023-02-17 02:08:17,976 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 160 transitions. Word has length 86 [2023-02-17 02:08:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:08:17,977 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 160 transitions. [2023-02-17 02:08:17,977 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-17 02:08:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 160 transitions. [2023-02-17 02:08:17,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-02-17 02:08:17,978 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:08:17,978 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-17 02:08:17,991 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-17 02:08:18,191 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-17 02:08:18,192 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:08:18,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:08:18,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1474759586, now seen corresponding path program 2 times [2023-02-17 02:08:18,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:08:18,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882437458] [2023-02-17 02:08:18,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:18,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:08:18,204 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:08:18,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843335467] [2023-02-17 02:08:18,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:08:18,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:08:18,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:08:18,206 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-17 02:08:18,224 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-17 02:08:18,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:08:18,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:08:18,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-17 02:08:18,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:08:18,407 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 32 proven. 68 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-02-17 02:08:18,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:08:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 32 proven. 68 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-02-17 02:08:19,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:08:19,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882437458] [2023-02-17 02:08:19,802 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:08:19,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843335467] [2023-02-17 02:08:19,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843335467] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:08:19,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:08:19,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2023-02-17 02:08:19,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841466419] [2023-02-17 02:08:19,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:08:19,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-17 02:08:19,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:08:19,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-17 02:08:19,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2023-02-17 02:08:19,806 INFO L87 Difference]: Start difference. First operand 129 states and 160 transitions. Second operand has 27 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 15 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 13 states have call predecessors, (30), 13 states have call successors, (30) [2023-02-17 02:08:25,482 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-17 02:08:29,115 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-17 02:08:29,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:08:29,413 INFO L93 Difference]: Finished difference Result 188 states and 240 transitions. [2023-02-17 02:08:29,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-17 02:08:29,413 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 15 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 13 states have call predecessors, (30), 13 states have call successors, (30) Word has length 97 [2023-02-17 02:08:29,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:08:29,414 INFO L225 Difference]: With dead ends: 188 [2023-02-17 02:08:29,414 INFO L226 Difference]: Without dead ends: 120 [2023-02-17 02:08:29,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2023-02-17 02:08:29,416 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 61 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 126 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-02-17 02:08:29,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 164 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 830 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2023-02-17 02:08:29,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-17 02:08:29,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2023-02-17 02:08:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 68 states have internal predecessors, (70), 24 states have call successors, (24), 13 states have call predecessors, (24), 13 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-17 02:08:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2023-02-17 02:08:29,458 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 97 [2023-02-17 02:08:29,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:08:29,459 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2023-02-17 02:08:29,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 15 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 13 states have call predecessors, (30), 13 states have call successors, (30) [2023-02-17 02:08:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2023-02-17 02:08:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-02-17 02:08:29,460 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:08:29,460 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:08:29,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-17 02:08:29,661 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-17 02:08:29,662 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:08:29,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:08:29,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1779279917, now seen corresponding path program 1 times [2023-02-17 02:08:29,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:08:29,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956193691] [2023-02-17 02:08:29,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:29,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:08:29,669 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:08:29,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [248946141] [2023-02-17 02:08:29,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:29,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:08:29,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:08:29,671 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-17 02:08:29,674 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-17 02:08:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:08:29,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 02:08:29,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:08:29,772 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 66 proven. 13 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-02-17 02:08:29,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:08:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 66 proven. 13 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-02-17 02:08:29,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:08:29,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956193691] [2023-02-17 02:08:29,803 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:08:29,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248946141] [2023-02-17 02:08:29,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248946141] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:08:29,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:08:29,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-02-17 02:08:29,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406538397] [2023-02-17 02:08:29,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:08:29,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:08:29,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:08:29,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:08:29,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:08:29,807 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2023-02-17 02:08:29,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:08:29,923 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2023-02-17 02:08:29,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:08:29,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 114 [2023-02-17 02:08:29,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:08:29,924 INFO L225 Difference]: With dead ends: 111 [2023-02-17 02:08:29,924 INFO L226 Difference]: Without dead ends: 104 [2023-02-17 02:08:29,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 214 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:08:29,925 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:08:29,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:08:29,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-17 02:08:29,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2023-02-17 02:08:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 68 states have internal predecessors, (70), 23 states have call successors, (23), 13 states have call predecessors, (23), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-17 02:08:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2023-02-17 02:08:29,983 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 114 [2023-02-17 02:08:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:08:29,984 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2023-02-17 02:08:29,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2023-02-17 02:08:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2023-02-17 02:08:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-02-17 02:08:29,985 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:08:29,985 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-17 02:08:29,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-17 02:08:30,192 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-17 02:08:30,192 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:08:30,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:08:30,193 INFO L85 PathProgramCache]: Analyzing trace with hash 289773103, now seen corresponding path program 2 times [2023-02-17 02:08:30,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:08:30,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533511654] [2023-02-17 02:08:30,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:08:30,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:08:30,202 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:08:30,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1301671064] [2023-02-17 02:08:30,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:08:30,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:08:30,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:08:30,204 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-17 02:08:30,213 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-17 02:08:30,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:08:30,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:08:30,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 55 conjunts are in the unsatisfiable core [2023-02-17 02:08:30,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:08:30,449 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-17 02:08:30,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:08:43,244 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-17 02:08:43,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:08:43,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533511654] [2023-02-17 02:08:43,244 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:08:43,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301671064] [2023-02-17 02:08:43,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301671064] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:08:43,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:08:43,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2023-02-17 02:08:43,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293085047] [2023-02-17 02:08:43,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:08:43,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-17 02:08:43,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:08:43,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-17 02:08:43,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=641, Unknown=2, NotChecked=0, Total=812 [2023-02-17 02:08:43,247 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 27 states have internal predecessors, (54), 15 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 13 states have call predecessors, (36), 13 states have call successors, (36) [2023-02-17 02:08:49,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:08:52,943 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-17 02:08:54,960 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (div |c_ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse44 (- |c_ULTIMATE.start_main_~d~0#1|)) (.cse61 (+ .cse13 1))) (let ((.cse7 (= (mod |c_ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse56 (< |c_ULTIMATE.start_main_~p~0#1| 0)) (.cse55 (< |c_ULTIMATE.start_main_~d~0#1| 0)) (.cse10 (= (mod |c_ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse14 (div |c_ULTIMATE.start_main_~p~0#1| 2)) (.cse24 (= (mod .cse13 2) 0)) (.cse58 (- (div |c_ULTIMATE.start_main_~d~0#1| 4))) (.cse57 (< .cse13 0)) (.cse30 (= (mod .cse61 2) 0)) (.cse60 (< .cse61 0)) (.cse59 (- (div .cse61 2))) (.cse0 (+ |c_ULTIMATE.start_main_~r~0#1| .cse44))) (let ((.cse27 (>= .cse0 .cse61)) (.cse32 (+ .cse0 (+ (- 1) .cse59))) (.cse31 (not .cse60)) (.cse28 (and (not .cse30) .cse60)) (.cse29 (+ .cse0 .cse59)) (.cse16 (>= .cse0 .cse13)) (.cse17 (not .cse57)) (.cse18 (+ .cse0 (+ (- 1) .cse58))) (.cse26 (+ .cse58 .cse0)) (.cse25 (and (not .cse24) .cse57)) (.cse1 (+ |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~q~0#1|)) (.cse15 (+ .cse14 1)) (.cse9 (and .cse55 (not .cse10))) (.cse2 (and (not .cse7) .cse56)) (.cse5 (not .cse56)) (.cse11 (not .cse55)) (.cse45 (* |c_ULTIMATE.start_main_~p~0#1| 2)) (.cse43 (* 2 |c_ULTIMATE.start_main_~d~0#1|))) (and (= (+ .cse0 (* |c_ULTIMATE.start_main_~B~0#1| .cse1)) |c_ULTIMATE.start_main_~A~0#1|) (or (>= |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~d~0#1|) (let ((.cse6 (* (+ .cse15 |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~B~0#1|)) (.cse4 (* (+ .cse14 |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~B~0#1|)) (.cse8 (- .cse13))) (and (or (let ((.cse3 (+ |c_ULTIMATE.start_main_~r~0#1| .cse8))) (and (or .cse2 (= (+ .cse3 .cse4) |c_ULTIMATE.start_main_~A~0#1|)) (or .cse5 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse3 .cse6)) .cse7))) .cse9) (or .cse10 .cse11 (let ((.cse12 (+ |c_ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse8)))) (and (or .cse5 (= (+ .cse12 .cse6) |c_ULTIMATE.start_main_~A~0#1|) .cse7) (or .cse2 (= (+ .cse12 .cse4) |c_ULTIMATE.start_main_~A~0#1|)))))))) (or (let ((.cse34 (< .cse14 0)) (.cse22 (= (mod .cse14 2) 0)) (.cse33 (div |c_ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse19 (* (+ .cse33 .cse1) |c_ULTIMATE.start_main_~B~0#1|)) (.cse20 (and .cse34 (not .cse22))) (.cse23 (not .cse34)) (.cse21 (* (+ (+ .cse33 1) .cse1) |c_ULTIMATE.start_main_~B~0#1|))) (and (or .cse16 (and (or .cse17 (and (or (= (+ .cse18 .cse19) |c_ULTIMATE.start_main_~A~0#1|) .cse20) (or (= (+ .cse21 .cse18) |c_ULTIMATE.start_main_~A~0#1|) .cse22 .cse23)) .cse24) (or .cse25 (and (or .cse22 .cse23 (= (+ .cse21 .cse26) |c_ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse19 .cse26) |c_ULTIMATE.start_main_~A~0#1|) .cse20)))) .cse9) (or .cse27 .cse10 .cse11 (and (or .cse28 (and (or (= (+ .cse29 .cse19) |c_ULTIMATE.start_main_~A~0#1|) .cse20) (or .cse22 (= (+ .cse29 .cse21) |c_ULTIMATE.start_main_~A~0#1|) .cse23))) (or .cse30 .cse31 (and (or (= (+ .cse32 .cse19) |c_ULTIMATE.start_main_~A~0#1|) .cse20) (or .cse22 .cse23 (= (+ .cse21 .cse32) |c_ULTIMATE.start_main_~A~0#1|))))))))) .cse2) (or .cse5 (let ((.cse37 (= (mod .cse15 2) 0)) (.cse40 (< .cse15 0)) (.cse41 (div .cse15 2))) (let ((.cse36 (* (+ (+ .cse41 1) .cse1) |c_ULTIMATE.start_main_~B~0#1|)) (.cse35 (not .cse40)) (.cse38 (* (+ .cse41 .cse1) |c_ULTIMATE.start_main_~B~0#1|)) (.cse39 (and (not .cse37) .cse40))) (and (or .cse27 (and (or .cse30 (and (or .cse35 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse32 .cse36)) .cse37) (or (= (+ .cse32 .cse38) |c_ULTIMATE.start_main_~A~0#1|) .cse39)) .cse31) (or .cse28 (and (or (= (+ .cse29 .cse38) |c_ULTIMATE.start_main_~A~0#1|) .cse39) (or (= (+ .cse29 .cse36) |c_ULTIMATE.start_main_~A~0#1|) .cse35 .cse37)))) .cse10 .cse11) (or .cse16 .cse9 (and (or .cse17 (and (or (= (+ .cse18 .cse38) |c_ULTIMATE.start_main_~A~0#1|) .cse39) (or (= (+ .cse18 .cse36) |c_ULTIMATE.start_main_~A~0#1|) .cse35 .cse37)) .cse24) (or (and (or (= (+ .cse36 .cse26) |c_ULTIMATE.start_main_~A~0#1|) .cse35 .cse37) (or (= (+ .cse38 .cse26) |c_ULTIMATE.start_main_~A~0#1|) .cse39)) .cse25)))))) .cse7) (let ((.cse46 (* 2 .cse43))) (let ((.cse42 (+ |c_ULTIMATE.start_main_~r~0#1| (- .cse46)))) (or (>= .cse42 .cse43) (= |c_ULTIMATE.start_main_~A~0#1| (+ (+ .cse42 .cse44) (* |c_ULTIMATE.start_main_~B~0#1| (+ (+ (* 2 .cse45) |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~p~0#1|)))) (not (>= |c_ULTIMATE.start_main_~r~0#1| .cse46))))) (let ((.cse47 (+ (- .cse43) |c_ULTIMATE.start_main_~r~0#1|))) (or (not (>= |c_ULTIMATE.start_main_~r~0#1| .cse43)) (>= .cse47 |c_ULTIMATE.start_main_~d~0#1|) (let ((.cse54 (+ .cse45 |c_ULTIMATE.start_main_~q~0#1|)) (.cse53 (div (* |c_ULTIMATE.start_main_~p~0#1| 4) 8))) (let ((.cse50 (* (+ .cse54 .cse53) |c_ULTIMATE.start_main_~B~0#1|)) (.cse49 (* (+ (+ .cse53 1) .cse54) |c_ULTIMATE.start_main_~B~0#1|)) (.cse51 (- (div (* |c_ULTIMATE.start_main_~d~0#1| 4) 8)))) (and (or .cse9 (let ((.cse48 (+ .cse51 .cse47))) (and (or .cse5 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse49)) .cse7) (or .cse2 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse50)))))) (or .cse10 (let ((.cse52 (+ (+ (- 1) .cse51) .cse47))) (and (or .cse2 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse50 .cse52))) (or (= (+ .cse49 .cse52) |c_ULTIMATE.start_main_~A~0#1|) .cse5 .cse7))) .cse11)))))) (= |c_ULTIMATE.start_main_~A~0#1| (+ (* |c_ULTIMATE.start_main_~B~0#1| |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~r~0#1|))))))) is different from false [2023-02-17 02:09:05,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:09:12,696 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-17 02:09:15,394 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-17 02:09:17,528 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-17 02:09:22,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:09:24,217 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-17 02:09:29,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:09:32,235 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-17 02:09:33,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:09:41,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:09:41,582 INFO L93 Difference]: Finished difference Result 214 states and 270 transitions. [2023-02-17 02:09:41,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-17 02:09:41,583 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 27 states have internal predecessors, (54), 15 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 13 states have call predecessors, (36), 13 states have call successors, (36) Word has length 116 [2023-02-17 02:09:41,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:09:41,584 INFO L225 Difference]: With dead ends: 214 [2023-02-17 02:09:41,584 INFO L226 Difference]: Without dead ends: 191 [2023-02-17 02:09:41,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=443, Invalid=1449, Unknown=4, NotChecked=84, Total=1980 [2023-02-17 02:09:41,590 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 96 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 230 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 37.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:09:41,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 196 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1021 Invalid, 6 Unknown, 2 Unchecked, 37.3s Time] [2023-02-17 02:09:41,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-17 02:09:41,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 181. [2023-02-17 02:09:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 113 states have (on average 1.1327433628318584) internal successors, (128), 119 states have internal predecessors, (128), 48 states have call successors, (48), 19 states have call predecessors, (48), 19 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2023-02-17 02:09:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 223 transitions. [2023-02-17 02:09:41,870 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 223 transitions. Word has length 116 [2023-02-17 02:09:41,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:09:41,870 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 223 transitions. [2023-02-17 02:09:41,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 27 states have internal predecessors, (54), 15 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 13 states have call predecessors, (36), 13 states have call successors, (36) [2023-02-17 02:09:41,871 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 223 transitions. [2023-02-17 02:09:41,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-17 02:09:41,872 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:09:41,872 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:09:41,878 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-17 02:09:42,078 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-17 02:09:42,079 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:09:42,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:09:42,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2143709678, now seen corresponding path program 3 times [2023-02-17 02:09:42,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:09:42,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802533142] [2023-02-17 02:09:42,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:09:42,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:09:42,089 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:09:42,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2113096977] [2023-02-17 02:09:42,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 02:09:42,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:09:42,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:09:42,091 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-17 02:09:42,093 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-17 02:09:42,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-17 02:09:42,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:09:42,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-17 02:09:42,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:09:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 118 proven. 52 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2023-02-17 02:09:42,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:09:42,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:09:42,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802533142] [2023-02-17 02:09:42,534 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:09:42,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113096977] [2023-02-17 02:09:42,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113096977] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:09:42,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:09:42,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-02-17 02:09:42,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644356681] [2023-02-17 02:09:42,534 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 02:09:42,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 02:09:42,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:09:42,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 02:09:42,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-02-17 02:09:42,535 INFO L87 Difference]: Start difference. First operand 181 states and 223 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-17 02:09:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:09:42,968 INFO L93 Difference]: Finished difference Result 203 states and 240 transitions. [2023-02-17 02:09:42,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:09:42,969 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 121 [2023-02-17 02:09:42,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:09:42,971 INFO L225 Difference]: With dead ends: 203 [2023-02-17 02:09:42,971 INFO L226 Difference]: Without dead ends: 201 [2023-02-17 02:09:42,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-02-17 02:09:42,972 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:09:42,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 61 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:09:42,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-02-17 02:09:43,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2023-02-17 02:09:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 128 states have (on average 1.1171875) internal successors, (143), 134 states have internal predecessors, (143), 48 states have call successors, (48), 24 states have call predecessors, (48), 24 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2023-02-17 02:09:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 238 transitions. [2023-02-17 02:09:43,239 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 238 transitions. Word has length 121 [2023-02-17 02:09:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:09:43,239 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 238 transitions. [2023-02-17 02:09:43,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-17 02:09:43,240 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 238 transitions. [2023-02-17 02:09:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-02-17 02:09:43,241 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:09:43,241 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-17 02:09:43,247 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-17 02:09:43,447 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-17 02:09:43,447 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:09:43,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:09:43,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1262824565, now seen corresponding path program 2 times [2023-02-17 02:09:43,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:09:43,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795205571] [2023-02-17 02:09:43,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:09:43,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:09:43,454 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:09:43,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [975556453] [2023-02-17 02:09:43,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:09:43,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:09:43,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:09:43,457 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-17 02:09:43,460 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-17 02:09:43,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:09:43,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:09:43,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-17 02:09:43,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:09:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 42 proven. 112 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-02-17 02:09:43,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:09:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 42 proven. 112 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-02-17 02:09:46,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:09:46,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795205571] [2023-02-17 02:09:46,101 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:09:46,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975556453] [2023-02-17 02:09:46,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975556453] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:09:46,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:09:46,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2023-02-17 02:09:46,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930497617] [2023-02-17 02:09:46,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:09:46,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-17 02:09:46,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:09:46,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-17 02:09:46,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=737, Unknown=0, NotChecked=0, Total=930 [2023-02-17 02:09:46,104 INFO L87 Difference]: Start difference. First operand 201 states and 238 transitions. Second operand has 31 states, 29 states have (on average 2.0) internal successors, (58), 29 states have internal predecessors, (58), 17 states have call successors, (42), 3 states have call predecessors, (42), 2 states have return successors, (40), 15 states have call predecessors, (40), 15 states have call successors, (40) [2023-02-17 02:09:47,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:09:47,863 INFO L93 Difference]: Finished difference Result 236 states and 268 transitions. [2023-02-17 02:09:47,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-17 02:09:47,864 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.0) internal successors, (58), 29 states have internal predecessors, (58), 17 states have call successors, (42), 3 states have call predecessors, (42), 2 states have return successors, (40), 15 states have call predecessors, (40), 15 states have call successors, (40) Word has length 127 [2023-02-17 02:09:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:09:47,864 INFO L225 Difference]: With dead ends: 236 [2023-02-17 02:09:47,864 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 02:09:47,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 221 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=366, Invalid=1440, Unknown=0, NotChecked=0, Total=1806 [2023-02-17 02:09:47,866 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 33 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-17 02:09:47,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 138 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-17 02:09:47,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 02:09:47,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 02:09:47,867 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-17 02:09:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 02:09:47,867 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2023-02-17 02:09:47,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:09:47,868 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 02:09:47,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.0) internal successors, (58), 29 states have internal predecessors, (58), 17 states have call successors, (42), 3 states have call predecessors, (42), 2 states have return successors, (40), 15 states have call predecessors, (40), 15 states have call successors, (40) [2023-02-17 02:09:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 02:09:47,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 02:09:47,870 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 02:09:47,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-17 02:09:48,076 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-17 02:09:48,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 02:09:48,149 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2023-02-17 02:09:48,154 INFO L895 garLoopResultBuilder]: At program point L52-2(lines 44 56) the Hoare annotation is: (let ((.cse174 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse219 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse146 (+ .cse174 1))) (let ((.cse144 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse147 (div .cse146 2)) (.cse239 (- .cse174)) (.cse87 (+ .cse219 1)) (.cse3 (- |ULTIMATE.start_main_~r~0#1|)) (.cse8 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (let ((.cse4 (- |ULTIMATE.start_main_~d~0#1|)) (.cse209 (+ .cse8 |ULTIMATE.start_main_~A~0#1|)) (.cse202 (+ |ULTIMATE.start_main_~A~0#1| .cse3)) (.cse7 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse32 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse82 (+ |ULTIMATE.start_main_~q~0#1| .cse87)) (.cse241 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse18 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse110 (+ |ULTIMATE.start_main_~q~0#1| .cse219)) (.cse238 (+ (- 1) .cse239)) (.cse240 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse129 (- .cse147)) (.cse40 (div .cse87 2)) (.cse131 (- .cse144)) (.cse95 (div |ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse96 (+ .cse95 1)) (.cse132 (+ (- 1) .cse131)) (.cse232 (< .cse219 0)) (.cse94 (= (mod .cse219 2) 0)) (.cse37 (= (mod .cse174 2) 0)) (.cse231 (< .cse174 0)) (.cse41 (+ .cse40 1)) (.cse233 (< .cse87 0)) (.cse24 (= (mod .cse87 2) 0)) (.cse130 (+ (- 1) .cse129)) (.cse234 (< .cse146 0)) (.cse27 (= (mod .cse146 2) 0)) (.cse230 (= .cse219 1)) (.cse225 (= .cse87 1)) (.cse20 (not .cse240)) (.cse133 (+ |ULTIMATE.start_main_~r~0#1| .cse238)) (.cse235 (* |ULTIMATE.start_main_~B~0#1| .cse110)) (.cse89 (and .cse241 (not .cse18))) (.cse236 (* .cse82 |ULTIMATE.start_main_~B~0#1|)) (.cse140 (+ |ULTIMATE.start_main_~r~0#1| .cse239)) (.cse19 (not .cse241)) (.cse39 (and (not .cse32) .cse240)) (.cse213 (not .cse7)) (.cse162 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse125 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse197 (div .cse202 2)) (.cse208 (< .cse209 0)) (.cse237 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse128 (+ |ULTIMATE.start_main_~r~0#1| .cse4)) (.cse45 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse195 (* 2 1))) (let ((.cse15 (* 2 .cse195)) (.cse179 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse10 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse42 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse115 (<= |ULTIMATE.start_main_~A~0#1| 5)) (.cse150 (* 2 .cse45)) (.cse31 (>= |ULTIMATE.start_main_~r~0#1| .cse146)) (.cse33 (>= |ULTIMATE.start_main_~r~0#1| .cse174)) (.cse173 (+ .cse128 .cse239)) (.cse176 (+ .cse128 .cse238)) (.cse198 (or (not .cse208) .cse237)) (.cse203 (+ .cse197 1)) (.cse207 (not .cse237)) (.cse175 (+ .cse125 1)) (.cse214 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse215 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse181 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse211 (* |ULTIMATE.start_main_~B~0#1| 4)) (.cse155 (or .cse213 .cse162)) (.cse46 (or (and (or (= (+ .cse235 .cse140) |ULTIMATE.start_main_~A~0#1|) .cse89) (or (= (+ .cse236 .cse140) |ULTIMATE.start_main_~A~0#1|) .cse18 .cse19)) .cse39)) (.cse154 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse47 (or .cse20 (and (or .cse89 (= (+ .cse133 .cse235) |ULTIMATE.start_main_~A~0#1|)) (or .cse18 .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse236 .cse133)))) .cse32)) (.cse149 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse97 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse151 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse12 (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 (* |ULTIMATE.start_main_~B~0#1| .cse125)))) (.cse14 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse172 (and (or (not .cse230) .cse89) (or .cse18 .cse19 (not .cse225)))) (.cse143 (+ .cse144 1)) (.cse145 (+ .cse147 1)) (.cse169 (+ .cse133 .cse129)) (.cse29 (and .cse234 (not .cse27))) (.cse28 (not .cse234)) (.cse170 (+ .cse133 .cse130)) (.cse21 (and .cse233 (not .cse24))) (.cse227 (* (+ .cse82 .cse40) |ULTIMATE.start_main_~B~0#1|)) (.cse226 (* (+ .cse41 .cse82) |ULTIMATE.start_main_~B~0#1|)) (.cse26 (not .cse233)) (.cse34 (and (not .cse37) .cse231)) (.cse167 (+ .cse131 .cse140)) (.cse91 (and .cse232 (not .cse94))) (.cse229 (* (+ .cse95 .cse110) |ULTIMATE.start_main_~B~0#1|)) (.cse93 (not .cse232)) (.cse163 (+ .cse132 .cse140)) (.cse228 (* (+ .cse96 .cse110) |ULTIMATE.start_main_~B~0#1|)) (.cse38 (not .cse231))) (let ((.cse9 (or (and (or .cse225 .cse18 .cse19 (and (or .cse37 .cse38 (and (or .cse24 (= (+ .cse163 .cse226) |ULTIMATE.start_main_~A~0#1|) .cse26) (or .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse163))))) (or .cse34 (and (or .cse21 (= (+ .cse227 .cse167) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse226 .cse167)) .cse24 .cse26))))) (or (and (or .cse34 (and (or (= (+ .cse229 .cse167) |ULTIMATE.start_main_~A~0#1|) .cse91) (or (= (+ .cse167 .cse228) |ULTIMATE.start_main_~A~0#1|) .cse93 .cse94))) (or (and (or .cse91 (= (+ .cse229 .cse163) |ULTIMATE.start_main_~A~0#1|)) (or .cse93 .cse94 (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse228)))) .cse37 .cse38)) .cse89 .cse230)) .cse39)) (.cse16 (or .cse20 .cse32 (and (or .cse225 .cse18 .cse19 (and (or (and (or (= (+ .cse226 .cse170) |ULTIMATE.start_main_~A~0#1|) .cse24 .cse26) (or .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse170)))) .cse27 .cse28) (or .cse29 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse169 .cse226)) .cse24 .cse26) (or .cse21 (= (+ .cse169 .cse227) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse93 .cse94 (= (+ .cse169 .cse228) |ULTIMATE.start_main_~A~0#1|)) (or .cse91 (= |ULTIMATE.start_main_~A~0#1| (+ .cse169 .cse229)))) .cse29) (or .cse27 .cse28 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse170 .cse228)) .cse93 .cse94) (or (= (+ .cse229 .cse170) |ULTIMATE.start_main_~A~0#1|) .cse91)))) .cse89 .cse230)))) (.cse121 (>= .cse128 .cse174)) (.cse124 (>= .cse128 .cse146)) (.cse75 (>= .cse133 .cse145)) (.cse76 (>= .cse133 .cse147)) (.cse64 (>= .cse140 .cse144)) (.cse58 (>= .cse140 .cse143)) (.cse43 (= |ULTIMATE.start_main_~d~0#1| 1)) (.cse152 (or .cse172 (and (or (= .cse174 |ULTIMATE.start_main_~B~0#1|) .cse39) (or .cse20 (= |ULTIMATE.start_main_~B~0#1| .cse146) .cse32)))) (.cse153 (let ((.cse224 (or .cse172 (and (or .cse20 .cse32 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse146)) |ULTIMATE.start_main_~A~0#1|)) (or .cse39 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse174 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse46 .cse154 .cse47 .cse155 .cse224 .cse149 .cse97 .cse151 .cse12 .cse14) (and .cse46 .cse154 .cse47 .cse224 .cse149 .cse97 .cse151 .cse12 .cse162 .cse14)))) (.cse156 (<= 2 .cse174)) (.cse182 (= (+ 4 0) |ULTIMATE.start_main_~q~0#1|)) (.cse185 (= .cse209 .cse211)) (.cse88 (>= |ULTIMATE.start_main_~p~0#1| 1)) (.cse190 (or .cse213 (= (+ .cse128 (* |ULTIMATE.start_main_~d~0#1| .cse125)) |ULTIMATE.start_main_~A~0#1|) .cse181)) (.cse193 (or (let ((.cse221 (div .cse215 4))) (let ((.cse220 (- .cse221))) (and (or .cse39 (= (+ (+ .cse128 .cse220) (* .cse221 .cse175)) |ULTIMATE.start_main_~A~0#1|) (not (>= .cse128 .cse221))) (let ((.cse222 (+ .cse221 1))) (or .cse20 (not (>= .cse128 .cse222)) (= (+ (+ (+ (- 1) .cse220) .cse128) (* .cse222 .cse175)) |ULTIMATE.start_main_~A~0#1|) .cse32))))) (let ((.cse223 (div .cse214 4))) (and (or (not (= 1 (+ .cse223 1))) .cse18 .cse19) (or (not (= .cse223 1)) .cse89))) (>= |ULTIMATE.start_main_~r~0#1| .cse215))) (.cse184 (or (and (= |ULTIMATE.start_main_~d~0#1| .cse197) .cse198) (and (= |ULTIMATE.start_main_~d~0#1| .cse203) .cse207 .cse208))) (.cse191 (or .cse154 (and .cse154 (<= 1 |ULTIMATE.start_main_~d~0#1|)))) (.cse6 (or .cse7 (let ((.cse218 (* (+ .cse125 .cse87) |ULTIMATE.start_main_~B~0#1|)) (.cse217 (* (+ .cse125 .cse219) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse217 .cse173) |ULTIMATE.start_main_~A~0#1|) .cse89) (or .cse18 .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse173 .cse218)))) .cse39) (or .cse20 (and (or .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse218)) .cse19) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse217)) .cse89)) .cse32))))) (.cse11 (or .cse7 (and .cse46 .cse47))) (.cse158 (or .cse172 (let ((.cse216 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse20 (not .cse31) .cse32 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 (* .cse216 .cse146)))) (or (not .cse33) .cse39 (= (+ (* .cse174 .cse216) .cse140) |ULTIMATE.start_main_~A~0#1|)))))) (.cse114 (>= |ULTIMATE.start_main_~A~0#1| .cse150)) (.cse13 (or (= .cse214 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ (+ (- .cse215) |ULTIMATE.start_main_~r~0#1|) .cse4) (* |ULTIMATE.start_main_~B~0#1| (+ (+ |ULTIMATE.start_main_~q~0#1| .cse214) |ULTIMATE.start_main_~p~0#1|)))))) (.cse116 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse42 .cse115) (and (or (not .cse42) (not .cse115)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse180 (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|)) (.cse178 (= .cse10 |ULTIMATE.start_main_~A~0#1|)) (.cse194 (= |ULTIMATE.start_main_~d~0#1| .cse45)) (.cse186 (= 2 |ULTIMATE.start_main_~p~0#1|)) (.cse212 (<= 2 |ULTIMATE.start_main_~d~0#1|)) (.cse17 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|)) (.cse161 (or .cse213 .cse179)) (.cse192 (= 2 |ULTIMATE.start_main_~d~0#1|)) (.cse210 (>= .cse10 .cse15)) (.cse196 (= |ULTIMATE.start_main_~p~0#1| .cse195))) (or (let ((.cse5 (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) .cse10)))) (and (let ((.cse2 (< .cse5 0)) (.cse0 (div (+ |ULTIMATE.start_main_~A~0#1| .cse3 .cse4) 2)) (.cse1 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0))) (or (and (= .cse0 |ULTIMATE.start_main_~d~0#1|) (or .cse1 (not .cse2))) (and .cse2 (= |ULTIMATE.start_main_~d~0#1| (+ .cse0 1)) (not .cse1)))) .cse6 .cse7 (= |ULTIMATE.start_main_~B~0#1| (+ (* (- 2) |ULTIMATE.start_main_~B~0#1|) .cse8 |ULTIMATE.start_main_~A~0#1|)) (= 2 .cse5) .cse9 (>= .cse10 |ULTIMATE.start_main_~d~0#1|) .cse11 .cse12 (= (+ (- 2) |ULTIMATE.start_main_~q~0#1|) 1) .cse13 .cse14 (not (>= (+ .cse10 .cse5) .cse15)) .cse16 (= (+ (* (- 1) 2) .cse17) 0))) (let ((.cse79 (= (mod .cse147 2) 0)) (.cse135 (< .cse147 0)) (.cse134 (- (div .cse146 4))) (.cse72 (= (mod .cse145 2) 0)) (.cse137 (< .cse145 0)) (.cse136 (- (div .cse145 2))) (.cse59 (= (mod .cse144 2) 0)) (.cse138 (< .cse144 0)) (.cse139 (- (div |ULTIMATE.start_main_~d~0#1| 8))) (.cse57 (= (mod .cse143 2) 0)) (.cse142 (- (div .cse143 2))) (.cse141 (< .cse143 0))) (let ((.cse44 (+ (* |ULTIMATE.start_main_~B~0#1| (- 4)) .cse8 |ULTIMATE.start_main_~A~0#1|)) (.cse30 (+ |ULTIMATE.start_main_~r~0#1| .cse129)) (.cse22 (+ .cse130 |ULTIMATE.start_main_~r~0#1|)) (.cse36 (+ .cse132 |ULTIMATE.start_main_~r~0#1|)) (.cse35 (+ .cse131 |ULTIMATE.start_main_~r~0#1|)) (.cse56 (not .cse141)) (.cse55 (+ (+ (- 1) .cse142) .cse140)) (.cse48 (+ .cse140 .cse142)) (.cse54 (and .cse141 (not .cse57))) (.cse63 (+ .cse140 .cse139)) (.cse62 (and (not .cse59) .cse138)) (.cse61 (+ (+ (- 1) .cse139) .cse140)) (.cse60 (not .cse138)) (.cse74 (+ .cse133 .cse136)) (.cse73 (and (not .cse72) .cse137)) (.cse71 (not .cse137)) (.cse70 (+ .cse133 (+ (- 1) .cse136))) (.cse80 (+ .cse134 .cse133)) (.cse81 (and (not .cse79) .cse135)) (.cse77 (not .cse135)) (.cse78 (+ .cse133 (+ (- 1) .cse134))) (.cse118 (+ .cse128 .cse132)) (.cse120 (+ .cse131 .cse128)) (.cse122 (+ .cse130 .cse128)) (.cse123 (+ .cse128 .cse129)) (.cse98 (+ |ULTIMATE.start_main_~A~0#1| (- 4)))) (and (or .cse18 .cse19 (let ((.cse25 (* |ULTIMATE.start_main_~B~0#1| (+ .cse41 |ULTIMATE.start_main_~q~0#1|))) (.cse23 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse40)))) (and (or .cse20 (and (or (and (or .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ .cse22 .cse23))) (or .cse24 (= (+ .cse25 .cse22) |ULTIMATE.start_main_~A~0#1|) .cse26)) .cse27 .cse28) (or .cse29 (and (or .cse21 (= (+ .cse30 .cse23) |ULTIMATE.start_main_~A~0#1|)) (or .cse24 (= |ULTIMATE.start_main_~A~0#1| (+ .cse25 .cse30)) .cse26)))) .cse31 .cse32) (or .cse33 (and (or .cse34 (and (or .cse21 (= (+ .cse35 .cse23) |ULTIMATE.start_main_~A~0#1|)) (or .cse24 (= |ULTIMATE.start_main_~A~0#1| (+ .cse35 .cse25)) .cse26))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse36 .cse25)) .cse24 .cse26) (or .cse21 (= (+ .cse36 .cse23) |ULTIMATE.start_main_~A~0#1|))) .cse37 .cse38)) .cse39)))) .cse42 .cse43 (not (>= (+ .cse44 |ULTIMATE.start_main_~r~0#1|) .cse45)) .cse46 .cse47 .cse7 (or .cse18 .cse19 (let ((.cse67 (= (mod .cse41 2) 0)) (.cse84 (< .cse41 0)) (.cse83 (div .cse41 2)) (.cse51 (= (mod .cse40 2) 0)) (.cse86 (< .cse40 0)) (.cse85 (div .cse87 4))) (let ((.cse53 (* (+ (+ .cse85 1) .cse82) |ULTIMATE.start_main_~B~0#1|)) (.cse52 (not .cse86)) (.cse50 (and (not .cse51) .cse86)) (.cse49 (* (+ .cse82 .cse85) |ULTIMATE.start_main_~B~0#1|)) (.cse68 (* |ULTIMATE.start_main_~B~0#1| (+ (+ .cse83 1) .cse82))) (.cse69 (not .cse84)) (.cse65 (and (not .cse67) .cse84)) (.cse66 (* |ULTIMATE.start_main_~B~0#1| (+ .cse82 .cse83)))) (and (or (and (or .cse21 (and (or .cse37 .cse38 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse49)) .cse50) (or .cse51 .cse52 (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse53)))) .cse54) (or (and (or .cse51 (= (+ .cse55 .cse53) |ULTIMATE.start_main_~A~0#1|) .cse52) (or .cse50 (= (+ .cse49 .cse55) |ULTIMATE.start_main_~A~0#1|))) .cse56 .cse57)) .cse58) (or .cse34 (and (or .cse59 .cse60 (and (or .cse50 (= (+ .cse49 .cse61) |ULTIMATE.start_main_~A~0#1|)) (or .cse51 .cse52 (= (+ .cse53 .cse61) |ULTIMATE.start_main_~A~0#1|)))) (or .cse62 (and (or .cse51 .cse52 (= (+ .cse63 .cse53) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse63 .cse49) |ULTIMATE.start_main_~A~0#1|) .cse50)))) .cse64))) (or (and (or .cse37 (and (or .cse54 (and (or .cse65 (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse66))) (or .cse67 (= (+ .cse68 .cse48) |ULTIMATE.start_main_~A~0#1|) .cse69))) (or .cse56 .cse57 (and (or (= (+ .cse55 .cse66) |ULTIMATE.start_main_~A~0#1|) .cse65) (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse68 .cse55)) .cse69)))) .cse38 .cse58) (or .cse34 .cse64 (and (or .cse59 (and (or .cse67 .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse68 .cse61))) (or .cse65 (= (+ .cse66 .cse61) |ULTIMATE.start_main_~A~0#1|))) .cse60) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse63 .cse66)) .cse65) (or .cse67 .cse69 (= (+ .cse63 .cse68) |ULTIMATE.start_main_~A~0#1|))) .cse62)))) .cse24 .cse26)) .cse39) (or .cse20 (and (or (and (or (and (or (and (or .cse51 (= (+ .cse70 .cse53) |ULTIMATE.start_main_~A~0#1|) .cse52) (or .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse49)))) .cse71 .cse72) (or .cse73 (and (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse53)) .cse52) (or .cse50 (= (+ .cse74 .cse49) |ULTIMATE.start_main_~A~0#1|))))) .cse27 .cse28 .cse75) (or .cse29 .cse76 (and (or .cse77 (and (or (= (+ .cse78 .cse53) |ULTIMATE.start_main_~A~0#1|) .cse51 .cse52) (or .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse49)))) .cse79) (or (and (or .cse51 (= (+ .cse53 .cse80) |ULTIMATE.start_main_~A~0#1|) .cse52) (or .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse49 .cse80)))) .cse81)))) .cse21) (or .cse24 .cse26 (and (or (and (or .cse77 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse68 .cse78)) .cse67 .cse69) (or .cse65 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse66)))) .cse79) (or (and (or (= (+ .cse68 .cse80) |ULTIMATE.start_main_~A~0#1|) .cse67 .cse69) (or .cse65 (= |ULTIMATE.start_main_~A~0#1| (+ .cse66 .cse80)))) .cse81)) .cse29 .cse76) (or (and (or .cse71 (and (or .cse67 .cse69 (= (+ .cse70 .cse68) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse66)) .cse65)) .cse72) (or .cse73 (and (or .cse67 (= (+ .cse74 .cse68) |ULTIMATE.start_main_~A~0#1|) .cse69) (or .cse65 (= (+ .cse74 .cse66) |ULTIMATE.start_main_~A~0#1|))))) .cse27 .cse28 .cse75)))) .cse32))))) (= .cse44 |ULTIMATE.start_main_~B~0#1|) .cse88 (= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 1) (or .cse89 (let ((.cse92 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse96))) (.cse90 (* |ULTIMATE.start_main_~B~0#1| (+ .cse95 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse20 (and (or .cse29 (and (or (= (+ .cse90 .cse30) |ULTIMATE.start_main_~A~0#1|) .cse91) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse30 .cse92)) .cse93 .cse94))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse22 .cse92)) .cse93 .cse94) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse90 .cse22)) .cse91)) .cse27 .cse28)) .cse31 .cse32) (or .cse33 (and (or .cse37 .cse38 (and (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse36 .cse92)) .cse94) (or .cse91 (= |ULTIMATE.start_main_~A~0#1| (+ .cse36 .cse90))))) (or .cse34 (and (or (= (+ .cse35 .cse92) |ULTIMATE.start_main_~A~0#1|) .cse93 .cse94) (or (= (+ .cse35 .cse90) |ULTIMATE.start_main_~A~0#1|) .cse91)))) .cse39)))) .cse97 .cse12 (>= (+ .cse98 4) .cse15) (or (let ((.cse101 (= (mod .cse96 2) 0)) (.cse109 (< .cse96 0)) (.cse111 (div .cse96 2)) (.cse107 (= (mod .cse95 2) 0)) (.cse112 (< .cse95 0)) (.cse113 (div |ULTIMATE.start_main_~p~0#1| 8))) (let ((.cse104 (* |ULTIMATE.start_main_~B~0#1| (+ .cse110 .cse113))) (.cse105 (and (not .cse107) .cse112)) (.cse106 (* |ULTIMATE.start_main_~B~0#1| (+ (+ .cse113 1) .cse110))) (.cse108 (not .cse112)) (.cse103 (* |ULTIMATE.start_main_~B~0#1| (+ (+ 1 .cse111) .cse110))) (.cse102 (not .cse109)) (.cse99 (* (+ .cse110 .cse111) |ULTIMATE.start_main_~B~0#1|)) (.cse100 (and (not .cse101) .cse109))) (and (or .cse39 (and (or (and (or (and (or .cse54 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse99)) .cse100) (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse103))))) (or .cse56 .cse57 (and (or .cse100 (= (+ .cse99 .cse55) |ULTIMATE.start_main_~A~0#1|)) (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse103 .cse55)))))) .cse37 .cse38 .cse58) (or .cse34 .cse64 (and (or .cse59 (and (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse103 .cse61))) (or (= (+ .cse99 .cse61) |ULTIMATE.start_main_~A~0#1|) .cse100)) .cse60) (or (and (or .cse101 (= (+ .cse63 .cse103) |ULTIMATE.start_main_~A~0#1|) .cse102) (or .cse100 (= (+ .cse63 .cse99) |ULTIMATE.start_main_~A~0#1|))) .cse62)))) .cse93 .cse94) (or (and (or .cse37 (and (or .cse56 .cse57 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse55 .cse104)) .cse105) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse55 .cse106)) .cse107 .cse108))) (or (and (or .cse107 .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse106))) (or .cse105 (= (+ .cse48 .cse104) |ULTIMATE.start_main_~A~0#1|))) .cse54)) .cse38 .cse58) (or .cse34 (and (or (and (or .cse107 .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse63 .cse106))) (or (= (+ .cse63 .cse104) |ULTIMATE.start_main_~A~0#1|) .cse105)) .cse62) (or .cse59 (and (or (= (+ .cse61 .cse104) |ULTIMATE.start_main_~A~0#1|) .cse105) (or (= (+ .cse61 .cse106) |ULTIMATE.start_main_~A~0#1|) .cse107 .cse108)) .cse60)) .cse64)) .cse91))) (or .cse20 (and (or (and (or (and (or .cse73 (and (or .cse105 (= (+ .cse74 .cse104) |ULTIMATE.start_main_~A~0#1|)) (or .cse107 (= (+ .cse74 .cse106) |ULTIMATE.start_main_~A~0#1|) .cse108))) (or .cse71 (and (or .cse107 (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse106)) .cse108) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse104)) .cse105)) .cse72)) .cse27 .cse28 .cse75) (or (and (or .cse77 (and (or (= (+ .cse78 .cse104) |ULTIMATE.start_main_~A~0#1|) .cse105) (or .cse107 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse106)) .cse108)) .cse79) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse80)) .cse105) (or .cse107 (= (+ .cse106 .cse80) |ULTIMATE.start_main_~A~0#1|) .cse108)) .cse81)) .cse29 .cse76)) .cse91) (or (and (or (and (or (and (or (= (+ .cse74 .cse103) |ULTIMATE.start_main_~A~0#1|) .cse101 .cse102) (or .cse100 (= (+ .cse74 .cse99) |ULTIMATE.start_main_~A~0#1|))) .cse73) (or .cse71 .cse72 (and (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse103))) (or .cse100 (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse99)))))) .cse27 .cse28 .cse75) (or (and (or (and (or .cse100 (= (+ .cse99 .cse80) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse103 .cse80) |ULTIMATE.start_main_~A~0#1|) .cse101 .cse102)) .cse81) (or .cse77 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse103)) .cse101 .cse102) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse99)) .cse100)) .cse79)) .cse29 .cse76)) .cse93 .cse94)) .cse32)))) .cse89) (>= .cse98 |ULTIMATE.start_main_~d~0#1|) .cse114 .cse115 .cse116 (= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~p~0#1| 4)) .cse14 (or (let ((.cse119 (* (+ .cse95 .cse125) |ULTIMATE.start_main_~B~0#1|)) (.cse117 (* (+ .cse125 .cse96) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse39 (and (or (and (or .cse93 .cse94 (= (+ .cse117 .cse118) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse118 .cse119)) .cse91)) .cse37 .cse38) (or .cse34 (and (or .cse91 (= (+ .cse120 .cse119) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse117 .cse120) |ULTIMATE.start_main_~A~0#1|) .cse93 .cse94)))) .cse121) (or .cse20 (and (or (and (or (= (+ .cse122 .cse117) |ULTIMATE.start_main_~A~0#1|) .cse93 .cse94) (or (= (+ .cse122 .cse119) |ULTIMATE.start_main_~A~0#1|) .cse91)) .cse27 .cse28) (or (and (or (= (+ .cse119 .cse123) |ULTIMATE.start_main_~A~0#1|) .cse91) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse117 .cse123)) .cse93 .cse94)) .cse29)) .cse124 .cse32))) .cse89) (or .cse18 (let ((.cse126 (* (+ .cse41 .cse125) |ULTIMATE.start_main_~B~0#1|)) (.cse127 (* (+ .cse125 .cse40) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse39 .cse121 (and (or .cse37 (and (or .cse24 .cse26 (= |ULTIMATE.start_main_~A~0#1| (+ .cse118 .cse126))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse118 .cse127)) .cse21)) .cse38) (or .cse34 (and (or .cse24 (= |ULTIMATE.start_main_~A~0#1| (+ .cse120 .cse126)) .cse26) (or (= (+ .cse127 .cse120) |ULTIMATE.start_main_~A~0#1|) .cse21))))) (or .cse20 .cse124 (and (or (and (or .cse24 (= |ULTIMATE.start_main_~A~0#1| (+ .cse122 .cse126)) .cse26) (or .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ .cse122 .cse127)))) .cse27 .cse28) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse126 .cse123)) .cse24 .cse26) (or .cse21 (= (+ .cse127 .cse123) |ULTIMATE.start_main_~A~0#1|))) .cse29)) .cse32))) .cse19) (= (+ .cse98 .cse4) |ULTIMATE.start_main_~r~0#1|)))) (let ((.cse148 (* 2 .cse15))) (and .cse42 (<= 8 |ULTIMATE.start_main_~p~0#1|) (>= |ULTIMATE.start_main_~r~0#1| .cse15) (= .cse148 |ULTIMATE.start_main_~p~0#1|) .cse149 (>= |ULTIMATE.start_main_~r~0#1| .cse150) .cse97 .cse151 (= .cse148 |ULTIMATE.start_main_~d~0#1|) .cse115 .cse116 (= (* .cse150 2) |ULTIMATE.start_main_~d~0#1|) .cse14 (let ((.cse165 (not .cse58)) (.cse166 (not .cse64)) (.cse168 (not .cse76)) (.cse171 (not .cse75))) (let ((.cse157 (or (and (or (not (= .cse41 1)) .cse24 .cse26) (or .cse21 (not (= .cse40 1)))) .cse18 (let ((.cse177 (+ .cse82 1))) (and (or .cse39 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 (* .cse177 .cse143))) .cse37 .cse38 .cse165) (or .cse34 .cse166 (= (+ (* .cse177 .cse144) .cse167) |ULTIMATE.start_main_~A~0#1|)))) (or .cse20 (and (or .cse168 (= |ULTIMATE.start_main_~A~0#1| (+ .cse169 (* .cse177 .cse147))) .cse29) (or .cse171 .cse27 .cse28 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse177 .cse145) .cse170)))) .cse32))) .cse19)) (.cse159 (or .cse172 (and (or (not .cse121) .cse39 (= (+ .cse173 (* .cse174 .cse175)) |ULTIMATE.start_main_~A~0#1|)) (or .cse20 (not .cse124) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse175 .cse146) .cse176)) .cse32)))) (.cse160 (or (and (or (not (= .cse95 1)) .cse91) (or (not (= .cse96 1)) .cse93 .cse94)) (let ((.cse164 (+ .cse110 1))) (and (or .cse39 (and (or (= (+ .cse163 (* .cse164 .cse143)) |ULTIMATE.start_main_~A~0#1|) .cse37 .cse38 .cse165) (or .cse34 .cse166 (= (+ .cse167 (* .cse164 .cse144)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse20 (and (or .cse168 .cse29 (= |ULTIMATE.start_main_~A~0#1| (+ .cse169 (* .cse164 .cse147)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse164 .cse145) .cse170)) .cse171 .cse27 .cse28)) .cse32))) .cse89))) (or (and .cse152 .cse153 .cse154 .cse6 .cse33 .cse155 .cse9 .cse156 .cse11 .cse157 .cse158 .cse159 .cse12 .cse160 .cse13 .cse161 .cse16 .cse32) (and .cse152 .cse153 .cse154 .cse6 .cse33 .cse9 .cse156 .cse11 .cse157 .cse158 .cse159 .cse12 .cse160 .cse13 .cse162 .cse161 .cse16 .cse32)))))) (and .cse178 .cse43 .cse46 .cse47 .cse7 .cse179 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse12 .cse14 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1)) .cse180) (and .cse7 .cse179 .cse149 .cse151 .cse14) (and .cse152 .cse153 .cse33 (= .cse150 |ULTIMATE.start_main_~d~0#1|) .cse156 (= |ULTIMATE.start_main_~p~0#1| .cse15) .cse149 (= |ULTIMATE.start_main_~d~0#1| .cse15) .cse181 .cse151 .cse14 .cse161 .cse32) (let ((.cse183 (+ |ULTIMATE.start_main_~r~0#1| 4))) (and .cse42 .cse182 (= |ULTIMATE.start_main_~A~0#1| .cse183) .cse154 .cse184 .cse185 .cse186 (<= 2 |ULTIMATE.start_main_~p~0#1|) .cse181 .cse97 (= |ULTIMATE.start_main_~q~0#1| 4) (let ((.cse188 (= (mod |ULTIMATE.start_main_~q~0#1| 2) 0)) (.cse189 (< |ULTIMATE.start_main_~q~0#1| 0)) (.cse187 (div |ULTIMATE.start_main_~q~0#1| 2))) (or (and (= .cse187 |ULTIMATE.start_main_~p~0#1|) (or .cse188 (not .cse189))) (and (not .cse188) .cse189 (= (+ .cse187 1) |ULTIMATE.start_main_~p~0#1|)))) .cse12 .cse190 .cse114 .cse13 .cse115 .cse116 .cse14 .cse191 .cse192 (>= .cse183 .cse15) .cse193)) (and .cse194 (= |ULTIMATE.start_main_~d~0#1| .cse195) .cse149 .cse97 .cse151 .cse14 .cse196) (and .cse182 .cse154 .cse7 .cse185 .cse88 (or (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse197)) .cse198 (let ((.cse201 (= (mod .cse197 2) 0)) (.cse199 (< .cse197 0)) (.cse200 (div .cse202 4))) (or (and .cse199 (= (+ .cse200 1) |ULTIMATE.start_main_~d~0#1|) (not .cse201)) (and (or .cse201 (not .cse199)) (= |ULTIMATE.start_main_~d~0#1| .cse200))))) (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse203)) (let ((.cse205 (= (mod .cse203 2) 0)) (.cse204 (< .cse203 0)) (.cse206 (div .cse203 2))) (or (and .cse204 (not .cse205) (= (+ .cse206 1) |ULTIMATE.start_main_~d~0#1|)) (and (or .cse205 (not .cse204)) (= .cse206 |ULTIMATE.start_main_~d~0#1|)))) .cse207 .cse208)) .cse190 .cse114 .cse14 .cse191 .cse193) (and .cse184 .cse7 (= (+ (* (- 1) .cse195) |ULTIMATE.start_main_~q~0#1|) 0) .cse14 .cse191 (= .cse209 .cse45)) (and (<= 4 |ULTIMATE.start_main_~p~0#1|) .cse42 (= |ULTIMATE.start_main_~p~0#1| 4) .cse178 .cse154 .cse6 .cse210 .cse155 .cse11 .cse158 (= |ULTIMATE.start_main_~d~0#1| .cse211) .cse212 .cse97 (= |ULTIMATE.start_main_~d~0#1| 4) .cse12 (= (+ |ULTIMATE.start_main_~A~0#1| .cse4) |ULTIMATE.start_main_~r~0#1|) .cse114 .cse13 .cse115 .cse116 .cse14 .cse161 .cse180) (and .cse178 .cse154 .cse155 .cse194 .cse186 .cse212 .cse12 (= .cse17 0) .cse14 .cse161 .cse192 (not .cse210) .cse196))))))))) [2023-02-17 02:09:48,154 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2023-02-17 02:09:48,157 INFO L895 garLoopResultBuilder]: At program point L44-1(lines 44 56) the Hoare annotation is: (let ((.cse250 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse239 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse263 (- .cse239)) (.cse190 (+ .cse250 1))) (let ((.cse70 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse185 (+ |ULTIMATE.start_main_~q~0#1| .cse190)) (.cse267 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse56 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse163 (+ |ULTIMATE.start_main_~q~0#1| .cse250)) (.cse262 (+ (- 1) .cse263)) (.cse266 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse27 (- |ULTIMATE.start_main_~d~0#1|)) (.cse220 (+ .cse239 1))) (let ((.cse219 (div .cse220 2)) (.cse218 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse256 (= .cse250 1)) (.cse251 (= .cse190 1)) (.cse92 (+ |ULTIMATE.start_main_~r~0#1| .cse27)) (.cse79 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse58 (not .cse266)) (.cse207 (+ |ULTIMATE.start_main_~r~0#1| .cse262)) (.cse264 (* |ULTIMATE.start_main_~B~0#1| .cse163)) (.cse91 (and .cse267 (not .cse56))) (.cse265 (* .cse185 |ULTIMATE.start_main_~B~0#1|)) (.cse213 (+ |ULTIMATE.start_main_~r~0#1| .cse263)) (.cse57 (not .cse267)) (.cse76 (and (not .cse70) .cse266))) (let ((.cse44 (or (and (or (= (+ .cse264 .cse213) |ULTIMATE.start_main_~A~0#1|) .cse91) (or (= (+ .cse265 .cse213) |ULTIMATE.start_main_~A~0#1|) .cse56 .cse57)) .cse76)) (.cse45 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse46 (or .cse58 (and (or .cse91 (= (+ .cse207 .cse264) |ULTIMATE.start_main_~A~0#1|)) (or .cse56 .cse57 (= |ULTIMATE.start_main_~A~0#1| (+ .cse265 .cse207)))) .cse70)) (.cse22 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse92 (* |ULTIMATE.start_main_~B~0#1| .cse79)))) (.cse8 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse237 (and (or (not .cse256) .cse91) (or .cse56 .cse57 (not .cse251)))) (.cse204 (- .cse218)) (.cse217 (+ .cse218 1)) (.cse221 (+ .cse219 1)) (.cse205 (- .cse219))) (let ((.cse206 (+ (- 1) .cse205)) (.cse155 (>= .cse207 .cse221)) (.cse258 (< .cse220 0)) (.cse115 (= (mod .cse220 2) 0)) (.cse161 (>= .cse207 .cse219)) (.cse139 (>= .cse213 .cse218)) (.cse103 (= (mod .cse239 2) 0)) (.cse138 (>= .cse213 .cse217)) (.cse259 (< .cse239 0)) (.cse203 (+ (- 1) .cse204)) (.cse104 (= (mod .cse190 2) 0)) (.cse260 (< .cse190 0)) (.cse119 (div .cse190 2)) (.cse127 (div |ULTIMATE.start_main_~p~0#1| 4)) (.cse261 (< .cse250 0)) (.cse122 (= (mod .cse250 2) 0)) (.cse90 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse99 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse20 (or .cse237 (and (or (= .cse239 |ULTIMATE.start_main_~B~0#1|) .cse76) (or .cse58 (= |ULTIMATE.start_main_~B~0#1| .cse220) .cse70)))) (.cse11 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse225 (or .cse237 (and (or .cse58 .cse70 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse220)) |ULTIMATE.start_main_~A~0#1|)) (or .cse76 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse239 |ULTIMATE.start_main_~q~0#1|))))))) (.cse227 (or (and .cse45 .cse22 .cse50) (and .cse44 .cse45 .cse46 .cse22 .cse50) (and .cse44 .cse45 .cse46 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse22 .cse50 .cse8 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1))))) (.cse26 (- |ULTIMATE.start_main_~r~0#1|)) (.cse101 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (let ((.cse9 (+ .cse101 |ULTIMATE.start_main_~A~0#1|)) (.cse36 (+ |ULTIMATE.start_main_~A~0#1| .cse26)) (.cse102 (>= .cse92 .cse239)) (.cse113 (>= .cse92 .cse220)) (.cse171 (>= |ULTIMATE.start_main_~r~0#1| .cse220)) (.cse172 (>= |ULTIMATE.start_main_~r~0#1| .cse239)) (.cse7 (or (and .cse20 .cse11 .cse225 .cse227) (and .cse20 .cse11 .cse225 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse227))) (.cse193 (+ (- .cse99) |ULTIMATE.start_main_~r~0#1|)) (.cse199 (+ |ULTIMATE.start_main_~q~0#1| .cse90)) (.cse5 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse238 (+ .cse92 .cse263)) (.cse241 (+ .cse92 .cse262)) (.cse125 (and .cse261 (not .cse122))) (.cse121 (not .cse261)) (.cse126 (+ .cse127 1)) (.cse120 (+ .cse119 1)) (.cse105 (not .cse260)) (.cse109 (and .cse260 (not .cse104))) (.cse228 (+ .cse203 .cse213)) (.cse110 (not .cse259)) (.cse230 (not .cse138)) (.cse111 (and (not .cse103) .cse259)) (.cse231 (not .cse139)) (.cse232 (+ .cse204 .cse213)) (.cse233 (not .cse161)) (.cse234 (+ .cse207 .cse205)) (.cse118 (and .cse258 (not .cse115))) (.cse236 (not .cse155)) (.cse116 (not .cse258)) (.cse235 (+ .cse207 .cse206))) (let ((.cse6 (* 2 1)) (.cse10 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse14 (or (and (or (not (= .cse120 1)) .cse104 .cse105) (or .cse109 (not (= .cse119 1)))) .cse56 (let ((.cse257 (+ .cse185 1))) (and (or .cse76 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 (* .cse257 .cse217))) .cse103 .cse110 .cse230) (or .cse111 .cse231 (= (+ (* .cse257 .cse218) .cse232) |ULTIMATE.start_main_~A~0#1|)))) (or .cse58 (and (or .cse233 (= |ULTIMATE.start_main_~A~0#1| (+ .cse234 (* .cse257 .cse219))) .cse118) (or .cse236 .cse115 .cse116 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse257 .cse221) .cse235)))) .cse70))) .cse57)) (.cse15 (let ((.cse253 (* (+ .cse185 .cse119) |ULTIMATE.start_main_~B~0#1|)) (.cse252 (* (+ .cse120 .cse185) |ULTIMATE.start_main_~B~0#1|)) (.cse255 (* (+ .cse127 .cse163) |ULTIMATE.start_main_~B~0#1|)) (.cse254 (* (+ .cse126 .cse163) |ULTIMATE.start_main_~B~0#1|))) (let ((.cse244 (or (and (or .cse251 .cse56 .cse57 (and (or .cse103 .cse110 (and (or .cse104 (= (+ .cse228 .cse252) |ULTIMATE.start_main_~A~0#1|) .cse105) (or .cse109 (= |ULTIMATE.start_main_~A~0#1| (+ .cse253 .cse228))))) (or .cse111 (and (or .cse109 (= (+ .cse253 .cse232) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse252 .cse232)) .cse104 .cse105))))) (or (and (or .cse111 (and (or (= (+ .cse255 .cse232) |ULTIMATE.start_main_~A~0#1|) .cse125) (or (= (+ .cse232 .cse254) |ULTIMATE.start_main_~A~0#1|) .cse121 .cse122))) (or (and (or .cse125 (= (+ .cse255 .cse228) |ULTIMATE.start_main_~A~0#1|)) (or .cse121 .cse122 (= |ULTIMATE.start_main_~A~0#1| (+ .cse228 .cse254)))) .cse103 .cse110)) .cse91 .cse256)) .cse76)) (.cse247 (or .cse58 .cse70 (and (or .cse251 .cse56 .cse57 (and (or (and (or (= (+ .cse252 .cse235) |ULTIMATE.start_main_~A~0#1|) .cse104 .cse105) (or .cse109 (= |ULTIMATE.start_main_~A~0#1| (+ .cse253 .cse235)))) .cse115 .cse116) (or .cse118 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse234 .cse252)) .cse104 .cse105) (or .cse109 (= (+ .cse234 .cse253) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse121 .cse122 (= (+ .cse234 .cse254) |ULTIMATE.start_main_~A~0#1|)) (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse234 .cse255)))) .cse118) (or .cse115 .cse116 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse235 .cse254)) .cse121 .cse122) (or (= (+ .cse255 .cse235) |ULTIMATE.start_main_~A~0#1|) .cse125)))) .cse91 .cse256)))) (.cse243 (or .cse5 (let ((.cse249 (* (+ .cse79 .cse190) |ULTIMATE.start_main_~B~0#1|)) (.cse248 (* (+ .cse79 .cse250) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse248 .cse238) |ULTIMATE.start_main_~A~0#1|) .cse91) (or .cse56 .cse57 (= |ULTIMATE.start_main_~A~0#1| (+ .cse238 .cse249)))) .cse76) (or .cse58 (and (or .cse56 (= |ULTIMATE.start_main_~A~0#1| (+ .cse241 .cse249)) .cse57) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse241 .cse248)) .cse91)) .cse70))))) (.cse245 (or .cse5 (and .cse44 .cse46))) (.cse246 (or (= .cse90 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ .cse193 .cse27) (* |ULTIMATE.start_main_~B~0#1| (+ .cse199 |ULTIMATE.start_main_~p~0#1|))))))) (or (and .cse45 .cse243 .cse244 .cse245 .cse50 .cse7 .cse246 .cse247) (and .cse243 (= |ULTIMATE.start_main_~B~0#1| (+ (* (- 2) |ULTIMATE.start_main_~B~0#1|) .cse101 |ULTIMATE.start_main_~A~0#1|)) .cse244 .cse245 .cse50 (= (+ (- 2) |ULTIMATE.start_main_~q~0#1|) 1) .cse7 .cse246 .cse8 .cse247) (and .cse45 .cse243 .cse245 .cse50 .cse7 .cse246))))) (.cse16 (or .cse237 (let ((.cse242 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse58 (not .cse171) .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse207 (* .cse242 .cse220)))) (or (not .cse172) .cse76 (= (+ (* .cse239 .cse242) .cse213) |ULTIMATE.start_main_~A~0#1|)))))) (.cse17 (or .cse237 (let ((.cse240 (+ .cse79 1))) (and (or (not .cse102) .cse76 (= (+ .cse238 (* .cse239 .cse240)) |ULTIMATE.start_main_~A~0#1|)) (or .cse58 (not .cse113) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse240 .cse220) .cse241)) .cse70))))) (.cse18 (or (and (or (not (= .cse127 1)) .cse125) (or (not (= .cse126 1)) .cse121 .cse122)) (let ((.cse229 (+ .cse163 1))) (and (or .cse76 (and (or (= (+ .cse228 (* .cse229 .cse217)) |ULTIMATE.start_main_~A~0#1|) .cse103 .cse110 .cse230) (or .cse111 .cse231 (= (+ .cse232 (* .cse229 .cse218)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse58 (and (or .cse233 .cse118 (= |ULTIMATE.start_main_~A~0#1| (+ .cse234 (* .cse229 .cse219)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse229 .cse221) .cse235)) .cse236 .cse115 .cse116)) .cse70))) .cse91)) (.cse55 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse0 (div .cse36 2)) (.cse4 (< .cse9 0)) (.cse224 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse29 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse42 (= |ULTIMATE.start_main_~d~0#1| 1)) (.cse19 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse12 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse13 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))) (let ((.cse21 (let ((.cse226 (or (and .cse44 .cse45 .cse46 .cse12 .cse22 .cse13 .cse50 .cse8) (and .cse45 .cse12 .cse22 .cse13 .cse50 .cse8)))) (or (and .cse225 .cse226 .cse19) (and (= .cse29 |ULTIMATE.start_main_~A~0#1|) .cse42 .cse5 .cse227 (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|)) (and .cse225 .cse227 .cse19) (and .cse225 .cse226)))) (.cse1 (or (not .cse4) .cse224)) (.cse2 (+ .cse0 1)) (.cse3 (not .cse224)) (.cse31 (>= |ULTIMATE.start_main_~p~0#1| 1)) (.cse32 (or (and .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse14 .cse15 .cse16 .cse17 .cse18 (or (not .cse5) (= (+ .cse92 (* |ULTIMATE.start_main_~d~0#1| .cse79)) |ULTIMATE.start_main_~A~0#1|) .cse55)))) (.cse40 (>= |ULTIMATE.start_main_~A~0#1| (* 2 .cse10))) (.cse30 (* 2 .cse6))) (or (and (or (and (= |ULTIMATE.start_main_~d~0#1| .cse0) .cse1) (and (= |ULTIMATE.start_main_~d~0#1| .cse2) .cse3 .cse4)) .cse5 (= (+ (* (- 1) .cse6) |ULTIMATE.start_main_~q~0#1|) 0) .cse7 .cse8 (= .cse9 .cse10)) (and .cse5 .cse11 .cse12 .cse13 .cse8) (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse20 .cse11 .cse21) (and .cse5 .cse11 .cse21 .cse8) (and .cse5 .cse11 .cse12 .cse22 .cse13 .cse8) (let ((.cse28 (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) .cse29)))) (and (let ((.cse25 (< .cse28 0)) (.cse23 (div (+ |ULTIMATE.start_main_~A~0#1| .cse26 .cse27) 2)) (.cse24 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0))) (or (and (= .cse23 |ULTIMATE.start_main_~d~0#1|) (or .cse24 (not .cse25))) (and .cse25 (= |ULTIMATE.start_main_~d~0#1| (+ .cse23 1)) (not .cse24)))) .cse5 (= 2 .cse28) (>= .cse29 |ULTIMATE.start_main_~d~0#1|) .cse15 (not (>= (+ .cse29 .cse28) .cse30)) (= (+ (* (- 1) 2) (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|)) 0))) (and (= (+ 4 0) |ULTIMATE.start_main_~q~0#1|) .cse5 (= .cse9 (* |ULTIMATE.start_main_~B~0#1| 4)) .cse31 .cse32 (or (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse0)) .cse1 (let ((.cse35 (= (mod .cse0 2) 0)) (.cse33 (< .cse0 0)) (.cse34 (div .cse36 4))) (or (and .cse33 (= (+ .cse34 1) |ULTIMATE.start_main_~d~0#1|) (not .cse35)) (and (or .cse35 (not .cse33)) (= |ULTIMATE.start_main_~d~0#1| .cse34))))) (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse2)) (let ((.cse38 (= (mod .cse2 2) 0)) (.cse37 (< .cse2 0)) (.cse39 (div .cse2 2))) (or (and .cse37 (not .cse38) (= (+ .cse39 1) |ULTIMATE.start_main_~d~0#1|)) (and (or .cse38 (not .cse37)) (= .cse39 |ULTIMATE.start_main_~d~0#1|)))) .cse3 .cse4)) .cse40 .cse8) (let ((.cse41 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse223 (<= |ULTIMATE.start_main_~A~0#1| 5)) (.cse222 (+ |ULTIMATE.start_main_~A~0#1| (- 4)))) (and .cse41 .cse42 .cse5 (let ((.cse154 (= (mod .cse221 2) 0)) (.cse208 (- (div .cse221 2))) (.cse209 (< .cse221 0)) (.cse158 (= (mod .cse219 2) 0)) (.cse211 (- (div .cse220 4))) (.cse210 (< .cse219 0)) (.cse140 (= (mod .cse218 2) 0)) (.cse212 (< .cse218 0)) (.cse214 (- (div |ULTIMATE.start_main_~d~0#1| 8))) (.cse215 (- (div .cse217 2))) (.cse216 (< .cse217 0)) (.cse136 (= (mod .cse217 2) 0))) (let ((.cse106 (+ .cse92 .cse203)) (.cse112 (+ .cse204 .cse92)) (.cse114 (+ .cse206 .cse92)) (.cse117 (+ .cse92 .cse205)) (.cse128 (and .cse216 (not .cse136))) (.cse129 (+ .cse213 .cse215)) (.cse135 (not .cse216)) (.cse137 (+ (+ (- 1) .cse215) .cse213)) (.cse141 (+ (+ (- 1) .cse214) .cse213)) (.cse142 (not .cse212)) (.cse143 (+ .cse213 .cse214)) (.cse144 (and (not .cse140) .cse212)) (.cse156 (not .cse210)) (.cse157 (+ .cse207 (+ (- 1) .cse211))) (.cse159 (+ .cse211 .cse207)) (.cse160 (and (not .cse158) .cse210)) (.cse152 (not .cse209)) (.cse153 (+ .cse207 (+ (- 1) .cse208))) (.cse150 (and (not .cse154) .cse209)) (.cse151 (+ .cse207 .cse208)) (.cse170 (+ .cse206 |ULTIMATE.start_main_~r~0#1|)) (.cse168 (+ |ULTIMATE.start_main_~r~0#1| .cse205)) (.cse174 (+ .cse204 |ULTIMATE.start_main_~r~0#1|)) (.cse173 (+ .cse203 |ULTIMATE.start_main_~r~0#1|))) (let ((.cse48 (let ((.cse202 (* .cse99 2))) (let ((.cse201 (+ (- .cse202) |ULTIMATE.start_main_~r~0#1|))) (or (>= .cse201 .cse99) (= (+ (+ .cse201 .cse27) (* (+ |ULTIMATE.start_main_~p~0#1| (+ |ULTIMATE.start_main_~q~0#1| (* 2 .cse90))) |ULTIMATE.start_main_~B~0#1|)) |ULTIMATE.start_main_~A~0#1|) (not (>= |ULTIMATE.start_main_~r~0#1| .cse202)))))) (.cse51 (or (>= .cse193 |ULTIMATE.start_main_~d~0#1|) (let ((.cse200 (div (* |ULTIMATE.start_main_~p~0#1| 4) 8))) (let ((.cse195 (* |ULTIMATE.start_main_~B~0#1| (+ .cse199 (+ .cse200 1)))) (.cse196 (* (+ .cse199 .cse200) |ULTIMATE.start_main_~B~0#1|)) (.cse197 (- (div (* |ULTIMATE.start_main_~d~0#1| 4) 8)))) (and (or (let ((.cse194 (+ .cse197 .cse193))) (and (or .cse56 (= (+ .cse194 .cse195) |ULTIMATE.start_main_~A~0#1|) .cse57) (or (= (+ .cse194 .cse196) |ULTIMATE.start_main_~A~0#1|) .cse91))) .cse76) (or .cse58 .cse70 (let ((.cse198 (+ (+ (- 1) .cse197) .cse193))) (and (or .cse56 .cse57 (= (+ .cse198 .cse195) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse198 .cse196) |ULTIMATE.start_main_~A~0#1|) .cse91))))))) (not (>= |ULTIMATE.start_main_~r~0#1| .cse99)))) (.cse43 (or .cse56 .cse57 (let ((.cse192 (* |ULTIMATE.start_main_~B~0#1| (+ .cse120 |ULTIMATE.start_main_~q~0#1|))) (.cse191 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse119)))) (and (or .cse58 (and (or (and (or .cse109 (= |ULTIMATE.start_main_~A~0#1| (+ .cse170 .cse191))) (or .cse104 (= (+ .cse192 .cse170) |ULTIMATE.start_main_~A~0#1|) .cse105)) .cse115 .cse116) (or .cse118 (and (or .cse109 (= (+ .cse168 .cse191) |ULTIMATE.start_main_~A~0#1|)) (or .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse192 .cse168)) .cse105)))) .cse171 .cse70) (or .cse172 (and (or .cse111 (and (or .cse109 (= (+ .cse174 .cse191) |ULTIMATE.start_main_~A~0#1|)) (or .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse192)) .cse105))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse173 .cse192)) .cse104 .cse105) (or .cse109 (= (+ .cse173 .cse191) |ULTIMATE.start_main_~A~0#1|))) .cse103 .cse110)) .cse76))))) (.cse47 (or .cse56 .cse57 (let ((.cse182 (= (mod .cse120 2) 0)) (.cse187 (< .cse120 0)) (.cse186 (div .cse120 2)) (.cse177 (= (mod .cse119 2) 0)) (.cse189 (< .cse119 0)) (.cse188 (div .cse190 4))) (let ((.cse179 (* (+ (+ .cse188 1) .cse185) |ULTIMATE.start_main_~B~0#1|)) (.cse178 (not .cse189)) (.cse176 (and (not .cse177) .cse189)) (.cse175 (* (+ .cse185 .cse188) |ULTIMATE.start_main_~B~0#1|)) (.cse183 (* |ULTIMATE.start_main_~B~0#1| (+ (+ .cse186 1) .cse185))) (.cse184 (not .cse187)) (.cse180 (and (not .cse182) .cse187)) (.cse181 (* |ULTIMATE.start_main_~B~0#1| (+ .cse185 .cse186)))) (and (or (and (or .cse109 (and (or .cse103 .cse110 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse129 .cse175)) .cse176) (or .cse177 .cse178 (= |ULTIMATE.start_main_~A~0#1| (+ .cse129 .cse179)))) .cse128) (or (and (or .cse177 (= (+ .cse137 .cse179) |ULTIMATE.start_main_~A~0#1|) .cse178) (or .cse176 (= (+ .cse175 .cse137) |ULTIMATE.start_main_~A~0#1|))) .cse135 .cse136)) .cse138) (or .cse111 (and (or .cse140 .cse142 (and (or .cse176 (= (+ .cse175 .cse141) |ULTIMATE.start_main_~A~0#1|)) (or .cse177 .cse178 (= (+ .cse179 .cse141) |ULTIMATE.start_main_~A~0#1|)))) (or .cse144 (and (or .cse177 .cse178 (= (+ .cse143 .cse179) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse143 .cse175) |ULTIMATE.start_main_~A~0#1|) .cse176)))) .cse139))) (or (and (or .cse103 (and (or .cse128 (and (or .cse180 (= |ULTIMATE.start_main_~A~0#1| (+ .cse129 .cse181))) (or .cse182 (= (+ .cse183 .cse129) |ULTIMATE.start_main_~A~0#1|) .cse184))) (or .cse135 .cse136 (and (or (= (+ .cse137 .cse181) |ULTIMATE.start_main_~A~0#1|) .cse180) (or .cse182 (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse137)) .cse184)))) .cse110 .cse138) (or .cse111 .cse139 (and (or .cse140 (and (or .cse182 .cse184 (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse141))) (or .cse180 (= (+ .cse181 .cse141) |ULTIMATE.start_main_~A~0#1|))) .cse142) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse143 .cse181)) .cse180) (or .cse182 .cse184 (= (+ .cse143 .cse183) |ULTIMATE.start_main_~A~0#1|))) .cse144)))) .cse104 .cse105)) .cse76) (or .cse58 (and (or (and (or (and (or (and (or .cse177 (= (+ .cse153 .cse179) |ULTIMATE.start_main_~A~0#1|) .cse178) (or .cse176 (= |ULTIMATE.start_main_~A~0#1| (+ .cse153 .cse175)))) .cse152 .cse154) (or .cse150 (and (or .cse177 (= |ULTIMATE.start_main_~A~0#1| (+ .cse151 .cse179)) .cse178) (or .cse176 (= (+ .cse151 .cse175) |ULTIMATE.start_main_~A~0#1|))))) .cse115 .cse116 .cse155) (or .cse118 .cse161 (and (or .cse156 (and (or (= (+ .cse157 .cse179) |ULTIMATE.start_main_~A~0#1|) .cse177 .cse178) (or .cse176 (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse175)))) .cse158) (or (and (or .cse177 (= (+ .cse179 .cse159) |ULTIMATE.start_main_~A~0#1|) .cse178) (or .cse176 (= |ULTIMATE.start_main_~A~0#1| (+ .cse175 .cse159)))) .cse160)))) .cse109) (or .cse104 .cse105 (and (or (and (or .cse156 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse183 .cse157)) .cse182 .cse184) (or .cse180 (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse181)))) .cse158) (or (and (or (= (+ .cse183 .cse159) |ULTIMATE.start_main_~A~0#1|) .cse182 .cse184) (or .cse180 (= |ULTIMATE.start_main_~A~0#1| (+ .cse181 .cse159)))) .cse160)) .cse118 .cse161) (or (and (or .cse152 (and (or .cse182 .cse184 (= (+ .cse153 .cse183) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse153 .cse181)) .cse180)) .cse154) (or .cse150 (and (or .cse182 (= (+ .cse151 .cse183) |ULTIMATE.start_main_~A~0#1|) .cse184) (or .cse180 (= (+ .cse151 .cse181) |ULTIMATE.start_main_~A~0#1|))))) .cse115 .cse116 .cse155)))) .cse70)))))) (.cse49 (or .cse91 (let ((.cse169 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse126))) (.cse167 (* |ULTIMATE.start_main_~B~0#1| (+ .cse127 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse58 (and (or .cse118 (and (or (= (+ .cse167 .cse168) |ULTIMATE.start_main_~A~0#1|) .cse125) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse168 .cse169)) .cse121 .cse122))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse170 .cse169)) .cse121 .cse122) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse167 .cse170)) .cse125)) .cse115 .cse116)) .cse171 .cse70) (or .cse172 (and (or .cse103 .cse110 (and (or .cse121 (= |ULTIMATE.start_main_~A~0#1| (+ .cse173 .cse169)) .cse122) (or .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse173 .cse167))))) (or .cse111 (and (or (= (+ .cse174 .cse169) |ULTIMATE.start_main_~A~0#1|) .cse121 .cse122) (or (= (+ .cse174 .cse167) |ULTIMATE.start_main_~A~0#1|) .cse125)))) .cse76))))) (.cse52 (or (let ((.cse132 (= (mod .cse126 2) 0)) (.cse162 (< .cse126 0)) (.cse164 (div .cse126 2)) (.cse148 (= (mod .cse127 2) 0)) (.cse165 (< .cse127 0)) (.cse166 (div |ULTIMATE.start_main_~p~0#1| 8))) (let ((.cse145 (* |ULTIMATE.start_main_~B~0#1| (+ .cse163 .cse166))) (.cse146 (and (not .cse148) .cse165)) (.cse147 (* |ULTIMATE.start_main_~B~0#1| (+ (+ .cse166 1) .cse163))) (.cse149 (not .cse165)) (.cse134 (* |ULTIMATE.start_main_~B~0#1| (+ (+ 1 .cse164) .cse163))) (.cse133 (not .cse162)) (.cse130 (* (+ .cse163 .cse164) |ULTIMATE.start_main_~B~0#1|)) (.cse131 (and (not .cse132) .cse162))) (and (or .cse76 (and (or (and (or (and (or .cse128 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse129 .cse130)) .cse131) (or .cse132 .cse133 (= |ULTIMATE.start_main_~A~0#1| (+ .cse129 .cse134))))) (or .cse135 .cse136 (and (or .cse131 (= (+ .cse130 .cse137) |ULTIMATE.start_main_~A~0#1|)) (or .cse132 .cse133 (= |ULTIMATE.start_main_~A~0#1| (+ .cse134 .cse137)))))) .cse103 .cse110 .cse138) (or .cse111 .cse139 (and (or .cse140 (and (or .cse132 .cse133 (= |ULTIMATE.start_main_~A~0#1| (+ .cse134 .cse141))) (or (= (+ .cse130 .cse141) |ULTIMATE.start_main_~A~0#1|) .cse131)) .cse142) (or (and (or .cse132 (= (+ .cse143 .cse134) |ULTIMATE.start_main_~A~0#1|) .cse133) (or .cse131 (= (+ .cse143 .cse130) |ULTIMATE.start_main_~A~0#1|))) .cse144)))) .cse121 .cse122) (or (and (or .cse103 (and (or .cse135 .cse136 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse137 .cse145)) .cse146) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse137 .cse147)) .cse148 .cse149))) (or (and (or .cse148 .cse149 (= |ULTIMATE.start_main_~A~0#1| (+ .cse129 .cse147))) (or .cse146 (= (+ .cse129 .cse145) |ULTIMATE.start_main_~A~0#1|))) .cse128)) .cse110 .cse138) (or .cse111 (and (or (and (or .cse148 .cse149 (= |ULTIMATE.start_main_~A~0#1| (+ .cse143 .cse147))) (or (= (+ .cse143 .cse145) |ULTIMATE.start_main_~A~0#1|) .cse146)) .cse144) (or .cse140 (and (or (= (+ .cse141 .cse145) |ULTIMATE.start_main_~A~0#1|) .cse146) (or (= (+ .cse141 .cse147) |ULTIMATE.start_main_~A~0#1|) .cse148 .cse149)) .cse142)) .cse139)) .cse125))) (or .cse58 (and (or (and (or (and (or .cse150 (and (or .cse146 (= (+ .cse151 .cse145) |ULTIMATE.start_main_~A~0#1|)) (or .cse148 (= (+ .cse151 .cse147) |ULTIMATE.start_main_~A~0#1|) .cse149))) (or .cse152 (and (or .cse148 (= |ULTIMATE.start_main_~A~0#1| (+ .cse153 .cse147)) .cse149) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse153 .cse145)) .cse146)) .cse154)) .cse115 .cse116 .cse155) (or (and (or .cse156 (and (or (= (+ .cse157 .cse145) |ULTIMATE.start_main_~A~0#1|) .cse146) (or .cse148 (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse147)) .cse149)) .cse158) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse145 .cse159)) .cse146) (or .cse148 (= (+ .cse147 .cse159) |ULTIMATE.start_main_~A~0#1|) .cse149)) .cse160)) .cse118 .cse161)) .cse125) (or (and (or (and (or (and (or (= (+ .cse151 .cse134) |ULTIMATE.start_main_~A~0#1|) .cse132 .cse133) (or .cse131 (= (+ .cse151 .cse130) |ULTIMATE.start_main_~A~0#1|))) .cse150) (or .cse152 .cse154 (and (or .cse132 .cse133 (= |ULTIMATE.start_main_~A~0#1| (+ .cse153 .cse134))) (or .cse131 (= |ULTIMATE.start_main_~A~0#1| (+ .cse153 .cse130)))))) .cse115 .cse116 .cse155) (or (and (or (and (or .cse131 (= (+ .cse130 .cse159) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse134 .cse159) |ULTIMATE.start_main_~A~0#1|) .cse132 .cse133)) .cse160) (or .cse156 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse134)) .cse132 .cse133) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse157 .cse130)) .cse131)) .cse158)) .cse118 .cse161)) .cse121 .cse122)) .cse70)))) .cse91)) (.cse53 (or (let ((.cse124 (* (+ .cse127 .cse79) |ULTIMATE.start_main_~B~0#1|)) (.cse123 (* (+ .cse79 .cse126) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse76 (and (or (and (or .cse121 .cse122 (= (+ .cse123 .cse106) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse106 .cse124)) .cse125)) .cse103 .cse110) (or .cse111 (and (or .cse125 (= (+ .cse112 .cse124) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse123 .cse112) |ULTIMATE.start_main_~A~0#1|) .cse121 .cse122)))) .cse102) (or .cse58 (and (or (and (or (= (+ .cse114 .cse123) |ULTIMATE.start_main_~A~0#1|) .cse121 .cse122) (or (= (+ .cse114 .cse124) |ULTIMATE.start_main_~A~0#1|) .cse125)) .cse115 .cse116) (or (and (or (= (+ .cse124 .cse117) |ULTIMATE.start_main_~A~0#1|) .cse125) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse123 .cse117)) .cse121 .cse122)) .cse118)) .cse113 .cse70))) .cse91)) (.cse54 (or .cse56 (let ((.cse107 (* (+ .cse120 .cse79) |ULTIMATE.start_main_~B~0#1|)) (.cse108 (* (+ .cse79 .cse119) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse76 .cse102 (and (or .cse103 (and (or .cse104 .cse105 (= |ULTIMATE.start_main_~A~0#1| (+ .cse106 .cse107))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse106 .cse108)) .cse109)) .cse110) (or .cse111 (and (or .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse107)) .cse105) (or (= (+ .cse108 .cse112) |ULTIMATE.start_main_~A~0#1|) .cse109))))) (or .cse58 .cse113 (and (or (and (or .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse114 .cse107)) .cse105) (or .cse109 (= |ULTIMATE.start_main_~A~0#1| (+ .cse114 .cse108)))) .cse115 .cse116) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse107 .cse117)) .cse104 .cse105) (or .cse109 (= (+ .cse108 .cse117) |ULTIMATE.start_main_~A~0#1|))) .cse118)) .cse70))) .cse57))) (or (and .cse43 .cse44 .cse45 .cse46 .cse47 .cse31 .cse48 .cse32 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54) (and .cse43 .cse45 .cse31 .cse48 .cse32 .cse49 .cse50) (and .cse45 .cse31 .cse48 .cse32 .cse50) (and .cse45 .cse31 .cse48 .cse32 .cse50 .cse51 (or .cse55 (let ((.cse93 (div .cse99 4))) (let ((.cse98 (+ .cse93 1))) (let ((.cse71 (= (mod .cse93 2) 0)) (.cse95 (< .cse93 0)) (.cse94 (- (div .cse99 8))) (.cse60 (= (mod .cse98 2) 0)) (.cse97 (< .cse98 0)) (.cse96 (- (div .cse98 2)))) (let ((.cse59 (>= .cse92 .cse98)) (.cse64 (+ .cse92 (+ (- 1) .cse96))) (.cse61 (not .cse97)) (.cse69 (and .cse97 (not .cse60))) (.cse68 (+ .cse96 .cse92)) (.cse73 (+ (+ (- 1) .cse94) .cse92)) (.cse72 (not .cse95)) (.cse74 (and (not .cse71) .cse95)) (.cse75 (+ .cse94 .cse92)) (.cse77 (>= .cse92 .cse93)) (.cse82 (div .cse90 4))) (and (or .cse56 .cse57 (let ((.cse81 (+ .cse82 1))) (let ((.cse62 (= (mod .cse81 2) 0)) (.cse78 (< .cse81 0)) (.cse80 (div .cse81 2))) (let ((.cse65 (* |ULTIMATE.start_main_~B~0#1| (+ (+ .cse80 1) .cse79))) (.cse63 (not .cse78)) (.cse66 (* |ULTIMATE.start_main_~B~0#1| (+ .cse79 .cse80))) (.cse67 (and (not .cse62) .cse78))) (and (or .cse58 .cse59 (and (or .cse60 .cse61 (and (or .cse62 .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse64 .cse65))) (or (= (+ .cse66 .cse64) |ULTIMATE.start_main_~A~0#1|) .cse67))) (or (and (or .cse62 (= |ULTIMATE.start_main_~A~0#1| (+ .cse68 .cse65)) .cse63) (or (= (+ .cse66 .cse68) |ULTIMATE.start_main_~A~0#1|) .cse67)) .cse69)) .cse70) (or (and (or .cse71 .cse72 (and (or .cse62 .cse63 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse65))) (or (= (+ .cse66 .cse73) |ULTIMATE.start_main_~A~0#1|) .cse67))) (or .cse74 (and (or .cse62 (= (+ .cse75 .cse65) |ULTIMATE.start_main_~A~0#1|) .cse63) (or (= (+ .cse75 .cse66) |ULTIMATE.start_main_~A~0#1|) .cse67)))) .cse76 .cse77)))))) (or (let ((.cse88 (div .cse90 8)) (.cse83 (= (mod .cse82 2) 0)) (.cse89 (< .cse82 0))) (let ((.cse87 (and (not .cse83) .cse89)) (.cse86 (* (+ .cse88 .cse79) |ULTIMATE.start_main_~B~0#1|)) (.cse84 (not .cse89)) (.cse85 (* |ULTIMATE.start_main_~B~0#1| (+ (+ .cse88 1) .cse79)))) (and (or .cse58 .cse59 (and (or (and (or .cse83 .cse84 (= (+ .cse64 .cse85) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse64 .cse86) |ULTIMATE.start_main_~A~0#1|) .cse87)) .cse60 .cse61) (or .cse69 (and (or .cse83 .cse84 (= (+ .cse85 .cse68) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse68 .cse86) |ULTIMATE.start_main_~A~0#1|) .cse87)))) .cse70) (or (and (or (and (or .cse87 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse86))) (or .cse83 .cse84 (= |ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse85)))) .cse71 .cse72) (or .cse74 (and (or .cse87 (= (+ .cse75 .cse86) |ULTIMATE.start_main_~A~0#1|)) (or .cse83 .cse84 (= (+ .cse75 .cse85) |ULTIMATE.start_main_~A~0#1|))))) .cse76 .cse77)))) .cse91)))))))) (let ((.cse100 (+ (* |ULTIMATE.start_main_~B~0#1| (- 4)) .cse101 |ULTIMATE.start_main_~A~0#1|))) (and .cse43 (not (>= (+ .cse100 |ULTIMATE.start_main_~r~0#1|) .cse10)) .cse44 .cse46 .cse47 (= .cse100 |ULTIMATE.start_main_~B~0#1|) .cse31 (= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 1) .cse32 .cse49 .cse50 .cse52 .cse40 .cse8 .cse53 .cse54)))))) .cse22 (>= (+ .cse222 4) .cse30) (>= .cse222 |ULTIMATE.start_main_~d~0#1|) .cse223 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse41 .cse223) (and (or (not .cse41) (not .cse223)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~p~0#1| 4)) .cse8 (= (+ .cse222 .cse27) |ULTIMATE.start_main_~r~0#1|))))))))))))) [2023-02-17 02:09:48,157 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 61) the Hoare annotation is: true [2023-02-17 02:09:48,158 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse94 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse77 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse97 (- .cse77)) (.cse95 (+ .cse94 1))) (let ((.cse15 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse14 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse89 (+ |ULTIMATE.start_main_~q~0#1| .cse95)) (.cse109 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse36 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse74 (+ |ULTIMATE.start_main_~q~0#1| .cse94)) (.cse96 (+ (- 1) .cse97)) (.cse108 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse56 (- |ULTIMATE.start_main_~d~0#1|))) (let ((.cse54 (= .cse94 1)) (.cse35 (= .cse95 1)) (.cse9 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse76 (+ |ULTIMATE.start_main_~r~0#1| .cse56)) (.cse82 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse34 (not .cse108)) (.cse83 (+ |ULTIMATE.start_main_~r~0#1| .cse96)) (.cse106 (* |ULTIMATE.start_main_~B~0#1| .cse74)) (.cse53 (and .cse109 (not .cse36))) (.cse107 (* .cse89 |ULTIMATE.start_main_~B~0#1|)) (.cse85 (+ |ULTIMATE.start_main_~r~0#1| .cse97)) (.cse37 (not .cse109)) (.cse59 (and (not .cse14) .cse108)) (.cse104 (not .cse15)) (.cse33 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))) (let ((.cse19 (* 2 1)) (.cse18 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse0 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse10 (<= |ULTIMATE.start_main_~A~0#1| 5)) (.cse16 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse25 (or .cse104 .cse33)) (.cse90 (or (and (or (= (+ .cse106 .cse85) |ULTIMATE.start_main_~A~0#1|) .cse53) (or (= (+ .cse107 .cse85) |ULTIMATE.start_main_~A~0#1|) .cse36 .cse37)) .cse59)) (.cse23 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse91 (or .cse34 (and (or .cse53 (= (+ .cse83 .cse106) |ULTIMATE.start_main_~A~0#1|)) (or .cse36 .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse107 .cse83)))) .cse14)) (.cse7 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse8 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse30 (= |ULTIMATE.start_main_~A~0#1| (+ .cse76 (* |ULTIMATE.start_main_~B~0#1| .cse82)))) (.cse12 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse17 (or .cse9 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0) (not .cse9)))) (.cse75 (and (or (not .cse54) .cse53) (or .cse36 .cse37 (not .cse35)))) (.cse80 (+ .cse77 1))) (let ((.cse1 (let ((.cse105 (or .cse75 (and (or .cse34 .cse14 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse80)) |ULTIMATE.start_main_~A~0#1|)) (or .cse59 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse77 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse90 .cse23 .cse91 .cse25 .cse105 .cse7 .cse8 .cse9 .cse30 .cse12 .cse17) (and .cse90 .cse23 .cse91 .cse105 .cse7 .cse8 .cse9 .cse30 .cse33 .cse12 .cse17)))) (.cse2 (or .cse75 (and (or (= .cse77 |ULTIMATE.start_main_~B~0#1|) .cse59) (or .cse34 (= |ULTIMATE.start_main_~B~0#1| .cse80) .cse14)))) (.cse5 (<= 2 .cse77)) (.cse13 (or .cse104 .cse16)) (.cse3 (>= |ULTIMATE.start_main_~r~0#1| .cse77)) (.cse11 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse10) (and (or (not .cse0) (not .cse10)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse4 (* 2 .cse18)) (.cse6 (* 2 .cse19))) (or (and (<= 4 |ULTIMATE.start_main_~p~0#1|) .cse0 .cse1 .cse2 .cse3 (= .cse4 |ULTIMATE.start_main_~d~0#1|) .cse5 (= |ULTIMATE.start_main_~p~0#1| .cse6) .cse7 (= |ULTIMATE.start_main_~d~0#1| .cse6) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (= |ULTIMATE.start_main_~d~0#1| 1) .cse15 (>= |ULTIMATE.start_main_~p~0#1| 1) .cse16 .cse7 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse17) (and .cse0 (= |ULTIMATE.start_main_~d~0#1| .cse18) (= |ULTIMATE.start_main_~d~0#1| .cse19) (<= 2 |ULTIMATE.start_main_~p~0#1|) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 (= |ULTIMATE.start_main_~p~0#1| .cse19)) (let ((.cse20 (* 2 .cse6))) (and .cse0 (<= 8 |ULTIMATE.start_main_~p~0#1|) (>= |ULTIMATE.start_main_~r~0#1| .cse6) (= .cse20 |ULTIMATE.start_main_~p~0#1|) .cse7 (>= |ULTIMATE.start_main_~r~0#1| .cse4) .cse8 .cse9 (= .cse20 |ULTIMATE.start_main_~d~0#1|) (let ((.cse71 (div .cse80 2)) (.cse87 (div .cse95 2)) (.cse69 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse57 (div |ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse58 (+ .cse57 1)) (.cse100 (< .cse94 0)) (.cse49 (= (mod .cse94 2) 0)) (.cse99 (- .cse69)) (.cse63 (= (mod .cse77 2) 0)) (.cse98 (< .cse77 0)) (.cse86 (+ .cse87 1)) (.cse101 (< .cse95 0)) (.cse40 (= (mod .cse95 2) 0)) (.cse72 (+ .cse71 1)) (.cse103 (< .cse80 0)) (.cse44 (= (mod .cse80 2) 0)) (.cse102 (- .cse71)) (.cse62 (+ .cse69 1))) (let ((.cse65 (not (>= .cse85 .cse62))) (.cse67 (not (>= .cse85 .cse69))) (.cse70 (not (>= .cse83 .cse71))) (.cse47 (+ .cse83 .cse102)) (.cse46 (and .cse103 (not .cse44))) (.cse73 (not (>= .cse83 .cse72))) (.cse45 (not .cse103)) (.cse39 (+ .cse83 (+ (- 1) .cse102))) (.cse42 (and .cse101 (not .cse40))) (.cse43 (* (+ .cse89 .cse87) |ULTIMATE.start_main_~B~0#1|)) (.cse38 (* (+ .cse86 .cse89) |ULTIMATE.start_main_~B~0#1|)) (.cse41 (not .cse101)) (.cse66 (and (not .cse63) .cse98)) (.cse68 (+ .cse99 .cse85)) (.cse51 (and .cse100 (not .cse49))) (.cse52 (* (+ .cse57 .cse74) |ULTIMATE.start_main_~B~0#1|)) (.cse48 (not .cse100)) (.cse60 (+ (+ (- 1) .cse99) .cse85)) (.cse50 (* (+ .cse58 .cse74) |ULTIMATE.start_main_~B~0#1|)) (.cse64 (not .cse98)) (.cse78 (+ .cse76 .cse97)) (.cse81 (+ .cse76 .cse96))) (let ((.cse24 (or .cse15 (let ((.cse93 (* (+ .cse82 .cse95) |ULTIMATE.start_main_~B~0#1|)) (.cse92 (* (+ .cse82 .cse94) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse92 .cse78) |ULTIMATE.start_main_~A~0#1|) .cse53) (or .cse36 .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse93)))) .cse59) (or .cse34 (and (or .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse93)) .cse37) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse92)) .cse53)) .cse14))))) (.cse26 (or (and (or .cse35 .cse36 .cse37 (and (or .cse63 .cse64 (and (or .cse40 (= (+ .cse60 .cse38) |ULTIMATE.start_main_~A~0#1|) .cse41) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse43 .cse60))))) (or .cse66 (and (or .cse42 (= (+ .cse43 .cse68) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse38 .cse68)) .cse40 .cse41))))) (or (and (or .cse66 (and (or (= (+ .cse52 .cse68) |ULTIMATE.start_main_~A~0#1|) .cse51) (or (= (+ .cse68 .cse50) |ULTIMATE.start_main_~A~0#1|) .cse48 .cse49))) (or (and (or .cse51 (= (+ .cse52 .cse60) |ULTIMATE.start_main_~A~0#1|)) (or .cse48 .cse49 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse50)))) .cse63 .cse64)) .cse53 .cse54)) .cse59)) (.cse27 (or .cse15 (and .cse90 .cse91))) (.cse21 (or (and (or (not (= .cse86 1)) .cse40 .cse41) (or .cse42 (not (= .cse87 1)))) .cse36 (let ((.cse88 (+ .cse89 1))) (and (or .cse59 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 (* .cse88 .cse62))) .cse63 .cse64 .cse65) (or .cse66 .cse67 (= (+ (* .cse88 .cse69) .cse68) |ULTIMATE.start_main_~A~0#1|)))) (or .cse34 (and (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 (* .cse88 .cse71))) .cse46) (or .cse73 .cse44 .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse88 .cse72) .cse39)))) .cse14))) .cse37)) (.cse28 (or .cse75 (let ((.cse84 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse34 (not (>= |ULTIMATE.start_main_~r~0#1| .cse80)) .cse14 (= |ULTIMATE.start_main_~A~0#1| (+ .cse83 (* .cse84 .cse80)))) (or (not .cse3) .cse59 (= (+ (* .cse77 .cse84) .cse85) |ULTIMATE.start_main_~A~0#1|)))))) (.cse29 (or .cse75 (let ((.cse79 (+ .cse82 1))) (and (or (not (>= .cse76 .cse77)) .cse59 (= (+ .cse78 (* .cse77 .cse79)) |ULTIMATE.start_main_~A~0#1|)) (or .cse34 (not (>= .cse76 .cse80)) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse79 .cse80) .cse81)) .cse14))))) (.cse22 (or (and (or (not (= .cse57 1)) .cse51) (or (not (= .cse58 1)) .cse48 .cse49)) (let ((.cse61 (+ .cse74 1))) (and (or .cse59 (and (or (= (+ .cse60 (* .cse61 .cse62)) |ULTIMATE.start_main_~A~0#1|) .cse63 .cse64 .cse65) (or .cse66 .cse67 (= (+ .cse68 (* .cse61 .cse69)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse34 (and (or .cse70 .cse46 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 (* .cse61 .cse71)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse61 .cse72) .cse39)) .cse73 .cse44 .cse45)) .cse14))) .cse53)) (.cse31 (let ((.cse55 (* 2 |ULTIMATE.start_main_~p~0#1|))) (or (= .cse55 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ (+ (- (* 2 |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~r~0#1|) .cse56) (* |ULTIMATE.start_main_~B~0#1| (+ (+ |ULTIMATE.start_main_~q~0#1| .cse55) |ULTIMATE.start_main_~p~0#1|))))))) (.cse32 (or .cse34 .cse14 (and (or .cse35 .cse36 .cse37 (and (or (and (or (= (+ .cse38 .cse39) |ULTIMATE.start_main_~A~0#1|) .cse40 .cse41) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse43 .cse39)))) .cse44 .cse45) (or .cse46 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse38)) .cse40 .cse41) (or .cse42 (= (+ .cse47 .cse43) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse48 .cse49 (= (+ .cse47 .cse50) |ULTIMATE.start_main_~A~0#1|)) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse52)))) .cse46) (or .cse44 .cse45 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse39 .cse50)) .cse48 .cse49) (or (= (+ .cse52 .cse39) |ULTIMATE.start_main_~A~0#1|) .cse51)))) .cse53 .cse54))))) (or (and (or (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|) (and .cse21 .cse22)) .cse1 .cse2 .cse23 .cse24 .cse3 .cse25 .cse26 .cse5 .cse27 .cse28 .cse29 .cse30 .cse31 .cse13 .cse32 .cse14) (and .cse1 .cse2 .cse23 .cse24 .cse3 .cse25 .cse26 .cse5 .cse27 .cse21 .cse28 .cse29 .cse30 .cse22 .cse31 .cse13 .cse32 .cse14) (and .cse1 .cse2 .cse23 .cse24 .cse3 .cse26 .cse5 .cse27 .cse21 .cse28 .cse29 .cse30 .cse22 .cse31 .cse33 .cse13 .cse32 .cse14)))))) .cse10 .cse11 (= (* .cse4 2) |ULTIMATE.start_main_~d~0#1|) .cse12))))))))) [2023-02-17 02:09:48,158 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 02:09:48,159 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 02:09:48,163 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (let ((.cse174 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse219 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse146 (+ .cse174 1))) (let ((.cse144 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse147 (div .cse146 2)) (.cse239 (- .cse174)) (.cse87 (+ .cse219 1)) (.cse3 (- |ULTIMATE.start_main_~r~0#1|)) (.cse8 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (let ((.cse4 (- |ULTIMATE.start_main_~d~0#1|)) (.cse209 (+ .cse8 |ULTIMATE.start_main_~A~0#1|)) (.cse202 (+ |ULTIMATE.start_main_~A~0#1| .cse3)) (.cse7 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse32 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse82 (+ |ULTIMATE.start_main_~q~0#1| .cse87)) (.cse241 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse18 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse110 (+ |ULTIMATE.start_main_~q~0#1| .cse219)) (.cse238 (+ (- 1) .cse239)) (.cse240 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse129 (- .cse147)) (.cse40 (div .cse87 2)) (.cse131 (- .cse144)) (.cse95 (div |ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse96 (+ .cse95 1)) (.cse132 (+ (- 1) .cse131)) (.cse232 (< .cse219 0)) (.cse94 (= (mod .cse219 2) 0)) (.cse37 (= (mod .cse174 2) 0)) (.cse231 (< .cse174 0)) (.cse41 (+ .cse40 1)) (.cse233 (< .cse87 0)) (.cse24 (= (mod .cse87 2) 0)) (.cse130 (+ (- 1) .cse129)) (.cse234 (< .cse146 0)) (.cse27 (= (mod .cse146 2) 0)) (.cse230 (= .cse219 1)) (.cse225 (= .cse87 1)) (.cse20 (not .cse240)) (.cse133 (+ |ULTIMATE.start_main_~r~0#1| .cse238)) (.cse235 (* |ULTIMATE.start_main_~B~0#1| .cse110)) (.cse89 (and .cse241 (not .cse18))) (.cse236 (* .cse82 |ULTIMATE.start_main_~B~0#1|)) (.cse140 (+ |ULTIMATE.start_main_~r~0#1| .cse239)) (.cse19 (not .cse241)) (.cse39 (and (not .cse32) .cse240)) (.cse213 (not .cse7)) (.cse162 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse125 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse197 (div .cse202 2)) (.cse208 (< .cse209 0)) (.cse237 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse128 (+ |ULTIMATE.start_main_~r~0#1| .cse4)) (.cse45 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse195 (* 2 1))) (let ((.cse15 (* 2 .cse195)) (.cse179 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse10 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse42 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse115 (<= |ULTIMATE.start_main_~A~0#1| 5)) (.cse150 (* 2 .cse45)) (.cse31 (>= |ULTIMATE.start_main_~r~0#1| .cse146)) (.cse33 (>= |ULTIMATE.start_main_~r~0#1| .cse174)) (.cse173 (+ .cse128 .cse239)) (.cse176 (+ .cse128 .cse238)) (.cse198 (or (not .cse208) .cse237)) (.cse203 (+ .cse197 1)) (.cse207 (not .cse237)) (.cse175 (+ .cse125 1)) (.cse214 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse215 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse181 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse211 (* |ULTIMATE.start_main_~B~0#1| 4)) (.cse155 (or .cse213 .cse162)) (.cse46 (or (and (or (= (+ .cse235 .cse140) |ULTIMATE.start_main_~A~0#1|) .cse89) (or (= (+ .cse236 .cse140) |ULTIMATE.start_main_~A~0#1|) .cse18 .cse19)) .cse39)) (.cse154 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse47 (or .cse20 (and (or .cse89 (= (+ .cse133 .cse235) |ULTIMATE.start_main_~A~0#1|)) (or .cse18 .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse236 .cse133)))) .cse32)) (.cse149 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse97 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse151 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse12 (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 (* |ULTIMATE.start_main_~B~0#1| .cse125)))) (.cse14 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse172 (and (or (not .cse230) .cse89) (or .cse18 .cse19 (not .cse225)))) (.cse143 (+ .cse144 1)) (.cse145 (+ .cse147 1)) (.cse169 (+ .cse133 .cse129)) (.cse29 (and .cse234 (not .cse27))) (.cse28 (not .cse234)) (.cse170 (+ .cse133 .cse130)) (.cse21 (and .cse233 (not .cse24))) (.cse227 (* (+ .cse82 .cse40) |ULTIMATE.start_main_~B~0#1|)) (.cse226 (* (+ .cse41 .cse82) |ULTIMATE.start_main_~B~0#1|)) (.cse26 (not .cse233)) (.cse34 (and (not .cse37) .cse231)) (.cse167 (+ .cse131 .cse140)) (.cse91 (and .cse232 (not .cse94))) (.cse229 (* (+ .cse95 .cse110) |ULTIMATE.start_main_~B~0#1|)) (.cse93 (not .cse232)) (.cse163 (+ .cse132 .cse140)) (.cse228 (* (+ .cse96 .cse110) |ULTIMATE.start_main_~B~0#1|)) (.cse38 (not .cse231))) (let ((.cse9 (or (and (or .cse225 .cse18 .cse19 (and (or .cse37 .cse38 (and (or .cse24 (= (+ .cse163 .cse226) |ULTIMATE.start_main_~A~0#1|) .cse26) (or .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse163))))) (or .cse34 (and (or .cse21 (= (+ .cse227 .cse167) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse226 .cse167)) .cse24 .cse26))))) (or (and (or .cse34 (and (or (= (+ .cse229 .cse167) |ULTIMATE.start_main_~A~0#1|) .cse91) (or (= (+ .cse167 .cse228) |ULTIMATE.start_main_~A~0#1|) .cse93 .cse94))) (or (and (or .cse91 (= (+ .cse229 .cse163) |ULTIMATE.start_main_~A~0#1|)) (or .cse93 .cse94 (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse228)))) .cse37 .cse38)) .cse89 .cse230)) .cse39)) (.cse16 (or .cse20 .cse32 (and (or .cse225 .cse18 .cse19 (and (or (and (or (= (+ .cse226 .cse170) |ULTIMATE.start_main_~A~0#1|) .cse24 .cse26) (or .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ .cse227 .cse170)))) .cse27 .cse28) (or .cse29 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse169 .cse226)) .cse24 .cse26) (or .cse21 (= (+ .cse169 .cse227) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse93 .cse94 (= (+ .cse169 .cse228) |ULTIMATE.start_main_~A~0#1|)) (or .cse91 (= |ULTIMATE.start_main_~A~0#1| (+ .cse169 .cse229)))) .cse29) (or .cse27 .cse28 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse170 .cse228)) .cse93 .cse94) (or (= (+ .cse229 .cse170) |ULTIMATE.start_main_~A~0#1|) .cse91)))) .cse89 .cse230)))) (.cse121 (>= .cse128 .cse174)) (.cse124 (>= .cse128 .cse146)) (.cse75 (>= .cse133 .cse145)) (.cse76 (>= .cse133 .cse147)) (.cse64 (>= .cse140 .cse144)) (.cse58 (>= .cse140 .cse143)) (.cse43 (= |ULTIMATE.start_main_~d~0#1| 1)) (.cse152 (or .cse172 (and (or (= .cse174 |ULTIMATE.start_main_~B~0#1|) .cse39) (or .cse20 (= |ULTIMATE.start_main_~B~0#1| .cse146) .cse32)))) (.cse153 (let ((.cse224 (or .cse172 (and (or .cse20 .cse32 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse146)) |ULTIMATE.start_main_~A~0#1|)) (or .cse39 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse174 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse46 .cse154 .cse47 .cse155 .cse224 .cse149 .cse97 .cse151 .cse12 .cse14) (and .cse46 .cse154 .cse47 .cse224 .cse149 .cse97 .cse151 .cse12 .cse162 .cse14)))) (.cse156 (<= 2 .cse174)) (.cse182 (= (+ 4 0) |ULTIMATE.start_main_~q~0#1|)) (.cse185 (= .cse209 .cse211)) (.cse88 (>= |ULTIMATE.start_main_~p~0#1| 1)) (.cse190 (or .cse213 (= (+ .cse128 (* |ULTIMATE.start_main_~d~0#1| .cse125)) |ULTIMATE.start_main_~A~0#1|) .cse181)) (.cse193 (or (let ((.cse221 (div .cse215 4))) (let ((.cse220 (- .cse221))) (and (or .cse39 (= (+ (+ .cse128 .cse220) (* .cse221 .cse175)) |ULTIMATE.start_main_~A~0#1|) (not (>= .cse128 .cse221))) (let ((.cse222 (+ .cse221 1))) (or .cse20 (not (>= .cse128 .cse222)) (= (+ (+ (+ (- 1) .cse220) .cse128) (* .cse222 .cse175)) |ULTIMATE.start_main_~A~0#1|) .cse32))))) (let ((.cse223 (div .cse214 4))) (and (or (not (= 1 (+ .cse223 1))) .cse18 .cse19) (or (not (= .cse223 1)) .cse89))) (>= |ULTIMATE.start_main_~r~0#1| .cse215))) (.cse184 (or (and (= |ULTIMATE.start_main_~d~0#1| .cse197) .cse198) (and (= |ULTIMATE.start_main_~d~0#1| .cse203) .cse207 .cse208))) (.cse191 (or .cse154 (and .cse154 (<= 1 |ULTIMATE.start_main_~d~0#1|)))) (.cse6 (or .cse7 (let ((.cse218 (* (+ .cse125 .cse87) |ULTIMATE.start_main_~B~0#1|)) (.cse217 (* (+ .cse125 .cse219) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse217 .cse173) |ULTIMATE.start_main_~A~0#1|) .cse89) (or .cse18 .cse19 (= |ULTIMATE.start_main_~A~0#1| (+ .cse173 .cse218)))) .cse39) (or .cse20 (and (or .cse18 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse218)) .cse19) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse217)) .cse89)) .cse32))))) (.cse11 (or .cse7 (and .cse46 .cse47))) (.cse158 (or .cse172 (let ((.cse216 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse20 (not .cse31) .cse32 (= |ULTIMATE.start_main_~A~0#1| (+ .cse133 (* .cse216 .cse146)))) (or (not .cse33) .cse39 (= (+ (* .cse174 .cse216) .cse140) |ULTIMATE.start_main_~A~0#1|)))))) (.cse114 (>= |ULTIMATE.start_main_~A~0#1| .cse150)) (.cse13 (or (= .cse214 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ (+ (- .cse215) |ULTIMATE.start_main_~r~0#1|) .cse4) (* |ULTIMATE.start_main_~B~0#1| (+ (+ |ULTIMATE.start_main_~q~0#1| .cse214) |ULTIMATE.start_main_~p~0#1|)))))) (.cse116 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse42 .cse115) (and (or (not .cse42) (not .cse115)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse180 (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|)) (.cse178 (= .cse10 |ULTIMATE.start_main_~A~0#1|)) (.cse194 (= |ULTIMATE.start_main_~d~0#1| .cse45)) (.cse186 (= 2 |ULTIMATE.start_main_~p~0#1|)) (.cse212 (<= 2 |ULTIMATE.start_main_~d~0#1|)) (.cse17 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|)) (.cse161 (or .cse213 .cse179)) (.cse192 (= 2 |ULTIMATE.start_main_~d~0#1|)) (.cse210 (>= .cse10 .cse15)) (.cse196 (= |ULTIMATE.start_main_~p~0#1| .cse195))) (or (let ((.cse5 (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) .cse10)))) (and (let ((.cse2 (< .cse5 0)) (.cse0 (div (+ |ULTIMATE.start_main_~A~0#1| .cse3 .cse4) 2)) (.cse1 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0))) (or (and (= .cse0 |ULTIMATE.start_main_~d~0#1|) (or .cse1 (not .cse2))) (and .cse2 (= |ULTIMATE.start_main_~d~0#1| (+ .cse0 1)) (not .cse1)))) .cse6 .cse7 (= |ULTIMATE.start_main_~B~0#1| (+ (* (- 2) |ULTIMATE.start_main_~B~0#1|) .cse8 |ULTIMATE.start_main_~A~0#1|)) (= 2 .cse5) .cse9 (>= .cse10 |ULTIMATE.start_main_~d~0#1|) .cse11 .cse12 (= (+ (- 2) |ULTIMATE.start_main_~q~0#1|) 1) .cse13 .cse14 (not (>= (+ .cse10 .cse5) .cse15)) .cse16 (= (+ (* (- 1) 2) .cse17) 0))) (let ((.cse79 (= (mod .cse147 2) 0)) (.cse135 (< .cse147 0)) (.cse134 (- (div .cse146 4))) (.cse72 (= (mod .cse145 2) 0)) (.cse137 (< .cse145 0)) (.cse136 (- (div .cse145 2))) (.cse59 (= (mod .cse144 2) 0)) (.cse138 (< .cse144 0)) (.cse139 (- (div |ULTIMATE.start_main_~d~0#1| 8))) (.cse57 (= (mod .cse143 2) 0)) (.cse142 (- (div .cse143 2))) (.cse141 (< .cse143 0))) (let ((.cse44 (+ (* |ULTIMATE.start_main_~B~0#1| (- 4)) .cse8 |ULTIMATE.start_main_~A~0#1|)) (.cse30 (+ |ULTIMATE.start_main_~r~0#1| .cse129)) (.cse22 (+ .cse130 |ULTIMATE.start_main_~r~0#1|)) (.cse36 (+ .cse132 |ULTIMATE.start_main_~r~0#1|)) (.cse35 (+ .cse131 |ULTIMATE.start_main_~r~0#1|)) (.cse56 (not .cse141)) (.cse55 (+ (+ (- 1) .cse142) .cse140)) (.cse48 (+ .cse140 .cse142)) (.cse54 (and .cse141 (not .cse57))) (.cse63 (+ .cse140 .cse139)) (.cse62 (and (not .cse59) .cse138)) (.cse61 (+ (+ (- 1) .cse139) .cse140)) (.cse60 (not .cse138)) (.cse74 (+ .cse133 .cse136)) (.cse73 (and (not .cse72) .cse137)) (.cse71 (not .cse137)) (.cse70 (+ .cse133 (+ (- 1) .cse136))) (.cse80 (+ .cse134 .cse133)) (.cse81 (and (not .cse79) .cse135)) (.cse77 (not .cse135)) (.cse78 (+ .cse133 (+ (- 1) .cse134))) (.cse118 (+ .cse128 .cse132)) (.cse120 (+ .cse131 .cse128)) (.cse122 (+ .cse130 .cse128)) (.cse123 (+ .cse128 .cse129)) (.cse98 (+ |ULTIMATE.start_main_~A~0#1| (- 4)))) (and (or .cse18 .cse19 (let ((.cse25 (* |ULTIMATE.start_main_~B~0#1| (+ .cse41 |ULTIMATE.start_main_~q~0#1|))) (.cse23 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse40)))) (and (or .cse20 (and (or (and (or .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ .cse22 .cse23))) (or .cse24 (= (+ .cse25 .cse22) |ULTIMATE.start_main_~A~0#1|) .cse26)) .cse27 .cse28) (or .cse29 (and (or .cse21 (= (+ .cse30 .cse23) |ULTIMATE.start_main_~A~0#1|)) (or .cse24 (= |ULTIMATE.start_main_~A~0#1| (+ .cse25 .cse30)) .cse26)))) .cse31 .cse32) (or .cse33 (and (or .cse34 (and (or .cse21 (= (+ .cse35 .cse23) |ULTIMATE.start_main_~A~0#1|)) (or .cse24 (= |ULTIMATE.start_main_~A~0#1| (+ .cse35 .cse25)) .cse26))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse36 .cse25)) .cse24 .cse26) (or .cse21 (= (+ .cse36 .cse23) |ULTIMATE.start_main_~A~0#1|))) .cse37 .cse38)) .cse39)))) .cse42 .cse43 (not (>= (+ .cse44 |ULTIMATE.start_main_~r~0#1|) .cse45)) .cse46 .cse47 .cse7 (or .cse18 .cse19 (let ((.cse67 (= (mod .cse41 2) 0)) (.cse84 (< .cse41 0)) (.cse83 (div .cse41 2)) (.cse51 (= (mod .cse40 2) 0)) (.cse86 (< .cse40 0)) (.cse85 (div .cse87 4))) (let ((.cse53 (* (+ (+ .cse85 1) .cse82) |ULTIMATE.start_main_~B~0#1|)) (.cse52 (not .cse86)) (.cse50 (and (not .cse51) .cse86)) (.cse49 (* (+ .cse82 .cse85) |ULTIMATE.start_main_~B~0#1|)) (.cse68 (* |ULTIMATE.start_main_~B~0#1| (+ (+ .cse83 1) .cse82))) (.cse69 (not .cse84)) (.cse65 (and (not .cse67) .cse84)) (.cse66 (* |ULTIMATE.start_main_~B~0#1| (+ .cse82 .cse83)))) (and (or (and (or .cse21 (and (or .cse37 .cse38 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse49)) .cse50) (or .cse51 .cse52 (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse53)))) .cse54) (or (and (or .cse51 (= (+ .cse55 .cse53) |ULTIMATE.start_main_~A~0#1|) .cse52) (or .cse50 (= (+ .cse49 .cse55) |ULTIMATE.start_main_~A~0#1|))) .cse56 .cse57)) .cse58) (or .cse34 (and (or .cse59 .cse60 (and (or .cse50 (= (+ .cse49 .cse61) |ULTIMATE.start_main_~A~0#1|)) (or .cse51 .cse52 (= (+ .cse53 .cse61) |ULTIMATE.start_main_~A~0#1|)))) (or .cse62 (and (or .cse51 .cse52 (= (+ .cse63 .cse53) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse63 .cse49) |ULTIMATE.start_main_~A~0#1|) .cse50)))) .cse64))) (or (and (or .cse37 (and (or .cse54 (and (or .cse65 (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse66))) (or .cse67 (= (+ .cse68 .cse48) |ULTIMATE.start_main_~A~0#1|) .cse69))) (or .cse56 .cse57 (and (or (= (+ .cse55 .cse66) |ULTIMATE.start_main_~A~0#1|) .cse65) (or .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse68 .cse55)) .cse69)))) .cse38 .cse58) (or .cse34 .cse64 (and (or .cse59 (and (or .cse67 .cse69 (= |ULTIMATE.start_main_~A~0#1| (+ .cse68 .cse61))) (or .cse65 (= (+ .cse66 .cse61) |ULTIMATE.start_main_~A~0#1|))) .cse60) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse63 .cse66)) .cse65) (or .cse67 .cse69 (= (+ .cse63 .cse68) |ULTIMATE.start_main_~A~0#1|))) .cse62)))) .cse24 .cse26)) .cse39) (or .cse20 (and (or (and (or (and (or (and (or .cse51 (= (+ .cse70 .cse53) |ULTIMATE.start_main_~A~0#1|) .cse52) (or .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse49)))) .cse71 .cse72) (or .cse73 (and (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse74 .cse53)) .cse52) (or .cse50 (= (+ .cse74 .cse49) |ULTIMATE.start_main_~A~0#1|))))) .cse27 .cse28 .cse75) (or .cse29 .cse76 (and (or .cse77 (and (or (= (+ .cse78 .cse53) |ULTIMATE.start_main_~A~0#1|) .cse51 .cse52) (or .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse49)))) .cse79) (or (and (or .cse51 (= (+ .cse53 .cse80) |ULTIMATE.start_main_~A~0#1|) .cse52) (or .cse50 (= |ULTIMATE.start_main_~A~0#1| (+ .cse49 .cse80)))) .cse81)))) .cse21) (or .cse24 .cse26 (and (or (and (or .cse77 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse68 .cse78)) .cse67 .cse69) (or .cse65 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse66)))) .cse79) (or (and (or (= (+ .cse68 .cse80) |ULTIMATE.start_main_~A~0#1|) .cse67 .cse69) (or .cse65 (= |ULTIMATE.start_main_~A~0#1| (+ .cse66 .cse80)))) .cse81)) .cse29 .cse76) (or (and (or .cse71 (and (or .cse67 .cse69 (= (+ .cse70 .cse68) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse66)) .cse65)) .cse72) (or .cse73 (and (or .cse67 (= (+ .cse74 .cse68) |ULTIMATE.start_main_~A~0#1|) .cse69) (or .cse65 (= (+ .cse74 .cse66) |ULTIMATE.start_main_~A~0#1|))))) .cse27 .cse28 .cse75)))) .cse32))))) (= .cse44 |ULTIMATE.start_main_~B~0#1|) .cse88 (= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 1) (or .cse89 (let ((.cse92 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse96))) (.cse90 (* |ULTIMATE.start_main_~B~0#1| (+ .cse95 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse20 (and (or .cse29 (and (or (= (+ .cse90 .cse30) |ULTIMATE.start_main_~A~0#1|) .cse91) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse30 .cse92)) .cse93 .cse94))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse22 .cse92)) .cse93 .cse94) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse90 .cse22)) .cse91)) .cse27 .cse28)) .cse31 .cse32) (or .cse33 (and (or .cse37 .cse38 (and (or .cse93 (= |ULTIMATE.start_main_~A~0#1| (+ .cse36 .cse92)) .cse94) (or .cse91 (= |ULTIMATE.start_main_~A~0#1| (+ .cse36 .cse90))))) (or .cse34 (and (or (= (+ .cse35 .cse92) |ULTIMATE.start_main_~A~0#1|) .cse93 .cse94) (or (= (+ .cse35 .cse90) |ULTIMATE.start_main_~A~0#1|) .cse91)))) .cse39)))) .cse97 .cse12 (>= (+ .cse98 4) .cse15) (or (let ((.cse101 (= (mod .cse96 2) 0)) (.cse109 (< .cse96 0)) (.cse111 (div .cse96 2)) (.cse107 (= (mod .cse95 2) 0)) (.cse112 (< .cse95 0)) (.cse113 (div |ULTIMATE.start_main_~p~0#1| 8))) (let ((.cse104 (* |ULTIMATE.start_main_~B~0#1| (+ .cse110 .cse113))) (.cse105 (and (not .cse107) .cse112)) (.cse106 (* |ULTIMATE.start_main_~B~0#1| (+ (+ .cse113 1) .cse110))) (.cse108 (not .cse112)) (.cse103 (* |ULTIMATE.start_main_~B~0#1| (+ (+ 1 .cse111) .cse110))) (.cse102 (not .cse109)) (.cse99 (* (+ .cse110 .cse111) |ULTIMATE.start_main_~B~0#1|)) (.cse100 (and (not .cse101) .cse109))) (and (or .cse39 (and (or (and (or (and (or .cse54 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse99)) .cse100) (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse103))))) (or .cse56 .cse57 (and (or .cse100 (= (+ .cse99 .cse55) |ULTIMATE.start_main_~A~0#1|)) (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse103 .cse55)))))) .cse37 .cse38 .cse58) (or .cse34 .cse64 (and (or .cse59 (and (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse103 .cse61))) (or (= (+ .cse99 .cse61) |ULTIMATE.start_main_~A~0#1|) .cse100)) .cse60) (or (and (or .cse101 (= (+ .cse63 .cse103) |ULTIMATE.start_main_~A~0#1|) .cse102) (or .cse100 (= (+ .cse63 .cse99) |ULTIMATE.start_main_~A~0#1|))) .cse62)))) .cse93 .cse94) (or (and (or .cse37 (and (or .cse56 .cse57 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse55 .cse104)) .cse105) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse55 .cse106)) .cse107 .cse108))) (or (and (or .cse107 .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse48 .cse106))) (or .cse105 (= (+ .cse48 .cse104) |ULTIMATE.start_main_~A~0#1|))) .cse54)) .cse38 .cse58) (or .cse34 (and (or (and (or .cse107 .cse108 (= |ULTIMATE.start_main_~A~0#1| (+ .cse63 .cse106))) (or (= (+ .cse63 .cse104) |ULTIMATE.start_main_~A~0#1|) .cse105)) .cse62) (or .cse59 (and (or (= (+ .cse61 .cse104) |ULTIMATE.start_main_~A~0#1|) .cse105) (or (= (+ .cse61 .cse106) |ULTIMATE.start_main_~A~0#1|) .cse107 .cse108)) .cse60)) .cse64)) .cse91))) (or .cse20 (and (or (and (or (and (or .cse73 (and (or .cse105 (= (+ .cse74 .cse104) |ULTIMATE.start_main_~A~0#1|)) (or .cse107 (= (+ .cse74 .cse106) |ULTIMATE.start_main_~A~0#1|) .cse108))) (or .cse71 (and (or .cse107 (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse106)) .cse108) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse104)) .cse105)) .cse72)) .cse27 .cse28 .cse75) (or (and (or .cse77 (and (or (= (+ .cse78 .cse104) |ULTIMATE.start_main_~A~0#1|) .cse105) (or .cse107 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse106)) .cse108)) .cse79) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse104 .cse80)) .cse105) (or .cse107 (= (+ .cse106 .cse80) |ULTIMATE.start_main_~A~0#1|) .cse108)) .cse81)) .cse29 .cse76)) .cse91) (or (and (or (and (or (and (or (= (+ .cse74 .cse103) |ULTIMATE.start_main_~A~0#1|) .cse101 .cse102) (or .cse100 (= (+ .cse74 .cse99) |ULTIMATE.start_main_~A~0#1|))) .cse73) (or .cse71 .cse72 (and (or .cse101 .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse103))) (or .cse100 (= |ULTIMATE.start_main_~A~0#1| (+ .cse70 .cse99)))))) .cse27 .cse28 .cse75) (or (and (or (and (or .cse100 (= (+ .cse99 .cse80) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse103 .cse80) |ULTIMATE.start_main_~A~0#1|) .cse101 .cse102)) .cse81) (or .cse77 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse103)) .cse101 .cse102) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse99)) .cse100)) .cse79)) .cse29 .cse76)) .cse93 .cse94)) .cse32)))) .cse89) (>= .cse98 |ULTIMATE.start_main_~d~0#1|) .cse114 .cse115 .cse116 (= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~p~0#1| 4)) .cse14 (or (let ((.cse119 (* (+ .cse95 .cse125) |ULTIMATE.start_main_~B~0#1|)) (.cse117 (* (+ .cse125 .cse96) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse39 (and (or (and (or .cse93 .cse94 (= (+ .cse117 .cse118) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse118 .cse119)) .cse91)) .cse37 .cse38) (or .cse34 (and (or .cse91 (= (+ .cse120 .cse119) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse117 .cse120) |ULTIMATE.start_main_~A~0#1|) .cse93 .cse94)))) .cse121) (or .cse20 (and (or (and (or (= (+ .cse122 .cse117) |ULTIMATE.start_main_~A~0#1|) .cse93 .cse94) (or (= (+ .cse122 .cse119) |ULTIMATE.start_main_~A~0#1|) .cse91)) .cse27 .cse28) (or (and (or (= (+ .cse119 .cse123) |ULTIMATE.start_main_~A~0#1|) .cse91) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse117 .cse123)) .cse93 .cse94)) .cse29)) .cse124 .cse32))) .cse89) (or .cse18 (let ((.cse126 (* (+ .cse41 .cse125) |ULTIMATE.start_main_~B~0#1|)) (.cse127 (* (+ .cse125 .cse40) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse39 .cse121 (and (or .cse37 (and (or .cse24 .cse26 (= |ULTIMATE.start_main_~A~0#1| (+ .cse118 .cse126))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse118 .cse127)) .cse21)) .cse38) (or .cse34 (and (or .cse24 (= |ULTIMATE.start_main_~A~0#1| (+ .cse120 .cse126)) .cse26) (or (= (+ .cse127 .cse120) |ULTIMATE.start_main_~A~0#1|) .cse21))))) (or .cse20 .cse124 (and (or (and (or .cse24 (= |ULTIMATE.start_main_~A~0#1| (+ .cse122 .cse126)) .cse26) (or .cse21 (= |ULTIMATE.start_main_~A~0#1| (+ .cse122 .cse127)))) .cse27 .cse28) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse126 .cse123)) .cse24 .cse26) (or .cse21 (= (+ .cse127 .cse123) |ULTIMATE.start_main_~A~0#1|))) .cse29)) .cse32))) .cse19) (= (+ .cse98 .cse4) |ULTIMATE.start_main_~r~0#1|)))) (let ((.cse148 (* 2 .cse15))) (and .cse42 (<= 8 |ULTIMATE.start_main_~p~0#1|) (>= |ULTIMATE.start_main_~r~0#1| .cse15) (= .cse148 |ULTIMATE.start_main_~p~0#1|) .cse149 (>= |ULTIMATE.start_main_~r~0#1| .cse150) .cse97 .cse151 (= .cse148 |ULTIMATE.start_main_~d~0#1|) .cse115 .cse116 (= (* .cse150 2) |ULTIMATE.start_main_~d~0#1|) .cse14 (let ((.cse165 (not .cse58)) (.cse166 (not .cse64)) (.cse168 (not .cse76)) (.cse171 (not .cse75))) (let ((.cse157 (or (and (or (not (= .cse41 1)) .cse24 .cse26) (or .cse21 (not (= .cse40 1)))) .cse18 (let ((.cse177 (+ .cse82 1))) (and (or .cse39 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 (* .cse177 .cse143))) .cse37 .cse38 .cse165) (or .cse34 .cse166 (= (+ (* .cse177 .cse144) .cse167) |ULTIMATE.start_main_~A~0#1|)))) (or .cse20 (and (or .cse168 (= |ULTIMATE.start_main_~A~0#1| (+ .cse169 (* .cse177 .cse147))) .cse29) (or .cse171 .cse27 .cse28 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse177 .cse145) .cse170)))) .cse32))) .cse19)) (.cse159 (or .cse172 (and (or (not .cse121) .cse39 (= (+ .cse173 (* .cse174 .cse175)) |ULTIMATE.start_main_~A~0#1|)) (or .cse20 (not .cse124) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse175 .cse146) .cse176)) .cse32)))) (.cse160 (or (and (or (not (= .cse95 1)) .cse91) (or (not (= .cse96 1)) .cse93 .cse94)) (let ((.cse164 (+ .cse110 1))) (and (or .cse39 (and (or (= (+ .cse163 (* .cse164 .cse143)) |ULTIMATE.start_main_~A~0#1|) .cse37 .cse38 .cse165) (or .cse34 .cse166 (= (+ .cse167 (* .cse164 .cse144)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse20 (and (or .cse168 .cse29 (= |ULTIMATE.start_main_~A~0#1| (+ .cse169 (* .cse164 .cse147)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse164 .cse145) .cse170)) .cse171 .cse27 .cse28)) .cse32))) .cse89))) (or (and .cse152 .cse153 .cse154 .cse6 .cse33 .cse155 .cse9 .cse156 .cse11 .cse157 .cse158 .cse159 .cse12 .cse160 .cse13 .cse161 .cse16 .cse32) (and .cse152 .cse153 .cse154 .cse6 .cse33 .cse9 .cse156 .cse11 .cse157 .cse158 .cse159 .cse12 .cse160 .cse13 .cse162 .cse161 .cse16 .cse32)))))) (and .cse178 .cse43 .cse46 .cse47 .cse7 .cse179 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse12 .cse14 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1)) .cse180) (and .cse7 .cse179 .cse149 .cse151 .cse14) (and .cse152 .cse153 .cse33 (= .cse150 |ULTIMATE.start_main_~d~0#1|) .cse156 (= |ULTIMATE.start_main_~p~0#1| .cse15) .cse149 (= |ULTIMATE.start_main_~d~0#1| .cse15) .cse181 .cse151 .cse14 .cse161 .cse32) (let ((.cse183 (+ |ULTIMATE.start_main_~r~0#1| 4))) (and .cse42 .cse182 (= |ULTIMATE.start_main_~A~0#1| .cse183) .cse154 .cse184 .cse185 .cse186 (<= 2 |ULTIMATE.start_main_~p~0#1|) .cse181 .cse97 (= |ULTIMATE.start_main_~q~0#1| 4) (let ((.cse188 (= (mod |ULTIMATE.start_main_~q~0#1| 2) 0)) (.cse189 (< |ULTIMATE.start_main_~q~0#1| 0)) (.cse187 (div |ULTIMATE.start_main_~q~0#1| 2))) (or (and (= .cse187 |ULTIMATE.start_main_~p~0#1|) (or .cse188 (not .cse189))) (and (not .cse188) .cse189 (= (+ .cse187 1) |ULTIMATE.start_main_~p~0#1|)))) .cse12 .cse190 .cse114 .cse13 .cse115 .cse116 .cse14 .cse191 .cse192 (>= .cse183 .cse15) .cse193)) (and .cse194 (= |ULTIMATE.start_main_~d~0#1| .cse195) .cse149 .cse97 .cse151 .cse14 .cse196) (and .cse182 .cse154 .cse7 .cse185 .cse88 (or (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse197)) .cse198 (let ((.cse201 (= (mod .cse197 2) 0)) (.cse199 (< .cse197 0)) (.cse200 (div .cse202 4))) (or (and .cse199 (= (+ .cse200 1) |ULTIMATE.start_main_~d~0#1|) (not .cse201)) (and (or .cse201 (not .cse199)) (= |ULTIMATE.start_main_~d~0#1| .cse200))))) (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse203)) (let ((.cse205 (= (mod .cse203 2) 0)) (.cse204 (< .cse203 0)) (.cse206 (div .cse203 2))) (or (and .cse204 (not .cse205) (= (+ .cse206 1) |ULTIMATE.start_main_~d~0#1|)) (and (or .cse205 (not .cse204)) (= .cse206 |ULTIMATE.start_main_~d~0#1|)))) .cse207 .cse208)) .cse190 .cse114 .cse14 .cse191 .cse193) (and .cse184 .cse7 (= (+ (* (- 1) .cse195) |ULTIMATE.start_main_~q~0#1|) 0) .cse14 .cse191 (= .cse209 .cse45)) (and (<= 4 |ULTIMATE.start_main_~p~0#1|) .cse42 (= |ULTIMATE.start_main_~p~0#1| 4) .cse178 .cse154 .cse6 .cse210 .cse155 .cse11 .cse158 (= |ULTIMATE.start_main_~d~0#1| .cse211) .cse212 .cse97 (= |ULTIMATE.start_main_~d~0#1| 4) .cse12 (= (+ |ULTIMATE.start_main_~A~0#1| .cse4) |ULTIMATE.start_main_~r~0#1|) .cse114 .cse13 .cse115 .cse116 .cse14 .cse161 .cse180) (and .cse178 .cse154 .cse155 .cse194 .cse186 .cse212 .cse12 (= .cse17 0) .cse14 .cse161 .cse192 (not .cse210) .cse196))))))))) [2023-02-17 02:09:48,163 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-02-17 02:09:48,168 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse94 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse221 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse97 (+ .cse94 1))) (let ((.cse78 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse83 (div .cse97 2)) (.cse241 (- .cse94)) (.cse155 (+ .cse221 1)) (.cse30 (- |ULTIMATE.start_main_~r~0#1|)) (.cse34 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (let ((.cse31 (- |ULTIMATE.start_main_~d~0#1|)) (.cse211 (+ .cse34 |ULTIMATE.start_main_~A~0#1|)) (.cse10 (+ |ULTIMATE.start_main_~A~0#1| .cse30)) (.cse1 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse61 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse106 (+ |ULTIMATE.start_main_~q~0#1| .cse155)) (.cse243 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse104 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse89 (+ |ULTIMATE.start_main_~q~0#1| .cse221)) (.cse240 (+ (- 1) .cse241)) (.cse242 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse179 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse183 (- .cse83)) (.cse103 (div .cse155 2)) (.cse185 (- .cse78)) (.cse63 (div |ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse65 (+ .cse63 1)) (.cse186 (+ (- 1) .cse185)) (.cse230 (< .cse221 0)) (.cse67 (= (mod .cse221 2) 0)) (.cse72 (= (mod .cse94 2) 0)) (.cse229 (< .cse94 0)) (.cse99 (+ .cse103 1)) (.cse231 (< .cse155 0)) (.cse100 (= (mod .cse155 2) 0)) (.cse184 (+ (- 1) .cse183)) (.cse232 (< .cse97 0)) (.cse87 (= (mod .cse97 2) 0)) (.cse22 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse95 (+ .cse179 1)) (.cse216 (* 2 |ULTIMATE.start_main_~p~0#1|)) (.cse217 (* 2 |ULTIMATE.start_main_~d~0#1|)) (.cse197 (not (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|))) (.cse228 (= .cse221 1)) (.cse223 (= .cse155 1)) (.cse79 (not .cse242)) (.cse187 (+ |ULTIMATE.start_main_~r~0#1| .cse240)) (.cse237 (* |ULTIMATE.start_main_~B~0#1| .cse89)) (.cse90 (and .cse243 (not .cse104))) (.cse238 (* .cse106 |ULTIMATE.start_main_~B~0#1|)) (.cse194 (+ |ULTIMATE.start_main_~r~0#1| .cse241)) (.cse107 (not .cse243)) (.cse68 (and (not .cse61) .cse242)) (.cse215 (not .cse1)) (.cse62 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse5 (div .cse10 2)) (.cse16 (< .cse211 0)) (.cse239 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse182 (+ |ULTIMATE.start_main_~r~0#1| .cse31)) (.cse120 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse199 (* 2 1))) (let ((.cse40 (* 2 .cse199)) (.cse24 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse36 (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse43 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse49 (<= |ULTIMATE.start_main_~A~0#1| 5)) (.cse46 (* 2 .cse120)) (.cse116 (>= |ULTIMATE.start_main_~r~0#1| .cse97)) (.cse53 (>= |ULTIMATE.start_main_~r~0#1| .cse94)) (.cse93 (+ .cse182 .cse241)) (.cse98 (+ .cse182 .cse240)) (.cse6 (or (not .cse16) .cse239)) (.cse11 (+ .cse5 1)) (.cse15 (not .cse239)) (.cse213 (* |ULTIMATE.start_main_~B~0#1| 4)) (.cse54 (or .cse215 .cse62)) (.cse21 (or (and (or (= (+ .cse237 .cse194) |ULTIMATE.start_main_~A~0#1|) .cse90) (or (= (+ .cse238 .cse194) |ULTIMATE.start_main_~A~0#1|) .cse104 .cse107)) .cse68)) (.cse23 (or .cse79 (and (or .cse90 (= (+ .cse187 .cse237) |ULTIMATE.start_main_~A~0#1|)) (or .cse104 .cse107 (= |ULTIMATE.start_main_~A~0#1| (+ .cse238 .cse187)))) .cse61)) (.cse45 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse47 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse48 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse25 (= |ULTIMATE.start_main_~A~0#1| (+ .cse182 (* |ULTIMATE.start_main_~B~0#1| .cse179)))) (.cse18 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse91 (and (or (not .cse228) .cse90) (or .cse104 .cse107 (not .cse223)))) (.cse84 (+ .cse83 1)) (.cse71 (+ .cse78 1)) (.cse208 (or .cse215 (= (+ .cse182 (* |ULTIMATE.start_main_~d~0#1| .cse179)) |ULTIMATE.start_main_~A~0#1|) .cse197)) (.cse209 (or (let ((.cse234 (div .cse217 4))) (let ((.cse233 (- .cse234))) (and (or .cse68 (= (+ (+ .cse182 .cse233) (* .cse234 .cse95)) |ULTIMATE.start_main_~A~0#1|) (not (>= .cse182 .cse234))) (let ((.cse235 (+ .cse234 1))) (or .cse79 (not (>= .cse182 .cse235)) (= (+ (+ (+ (- 1) .cse233) .cse182) (* .cse235 .cse95)) |ULTIMATE.start_main_~A~0#1|) .cse61))))) (let ((.cse236 (div .cse216 4))) (and (or (not (= 1 (+ .cse236 1))) .cse104 .cse107) (or (not (= .cse236 1)) .cse90))) (>= |ULTIMATE.start_main_~r~0#1| .cse217))) (.cse39 (or .cse22 (and .cse22 (<= 1 |ULTIMATE.start_main_~d~0#1|)))) (.cse82 (+ .cse187 .cse183)) (.cse81 (and .cse232 (not .cse87))) (.cse88 (not .cse232)) (.cse85 (+ .cse187 .cse184)) (.cse102 (and .cse231 (not .cse100))) (.cse225 (* (+ .cse106 .cse103) |ULTIMATE.start_main_~B~0#1|)) (.cse224 (* (+ .cse99 .cse106) |ULTIMATE.start_main_~B~0#1|)) (.cse101 (not .cse231)) (.cse75 (and (not .cse72) .cse229)) (.cse77 (+ .cse185 .cse194)) (.cse64 (and .cse230 (not .cse67))) (.cse227 (* (+ .cse63 .cse89) |ULTIMATE.start_main_~B~0#1|)) (.cse66 (not .cse230)) (.cse69 (+ .cse186 .cse194)) (.cse226 (* (+ .cse65 .cse89) |ULTIMATE.start_main_~B~0#1|)) (.cse73 (not .cse229))) (let ((.cse35 (or (and (or .cse223 .cse104 .cse107 (and (or .cse72 .cse73 (and (or .cse100 (= (+ .cse69 .cse224) |ULTIMATE.start_main_~A~0#1|) .cse101) (or .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse225 .cse69))))) (or .cse75 (and (or .cse102 (= (+ .cse225 .cse77) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse224 .cse77)) .cse100 .cse101))))) (or (and (or .cse75 (and (or (= (+ .cse227 .cse77) |ULTIMATE.start_main_~A~0#1|) .cse64) (or (= (+ .cse77 .cse226) |ULTIMATE.start_main_~A~0#1|) .cse66 .cse67))) (or (and (or .cse64 (= (+ .cse227 .cse69) |ULTIMATE.start_main_~A~0#1|)) (or .cse66 .cse67 (= |ULTIMATE.start_main_~A~0#1| (+ .cse69 .cse226)))) .cse72 .cse73)) .cse90 .cse228)) .cse68)) (.cse41 (or .cse79 .cse61 (and (or .cse223 .cse104 .cse107 (and (or (and (or (= (+ .cse224 .cse85) |ULTIMATE.start_main_~A~0#1|) .cse100 .cse101) (or .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse225 .cse85)))) .cse87 .cse88) (or .cse81 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse82 .cse224)) .cse100 .cse101) (or .cse102 (= (+ .cse82 .cse225) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse66 .cse67 (= (+ .cse82 .cse226) |ULTIMATE.start_main_~A~0#1|)) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse82 .cse227)))) .cse81) (or .cse87 .cse88 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse85 .cse226)) .cse66 .cse67) (or (= (+ .cse227 .cse85) |ULTIMATE.start_main_~A~0#1|) .cse64)))) .cse90 .cse228)))) (.cse20 (= |ULTIMATE.start_main_~d~0#1| 1)) (.cse3 (>= |ULTIMATE.start_main_~p~0#1| 1)) (.cse4 (or (and .cse22 .cse208 .cse39 .cse209) (and .cse22 .cse39))) (.cse111 (>= .cse194 .cse71)) (.cse110 (>= .cse194 .cse78)) (.cse108 (>= .cse187 .cse84)) (.cse109 (>= .cse187 .cse83)) (.cse92 (>= .cse182 .cse94)) (.cse96 (>= .cse182 .cse97)) (.cse51 (or .cse91 (and (or (= .cse94 |ULTIMATE.start_main_~B~0#1|) .cse68) (or .cse79 (= |ULTIMATE.start_main_~B~0#1| .cse97) .cse61)))) (.cse52 (let ((.cse222 (or .cse91 (and (or .cse79 .cse61 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse97)) |ULTIMATE.start_main_~A~0#1|)) (or .cse68 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse94 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse21 .cse22 .cse23 .cse54 .cse222 .cse45 .cse47 .cse48 .cse25 .cse18) (and .cse21 .cse22 .cse23 .cse222 .cse45 .cse47 .cse48 .cse25 .cse62 .cse18)))) (.cse55 (<= 2 .cse94)) (.cse0 (= (+ 4 0) |ULTIMATE.start_main_~q~0#1|)) (.cse2 (= .cse211 .cse213)) (.cse202 (or (and (= |ULTIMATE.start_main_~d~0#1| .cse5) .cse6) (and (= |ULTIMATE.start_main_~d~0#1| .cse11) .cse15 .cse16))) (.cse33 (or .cse1 (let ((.cse220 (* (+ .cse179 .cse155) |ULTIMATE.start_main_~B~0#1|)) (.cse219 (* (+ .cse179 .cse221) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse219 .cse93) |ULTIMATE.start_main_~A~0#1|) .cse90) (or .cse104 .cse107 (= |ULTIMATE.start_main_~A~0#1| (+ .cse93 .cse220)))) .cse68) (or .cse79 (and (or .cse104 (= |ULTIMATE.start_main_~A~0#1| (+ .cse98 .cse220)) .cse107) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse98 .cse219)) .cse90)) .cse61))))) (.cse37 (or .cse1 (and .cse21 .cse23))) (.cse57 (or .cse91 (let ((.cse218 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse79 (not .cse116) .cse61 (= |ULTIMATE.start_main_~A~0#1| (+ .cse187 (* .cse218 .cse97)))) (or (not .cse53) .cse68 (= (+ (* .cse94 .cse218) .cse194) |ULTIMATE.start_main_~A~0#1|)))))) (.cse17 (>= |ULTIMATE.start_main_~A~0#1| .cse46)) (.cse38 (or (= .cse216 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ (+ (- .cse217) |ULTIMATE.start_main_~r~0#1|) .cse31) (* |ULTIMATE.start_main_~B~0#1| (+ (+ |ULTIMATE.start_main_~q~0#1| .cse216) |ULTIMATE.start_main_~p~0#1|)))))) (.cse50 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse43 .cse49) (and (or (not .cse43) (not .cse49)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse26 (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|)) (.cse19 (= .cse36 |ULTIMATE.start_main_~A~0#1|)) (.cse198 (= |ULTIMATE.start_main_~d~0#1| .cse120)) (.cse203 (= 2 |ULTIMATE.start_main_~p~0#1|)) (.cse214 (<= 2 |ULTIMATE.start_main_~d~0#1|)) (.cse42 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|)) (.cse60 (or .cse215 .cse24)) (.cse210 (= 2 |ULTIMATE.start_main_~d~0#1|)) (.cse212 (>= .cse36 .cse40)) (.cse200 (= |ULTIMATE.start_main_~p~0#1| .cse199))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse5)) .cse6 (let ((.cse9 (= (mod .cse5 2) 0)) (.cse7 (< .cse5 0)) (.cse8 (div .cse10 4))) (or (and .cse7 (= (+ .cse8 1) |ULTIMATE.start_main_~d~0#1|) (not .cse9)) (and (or .cse9 (not .cse7)) (= |ULTIMATE.start_main_~d~0#1| .cse8))))) (and (not (>= |ULTIMATE.start_main_~r~0#1| .cse11)) (let ((.cse13 (= (mod .cse11 2) 0)) (.cse12 (< .cse11 0)) (.cse14 (div .cse11 2))) (or (and .cse12 (not .cse13) (= (+ .cse14 1) |ULTIMATE.start_main_~d~0#1|)) (and (or .cse13 (not .cse12)) (= .cse14 |ULTIMATE.start_main_~d~0#1|)))) .cse15 .cse16)) .cse17 .cse18) (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse1 .cse24 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse25 .cse18 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1)) .cse26) (let ((.cse32 (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) .cse36)))) (and (let ((.cse29 (< .cse32 0)) (.cse27 (div (+ |ULTIMATE.start_main_~A~0#1| .cse30 .cse31) 2)) (.cse28 (= (mod (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0))) (or (and (= .cse27 |ULTIMATE.start_main_~d~0#1|) (or .cse28 (not .cse29))) (and .cse29 (= |ULTIMATE.start_main_~d~0#1| (+ .cse27 1)) (not .cse28)))) .cse33 .cse1 (= |ULTIMATE.start_main_~B~0#1| (+ (* (- 2) |ULTIMATE.start_main_~B~0#1|) .cse34 |ULTIMATE.start_main_~A~0#1|)) (= 2 .cse32) .cse35 (>= .cse36 |ULTIMATE.start_main_~d~0#1|) .cse37 .cse25 (= (+ (- 2) |ULTIMATE.start_main_~q~0#1|) 1) .cse38 .cse18 .cse39 (not (>= (+ .cse36 .cse32) .cse40)) .cse41 (= (+ (* (- 1) 2) .cse42) 0))) (let ((.cse44 (* 2 .cse40))) (and .cse43 (<= 8 |ULTIMATE.start_main_~p~0#1|) (>= |ULTIMATE.start_main_~r~0#1| .cse40) (= .cse44 |ULTIMATE.start_main_~p~0#1|) .cse45 (>= |ULTIMATE.start_main_~r~0#1| .cse46) .cse47 .cse48 (= .cse44 |ULTIMATE.start_main_~d~0#1|) .cse49 .cse50 (= (* .cse46 2) |ULTIMATE.start_main_~d~0#1|) .cse18 (let ((.cse74 (not .cse111)) (.cse76 (not .cse110)) (.cse80 (not .cse109)) (.cse86 (not .cse108))) (let ((.cse56 (or (and (or (not (= .cse99 1)) .cse100 .cse101) (or .cse102 (not (= .cse103 1)))) .cse104 (let ((.cse105 (+ .cse106 1))) (and (or .cse68 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse69 (* .cse105 .cse71))) .cse72 .cse73 .cse74) (or .cse75 .cse76 (= (+ (* .cse105 .cse78) .cse77) |ULTIMATE.start_main_~A~0#1|)))) (or .cse79 (and (or .cse80 (= |ULTIMATE.start_main_~A~0#1| (+ .cse82 (* .cse105 .cse83))) .cse81) (or .cse86 .cse87 .cse88 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse105 .cse84) .cse85)))) .cse61))) .cse107)) (.cse58 (or .cse91 (and (or (not .cse92) .cse68 (= (+ .cse93 (* .cse94 .cse95)) |ULTIMATE.start_main_~A~0#1|)) (or .cse79 (not .cse96) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse95 .cse97) .cse98)) .cse61)))) (.cse59 (or (and (or (not (= .cse63 1)) .cse64) (or (not (= .cse65 1)) .cse66 .cse67)) (let ((.cse70 (+ .cse89 1))) (and (or .cse68 (and (or (= (+ .cse69 (* .cse70 .cse71)) |ULTIMATE.start_main_~A~0#1|) .cse72 .cse73 .cse74) (or .cse75 .cse76 (= (+ .cse77 (* .cse70 .cse78)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse79 (and (or .cse80 .cse81 (= |ULTIMATE.start_main_~A~0#1| (+ .cse82 (* .cse70 .cse83)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse70 .cse84) .cse85)) .cse86 .cse87 .cse88)) .cse61))) .cse90))) (or (and .cse51 .cse52 .cse22 .cse33 .cse53 .cse54 .cse35 .cse55 .cse37 .cse56 .cse57 .cse58 .cse25 .cse59 .cse38 .cse60 .cse41 .cse61) (and .cse51 .cse52 .cse22 .cse33 .cse53 .cse35 .cse55 .cse37 .cse56 .cse57 .cse58 .cse25 .cse59 .cse38 .cse62 .cse60 .cse41 .cse61)))))) (let ((.cse148 (= (mod .cse83 2) 0)) (.cse189 (< .cse83 0)) (.cse188 (- (div .cse97 4))) (.cse143 (= (mod .cse84 2) 0)) (.cse191 (< .cse84 0)) (.cse190 (- (div .cse84 2))) (.cse131 (= (mod .cse78 2) 0)) (.cse192 (< .cse78 0)) (.cse193 (- (div |ULTIMATE.start_main_~d~0#1| 8))) (.cse130 (= (mod .cse71 2) 0)) (.cse196 (- (div .cse71 2))) (.cse195 (< .cse71 0))) (let ((.cse119 (+ (* |ULTIMATE.start_main_~B~0#1| (- 4)) .cse34 |ULTIMATE.start_main_~A~0#1|)) (.cse115 (+ |ULTIMATE.start_main_~r~0#1| .cse183)) (.cse112 (+ .cse184 |ULTIMATE.start_main_~r~0#1|)) (.cse118 (+ .cse186 |ULTIMATE.start_main_~r~0#1|)) (.cse117 (+ .cse185 |ULTIMATE.start_main_~r~0#1|)) (.cse129 (not .cse195)) (.cse128 (+ (+ (- 1) .cse196) .cse194)) (.cse121 (+ .cse194 .cse196)) (.cse127 (and .cse195 (not .cse130))) (.cse135 (+ .cse194 .cse193)) (.cse134 (and (not .cse131) .cse192)) (.cse133 (+ (+ (- 1) .cse193) .cse194)) (.cse132 (not .cse192)) (.cse145 (+ .cse187 .cse190)) (.cse144 (and (not .cse143) .cse191)) (.cse142 (not .cse191)) (.cse141 (+ .cse187 (+ (- 1) .cse190))) (.cse149 (+ .cse188 .cse187)) (.cse150 (and (not .cse148) .cse189)) (.cse146 (not .cse189)) (.cse147 (+ .cse187 (+ (- 1) .cse188))) (.cse174 (+ .cse182 .cse186)) (.cse176 (+ .cse185 .cse182)) (.cse177 (+ .cse184 .cse182)) (.cse178 (+ .cse182 .cse183)) (.cse158 (+ |ULTIMATE.start_main_~A~0#1| (- 4)))) (and (or .cse104 .cse107 (let ((.cse114 (* |ULTIMATE.start_main_~B~0#1| (+ .cse99 |ULTIMATE.start_main_~q~0#1|))) (.cse113 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse103)))) (and (or .cse79 (and (or (and (or .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse113))) (or .cse100 (= (+ .cse114 .cse112) |ULTIMATE.start_main_~A~0#1|) .cse101)) .cse87 .cse88) (or .cse81 (and (or .cse102 (= (+ .cse115 .cse113) |ULTIMATE.start_main_~A~0#1|)) (or .cse100 (= |ULTIMATE.start_main_~A~0#1| (+ .cse114 .cse115)) .cse101)))) .cse116 .cse61) (or .cse53 (and (or .cse75 (and (or .cse102 (= (+ .cse117 .cse113) |ULTIMATE.start_main_~A~0#1|)) (or .cse100 (= |ULTIMATE.start_main_~A~0#1| (+ .cse117 .cse114)) .cse101))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse118 .cse114)) .cse100 .cse101) (or .cse102 (= (+ .cse118 .cse113) |ULTIMATE.start_main_~A~0#1|))) .cse72 .cse73)) .cse68)))) .cse43 .cse20 (not (>= (+ .cse119 |ULTIMATE.start_main_~r~0#1|) .cse120)) .cse21 .cse23 .cse1 (or .cse104 .cse107 (let ((.cse138 (= (mod .cse99 2) 0)) (.cse152 (< .cse99 0)) (.cse151 (div .cse99 2)) (.cse124 (= (mod .cse103 2) 0)) (.cse154 (< .cse103 0)) (.cse153 (div .cse155 4))) (let ((.cse126 (* (+ (+ .cse153 1) .cse106) |ULTIMATE.start_main_~B~0#1|)) (.cse125 (not .cse154)) (.cse123 (and (not .cse124) .cse154)) (.cse122 (* (+ .cse106 .cse153) |ULTIMATE.start_main_~B~0#1|)) (.cse139 (* |ULTIMATE.start_main_~B~0#1| (+ (+ .cse151 1) .cse106))) (.cse140 (not .cse152)) (.cse136 (and (not .cse138) .cse152)) (.cse137 (* |ULTIMATE.start_main_~B~0#1| (+ .cse106 .cse151)))) (and (or (and (or .cse102 (and (or .cse72 .cse73 (and (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse121 .cse122)) .cse123) (or .cse124 .cse125 (= |ULTIMATE.start_main_~A~0#1| (+ .cse121 .cse126)))) .cse127) (or (and (or .cse124 (= (+ .cse128 .cse126) |ULTIMATE.start_main_~A~0#1|) .cse125) (or .cse123 (= (+ .cse122 .cse128) |ULTIMATE.start_main_~A~0#1|))) .cse129 .cse130)) .cse111) (or .cse75 (and (or .cse131 .cse132 (and (or .cse123 (= (+ .cse122 .cse133) |ULTIMATE.start_main_~A~0#1|)) (or .cse124 .cse125 (= (+ .cse126 .cse133) |ULTIMATE.start_main_~A~0#1|)))) (or .cse134 (and (or .cse124 .cse125 (= (+ .cse135 .cse126) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse135 .cse122) |ULTIMATE.start_main_~A~0#1|) .cse123)))) .cse110))) (or (and (or .cse72 (and (or .cse127 (and (or .cse136 (= |ULTIMATE.start_main_~A~0#1| (+ .cse121 .cse137))) (or .cse138 (= (+ .cse139 .cse121) |ULTIMATE.start_main_~A~0#1|) .cse140))) (or .cse129 .cse130 (and (or (= (+ .cse128 .cse137) |ULTIMATE.start_main_~A~0#1|) .cse136) (or .cse138 (= |ULTIMATE.start_main_~A~0#1| (+ .cse139 .cse128)) .cse140)))) .cse73 .cse111) (or .cse75 .cse110 (and (or .cse131 (and (or .cse138 .cse140 (= |ULTIMATE.start_main_~A~0#1| (+ .cse139 .cse133))) (or .cse136 (= (+ .cse137 .cse133) |ULTIMATE.start_main_~A~0#1|))) .cse132) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse137)) .cse136) (or .cse138 .cse140 (= (+ .cse135 .cse139) |ULTIMATE.start_main_~A~0#1|))) .cse134)))) .cse100 .cse101)) .cse68) (or .cse79 (and (or (and (or (and (or (and (or .cse124 (= (+ .cse141 .cse126) |ULTIMATE.start_main_~A~0#1|) .cse125) (or .cse123 (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse122)))) .cse142 .cse143) (or .cse144 (and (or .cse124 (= |ULTIMATE.start_main_~A~0#1| (+ .cse145 .cse126)) .cse125) (or .cse123 (= (+ .cse145 .cse122) |ULTIMATE.start_main_~A~0#1|))))) .cse87 .cse88 .cse108) (or .cse81 .cse109 (and (or .cse146 (and (or (= (+ .cse147 .cse126) |ULTIMATE.start_main_~A~0#1|) .cse124 .cse125) (or .cse123 (= |ULTIMATE.start_main_~A~0#1| (+ .cse147 .cse122)))) .cse148) (or (and (or .cse124 (= (+ .cse126 .cse149) |ULTIMATE.start_main_~A~0#1|) .cse125) (or .cse123 (= |ULTIMATE.start_main_~A~0#1| (+ .cse122 .cse149)))) .cse150)))) .cse102) (or .cse100 .cse101 (and (or (and (or .cse146 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse139 .cse147)) .cse138 .cse140) (or .cse136 (= |ULTIMATE.start_main_~A~0#1| (+ .cse147 .cse137)))) .cse148) (or (and (or (= (+ .cse139 .cse149) |ULTIMATE.start_main_~A~0#1|) .cse138 .cse140) (or .cse136 (= |ULTIMATE.start_main_~A~0#1| (+ .cse137 .cse149)))) .cse150)) .cse81 .cse109) (or (and (or .cse142 (and (or .cse138 .cse140 (= (+ .cse141 .cse139) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse137)) .cse136)) .cse143) (or .cse144 (and (or .cse138 (= (+ .cse145 .cse139) |ULTIMATE.start_main_~A~0#1|) .cse140) (or .cse136 (= (+ .cse145 .cse137) |ULTIMATE.start_main_~A~0#1|))))) .cse87 .cse88 .cse108)))) .cse61))))) (= .cse119 |ULTIMATE.start_main_~B~0#1|) .cse3 (= (+ |ULTIMATE.start_main_~q~0#1| (- 4)) 1) (or .cse90 (let ((.cse157 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse65))) (.cse156 (* |ULTIMATE.start_main_~B~0#1| (+ .cse63 |ULTIMATE.start_main_~q~0#1|)))) (and (or .cse79 (and (or .cse81 (and (or (= (+ .cse156 .cse115) |ULTIMATE.start_main_~A~0#1|) .cse64) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse115 .cse157)) .cse66 .cse67))) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse112 .cse157)) .cse66 .cse67) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse156 .cse112)) .cse64)) .cse87 .cse88)) .cse116 .cse61) (or .cse53 (and (or .cse72 .cse73 (and (or .cse66 (= |ULTIMATE.start_main_~A~0#1| (+ .cse118 .cse157)) .cse67) (or .cse64 (= |ULTIMATE.start_main_~A~0#1| (+ .cse118 .cse156))))) (or .cse75 (and (or (= (+ .cse117 .cse157) |ULTIMATE.start_main_~A~0#1|) .cse66 .cse67) (or (= (+ .cse117 .cse156) |ULTIMATE.start_main_~A~0#1|) .cse64)))) .cse68)))) .cse47 .cse4 .cse25 (>= (+ .cse158 4) .cse40) (or (let ((.cse161 (= (mod .cse65 2) 0)) (.cse169 (< .cse65 0)) (.cse170 (div .cse65 2)) (.cse167 (= (mod .cse63 2) 0)) (.cse171 (< .cse63 0)) (.cse172 (div |ULTIMATE.start_main_~p~0#1| 8))) (let ((.cse164 (* |ULTIMATE.start_main_~B~0#1| (+ .cse89 .cse172))) (.cse165 (and (not .cse167) .cse171)) (.cse166 (* |ULTIMATE.start_main_~B~0#1| (+ (+ .cse172 1) .cse89))) (.cse168 (not .cse171)) (.cse163 (* |ULTIMATE.start_main_~B~0#1| (+ (+ 1 .cse170) .cse89))) (.cse162 (not .cse169)) (.cse159 (* (+ .cse89 .cse170) |ULTIMATE.start_main_~B~0#1|)) (.cse160 (and (not .cse161) .cse169))) (and (or .cse68 (and (or (and (or (and (or .cse127 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse121 .cse159)) .cse160) (or .cse161 .cse162 (= |ULTIMATE.start_main_~A~0#1| (+ .cse121 .cse163))))) (or .cse129 .cse130 (and (or .cse160 (= (+ .cse159 .cse128) |ULTIMATE.start_main_~A~0#1|)) (or .cse161 .cse162 (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse128)))))) .cse72 .cse73 .cse111) (or .cse75 .cse110 (and (or .cse131 (and (or .cse161 .cse162 (= |ULTIMATE.start_main_~A~0#1| (+ .cse163 .cse133))) (or (= (+ .cse159 .cse133) |ULTIMATE.start_main_~A~0#1|) .cse160)) .cse132) (or (and (or .cse161 (= (+ .cse135 .cse163) |ULTIMATE.start_main_~A~0#1|) .cse162) (or .cse160 (= (+ .cse135 .cse159) |ULTIMATE.start_main_~A~0#1|))) .cse134)))) .cse66 .cse67) (or (and (or .cse72 (and (or .cse129 .cse130 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse164)) .cse165) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse128 .cse166)) .cse167 .cse168))) (or (and (or .cse167 .cse168 (= |ULTIMATE.start_main_~A~0#1| (+ .cse121 .cse166))) (or .cse165 (= (+ .cse121 .cse164) |ULTIMATE.start_main_~A~0#1|))) .cse127)) .cse73 .cse111) (or .cse75 (and (or (and (or .cse167 .cse168 (= |ULTIMATE.start_main_~A~0#1| (+ .cse135 .cse166))) (or (= (+ .cse135 .cse164) |ULTIMATE.start_main_~A~0#1|) .cse165)) .cse134) (or .cse131 (and (or (= (+ .cse133 .cse164) |ULTIMATE.start_main_~A~0#1|) .cse165) (or (= (+ .cse133 .cse166) |ULTIMATE.start_main_~A~0#1|) .cse167 .cse168)) .cse132)) .cse110)) .cse64))) (or .cse79 (and (or (and (or (and (or .cse144 (and (or .cse165 (= (+ .cse145 .cse164) |ULTIMATE.start_main_~A~0#1|)) (or .cse167 (= (+ .cse145 .cse166) |ULTIMATE.start_main_~A~0#1|) .cse168))) (or .cse142 (and (or .cse167 (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse166)) .cse168) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse164)) .cse165)) .cse143)) .cse87 .cse88 .cse108) (or (and (or .cse146 (and (or (= (+ .cse147 .cse164) |ULTIMATE.start_main_~A~0#1|) .cse165) (or .cse167 (= |ULTIMATE.start_main_~A~0#1| (+ .cse147 .cse166)) .cse168)) .cse148) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse164 .cse149)) .cse165) (or .cse167 (= (+ .cse166 .cse149) |ULTIMATE.start_main_~A~0#1|) .cse168)) .cse150)) .cse81 .cse109)) .cse64) (or (and (or (and (or (and (or (= (+ .cse145 .cse163) |ULTIMATE.start_main_~A~0#1|) .cse161 .cse162) (or .cse160 (= (+ .cse145 .cse159) |ULTIMATE.start_main_~A~0#1|))) .cse144) (or .cse142 .cse143 (and (or .cse161 .cse162 (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse163))) (or .cse160 (= |ULTIMATE.start_main_~A~0#1| (+ .cse141 .cse159)))))) .cse87 .cse88 .cse108) (or (and (or (and (or .cse160 (= (+ .cse159 .cse149) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse163 .cse149) |ULTIMATE.start_main_~A~0#1|) .cse161 .cse162)) .cse150) (or .cse146 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse147 .cse163)) .cse161 .cse162) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse147 .cse159)) .cse160)) .cse148)) .cse81 .cse109)) .cse66 .cse67)) .cse61)))) .cse90) (>= .cse158 |ULTIMATE.start_main_~d~0#1|) .cse17 .cse49 .cse50 (= |ULTIMATE.start_main_~q~0#1| (+ |ULTIMATE.start_main_~p~0#1| 4)) .cse18 (or (let ((.cse175 (* (+ .cse63 .cse179) |ULTIMATE.start_main_~B~0#1|)) (.cse173 (* (+ .cse179 .cse65) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse68 (and (or (and (or .cse66 .cse67 (= (+ .cse173 .cse174) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse175)) .cse64)) .cse72 .cse73) (or .cse75 (and (or .cse64 (= (+ .cse176 .cse175) |ULTIMATE.start_main_~A~0#1|)) (or (= (+ .cse173 .cse176) |ULTIMATE.start_main_~A~0#1|) .cse66 .cse67)))) .cse92) (or .cse79 (and (or (and (or (= (+ .cse177 .cse173) |ULTIMATE.start_main_~A~0#1|) .cse66 .cse67) (or (= (+ .cse177 .cse175) |ULTIMATE.start_main_~A~0#1|) .cse64)) .cse87 .cse88) (or (and (or (= (+ .cse175 .cse178) |ULTIMATE.start_main_~A~0#1|) .cse64) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse173 .cse178)) .cse66 .cse67)) .cse81)) .cse96 .cse61))) .cse90) (or .cse104 (let ((.cse180 (* (+ .cse99 .cse179) |ULTIMATE.start_main_~B~0#1|)) (.cse181 (* (+ .cse179 .cse103) |ULTIMATE.start_main_~B~0#1|))) (and (or .cse68 .cse92 (and (or .cse72 (and (or .cse100 .cse101 (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse180))) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse174 .cse181)) .cse102)) .cse73) (or .cse75 (and (or .cse100 (= |ULTIMATE.start_main_~A~0#1| (+ .cse176 .cse180)) .cse101) (or (= (+ .cse181 .cse176) |ULTIMATE.start_main_~A~0#1|) .cse102))))) (or .cse79 .cse96 (and (or (and (or .cse100 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse180)) .cse101) (or .cse102 (= |ULTIMATE.start_main_~A~0#1| (+ .cse177 .cse181)))) .cse87 .cse88) (or (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse180 .cse178)) .cse100 .cse101) (or .cse102 (= (+ .cse181 .cse178) |ULTIMATE.start_main_~A~0#1|))) .cse81)) .cse61))) .cse107) (= (+ .cse158 .cse31) |ULTIMATE.start_main_~r~0#1|)))) (and .cse1 .cse24 .cse45 .cse48 .cse18) (and .cse51 .cse52 .cse53 (= .cse46 |ULTIMATE.start_main_~d~0#1|) .cse55 (= |ULTIMATE.start_main_~p~0#1| .cse40) .cse45 (= |ULTIMATE.start_main_~d~0#1| .cse40) .cse197 .cse48 .cse18 .cse60 .cse61) (and .cse198 (= |ULTIMATE.start_main_~d~0#1| .cse199) .cse45 .cse47 .cse48 .cse18 .cse200) (let ((.cse201 (+ |ULTIMATE.start_main_~r~0#1| 4))) (and .cse43 .cse0 (= |ULTIMATE.start_main_~A~0#1| .cse201) .cse202 .cse2 .cse203 .cse197 .cse47 (= |ULTIMATE.start_main_~q~0#1| 4) (let ((.cse205 (= (mod |ULTIMATE.start_main_~q~0#1| 2) 0)) (.cse206 (< |ULTIMATE.start_main_~q~0#1| 0)) (.cse204 (div |ULTIMATE.start_main_~q~0#1| 2))) (or (and (= .cse204 |ULTIMATE.start_main_~p~0#1|) (or .cse205 (not .cse206))) (and (not .cse205) .cse206 (= (+ .cse204 1) |ULTIMATE.start_main_~p~0#1|)))) .cse17 .cse49 .cse50 .cse18 (let ((.cse207 (<= 2 |ULTIMATE.start_main_~p~0#1|))) (or (and .cse22 .cse54 .cse207 .cse25 .cse38 .cse39) (and .cse22 .cse207 .cse25 .cse208 .cse38 .cse39 .cse209))) .cse210 (>= .cse201 .cse40))) (and .cse202 .cse1 (= (+ (* (- 1) .cse199) |ULTIMATE.start_main_~q~0#1|) 0) .cse18 .cse39 (= .cse211 .cse120)) (and (<= 4 |ULTIMATE.start_main_~p~0#1|) .cse43 (= |ULTIMATE.start_main_~p~0#1| 4) .cse19 .cse22 .cse33 .cse212 .cse54 .cse37 .cse57 (= |ULTIMATE.start_main_~d~0#1| .cse213) .cse214 .cse47 (= |ULTIMATE.start_main_~d~0#1| 4) .cse25 (= (+ |ULTIMATE.start_main_~A~0#1| .cse31) |ULTIMATE.start_main_~r~0#1|) .cse17 .cse38 .cse49 .cse50 .cse18 .cse60 .cse26) (and .cse19 .cse22 .cse54 .cse198 .cse203 .cse214 .cse25 (= .cse42 0) .cse18 .cse60 .cse210 (not .cse212) .cse200))))))))) [2023-02-17 02:09:48,168 INFO L899 garLoopResultBuilder]: For program point L37(lines 34 42) no Hoare annotation was computed. [2023-02-17 02:09:48,169 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 02:09:48,169 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse27 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse30 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse21 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (let ((.cse11 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse28 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse4 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse5 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse15 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse7 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse18 (and .cse30 (not .cse21))) (.cse22 (not .cse30)) (.cse26 (+ .cse27 1))) (let ((.cse6 (and (or (not (= .cse27 1)) .cse18) (or .cse21 .cse22 (not (= .cse26 1))))) (.cse10 (+ .cse7 1)) (.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse1 (let ((.cse29 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|))) (or (and .cse3 .cse29 .cse4 .cse5) (and .cse15 .cse29)))) (.cse9 (not .cse28)) (.cse8 (and (not .cse11) .cse28))) (let ((.cse12 (let ((.cse13 (let ((.cse20 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse27))) (.cse23 (* (+ |ULTIMATE.start_main_~q~0#1| .cse26) |ULTIMATE.start_main_~B~0#1|)) (.cse24 (- .cse7))) (let ((.cse14 (or (let ((.cse25 (+ |ULTIMATE.start_main_~r~0#1| .cse24))) (and (or (= (+ .cse20 .cse25) |ULTIMATE.start_main_~A~0#1|) .cse18) (or (= (+ .cse23 .cse25) |ULTIMATE.start_main_~A~0#1|) .cse21 .cse22))) .cse8)) (.cse16 (or .cse9 (let ((.cse19 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse24)))) (and (or .cse18 (= (+ .cse19 .cse20) |ULTIMATE.start_main_~A~0#1|)) (or .cse21 .cse22 (= |ULTIMATE.start_main_~A~0#1| (+ .cse23 .cse19))))) .cse11)) (.cse17 (= |ULTIMATE.start_main_~A~0#1| (+ (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~d~0#1|)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)))))) (or (and .cse14 .cse15 .cse16 .cse1 .cse17) (and .cse15 .cse1 .cse17) (and .cse14 .cse16 .cse1 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse17 .cse5 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1)))))))) (or (and (or .cse6 (and (or .cse9 .cse11 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse10)) |ULTIMATE.start_main_~A~0#1|)) (or .cse8 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse7 |ULTIMATE.start_main_~q~0#1|)))))) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) .cse13) (and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|) .cse13)))) (.cse2 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (or .cse6 (and (or (= .cse7 |ULTIMATE.start_main_~B~0#1|) .cse8) (or .cse9 (= |ULTIMATE.start_main_~B~0#1| .cse10) .cse11))) .cse12 .cse2) (and .cse0 .cse2 .cse4 .cse5) (and .cse0 .cse12 .cse2 .cse5)))))) [2023-02-17 02:09:48,169 INFO L899 garLoopResultBuilder]: For program point L46(lines 44 56) no Hoare annotation was computed. [2023-02-17 02:09:48,169 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 02:09:48,171 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 42) the Hoare annotation is: (let ((.cse94 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse77 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse97 (- .cse77)) (.cse95 (+ .cse94 1))) (let ((.cse15 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse14 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse89 (+ |ULTIMATE.start_main_~q~0#1| .cse95)) (.cse109 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse36 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse74 (+ |ULTIMATE.start_main_~q~0#1| .cse94)) (.cse96 (+ (- 1) .cse97)) (.cse108 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse56 (- |ULTIMATE.start_main_~d~0#1|))) (let ((.cse54 (= .cse94 1)) (.cse35 (= .cse95 1)) (.cse9 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse76 (+ |ULTIMATE.start_main_~r~0#1| .cse56)) (.cse82 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse34 (not .cse108)) (.cse83 (+ |ULTIMATE.start_main_~r~0#1| .cse96)) (.cse106 (* |ULTIMATE.start_main_~B~0#1| .cse74)) (.cse53 (and .cse109 (not .cse36))) (.cse107 (* .cse89 |ULTIMATE.start_main_~B~0#1|)) (.cse85 (+ |ULTIMATE.start_main_~r~0#1| .cse97)) (.cse37 (not .cse109)) (.cse59 (and (not .cse14) .cse108)) (.cse104 (not .cse15)) (.cse33 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))) (let ((.cse19 (* 2 1)) (.cse18 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse0 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse10 (<= |ULTIMATE.start_main_~A~0#1| 5)) (.cse16 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse25 (or .cse104 .cse33)) (.cse90 (or (and (or (= (+ .cse106 .cse85) |ULTIMATE.start_main_~A~0#1|) .cse53) (or (= (+ .cse107 .cse85) |ULTIMATE.start_main_~A~0#1|) .cse36 .cse37)) .cse59)) (.cse23 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse91 (or .cse34 (and (or .cse53 (= (+ .cse83 .cse106) |ULTIMATE.start_main_~A~0#1|)) (or .cse36 .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse107 .cse83)))) .cse14)) (.cse7 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse8 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse30 (= |ULTIMATE.start_main_~A~0#1| (+ .cse76 (* |ULTIMATE.start_main_~B~0#1| .cse82)))) (.cse12 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse17 (or .cse9 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0) (not .cse9)))) (.cse75 (and (or (not .cse54) .cse53) (or .cse36 .cse37 (not .cse35)))) (.cse80 (+ .cse77 1))) (let ((.cse1 (let ((.cse105 (or .cse75 (and (or .cse34 .cse14 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse80)) |ULTIMATE.start_main_~A~0#1|)) (or .cse59 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse77 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse90 .cse23 .cse91 .cse25 .cse105 .cse7 .cse8 .cse9 .cse30 .cse12 .cse17) (and .cse90 .cse23 .cse91 .cse105 .cse7 .cse8 .cse9 .cse30 .cse33 .cse12 .cse17)))) (.cse2 (or .cse75 (and (or (= .cse77 |ULTIMATE.start_main_~B~0#1|) .cse59) (or .cse34 (= |ULTIMATE.start_main_~B~0#1| .cse80) .cse14)))) (.cse5 (<= 2 .cse77)) (.cse13 (or .cse104 .cse16)) (.cse3 (>= |ULTIMATE.start_main_~r~0#1| .cse77)) (.cse11 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse10) (and (or (not .cse0) (not .cse10)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse4 (* 2 .cse18)) (.cse6 (* 2 .cse19))) (or (and (<= 4 |ULTIMATE.start_main_~p~0#1|) .cse0 .cse1 .cse2 .cse3 (= .cse4 |ULTIMATE.start_main_~d~0#1|) .cse5 (= |ULTIMATE.start_main_~p~0#1| .cse6) .cse7 (= |ULTIMATE.start_main_~d~0#1| .cse6) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (= |ULTIMATE.start_main_~d~0#1| 1) .cse15 (>= |ULTIMATE.start_main_~p~0#1| 1) .cse16 .cse7 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse17) (and .cse0 (= |ULTIMATE.start_main_~d~0#1| .cse18) (= |ULTIMATE.start_main_~d~0#1| .cse19) (<= 2 |ULTIMATE.start_main_~p~0#1|) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 (= |ULTIMATE.start_main_~p~0#1| .cse19)) (let ((.cse20 (* 2 .cse6))) (and .cse0 (<= 8 |ULTIMATE.start_main_~p~0#1|) (>= |ULTIMATE.start_main_~r~0#1| .cse6) (= .cse20 |ULTIMATE.start_main_~p~0#1|) .cse7 (>= |ULTIMATE.start_main_~r~0#1| .cse4) .cse8 .cse9 (= .cse20 |ULTIMATE.start_main_~d~0#1|) (let ((.cse71 (div .cse80 2)) (.cse87 (div .cse95 2)) (.cse69 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse57 (div |ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse58 (+ .cse57 1)) (.cse100 (< .cse94 0)) (.cse49 (= (mod .cse94 2) 0)) (.cse99 (- .cse69)) (.cse63 (= (mod .cse77 2) 0)) (.cse98 (< .cse77 0)) (.cse86 (+ .cse87 1)) (.cse101 (< .cse95 0)) (.cse40 (= (mod .cse95 2) 0)) (.cse72 (+ .cse71 1)) (.cse103 (< .cse80 0)) (.cse44 (= (mod .cse80 2) 0)) (.cse102 (- .cse71)) (.cse62 (+ .cse69 1))) (let ((.cse65 (not (>= .cse85 .cse62))) (.cse67 (not (>= .cse85 .cse69))) (.cse70 (not (>= .cse83 .cse71))) (.cse47 (+ .cse83 .cse102)) (.cse46 (and .cse103 (not .cse44))) (.cse73 (not (>= .cse83 .cse72))) (.cse45 (not .cse103)) (.cse39 (+ .cse83 (+ (- 1) .cse102))) (.cse42 (and .cse101 (not .cse40))) (.cse43 (* (+ .cse89 .cse87) |ULTIMATE.start_main_~B~0#1|)) (.cse38 (* (+ .cse86 .cse89) |ULTIMATE.start_main_~B~0#1|)) (.cse41 (not .cse101)) (.cse66 (and (not .cse63) .cse98)) (.cse68 (+ .cse99 .cse85)) (.cse51 (and .cse100 (not .cse49))) (.cse52 (* (+ .cse57 .cse74) |ULTIMATE.start_main_~B~0#1|)) (.cse48 (not .cse100)) (.cse60 (+ (+ (- 1) .cse99) .cse85)) (.cse50 (* (+ .cse58 .cse74) |ULTIMATE.start_main_~B~0#1|)) (.cse64 (not .cse98)) (.cse78 (+ .cse76 .cse97)) (.cse81 (+ .cse76 .cse96))) (let ((.cse24 (or .cse15 (let ((.cse93 (* (+ .cse82 .cse95) |ULTIMATE.start_main_~B~0#1|)) (.cse92 (* (+ .cse82 .cse94) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse92 .cse78) |ULTIMATE.start_main_~A~0#1|) .cse53) (or .cse36 .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse93)))) .cse59) (or .cse34 (and (or .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse93)) .cse37) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse92)) .cse53)) .cse14))))) (.cse26 (or (and (or .cse35 .cse36 .cse37 (and (or .cse63 .cse64 (and (or .cse40 (= (+ .cse60 .cse38) |ULTIMATE.start_main_~A~0#1|) .cse41) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse43 .cse60))))) (or .cse66 (and (or .cse42 (= (+ .cse43 .cse68) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse38 .cse68)) .cse40 .cse41))))) (or (and (or .cse66 (and (or (= (+ .cse52 .cse68) |ULTIMATE.start_main_~A~0#1|) .cse51) (or (= (+ .cse68 .cse50) |ULTIMATE.start_main_~A~0#1|) .cse48 .cse49))) (or (and (or .cse51 (= (+ .cse52 .cse60) |ULTIMATE.start_main_~A~0#1|)) (or .cse48 .cse49 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse50)))) .cse63 .cse64)) .cse53 .cse54)) .cse59)) (.cse27 (or .cse15 (and .cse90 .cse91))) (.cse21 (or (and (or (not (= .cse86 1)) .cse40 .cse41) (or .cse42 (not (= .cse87 1)))) .cse36 (let ((.cse88 (+ .cse89 1))) (and (or .cse59 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 (* .cse88 .cse62))) .cse63 .cse64 .cse65) (or .cse66 .cse67 (= (+ (* .cse88 .cse69) .cse68) |ULTIMATE.start_main_~A~0#1|)))) (or .cse34 (and (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 (* .cse88 .cse71))) .cse46) (or .cse73 .cse44 .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse88 .cse72) .cse39)))) .cse14))) .cse37)) (.cse28 (or .cse75 (let ((.cse84 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse34 (not (>= |ULTIMATE.start_main_~r~0#1| .cse80)) .cse14 (= |ULTIMATE.start_main_~A~0#1| (+ .cse83 (* .cse84 .cse80)))) (or (not .cse3) .cse59 (= (+ (* .cse77 .cse84) .cse85) |ULTIMATE.start_main_~A~0#1|)))))) (.cse29 (or .cse75 (let ((.cse79 (+ .cse82 1))) (and (or (not (>= .cse76 .cse77)) .cse59 (= (+ .cse78 (* .cse77 .cse79)) |ULTIMATE.start_main_~A~0#1|)) (or .cse34 (not (>= .cse76 .cse80)) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse79 .cse80) .cse81)) .cse14))))) (.cse22 (or (and (or (not (= .cse57 1)) .cse51) (or (not (= .cse58 1)) .cse48 .cse49)) (let ((.cse61 (+ .cse74 1))) (and (or .cse59 (and (or (= (+ .cse60 (* .cse61 .cse62)) |ULTIMATE.start_main_~A~0#1|) .cse63 .cse64 .cse65) (or .cse66 .cse67 (= (+ .cse68 (* .cse61 .cse69)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse34 (and (or .cse70 .cse46 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 (* .cse61 .cse71)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse61 .cse72) .cse39)) .cse73 .cse44 .cse45)) .cse14))) .cse53)) (.cse31 (let ((.cse55 (* 2 |ULTIMATE.start_main_~p~0#1|))) (or (= .cse55 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ (+ (- (* 2 |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~r~0#1|) .cse56) (* |ULTIMATE.start_main_~B~0#1| (+ (+ |ULTIMATE.start_main_~q~0#1| .cse55) |ULTIMATE.start_main_~p~0#1|))))))) (.cse32 (or .cse34 .cse14 (and (or .cse35 .cse36 .cse37 (and (or (and (or (= (+ .cse38 .cse39) |ULTIMATE.start_main_~A~0#1|) .cse40 .cse41) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse43 .cse39)))) .cse44 .cse45) (or .cse46 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse38)) .cse40 .cse41) (or .cse42 (= (+ .cse47 .cse43) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse48 .cse49 (= (+ .cse47 .cse50) |ULTIMATE.start_main_~A~0#1|)) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse52)))) .cse46) (or .cse44 .cse45 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse39 .cse50)) .cse48 .cse49) (or (= (+ .cse52 .cse39) |ULTIMATE.start_main_~A~0#1|) .cse51)))) .cse53 .cse54))))) (or (and (or (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|) (and .cse21 .cse22)) .cse1 .cse2 .cse23 .cse24 .cse3 .cse25 .cse26 .cse5 .cse27 .cse28 .cse29 .cse30 .cse31 .cse13 .cse32 .cse14) (and .cse1 .cse2 .cse23 .cse24 .cse3 .cse25 .cse26 .cse5 .cse27 .cse21 .cse28 .cse29 .cse30 .cse22 .cse31 .cse13 .cse32 .cse14) (and .cse1 .cse2 .cse23 .cse24 .cse3 .cse26 .cse5 .cse27 .cse21 .cse28 .cse29 .cse30 .cse22 .cse31 .cse33 .cse13 .cse32 .cse14)))))) .cse10 .cse11 (= (* .cse4 2) |ULTIMATE.start_main_~d~0#1|) .cse12))))))))) [2023-02-17 02:09:48,171 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-02-17 02:09:48,172 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse94 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse77 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse97 (- .cse77)) (.cse95 (+ .cse94 1))) (let ((.cse15 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse14 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse89 (+ |ULTIMATE.start_main_~q~0#1| .cse95)) (.cse109 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse36 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse74 (+ |ULTIMATE.start_main_~q~0#1| .cse94)) (.cse96 (+ (- 1) .cse97)) (.cse108 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse56 (- |ULTIMATE.start_main_~d~0#1|))) (let ((.cse54 (= .cse94 1)) (.cse35 (= .cse95 1)) (.cse9 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse76 (+ |ULTIMATE.start_main_~r~0#1| .cse56)) (.cse82 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse34 (not .cse108)) (.cse83 (+ |ULTIMATE.start_main_~r~0#1| .cse96)) (.cse106 (* |ULTIMATE.start_main_~B~0#1| .cse74)) (.cse53 (and .cse109 (not .cse36))) (.cse107 (* .cse89 |ULTIMATE.start_main_~B~0#1|)) (.cse85 (+ |ULTIMATE.start_main_~r~0#1| .cse97)) (.cse37 (not .cse109)) (.cse59 (and (not .cse14) .cse108)) (.cse104 (not .cse15)) (.cse33 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))) (let ((.cse19 (* 2 1)) (.cse18 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse0 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse10 (<= |ULTIMATE.start_main_~A~0#1| 5)) (.cse16 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse25 (or .cse104 .cse33)) (.cse90 (or (and (or (= (+ .cse106 .cse85) |ULTIMATE.start_main_~A~0#1|) .cse53) (or (= (+ .cse107 .cse85) |ULTIMATE.start_main_~A~0#1|) .cse36 .cse37)) .cse59)) (.cse23 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse91 (or .cse34 (and (or .cse53 (= (+ .cse83 .cse106) |ULTIMATE.start_main_~A~0#1|)) (or .cse36 .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse107 .cse83)))) .cse14)) (.cse7 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse8 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse30 (= |ULTIMATE.start_main_~A~0#1| (+ .cse76 (* |ULTIMATE.start_main_~B~0#1| .cse82)))) (.cse12 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse17 (or .cse9 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0) (not .cse9)))) (.cse75 (and (or (not .cse54) .cse53) (or .cse36 .cse37 (not .cse35)))) (.cse80 (+ .cse77 1))) (let ((.cse1 (let ((.cse105 (or .cse75 (and (or .cse34 .cse14 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse80)) |ULTIMATE.start_main_~A~0#1|)) (or .cse59 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse77 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse90 .cse23 .cse91 .cse25 .cse105 .cse7 .cse8 .cse9 .cse30 .cse12 .cse17) (and .cse90 .cse23 .cse91 .cse105 .cse7 .cse8 .cse9 .cse30 .cse33 .cse12 .cse17)))) (.cse2 (or .cse75 (and (or (= .cse77 |ULTIMATE.start_main_~B~0#1|) .cse59) (or .cse34 (= |ULTIMATE.start_main_~B~0#1| .cse80) .cse14)))) (.cse5 (<= 2 .cse77)) (.cse13 (or .cse104 .cse16)) (.cse3 (>= |ULTIMATE.start_main_~r~0#1| .cse77)) (.cse11 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse10) (and (or (not .cse0) (not .cse10)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse4 (* 2 .cse18)) (.cse6 (* 2 .cse19))) (or (and (<= 4 |ULTIMATE.start_main_~p~0#1|) .cse0 .cse1 .cse2 .cse3 (= .cse4 |ULTIMATE.start_main_~d~0#1|) .cse5 (= |ULTIMATE.start_main_~p~0#1| .cse6) .cse7 (= |ULTIMATE.start_main_~d~0#1| .cse6) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (= |ULTIMATE.start_main_~d~0#1| 1) .cse15 (>= |ULTIMATE.start_main_~p~0#1| 1) .cse16 .cse7 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse17) (and .cse0 (= |ULTIMATE.start_main_~d~0#1| .cse18) (= |ULTIMATE.start_main_~d~0#1| .cse19) (<= 2 |ULTIMATE.start_main_~p~0#1|) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 (= |ULTIMATE.start_main_~p~0#1| .cse19)) (let ((.cse20 (* 2 .cse6))) (and .cse0 (<= 8 |ULTIMATE.start_main_~p~0#1|) (>= |ULTIMATE.start_main_~r~0#1| .cse6) (= .cse20 |ULTIMATE.start_main_~p~0#1|) .cse7 (>= |ULTIMATE.start_main_~r~0#1| .cse4) .cse8 .cse9 (= .cse20 |ULTIMATE.start_main_~d~0#1|) (let ((.cse71 (div .cse80 2)) (.cse87 (div .cse95 2)) (.cse69 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse57 (div |ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse58 (+ .cse57 1)) (.cse100 (< .cse94 0)) (.cse49 (= (mod .cse94 2) 0)) (.cse99 (- .cse69)) (.cse63 (= (mod .cse77 2) 0)) (.cse98 (< .cse77 0)) (.cse86 (+ .cse87 1)) (.cse101 (< .cse95 0)) (.cse40 (= (mod .cse95 2) 0)) (.cse72 (+ .cse71 1)) (.cse103 (< .cse80 0)) (.cse44 (= (mod .cse80 2) 0)) (.cse102 (- .cse71)) (.cse62 (+ .cse69 1))) (let ((.cse65 (not (>= .cse85 .cse62))) (.cse67 (not (>= .cse85 .cse69))) (.cse70 (not (>= .cse83 .cse71))) (.cse47 (+ .cse83 .cse102)) (.cse46 (and .cse103 (not .cse44))) (.cse73 (not (>= .cse83 .cse72))) (.cse45 (not .cse103)) (.cse39 (+ .cse83 (+ (- 1) .cse102))) (.cse42 (and .cse101 (not .cse40))) (.cse43 (* (+ .cse89 .cse87) |ULTIMATE.start_main_~B~0#1|)) (.cse38 (* (+ .cse86 .cse89) |ULTIMATE.start_main_~B~0#1|)) (.cse41 (not .cse101)) (.cse66 (and (not .cse63) .cse98)) (.cse68 (+ .cse99 .cse85)) (.cse51 (and .cse100 (not .cse49))) (.cse52 (* (+ .cse57 .cse74) |ULTIMATE.start_main_~B~0#1|)) (.cse48 (not .cse100)) (.cse60 (+ (+ (- 1) .cse99) .cse85)) (.cse50 (* (+ .cse58 .cse74) |ULTIMATE.start_main_~B~0#1|)) (.cse64 (not .cse98)) (.cse78 (+ .cse76 .cse97)) (.cse81 (+ .cse76 .cse96))) (let ((.cse24 (or .cse15 (let ((.cse93 (* (+ .cse82 .cse95) |ULTIMATE.start_main_~B~0#1|)) (.cse92 (* (+ .cse82 .cse94) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse92 .cse78) |ULTIMATE.start_main_~A~0#1|) .cse53) (or .cse36 .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse93)))) .cse59) (or .cse34 (and (or .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse93)) .cse37) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse92)) .cse53)) .cse14))))) (.cse26 (or (and (or .cse35 .cse36 .cse37 (and (or .cse63 .cse64 (and (or .cse40 (= (+ .cse60 .cse38) |ULTIMATE.start_main_~A~0#1|) .cse41) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse43 .cse60))))) (or .cse66 (and (or .cse42 (= (+ .cse43 .cse68) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse38 .cse68)) .cse40 .cse41))))) (or (and (or .cse66 (and (or (= (+ .cse52 .cse68) |ULTIMATE.start_main_~A~0#1|) .cse51) (or (= (+ .cse68 .cse50) |ULTIMATE.start_main_~A~0#1|) .cse48 .cse49))) (or (and (or .cse51 (= (+ .cse52 .cse60) |ULTIMATE.start_main_~A~0#1|)) (or .cse48 .cse49 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse50)))) .cse63 .cse64)) .cse53 .cse54)) .cse59)) (.cse27 (or .cse15 (and .cse90 .cse91))) (.cse21 (or (and (or (not (= .cse86 1)) .cse40 .cse41) (or .cse42 (not (= .cse87 1)))) .cse36 (let ((.cse88 (+ .cse89 1))) (and (or .cse59 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 (* .cse88 .cse62))) .cse63 .cse64 .cse65) (or .cse66 .cse67 (= (+ (* .cse88 .cse69) .cse68) |ULTIMATE.start_main_~A~0#1|)))) (or .cse34 (and (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 (* .cse88 .cse71))) .cse46) (or .cse73 .cse44 .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse88 .cse72) .cse39)))) .cse14))) .cse37)) (.cse28 (or .cse75 (let ((.cse84 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse34 (not (>= |ULTIMATE.start_main_~r~0#1| .cse80)) .cse14 (= |ULTIMATE.start_main_~A~0#1| (+ .cse83 (* .cse84 .cse80)))) (or (not .cse3) .cse59 (= (+ (* .cse77 .cse84) .cse85) |ULTIMATE.start_main_~A~0#1|)))))) (.cse29 (or .cse75 (let ((.cse79 (+ .cse82 1))) (and (or (not (>= .cse76 .cse77)) .cse59 (= (+ .cse78 (* .cse77 .cse79)) |ULTIMATE.start_main_~A~0#1|)) (or .cse34 (not (>= .cse76 .cse80)) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse79 .cse80) .cse81)) .cse14))))) (.cse22 (or (and (or (not (= .cse57 1)) .cse51) (or (not (= .cse58 1)) .cse48 .cse49)) (let ((.cse61 (+ .cse74 1))) (and (or .cse59 (and (or (= (+ .cse60 (* .cse61 .cse62)) |ULTIMATE.start_main_~A~0#1|) .cse63 .cse64 .cse65) (or .cse66 .cse67 (= (+ .cse68 (* .cse61 .cse69)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse34 (and (or .cse70 .cse46 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 (* .cse61 .cse71)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse61 .cse72) .cse39)) .cse73 .cse44 .cse45)) .cse14))) .cse53)) (.cse31 (let ((.cse55 (* 2 |ULTIMATE.start_main_~p~0#1|))) (or (= .cse55 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ (+ (- (* 2 |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~r~0#1|) .cse56) (* |ULTIMATE.start_main_~B~0#1| (+ (+ |ULTIMATE.start_main_~q~0#1| .cse55) |ULTIMATE.start_main_~p~0#1|))))))) (.cse32 (or .cse34 .cse14 (and (or .cse35 .cse36 .cse37 (and (or (and (or (= (+ .cse38 .cse39) |ULTIMATE.start_main_~A~0#1|) .cse40 .cse41) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse43 .cse39)))) .cse44 .cse45) (or .cse46 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse38)) .cse40 .cse41) (or .cse42 (= (+ .cse47 .cse43) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse48 .cse49 (= (+ .cse47 .cse50) |ULTIMATE.start_main_~A~0#1|)) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse52)))) .cse46) (or .cse44 .cse45 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse39 .cse50)) .cse48 .cse49) (or (= (+ .cse52 .cse39) |ULTIMATE.start_main_~A~0#1|) .cse51)))) .cse53 .cse54))))) (or (and (or (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|) (and .cse21 .cse22)) .cse1 .cse2 .cse23 .cse24 .cse3 .cse25 .cse26 .cse5 .cse27 .cse28 .cse29 .cse30 .cse31 .cse13 .cse32 .cse14) (and .cse1 .cse2 .cse23 .cse24 .cse3 .cse25 .cse26 .cse5 .cse27 .cse21 .cse28 .cse29 .cse30 .cse22 .cse31 .cse13 .cse32 .cse14) (and .cse1 .cse2 .cse23 .cse24 .cse3 .cse26 .cse5 .cse27 .cse21 .cse28 .cse29 .cse30 .cse22 .cse31 .cse33 .cse13 .cse32 .cse14)))))) .cse10 .cse11 (= (* .cse4 2) |ULTIMATE.start_main_~d~0#1|) .cse12))))))))) [2023-02-17 02:09:48,173 INFO L895 garLoopResultBuilder]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse94 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse77 (div |ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse97 (- .cse77)) (.cse95 (+ .cse94 1))) (let ((.cse15 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse14 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse89 (+ |ULTIMATE.start_main_~q~0#1| .cse95)) (.cse109 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse36 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0)) (.cse74 (+ |ULTIMATE.start_main_~q~0#1| .cse94)) (.cse96 (+ (- 1) .cse97)) (.cse108 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse56 (- |ULTIMATE.start_main_~d~0#1|))) (let ((.cse54 (= .cse94 1)) (.cse35 (= .cse95 1)) (.cse9 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse76 (+ |ULTIMATE.start_main_~r~0#1| .cse56)) (.cse82 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse34 (not .cse108)) (.cse83 (+ |ULTIMATE.start_main_~r~0#1| .cse96)) (.cse106 (* |ULTIMATE.start_main_~B~0#1| .cse74)) (.cse53 (and .cse109 (not .cse36))) (.cse107 (* .cse89 |ULTIMATE.start_main_~B~0#1|)) (.cse85 (+ |ULTIMATE.start_main_~r~0#1| .cse97)) (.cse37 (not .cse109)) (.cse59 (and (not .cse14) .cse108)) (.cse104 (not .cse15)) (.cse33 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))) (let ((.cse19 (* 2 1)) (.cse18 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse0 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse10 (<= |ULTIMATE.start_main_~A~0#1| 5)) (.cse16 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse25 (or .cse104 .cse33)) (.cse90 (or (and (or (= (+ .cse106 .cse85) |ULTIMATE.start_main_~A~0#1|) .cse53) (or (= (+ .cse107 .cse85) |ULTIMATE.start_main_~A~0#1|) .cse36 .cse37)) .cse59)) (.cse23 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse91 (or .cse34 (and (or .cse53 (= (+ .cse83 .cse106) |ULTIMATE.start_main_~A~0#1|)) (or .cse36 .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse107 .cse83)))) .cse14)) (.cse7 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse8 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse30 (= |ULTIMATE.start_main_~A~0#1| (+ .cse76 (* |ULTIMATE.start_main_~B~0#1| .cse82)))) (.cse12 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse17 (or .cse9 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0) (not .cse9)))) (.cse75 (and (or (not .cse54) .cse53) (or .cse36 .cse37 (not .cse35)))) (.cse80 (+ .cse77 1))) (let ((.cse1 (let ((.cse105 (or .cse75 (and (or .cse34 .cse14 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse80)) |ULTIMATE.start_main_~A~0#1|)) (or .cse59 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse77 |ULTIMATE.start_main_~q~0#1|)))))))) (or (and .cse90 .cse23 .cse91 .cse25 .cse105 .cse7 .cse8 .cse9 .cse30 .cse12 .cse17) (and .cse90 .cse23 .cse91 .cse105 .cse7 .cse8 .cse9 .cse30 .cse33 .cse12 .cse17)))) (.cse2 (or .cse75 (and (or (= .cse77 |ULTIMATE.start_main_~B~0#1|) .cse59) (or .cse34 (= |ULTIMATE.start_main_~B~0#1| .cse80) .cse14)))) (.cse5 (<= 2 .cse77)) (.cse13 (or .cse104 .cse16)) (.cse3 (>= |ULTIMATE.start_main_~r~0#1| .cse77)) (.cse11 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse10) (and (or (not .cse0) (not .cse10)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse4 (* 2 .cse18)) (.cse6 (* 2 .cse19))) (or (and (<= 4 |ULTIMATE.start_main_~p~0#1|) .cse0 .cse1 .cse2 .cse3 (= .cse4 |ULTIMATE.start_main_~d~0#1|) .cse5 (= |ULTIMATE.start_main_~p~0#1| .cse6) .cse7 (= |ULTIMATE.start_main_~d~0#1| .cse6) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (= |ULTIMATE.start_main_~d~0#1| 1) .cse15 (>= |ULTIMATE.start_main_~p~0#1| 1) .cse16 .cse7 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse17) (and .cse0 (= |ULTIMATE.start_main_~d~0#1| .cse18) (= |ULTIMATE.start_main_~d~0#1| .cse19) (<= 2 |ULTIMATE.start_main_~p~0#1|) (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 (= |ULTIMATE.start_main_~p~0#1| .cse19)) (let ((.cse20 (* 2 .cse6))) (and .cse0 (<= 8 |ULTIMATE.start_main_~p~0#1|) (>= |ULTIMATE.start_main_~r~0#1| .cse6) (= .cse20 |ULTIMATE.start_main_~p~0#1|) .cse7 (>= |ULTIMATE.start_main_~r~0#1| .cse4) .cse8 .cse9 (= .cse20 |ULTIMATE.start_main_~d~0#1|) (let ((.cse71 (div .cse80 2)) (.cse87 (div .cse95 2)) (.cse69 (div |ULTIMATE.start_main_~d~0#1| 4)) (.cse57 (div |ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse58 (+ .cse57 1)) (.cse100 (< .cse94 0)) (.cse49 (= (mod .cse94 2) 0)) (.cse99 (- .cse69)) (.cse63 (= (mod .cse77 2) 0)) (.cse98 (< .cse77 0)) (.cse86 (+ .cse87 1)) (.cse101 (< .cse95 0)) (.cse40 (= (mod .cse95 2) 0)) (.cse72 (+ .cse71 1)) (.cse103 (< .cse80 0)) (.cse44 (= (mod .cse80 2) 0)) (.cse102 (- .cse71)) (.cse62 (+ .cse69 1))) (let ((.cse65 (not (>= .cse85 .cse62))) (.cse67 (not (>= .cse85 .cse69))) (.cse70 (not (>= .cse83 .cse71))) (.cse47 (+ .cse83 .cse102)) (.cse46 (and .cse103 (not .cse44))) (.cse73 (not (>= .cse83 .cse72))) (.cse45 (not .cse103)) (.cse39 (+ .cse83 (+ (- 1) .cse102))) (.cse42 (and .cse101 (not .cse40))) (.cse43 (* (+ .cse89 .cse87) |ULTIMATE.start_main_~B~0#1|)) (.cse38 (* (+ .cse86 .cse89) |ULTIMATE.start_main_~B~0#1|)) (.cse41 (not .cse101)) (.cse66 (and (not .cse63) .cse98)) (.cse68 (+ .cse99 .cse85)) (.cse51 (and .cse100 (not .cse49))) (.cse52 (* (+ .cse57 .cse74) |ULTIMATE.start_main_~B~0#1|)) (.cse48 (not .cse100)) (.cse60 (+ (+ (- 1) .cse99) .cse85)) (.cse50 (* (+ .cse58 .cse74) |ULTIMATE.start_main_~B~0#1|)) (.cse64 (not .cse98)) (.cse78 (+ .cse76 .cse97)) (.cse81 (+ .cse76 .cse96))) (let ((.cse24 (or .cse15 (let ((.cse93 (* (+ .cse82 .cse95) |ULTIMATE.start_main_~B~0#1|)) (.cse92 (* (+ .cse82 .cse94) |ULTIMATE.start_main_~B~0#1|))) (and (or (and (or (= (+ .cse92 .cse78) |ULTIMATE.start_main_~A~0#1|) .cse53) (or .cse36 .cse37 (= |ULTIMATE.start_main_~A~0#1| (+ .cse78 .cse93)))) .cse59) (or .cse34 (and (or .cse36 (= |ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse93)) .cse37) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse92)) .cse53)) .cse14))))) (.cse26 (or (and (or .cse35 .cse36 .cse37 (and (or .cse63 .cse64 (and (or .cse40 (= (+ .cse60 .cse38) |ULTIMATE.start_main_~A~0#1|) .cse41) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse43 .cse60))))) (or .cse66 (and (or .cse42 (= (+ .cse43 .cse68) |ULTIMATE.start_main_~A~0#1|)) (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse38 .cse68)) .cse40 .cse41))))) (or (and (or .cse66 (and (or (= (+ .cse52 .cse68) |ULTIMATE.start_main_~A~0#1|) .cse51) (or (= (+ .cse68 .cse50) |ULTIMATE.start_main_~A~0#1|) .cse48 .cse49))) (or (and (or .cse51 (= (+ .cse52 .cse60) |ULTIMATE.start_main_~A~0#1|)) (or .cse48 .cse49 (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 .cse50)))) .cse63 .cse64)) .cse53 .cse54)) .cse59)) (.cse27 (or .cse15 (and .cse90 .cse91))) (.cse21 (or (and (or (not (= .cse86 1)) .cse40 .cse41) (or .cse42 (not (= .cse87 1)))) .cse36 (let ((.cse88 (+ .cse89 1))) (and (or .cse59 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse60 (* .cse88 .cse62))) .cse63 .cse64 .cse65) (or .cse66 .cse67 (= (+ (* .cse88 .cse69) .cse68) |ULTIMATE.start_main_~A~0#1|)))) (or .cse34 (and (or .cse70 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 (* .cse88 .cse71))) .cse46) (or .cse73 .cse44 .cse45 (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse88 .cse72) .cse39)))) .cse14))) .cse37)) (.cse28 (or .cse75 (let ((.cse84 (+ |ULTIMATE.start_main_~q~0#1| 1))) (and (or .cse34 (not (>= |ULTIMATE.start_main_~r~0#1| .cse80)) .cse14 (= |ULTIMATE.start_main_~A~0#1| (+ .cse83 (* .cse84 .cse80)))) (or (not .cse3) .cse59 (= (+ (* .cse77 .cse84) .cse85) |ULTIMATE.start_main_~A~0#1|)))))) (.cse29 (or .cse75 (let ((.cse79 (+ .cse82 1))) (and (or (not (>= .cse76 .cse77)) .cse59 (= (+ .cse78 (* .cse77 .cse79)) |ULTIMATE.start_main_~A~0#1|)) (or .cse34 (not (>= .cse76 .cse80)) (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse79 .cse80) .cse81)) .cse14))))) (.cse22 (or (and (or (not (= .cse57 1)) .cse51) (or (not (= .cse58 1)) .cse48 .cse49)) (let ((.cse61 (+ .cse74 1))) (and (or .cse59 (and (or (= (+ .cse60 (* .cse61 .cse62)) |ULTIMATE.start_main_~A~0#1|) .cse63 .cse64 .cse65) (or .cse66 .cse67 (= (+ .cse68 (* .cse61 .cse69)) |ULTIMATE.start_main_~A~0#1|)))) (or .cse34 (and (or .cse70 .cse46 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 (* .cse61 .cse71)))) (or (= |ULTIMATE.start_main_~A~0#1| (+ (* .cse61 .cse72) .cse39)) .cse73 .cse44 .cse45)) .cse14))) .cse53)) (.cse31 (let ((.cse55 (* 2 |ULTIMATE.start_main_~p~0#1|))) (or (= .cse55 1) (= |ULTIMATE.start_main_~A~0#1| (+ (+ (+ (- (* 2 |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~r~0#1|) .cse56) (* |ULTIMATE.start_main_~B~0#1| (+ (+ |ULTIMATE.start_main_~q~0#1| .cse55) |ULTIMATE.start_main_~p~0#1|))))))) (.cse32 (or .cse34 .cse14 (and (or .cse35 .cse36 .cse37 (and (or (and (or (= (+ .cse38 .cse39) |ULTIMATE.start_main_~A~0#1|) .cse40 .cse41) (or .cse42 (= |ULTIMATE.start_main_~A~0#1| (+ .cse43 .cse39)))) .cse44 .cse45) (or .cse46 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse38)) .cse40 .cse41) (or .cse42 (= (+ .cse47 .cse43) |ULTIMATE.start_main_~A~0#1|)))))) (or (and (or (and (or .cse48 .cse49 (= (+ .cse47 .cse50) |ULTIMATE.start_main_~A~0#1|)) (or .cse51 (= |ULTIMATE.start_main_~A~0#1| (+ .cse47 .cse52)))) .cse46) (or .cse44 .cse45 (and (or (= |ULTIMATE.start_main_~A~0#1| (+ .cse39 .cse50)) .cse48 .cse49) (or (= (+ .cse52 .cse39) |ULTIMATE.start_main_~A~0#1|) .cse51)))) .cse53 .cse54))))) (or (and (or (>= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|) (and .cse21 .cse22)) .cse1 .cse2 .cse23 .cse24 .cse3 .cse25 .cse26 .cse5 .cse27 .cse28 .cse29 .cse30 .cse31 .cse13 .cse32 .cse14) (and .cse1 .cse2 .cse23 .cse24 .cse3 .cse25 .cse26 .cse5 .cse27 .cse21 .cse28 .cse29 .cse30 .cse22 .cse31 .cse13 .cse32 .cse14) (and .cse1 .cse2 .cse23 .cse24 .cse3 .cse26 .cse5 .cse27 .cse21 .cse28 .cse29 .cse30 .cse22 .cse31 .cse33 .cse13 .cse32 .cse14)))))) .cse10 .cse11 (= (* .cse4 2) |ULTIMATE.start_main_~d~0#1|) .cse12))))))))) [2023-02-17 02:09:48,174 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-17 02:09:48,174 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-17 02:09:48,174 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-17 02:09:48,174 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-17 02:09:48,174 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-02-17 02:09:48,174 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-17 02:09:48,177 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-17 02:09:48,179 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 02:09:48,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 02:09:48 BoogieIcfgContainer [2023-02-17 02:09:48,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 02:09:48,279 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 02:09:48,279 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 02:09:48,279 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 02:09:48,279 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:08:00" (3/4) ... [2023-02-17 02:09:48,282 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 02:09:48,288 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 02:09:48,292 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-02-17 02:09:48,293 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-02-17 02:09:48,293 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-02-17 02:09:48,293 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 02:09:48,293 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 02:09:48,348 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 02:09:48,348 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 02:09:48,349 INFO L158 Benchmark]: Toolchain (without parser) took 108697.29ms. Allocated memory was 127.9MB in the beginning and 255.9MB in the end (delta: 127.9MB). Free memory was 79.9MB in the beginning and 127.8MB in the end (delta: -47.9MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. [2023-02-17 02:09:48,349 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 127.9MB. Free memory is still 99.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:09:48,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.15ms. Allocated memory is still 127.9MB. Free memory was 79.5MB in the beginning and 69.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 02:09:48,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.51ms. Allocated memory is still 127.9MB. Free memory was 69.0MB in the beginning and 67.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 02:09:48,350 INFO L158 Benchmark]: Boogie Preprocessor took 39.94ms. Allocated memory is still 127.9MB. Free memory was 67.4MB in the beginning and 66.4MB in the end (delta: 991.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:09:48,351 INFO L158 Benchmark]: RCFGBuilder took 293.20ms. Allocated memory is still 127.9MB. Free memory was 66.4MB in the beginning and 55.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 02:09:48,351 INFO L158 Benchmark]: TraceAbstraction took 108041.01ms. Allocated memory was 127.9MB in the beginning and 255.9MB in the end (delta: 127.9MB). Free memory was 54.8MB in the beginning and 132.0MB in the end (delta: -77.2MB). Peak memory consumption was 112.5MB. Max. memory is 16.1GB. [2023-02-17 02:09:48,351 INFO L158 Benchmark]: Witness Printer took 69.74ms. Allocated memory is still 255.9MB. Free memory was 132.0MB in the beginning and 127.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 02:09:48,357 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.16ms. Allocated memory is still 127.9MB. Free memory is still 99.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.15ms. Allocated memory is still 127.9MB. Free memory was 79.5MB in the beginning and 69.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.51ms. Allocated memory is still 127.9MB. Free memory was 69.0MB in the beginning and 67.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.94ms. Allocated memory is still 127.9MB. Free memory was 67.4MB in the beginning and 66.4MB in the end (delta: 991.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 293.20ms. Allocated memory is still 127.9MB. Free memory was 66.4MB in the beginning and 55.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 108041.01ms. Allocated memory was 127.9MB in the beginning and 255.9MB in the end (delta: 127.9MB). Free memory was 54.8MB in the beginning and 132.0MB in the end (delta: -77.2MB). Peak memory consumption was 112.5MB. Max. memory is 16.1GB. * Witness Printer took 69.74ms. Allocated memory is still 255.9MB. Free memory was 132.0MB in the beginning and 127.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 107.9s, OverallIterations: 15, TraceHistogramMax: 21, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 80.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 513 SdHoareTripleChecker+Valid, 55.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 463 mSDsluCounter, 1528 SdHoareTripleChecker+Invalid, 55.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2 IncrementalHoareTripleChecker+Unchecked, 1083 mSDsCounter, 805 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4999 IncrementalHoareTripleChecker+Invalid, 5814 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 805 mSolverCounterUnsat, 445 mSDtfsCounter, 4999 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1839 GetRequests, 1568 SyntacticMatches, 19 SemanticMatches, 252 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 38.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred in iteration=14, InterpolantAutomatonStates: 175, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 81 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 152 PreInvPairs, 218 NumberOfFragments, 213440 HoareAnnotationTreeSize, 152 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 23.1s InterpolantComputationTime, 1019 NumberOfCodeBlocks, 954 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1774 ConstructedInterpolants, 0 QuantifiedInterpolants, 109861 SizeOfPredicates, 56 NumberOfNonLiveVariables, 2395 ConjunctsInSsa, 386 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 7598/8556 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 + -r + -d) / 2 == d && ((A + d + r) % 2 == 0 || !(A + -1 * (d + r) < 0))) || ((A + -1 * (d + r) < 0 && d == (A + -r + -d) / 2 + 1) && !((A + d + r) % 2 == 0))) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && p == 1) && B == -2 * B + -1 * r + A) && 2 == A + -1 * (d + r)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && d + r >= d) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && -2 + q == 1) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && B == 1) && !(d + r + (A + -1 * (d + r)) >= 2 * (2 * 1))) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && -1 * 2 + (-1 * p + q) == 0) || ((((((((((((((((((((((((((p % 2 == 0 || !(p < 0)) || ((((!(d < 0) || ((((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 2 + 1) / 2)) && (((p / 2 + 1) % 2 == 0 || B * ((p / 2 + 1) / 2 + 1 + q) + (-1 + -((d / 2 + 1) / 2) + r) == A) || !(p / 2 + 1 < 0))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + -((d / 2 + 1) / 2) + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == B * ((p / 2 + 1) / 2 + 1 + q) + (r + -((d / 2 + 1) / 2))) || !(p / 2 + 1 < 0)))))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A) && (((p / 2 + 1) % 2 == 0 || A == -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q)) || !(p / 2 + 1 < 0)))) && (((((A == -1 + -(d / 4) + r + B * ((p / 2 + 1) / 2 + 1 + q) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || -1 + -(d / 4) + r + B * (q + (p / 2 + 1) / 2) == A)) || d / 2 % 2 == 0) || !(d / 2 < 0)))) || (!(d % 2 == 0) && d < 0)))) && A >= 0) && d == 1) && !(B * -4 + -1 * r + A + r >= 2 * B)) && (((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0))) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && p == 1) && ((p % 2 == 0 || !(p < 0)) || (((((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || ((((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))) && ((((((p / 2 + 1) / 2 % 2 == 0 || -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A)) || !(d / 4 + 1 < 0)) || (d / 4 + 1) % 2 == 0))) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((d / 4 % 2 == 0 || !(d / 4 < 0)) || (((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A) && (((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A))) && ((!(d / 4 % 2 == 0) && d / 4 < 0) || ((((p / 2 + 1) / 2 % 2 == 0 || !((p / 2 + 1) / 2 < 0)) || r + -(d / 2) + -(d / 8) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) && (r + -(d / 2) + -(d / 8) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A || (!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0)))))) || r + -(d / 2) >= d / 4))) && ((((((d / 2 % 2 == 0 || (((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || (((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + -(d / 2) + -((d / 4 + 1) / 2)) == A) || !((p / 2 + 1) / 2 + 1 < 0)))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || ((-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2)))) || !((p / 2 + 1) / 2 + 1 < 0)))))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || r + -(d / 2) >= d / 4) || (((d / 4 % 2 == 0 || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-1 + -(d / 8) + (r + -(d / 2))) == A))) || !(d / 4 < 0)) && (((A == r + -(d / 2) + -(d / 8) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)) && ((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + -(d / 2) + -(d / 8) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A)) || (!(d / 4 % 2 == 0) && d / 4 < 0))))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((((((((((((p / 2 + 1) / 2 % 2 == 0 || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B)) || !((d / 2 + 1) / 2 + 1 < 0)) || ((d / 2 + 1) / 2 + 1) % 2 == 0) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || ((((p / 2 + 1) / 2 % 2 == 0 || A == r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B == A)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (((!((d / 2 + 1) / 2 < 0) || (((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B == A || (p / 2 + 1) / 2 % 2 == 0) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B))) || (d / 2 + 1) / 2 % 2 == 0) && (((((p / 2 + 1) / 2 % 2 == 0 || ((p / 2 + 1) / 4 + 1 + (q + (p / 2 + 1))) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !((p / 2 + 1) / 2 < 0)) && ((!((p / 2 + 1) / 2 % 2 == 0) && (p / 2 + 1) / 2 < 0) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 4) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))))) || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))) && (((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || ((((((!((d / 2 + 1) / 2 < 0) || (((A == B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4))) || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2)))) || (d / 2 + 1) / 2 % 2 == 0) && ((((B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || ((p / 2 + 1) / 2 + 1) % 2 == 0) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || A == B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) && ((((((!((d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || !((p / 2 + 1) / 2 + 1 < 0)) || r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) || (!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0) && ((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || (((((p / 2 + 1) / 2 + 1) % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (((p / 2 + 1) / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) == A) || !((p / 2 + 1) / 2 + 1 < 0)) && ((!(((p / 2 + 1) / 2 + 1) % 2 == 0) && (p / 2 + 1) / 2 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + (p / 2 + 1) + ((p / 2 + 1) / 2 + 1) / 2) == A)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1))))) || d % 2 == 0)))) && B * -4 + -1 * r + A == B) && p >= 1) && q + -4 == 1) && ((p < 0 && !(p % 2 == 0)) || ((((!(d < 0) || (((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || ((B * (p / 4 + q) + (r + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == r + -((d / 2 + 1) / 2) + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((A == -1 + -((d / 2 + 1) / 2) + r + B * (q + (p / 4 + 1)) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (A == B * (p / 4 + q) + (-1 + -((d / 2 + 1) / 2) + r) || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || r >= d / 2 + 1) || d % 2 == 0) && ((r >= d / 2 || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || (((!(p / 2 < 0) || A == -1 + -(d / 4) + r + B * (q + (p / 4 + 1))) || p / 2 % 2 == 0) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == -1 + -(d / 4) + r + B * (p / 4 + q)))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((-(d / 4) + r + B * (q + (p / 4 + 1)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-(d / 4) + r + B * (p / 4 + q) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))))))) || (!(d % 2 == 0) && d < 0))))) && B * p == d) && A == r + -d + B * (p + q)) && A + -4 + 4 >= 2 * (2 * 1)) && ((((!(d % 2 == 0) && d < 0) || ((((((((((d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0)) || ((A == r + -(d / 2) + -((d / 4 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))))) && ((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || (((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))) == A) && (((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -((d / 4 + 1) / 2) + (r + -(d / 2))))))) || d / 2 % 2 == 0) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || r + -(d / 2) >= d / 4) || (((d / 4 % 2 == 0 || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-1 + -(d / 8) + (r + -(d / 2)))) && ((q + p / 2 + (p / 4 + 1) / 2) * B + (-1 + -(d / 8) + (r + -(d / 2))) == A || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || !(d / 4 < 0)) && (((((p / 4 + 1) % 2 == 0 || r + -(d / 2) + -(d / 8) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + -(d / 2) + -(d / 8) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || (!(d / 4 % 2 == 0) && d / 4 < 0))))) || !(p / 2 < 0)) || p / 2 % 2 == 0) && (((((d / 2 % 2 == 0 || (((!(d / 4 + 1 < 0) || (d / 4 + 1) % 2 == 0) || ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((A == -1 + -((d / 4 + 1) / 2) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) || p / 4 % 2 == 0) || !(p / 4 < 0)))) && ((((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -((d / 4 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2))) && ((!(p / 4 % 2 == 0) && p / 4 < 0) || r + -(d / 2) + -((d / 4 + 1) / 2) + B * (q + p / 2 + p / 8) == A)) || (d / 4 + 1 < 0 && !((d / 4 + 1) % 2 == 0))))) || !(d / 2 < 0)) || r + -(d / 2) >= d / 4 + 1) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || (((((p / 4 % 2 == 0 || !(p / 4 < 0)) || A == r + -(d / 2) + -(d / 8) + B * (p / 8 + 1 + (q + p / 2))) && (r + -(d / 2) + -(d / 8) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0))) || (!(d / 4 % 2 == 0) && d / 4 < 0)) && ((d / 4 % 2 == 0 || ((-1 + -(d / 8) + (r + -(d / 2)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((-1 + -(d / 8) + (r + -(d / 2)) + B * (p / 8 + 1 + (q + p / 2)) == A || p / 4 % 2 == 0) || !(p / 4 < 0)))) || !(d / 4 < 0)))) || r + -(d / 2) >= d / 4)) || (p / 2 < 0 && !(p / 2 % 2 == 0))))) && ((!(d < 0) || (((((((((!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0) || (((!(p / 4 % 2 == 0) && p / 4 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (q + p / 2 + p / 8) == A) && ((p / 4 % 2 == 0 || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (p / 8 + 1 + (q + p / 2)) == A) || !(p / 4 < 0)))) && ((!((d / 2 + 1) / 2 + 1 < 0) || (((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (q + p / 2 + p / 8) || (!(p / 4 % 2 == 0) && p / 4 < 0)))) || ((d / 2 + 1) / 2 + 1) % 2 == 0)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((((!((d / 2 + 1) / 2 < 0) || ((r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (q + p / 2 + p / 8) == A || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (p / 8 + 1 + (q + p / 2))) || !(p / 4 < 0)))) || (d / 2 + 1) / 2 % 2 == 0) && (((A == B * (q + p / 2 + p / 8) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) || (!(p / 4 % 2 == 0) && p / 4 < 0)) && ((p / 4 % 2 == 0 || B * (p / 8 + 1 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) || !(p / 4 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0))) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2)) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && (((((((((((r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || r + (-1 + -(d / 2)) + -(((d / 2 + 1) / 2 + 1) / 2) + (q + p / 2 + (p / 4 + 1) / 2) * B == A)) || (!(((d / 2 + 1) / 2 + 1) % 2 == 0) && (d / 2 + 1) / 2 + 1 < 0)) && ((!((d / 2 + 1) / 2 + 1 < 0) || ((d / 2 + 1) / 2 + 1) % 2 == 0) || ((((p / 4 + 1) % 2 == 0 || !(p / 4 + 1 < 0)) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2))) && ((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || A == r + (-1 + -(d / 2)) + (-1 + -(((d / 2 + 1) / 2 + 1) / 2)) + (q + p / 2 + (p / 4 + 1) / 2) * B)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) && (((((((!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0) || (q + p / 2 + (p / 4 + 1) / 2) * B + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A) && ((B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) + (-((d / 2 + 1) / 4) + (r + (-1 + -(d / 2)))) == A || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0))) || (!((d / 2 + 1) / 2 % 2 == 0) && (d / 2 + 1) / 2 < 0)) && ((!((d / 2 + 1) / 2 < 0) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + B * (1 + (p / 4 + 1) / 2 + (q + p / 2)) || (p / 4 + 1) % 2 == 0) || !(p / 4 + 1 < 0)) && (A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 4)) + (q + p / 2 + (p / 4 + 1) / 2) * B || (!((p / 4 + 1) % 2 == 0) && p / 4 + 1 < 0)))) || (d / 2 + 1) / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0))) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && A + -4 >= d) && A >= 2 * (2 * B)) && A <= 5) && (((cond == 1 && A >= 0) && A <= 5) || ((!(A >= 0) || !(A <= 5)) && cond == 0))) && q == p + 4) && B == 1) && (((((!(d % 2 == 0) && d < 0) || ((((((!(p / 2 < 0) || p / 2 % 2 == 0) || (p + q + (p / 4 + 1)) * B + (r + -d + (-1 + -(d / 4))) == A) && (A == r + -d + (-1 + -(d / 4)) + (p / 4 + (p + q)) * B || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || d / 2 % 2 == 0) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 < 0 && !(p / 2 % 2 == 0)) || -(d / 4) + (r + -d) + (p / 4 + (p + q)) * B == A) && (((p + q + (p / 4 + 1)) * B + (-(d / 4) + (r + -d)) == A || !(p / 2 < 0)) || p / 2 % 2 == 0))))) || r + -d >= d / 2) && (((!(d < 0) || ((((((-1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 4 + 1)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0) && (-1 + -((d / 2 + 1) / 2) + (r + -d) + (p / 4 + (p + q)) * B == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((((p / 4 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((A == (p + q + (p / 4 + 1)) * B + (r + -d + -((d / 2 + 1) / 2)) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || r + -d >= d / 2 + 1) || d % 2 == 0)) || (p < 0 && !(p % 2 == 0)))) && ((p % 2 == 0 || ((((!(d % 2 == 0) && d < 0) || r + -d >= d / 2) || (((d / 2 % 2 == 0 || ((((p / 2 + 1) % 2 == 0 || !(p / 2 + 1 < 0)) || A == r + -d + (-1 + -(d / 4)) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) && (A == r + -d + (-1 + -(d / 4)) + (p + q + (p / 2 + 1) / 2) * B || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))) || !(d / 2 < 0)) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || ((((p / 2 + 1) % 2 == 0 || A == -(d / 4) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p + q + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -d)) == A || (p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0))))))) && (((!(d < 0) || r + -d >= d / 2 + 1) || (((((((p / 2 + 1) % 2 == 0 || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + ((p / 2 + 1) / 2 + 1 + (p + q)) * B) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == -1 + -((d / 2 + 1) / 2) + (r + -d) + (p + q + (p / 2 + 1) / 2) * B)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((((A == ((p / 2 + 1) / 2 + 1 + (p + q)) * B + (r + -d + -((d / 2 + 1) / 2)) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (p + q + (p / 2 + 1) / 2) * B + (r + -d + -((d / 2 + 1) / 2)) == A)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))))) || d % 2 == 0))) || !(p < 0))) && A + -4 + -d == r)) || (((((((((((((A >= 0 && 8 <= p) && r >= 2 * (2 * 1)) && 2 * (2 * (2 * 1)) == p) && q == 0) && r >= 2 * (2 * B)) && B * p == d) && A == r) && 2 * (2 * (2 * 1)) == d) && A <= 5) && (((cond == 1 && A >= 0) && A <= 5) || ((!(A >= 0) || !(A <= 5)) && cond == 0))) && 2 * (2 * B) * 2 == d) && B == 1) && (((((((((((((((((((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0))) && (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) || ((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0) || ((((((((((((((((((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0))) && (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) || ((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && d * q + r == A) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0)))) || ((((((((((d + r == A && d == 1) && (((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0))) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && p == 1) && B == d) && r == -B + A) && A == r + -d + B * (p + q)) && B == 1) && q == 0 + 1) && p + 0 == q)) || ((((p == 1 && B == d) && q == 0) && A == r) && B == 1)) || (((((((((((((((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0))) && (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) || ((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1))) && r >= d / 2) && 2 * (2 * B) == d) && 2 <= d / 2) && p == 2 * (2 * 1)) && q == 0) && d == 2 * (2 * 1)) && !(r >= d)) && A == r) && B == 1) && (!(p == 1) || B == d)) && d % 2 == 0)) || ((((((((((((((((((((((A >= 0 && 4 + 0 == q) && A == r + 4) && A == B * q + r) && ((d == (A + -r) / 2 && (!(-1 * r + A < 0) || (A + r) % 2 == 0)) || ((d == (A + -r) / 2 + 1 && !((A + r) % 2 == 0)) && -1 * r + A < 0))) && -1 * r + A == B * 4) && 2 == p) && 2 <= p) && !(r >= d)) && B * p == d) && q == 4) && ((q / 2 == p && (q % 2 == 0 || !(q < 0))) || ((!(q % 2 == 0) && q < 0) && q / 2 + 1 == p))) && A == r + -d + B * (p + q)) && ((!(p == 1) || r + -d + d * (p + q) == A) || !(r >= d))) && A >= 2 * (2 * B)) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && A <= 5) && (((cond == 1 && A >= 0) && A <= 5) || ((!(A >= 0) || !(A <= 5)) && cond == 0))) && B == 1) && (A == B * q + r || (A == B * q + r && 1 <= d))) && 2 == d) && r + 4 >= 2 * (2 * 1)) && ((((((!(d % 2 == 0) && d < 0) || r + -d + -(2 * d / 4) + 2 * d / 4 * (p + q + 1) == A) || !(r + -d >= 2 * d / 4)) && (((!(d < 0) || !(r + -d >= 2 * d / 4 + 1)) || -1 + -(2 * d / 4) + (r + -d) + (2 * d / 4 + 1) * (p + q + 1) == A) || d % 2 == 0)) || (((!(1 == 2 * p / 4 + 1) || p % 2 == 0) || !(p < 0)) && (!(2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))))) || r >= 2 * d))) || ((((((d == 2 * B && d == 2 * 1) && q == 0) && B * p == d) && A == r) && B == 1) && p == 2 * 1)) || ((((((((((4 + 0 == q && A == B * q + r) && p == 1) && -1 * r + A == B * 4) && p >= 1) && (((!(r >= (A + -r) / 2) && (!(-1 * r + A < 0) || (A + r) % 2 == 0)) && ((((A + -r) / 2 < 0 && (A + -r) / 4 + 1 == d) && !((A + -r) / 2 % 2 == 0)) || (((A + -r) / 2 % 2 == 0 || !((A + -r) / 2 < 0)) && d == (A + -r) / 4))) || (((!(r >= (A + -r) / 2 + 1) && ((((A + -r) / 2 + 1 < 0 && !(((A + -r) / 2 + 1) % 2 == 0)) && ((A + -r) / 2 + 1) / 2 + 1 == d) || ((((A + -r) / 2 + 1) % 2 == 0 || !((A + -r) / 2 + 1 < 0)) && ((A + -r) / 2 + 1) / 2 == d))) && !((A + r) % 2 == 0)) && -1 * r + A < 0))) && ((!(p == 1) || r + -d + d * (p + q) == A) || !(r >= d))) && A >= 2 * (2 * B)) && B == 1) && (A == B * q + r || (A == B * q + r && 1 <= d))) && ((((((!(d % 2 == 0) && d < 0) || r + -d + -(2 * d / 4) + 2 * d / 4 * (p + q + 1) == A) || !(r + -d >= 2 * d / 4)) && (((!(d < 0) || !(r + -d >= 2 * d / 4 + 1)) || -1 + -(2 * d / 4) + (r + -d) + (2 * d / 4 + 1) * (p + q + 1) == A) || d % 2 == 0)) || (((!(1 == 2 * p / 4 + 1) || p % 2 == 0) || !(p < 0)) && (!(2 * p / 4 == 1) || (p < 0 && !(p % 2 == 0))))) || r >= 2 * d))) || (((((((d == (A + -r) / 2 && (!(-1 * r + A < 0) || (A + r) % 2 == 0)) || ((d == (A + -r) / 2 + 1 && !((A + r) % 2 == 0)) && -1 * r + A < 0)) && p == 1) && -1 * (2 * 1) + q == 0) && B == 1) && (A == B * q + r || (A == B * q + r && 1 <= d))) && -1 * r + A == 2 * B)) || ((((((((((((((((((((((4 <= p && A >= 0) && p == 4) && d + r == A) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && d + r >= 2 * (2 * 1)) && (!(p == 1) || d * q + r == A)) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && d == B * 4) && 2 <= d) && B * p == d) && d == 4) && A == r + -d + B * (p + q)) && A + -d == r) && A >= 2 * (2 * B)) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && A <= 5) && (((cond == 1 && A >= 0) && A <= 5) || ((!(A >= 0) || !(A <= 5)) && cond == 0))) && B == 1) && (!(p == 1) || B == d)) && p + 0 == q)) || ((((((((((((d + r == A && A == B * q + r) && (!(p == 1) || d * q + r == A)) && d == 2 * B) && 2 == p) && 2 <= d) && A == r + -d + B * (p + q)) && -1 * p + q == 0) && B == 1) && (!(p == 1) || B == d)) && 2 == d) && !(d + r >= 2 * (2 * 1))) && p == 2 * 1) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((((((((((((4 <= p && A >= 0) && ((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && r >= d / 2) && 2 * (2 * B) == d) && 2 <= d / 2) && p == 2 * (2 * 1)) && q == 0) && d == 2 * (2 * 1)) && B * p == d) && A == r) && A <= 5) && (((cond == 1 && A >= 0) && A <= 5) || ((!(A >= 0) || !(A <= 5)) && cond == 0))) && B == 1) && (!(p == 1) || B == d)) && d % 2 == 0) || ((((((((((((A >= 0 && d == 1) && p == 1) && p >= 1) && B == d) && q == 0) && 1 <= d) && B * p == d) && A == r) && A <= 5) && (((cond == 1 && A >= 0) && A <= 5) || ((!(A >= 0) || !(A <= 5)) && cond == 0))) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r))))) || ((((((((((((A >= 0 && d == 2 * B) && d == 2 * 1) && 2 <= p) && 2 <= d) && q == 0) && B * p == d) && A == r) && A <= 5) && (((cond == 1 && A >= 0) && A <= 5) || ((!(A >= 0) || !(A <= 5)) && cond == 0))) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) && p == 2 * 1)) || (((((((((((((A >= 0 && 8 <= p) && r >= 2 * (2 * 1)) && 2 * (2 * (2 * 1)) == p) && q == 0) && r >= 2 * (2 * B)) && B * p == d) && A == r) && 2 * (2 * (2 * 1)) == d) && (((((((((((((((((((r >= d || (((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0))))) && ((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0) || (((((((((((((((((((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (!(p == 1) || d * q + r == A)) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0)) || (((((((((((((((((((((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (!(p == 1) || d * q + r == A)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) || (((((((((((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && A == B * q + r) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(d < 0) || d % 2 == 0) || r + q * (d / 2 + 1) == A) && ((!(d % 2 == 0) && d < 0) || A == r + d / 2 * q)))) && q == 0) && B * p == d) && A == r) && A == r + -d + B * (p + q)) && d * q + r == A) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r))))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((d / 2 == B || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || B == d / 2 + 1) || d % 2 == 0)))) && A == B * q + r) && (p == 1 || (((((p + q + p / 2) * B + (r + -d + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || A == r + -d + -(d / 2) + (p + q + (p / 2 + 1)) * B)) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p % 2 == 0 || A == r + -d + (-1 + -(d / 2)) + (p + q + (p / 2 + 1)) * B) || !(p < 0)) && (A == r + -d + (-1 + -(d / 2)) + (p + q + p / 2) * B || (p < 0 && !(p % 2 == 0))))) || d % 2 == 0)))) && r >= d / 2) && (((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || (((d / 2 % 2 == 0 || !(d / 2 < 0)) || ((((p / 2 + 1) % 2 == 0 || -1 + -(d / 4) + (r + -(d / 2)) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B == A) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-1 + -(d / 4) + (r + -(d / 2)))))) && ((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (-(d / 4) + (r + -(d / 2))) == A) && ((A == ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (-(d / 4) + (r + -(d / 2))) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)))))) && (((((!(d / 2 % 2 == 0) && d / 2 < 0) || (((p / 4 + (q + p / 2)) * B + (-(d / 4) + (r + -(d / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((-(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B == A || !(p / 2 < 0)) || p / 2 % 2 == 0))) && (((((p / 2 < 0 && !(p / 2 % 2 == 0)) || (p / 4 + (q + p / 2)) * B + (-1 + -(d / 4) + (r + -(d / 2))) == A) && ((!(p / 2 < 0) || p / 2 % 2 == 0) || A == -1 + -(d / 4) + (r + -(d / 2)) + (p / 4 + 1 + (q + p / 2)) * B)) || d / 2 % 2 == 0) || !(d / 2 < 0))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)) || (!(d % 2 == 0) && d < 0))) && 2 <= d / 2) && (p == 1 || ((((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0)) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)))) && ((((((!((p / 2 + 1) / 2 + 1 == 1) || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || !((p / 2 + 1) / 2 == 1))) || p % 2 == 0) || (((!(d % 2 == 0) && d < 0) || ((((A == -1 + -(d / 4) + (r + -(d / 2)) + (q + (p / 2 + 1) + 1) * (d / 4 + 1) || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || (q + (p / 2 + 1) + 1) * (d / 4) + (-(d / 4) + (r + -(d / 2))) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) || A == (q + (p / 2 + 1) + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)))))) || d % 2 == 0))) || !(p < 0))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || ((((!(d < 0) || !(r >= d / 2 + 1)) || d % 2 == 0) || A == r + (-1 + -(d / 2)) + (q + 1) * (d / 2 + 1)) && ((!(r >= d / 2) || (!(d % 2 == 0) && d < 0)) || d / 2 * (q + 1) + (r + -(d / 2)) == A)))) && (((!(p / 2 == 1) || (p < 0 && !(p % 2 == 0))) && ((p % 2 == 0 || !(p < 0)) || !(p / 2 + 1 == 1))) || (((!(r + -d >= d / 2) || (!(d % 2 == 0) && d < 0)) || r + -d + -(d / 2) + d / 2 * (p + q + 1) == A) && (((!(d < 0) || !(r + -d >= d / 2 + 1)) || A == (p + q + 1) * (d / 2 + 1) + (r + -d + (-1 + -(d / 2)))) || d % 2 == 0)))) && A == r + -d + B * (p + q)) && ((((!(p / 4 == 1) || (p / 2 < 0 && !(p / 2 % 2 == 0))) && ((!(p / 4 + 1 == 1) || !(p / 2 < 0)) || p / 2 % 2 == 0)) || (((!(d % 2 == 0) && d < 0) || ((((-1 + -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4 + 1) == A || d / 2 % 2 == 0) || !(d / 2 < 0)) || !(r + -(d / 2) >= d / 4 + 1)) && (((!(d / 2 % 2 == 0) && d / 2 < 0) || !(r + -(d / 2) >= d / 4)) || -(d / 4) + (r + -(d / 2)) + (q + p / 2 + 1) * (d / 4) == A))) && ((!(d < 0) || (((!(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + p / 2 + 1) * ((d / 2 + 1) / 2)) && (((A == (q + p / 2 + 1) * ((d / 2 + 1) / 2 + 1) + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) || !(r + (-1 + -(d / 2)) >= (d / 2 + 1) / 2 + 1)) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)))) || d % 2 == 0))) || (p < 0 && !(p % 2 == 0)))) && (2 * p == 1 || A == -(2 * d) + r + -d + B * (q + 2 * p + p))) && d * q + r == A) && (!(p == 1) || B == d)) && ((!(d < 0) || d % 2 == 0) || ((((p / 2 + 1 == 1 || p % 2 == 0) || !(p < 0)) || ((((((((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || A == (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))))) || (d / 2 + 1) % 2 == 0) || !(d / 2 + 1 < 0)) && ((d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0)) || (((A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + ((p / 2 + 1) / 2 + 1 + (q + (p / 2 + 1))) * B || (p / 2 + 1) % 2 == 0) || !(p / 2 + 1 < 0)) && ((p / 2 + 1 < 0 && !((p / 2 + 1) % 2 == 0)) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (q + (p / 2 + 1) + (p / 2 + 1) / 2) * B == A))))) && (((((((!(p / 2 < 0) || p / 2 % 2 == 0) || r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + 1 + (q + p / 2)) * B == A) && ((p / 2 < 0 && !(p / 2 % 2 == 0)) || A == r + (-1 + -(d / 2)) + -((d / 2 + 1) / 2) + (p / 4 + (q + p / 2)) * B)) || (d / 2 + 1 < 0 && !((d / 2 + 1) % 2 == 0))) && (((d / 2 + 1) % 2 == 0 || !(d / 2 + 1 < 0)) || (((A == r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2)) + (p / 4 + 1 + (q + p / 2)) * B || !(p / 2 < 0)) || p / 2 % 2 == 0) && ((p / 4 + (q + p / 2)) * B + (r + (-1 + -(d / 2)) + (-1 + -((d / 2 + 1) / 2))) == A || (p / 2 < 0 && !(p / 2 % 2 == 0)))))) || (p < 0 && !(p % 2 == 0))) || p / 2 == 1)))) && d % 2 == 0))) && A <= 5) && (((cond == 1 && A >= 0) && A <= 5) || ((!(A >= 0) || !(A <= 5)) && cond == 0))) && 2 * (2 * B) * 2 == d) && B == 1) RESULT: Ultimate proved your program to be correct! [2023-02-17 02:09:48,503 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