./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4e2993d4b0d2c145cb6ebddb0d9f125eb6995ee629adf15e0b0f7e55a8d8a49a --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 01:27:49,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 01:27:49,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 01:27:49,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 01:27:49,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 01:27:49,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 01:27:49,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 01:27:49,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 01:27:49,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 01:27:49,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 01:27:49,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 01:27:49,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 01:27:49,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 01:27:49,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 01:27:49,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 01:27:49,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 01:27:49,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 01:27:49,742 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 01:27:49,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 01:27:49,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 01:27:49,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 01:27:49,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 01:27:49,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 01:27:49,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 01:27:49,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 01:27:49,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 01:27:49,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 01:27:49,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 01:27:49,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 01:27:49,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 01:27:49,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 01:27:49,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 01:27:49,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 01:27:49,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 01:27:49,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 01:27:49,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 01:27:49,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 01:27:49,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 01:27:49,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 01:27:49,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 01:27:49,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 01:27:49,768 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 01:27:49,794 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 01:27:49,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 01:27:49,795 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 01:27:49,795 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 01:27:49,796 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 01:27:49,796 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 01:27:49,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 01:27:49,797 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 01:27:49,797 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 01:27:49,797 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 01:27:49,798 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 01:27:49,798 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 01:27:49,798 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 01:27:49,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 01:27:49,798 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 01:27:49,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 01:27:49,799 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 01:27:49,799 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 01:27:49,799 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 01:27:49,799 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 01:27:49,799 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 01:27:49,799 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 01:27:49,800 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 01:27:49,800 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 01:27:49,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 01:27:49,800 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 01:27:49,800 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 01:27:49,800 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 01:27:49,801 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 01:27:49,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 01:27:49,801 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 01:27:49,801 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 01:27:49,801 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 01:27:49,802 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 01:27:49,802 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 01:27:49,802 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 -> 4e2993d4b0d2c145cb6ebddb0d9f125eb6995ee629adf15e0b0f7e55a8d8a49a [2023-02-17 01:27:49,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 01:27:50,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 01:27:50,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 01:27:50,026 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 01:27:50,026 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 01:27:50,027 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound10.c [2023-02-17 01:27:51,190 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 01:27:51,333 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 01:27:51,333 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound10.c [2023-02-17 01:27:51,338 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c51b9bf97/a2d9fc6756ef4ac690f4c3b187647279/FLAG01cd5b1a6 [2023-02-17 01:27:51,349 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c51b9bf97/a2d9fc6756ef4ac690f4c3b187647279 [2023-02-17 01:27:51,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 01:27:51,352 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 01:27:51,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 01:27:51,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 01:27:51,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 01:27:51,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 01:27:51" (1/1) ... [2023-02-17 01:27:51,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161effb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:51, skipping insertion in model container [2023-02-17 01:27:51,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 01:27:51" (1/1) ... [2023-02-17 01:27:51,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 01:27:51,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 01:27:51,466 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/cohencu-ll_valuebound10.c[588,601] [2023-02-17 01:27:51,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 01:27:51,491 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 01:27:51,502 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/cohencu-ll_valuebound10.c[588,601] [2023-02-17 01:27:51,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 01:27:51,522 INFO L208 MainTranslator]: Completed translation [2023-02-17 01:27:51,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:51 WrapperNode [2023-02-17 01:27:51,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 01:27:51,524 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 01:27:51,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 01:27:51,524 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 01:27:51,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:51" (1/1) ... [2023-02-17 01:27:51,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:51" (1/1) ... [2023-02-17 01:27:51,555 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2023-02-17 01:27:51,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 01:27:51,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 01:27:51,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 01:27:51,556 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 01:27:51,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:51" (1/1) ... [2023-02-17 01:27:51,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:51" (1/1) ... [2023-02-17 01:27:51,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:51" (1/1) ... [2023-02-17 01:27:51,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:51" (1/1) ... [2023-02-17 01:27:51,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:51" (1/1) ... [2023-02-17 01:27:51,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:51" (1/1) ... [2023-02-17 01:27:51,572 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:51" (1/1) ... [2023-02-17 01:27:51,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:51" (1/1) ... [2023-02-17 01:27:51,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 01:27:51,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 01:27:51,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 01:27:51,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 01:27:51,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:51" (1/1) ... [2023-02-17 01:27:51,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 01:27:51,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:27:51,603 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 01:27:51,613 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 01:27:51,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 01:27:51,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 01:27:51,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 01:27:51,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 01:27:51,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 01:27:51,638 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 01:27:51,688 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 01:27:51,689 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 01:27:51,817 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 01:27:51,822 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 01:27:51,822 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 01:27:51,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:27:51 BoogieIcfgContainer [2023-02-17 01:27:51,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 01:27:51,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 01:27:51,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 01:27:51,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 01:27:51,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 01:27:51" (1/3) ... [2023-02-17 01:27:51,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f377afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 01:27:51, skipping insertion in model container [2023-02-17 01:27:51,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:27:51" (2/3) ... [2023-02-17 01:27:51,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f377afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 01:27:51, skipping insertion in model container [2023-02-17 01:27:51,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:27:51" (3/3) ... [2023-02-17 01:27:51,831 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound10.c [2023-02-17 01:27:51,847 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 01:27:51,848 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 01:27:51,898 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 01:27:51,903 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;@638e203a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 01:27:51,904 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 01:27:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-17 01:27:51,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 01:27:51,928 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:27:51,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:27:51,943 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:27:51,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:27:51,963 INFO L85 PathProgramCache]: Analyzing trace with hash -588951690, now seen corresponding path program 1 times [2023-02-17 01:27:51,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:27:51,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029753066] [2023-02-17 01:27:51,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:51,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:27:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:27:52,147 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 01:27:52,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:27:52,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029753066] [2023-02-17 01:27:52,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029753066] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:27:52,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:27:52,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 01:27:52,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689924677] [2023-02-17 01:27:52,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:27:52,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 01:27:52,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:27:52,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 01:27:52,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 01:27:52,202 INFO L87 Difference]: Start difference. First operand has 27 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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 01:27:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:27:52,224 INFO L93 Difference]: Finished difference Result 51 states and 89 transitions. [2023-02-17 01:27:52,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 01:27:52,237 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 01:27:52,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:27:52,242 INFO L225 Difference]: With dead ends: 51 [2023-02-17 01:27:52,242 INFO L226 Difference]: Without dead ends: 23 [2023-02-17 01:27:52,244 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 01:27:52,246 INFO L413 NwaCegarLoop]: 37 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, 37 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 01:27:52,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 01:27:52,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-17 01:27:52,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-17 01:27:52,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 01:27:52,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2023-02-17 01:27:52,282 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 9 [2023-02-17 01:27:52,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:27:52,283 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2023-02-17 01:27:52,284 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 01:27:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2023-02-17 01:27:52,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 01:27:52,285 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:27:52,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:27:52,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 01:27:52,286 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:27:52,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:27:52,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1187604804, now seen corresponding path program 1 times [2023-02-17 01:27:52,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:27:52,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496285421] [2023-02-17 01:27:52,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:52,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:27:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:27:52,498 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 01:27:52,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:27:52,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496285421] [2023-02-17 01:27:52,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496285421] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:27:52,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:27:52,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 01:27:52,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350356229] [2023-02-17 01:27:52,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:27:52,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 01:27:52,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:27:52,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 01:27:52,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 01:27:52,502 INFO L87 Difference]: Start difference. First operand 23 states and 33 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 01:27:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:27:52,628 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2023-02-17 01:27:52,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 01:27:52,629 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 01:27:52,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:27:52,630 INFO L225 Difference]: With dead ends: 29 [2023-02-17 01:27:52,630 INFO L226 Difference]: Without dead ends: 27 [2023-02-17 01:27:52,631 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 01:27:52,633 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:27:52,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:27:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-17 01:27:52,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-17 01:27:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 01:27:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-02-17 01:27:52,646 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 9 [2023-02-17 01:27:52,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:27:52,646 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-02-17 01:27:52,647 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 01:27:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-02-17 01:27:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 01:27:52,647 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:27:52,648 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:27:52,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 01:27:52,648 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:27:52,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:27:52,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1137950087, now seen corresponding path program 1 times [2023-02-17 01:27:52,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:27:52,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529193378] [2023-02-17 01:27:52,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:52,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:27:52,662 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:27:52,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [270512438] [2023-02-17 01:27:52,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:52,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:27:52,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:27:52,666 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 01:27:52,680 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 01:27:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:27:52,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 01:27:52,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:27:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:27:52,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:27:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:27:52,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:27:52,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529193378] [2023-02-17 01:27:52,942 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:27:52,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270512438] [2023-02-17 01:27:52,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270512438] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:27:52,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:27:52,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-17 01:27:52,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923719120] [2023-02-17 01:27:52,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:27:52,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 01:27:52,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:27:52,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 01:27:52,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-17 01:27:52,950 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:27:53,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:27:53,263 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2023-02-17 01:27:53,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 01:27:53,264 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2023-02-17 01:27:53,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:27:53,266 INFO L225 Difference]: With dead ends: 52 [2023-02-17 01:27:53,266 INFO L226 Difference]: Without dead ends: 50 [2023-02-17 01:27:53,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:27:53,267 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 01:27:53,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 60 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 01:27:53,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-17 01:27:53,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2023-02-17 01:27:53,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-17 01:27:53,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2023-02-17 01:27:53,281 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 14 [2023-02-17 01:27:53,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:27:53,282 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2023-02-17 01:27:53,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:27:53,282 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2023-02-17 01:27:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 01:27:53,285 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:27:53,285 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:27:53,293 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 01:27:53,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:27:53,491 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:27:53,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:27:53,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1500531996, now seen corresponding path program 1 times [2023-02-17 01:27:53,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:27:53,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27702937] [2023-02-17 01:27:53,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:53,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:27:53,506 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:27:53,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1492860799] [2023-02-17 01:27:53,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:53,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:27:53,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:27:53,510 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 01:27:53,512 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 01:27:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:27:53,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 01:27:53,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:27:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 01:27:53,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:27:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 01:27:53,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:27:53,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27702937] [2023-02-17 01:27:53,642 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:27:53,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492860799] [2023-02-17 01:27:53,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492860799] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:27:53,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:27:53,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-17 01:27:53,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164141705] [2023-02-17 01:27:53,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:27:53,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 01:27:53,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:27:53,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 01:27:53,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-17 01:27:53,649 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 01:27:53,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:27:53,852 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2023-02-17 01:27:53,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 01:27:53,853 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 19 [2023-02-17 01:27:53,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:27:53,854 INFO L225 Difference]: With dead ends: 54 [2023-02-17 01:27:53,855 INFO L226 Difference]: Without dead ends: 52 [2023-02-17 01:27:53,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:27:53,856 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 01:27:53,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 47 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 01:27:53,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-17 01:27:53,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2023-02-17 01:27:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-17 01:27:53,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2023-02-17 01:27:53,879 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 19 [2023-02-17 01:27:53,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:27:53,879 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2023-02-17 01:27:53,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 01:27:53,880 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2023-02-17 01:27:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 01:27:53,880 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:27:53,881 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:27:53,886 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 01:27:54,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-17 01:27:54,087 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:27:54,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:27:54,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1926539111, now seen corresponding path program 1 times [2023-02-17 01:27:54,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:27:54,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625853757] [2023-02-17 01:27:54,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:54,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:27:54,104 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:27:54,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1580049884] [2023-02-17 01:27:54,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:54,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:27:54,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:27:54,129 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 01:27:54,130 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 01:27:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:27:54,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 01:27:54,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:27:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 01:27:54,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:27:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 01:27:54,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:27:54,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625853757] [2023-02-17 01:27:54,389 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:27:54,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580049884] [2023-02-17 01:27:54,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580049884] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:27:54,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:27:54,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-17 01:27:54,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238698145] [2023-02-17 01:27:54,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:27:54,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 01:27:54,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:27:54,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 01:27:54,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-17 01:27:54,396 INFO L87 Difference]: Start difference. First operand 51 states and 68 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, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-17 01:27:55,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:27:55,003 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2023-02-17 01:27:55,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 01:27:55,004 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, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2023-02-17 01:27:55,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:27:55,005 INFO L225 Difference]: With dead ends: 67 [2023-02-17 01:27:55,005 INFO L226 Difference]: Without dead ends: 58 [2023-02-17 01:27:55,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:27:55,005 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-17 01:27:55,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 60 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-17 01:27:55,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-17 01:27:55,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-02-17 01:27:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 31 states have (on average 1.064516129032258) internal successors, (33), 33 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-02-17 01:27:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2023-02-17 01:27:55,019 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 24 [2023-02-17 01:27:55,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:27:55,020 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2023-02-17 01:27:55,020 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, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-17 01:27:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2023-02-17 01:27:55,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 01:27:55,021 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:27:55,021 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:27:55,045 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 01:27:55,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:27:55,226 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:27:55,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:27:55,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1495173479, now seen corresponding path program 1 times [2023-02-17 01:27:55,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:27:55,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963373297] [2023-02-17 01:27:55,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:55,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:27:55,248 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:27:55,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [437932969] [2023-02-17 01:27:55,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:55,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:27:55,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:27:55,256 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 01:27:55,258 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 01:27:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:27:55,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 01:27:55,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:27:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-17 01:27:55,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:27:55,390 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-17 01:27:55,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:27:55,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963373297] [2023-02-17 01:27:55,391 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:27:55,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437932969] [2023-02-17 01:27:55,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437932969] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:27:55,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:27:55,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-17 01:27:55,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800297626] [2023-02-17 01:27:55,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:27:55,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 01:27:55,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:27:55,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 01:27:55,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:27:55,393 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-17 01:27:57,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:27:58,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:27:58,126 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2023-02-17 01:27:58,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 01:27:58,127 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 46 [2023-02-17 01:27:58,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:27:58,128 INFO L225 Difference]: With dead ends: 82 [2023-02-17 01:27:58,128 INFO L226 Difference]: Without dead ends: 80 [2023-02-17 01:27:58,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-02-17 01:27:58,129 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 73 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-02-17 01:27:58,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 62 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 281 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2023-02-17 01:27:58,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-17 01:27:58,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2023-02-17 01:27:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 45 states have internal predecessors, (45), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-17 01:27:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2023-02-17 01:27:58,153 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 46 [2023-02-17 01:27:58,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:27:58,155 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2023-02-17 01:27:58,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-17 01:27:58,155 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2023-02-17 01:27:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-17 01:27:58,156 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:27:58,156 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:27:58,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 01:27:58,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:27:58,363 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:27:58,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:27:58,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1498221753, now seen corresponding path program 2 times [2023-02-17 01:27:58,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:27:58,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310182552] [2023-02-17 01:27:58,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:58,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:27:58,374 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:27:58,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1951216465] [2023-02-17 01:27:58,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 01:27:58,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:27:58,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:27:58,380 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 01:27:58,380 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 01:27:58,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 01:27:58,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 01:27:58,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 01:27:58,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:27:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 17 proven. 31 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-17 01:27:58,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:27:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 19 proven. 25 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-02-17 01:27:58,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:27:58,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310182552] [2023-02-17 01:27:58,570 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:27:58,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951216465] [2023-02-17 01:27:58,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951216465] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:27:58,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:27:58,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-17 01:27:58,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665372163] [2023-02-17 01:27:58,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:27:58,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 01:27:58,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:27:58,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 01:27:58,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-17 01:27:58,572 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-02-17 01:27:59,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:27:59,080 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2023-02-17 01:27:59,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 01:27:59,080 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 56 [2023-02-17 01:27:59,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:27:59,081 INFO L225 Difference]: With dead ends: 86 [2023-02-17 01:27:59,081 INFO L226 Difference]: Without dead ends: 81 [2023-02-17 01:27:59,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:27:59,082 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 01:27:59,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 88 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 01:27:59,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-17 01:27:59,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-02-17 01:27:59,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 48 states have internal predecessors, (48), 24 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-17 01:27:59,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2023-02-17 01:27:59,095 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 56 [2023-02-17 01:27:59,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:27:59,095 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2023-02-17 01:27:59,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-02-17 01:27:59,096 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2023-02-17 01:27:59,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-17 01:27:59,097 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:27:59,097 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:27:59,108 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 01:27:59,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:27:59,302 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:27:59,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:27:59,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1061977627, now seen corresponding path program 1 times [2023-02-17 01:27:59,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:27:59,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460400512] [2023-02-17 01:27:59,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:59,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:27:59,320 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:27:59,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1493422258] [2023-02-17 01:27:59,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:27:59,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:27:59,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:27:59,327 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 01:27:59,340 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 01:27:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:27:59,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-17 01:27:59,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:27:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-17 01:27:59,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:27:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-17 01:27:59,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:27:59,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460400512] [2023-02-17 01:27:59,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:27:59,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493422258] [2023-02-17 01:27:59,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493422258] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:27:59,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:27:59,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-02-17 01:27:59,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279017367] [2023-02-17 01:27:59,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:27:59,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 01:27:59,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:27:59,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 01:27:59,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:27:59,540 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-17 01:28:00,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:28:00,004 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2023-02-17 01:28:00,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 01:28:00,004 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 67 [2023-02-17 01:28:00,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:28:00,005 INFO L225 Difference]: With dead ends: 95 [2023-02-17 01:28:00,005 INFO L226 Difference]: Without dead ends: 93 [2023-02-17 01:28:00,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2023-02-17 01:28:00,006 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 30 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 01:28:00,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 150 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 01:28:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-17 01:28:00,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2023-02-17 01:28:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 52 states have internal predecessors, (53), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-02-17 01:28:00,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2023-02-17 01:28:00,025 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 67 [2023-02-17 01:28:00,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:28:00,026 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2023-02-17 01:28:00,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-17 01:28:00,026 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2023-02-17 01:28:00,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-17 01:28:00,027 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:28:00,027 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 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 01:28:00,044 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 01:28:00,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:28:00,232 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:28:00,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:28:00,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1246911088, now seen corresponding path program 1 times [2023-02-17 01:28:00,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:28:00,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101140935] [2023-02-17 01:28:00,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:28:00,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:28:00,239 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:28:00,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2008382180] [2023-02-17 01:28:00,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:28:00,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:28:00,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:28:00,256 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 01:28:00,257 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 01:28:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:28:00,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-17 01:28:00,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:28:00,395 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-02-17 01:28:00,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:28:00,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:28:00,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101140935] [2023-02-17 01:28:00,505 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:28:00,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008382180] [2023-02-17 01:28:00,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008382180] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 01:28:00,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:28:00,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-02-17 01:28:00,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020547528] [2023-02-17 01:28:00,505 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 01:28:00,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 01:28:00,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:28:00,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 01:28:00,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:28:00,507 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-17 01:28:00,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:28:00,650 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2023-02-17 01:28:00,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 01:28:00,650 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 72 [2023-02-17 01:28:00,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:28:00,651 INFO L225 Difference]: With dead ends: 97 [2023-02-17 01:28:00,651 INFO L226 Difference]: Without dead ends: 88 [2023-02-17 01:28:00,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2023-02-17 01:28:00,652 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 20 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:28:00,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 95 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:28:00,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-17 01:28:00,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-17 01:28:00,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 51 states have internal predecessors, (52), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-17 01:28:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2023-02-17 01:28:00,669 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 72 [2023-02-17 01:28:00,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:28:00,669 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2023-02-17 01:28:00,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-17 01:28:00,670 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2023-02-17 01:28:00,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-02-17 01:28:00,670 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:28:00,671 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-17 01:28:00,696 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 01:28:00,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:28:00,885 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:28:00,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:28:00,885 INFO L85 PathProgramCache]: Analyzing trace with hash -322800313, now seen corresponding path program 3 times [2023-02-17 01:28:00,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:28:00,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247403361] [2023-02-17 01:28:00,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:28:00,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:28:00,892 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:28:00,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [287570267] [2023-02-17 01:28:00,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 01:28:00,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:28:00,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:28:00,909 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 01:28:00,950 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 01:28:00,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-17 01:28:00,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 01:28:00,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-17 01:28:00,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:28:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-17 01:28:01,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:28:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-17 01:28:01,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:28:01,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247403361] [2023-02-17 01:28:01,165 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:28:01,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287570267] [2023-02-17 01:28:01,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287570267] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:28:01,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:28:01,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-17 01:28:01,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451563815] [2023-02-17 01:28:01,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:28:01,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 01:28:01,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:28:01,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 01:28:01,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-02-17 01:28:01,170 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2023-02-17 01:28:02,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:28:02,481 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2023-02-17 01:28:02,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 01:28:02,482 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) Word has length 78 [2023-02-17 01:28:02,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:28:02,483 INFO L225 Difference]: With dead ends: 110 [2023-02-17 01:28:02,483 INFO L226 Difference]: Without dead ends: 107 [2023-02-17 01:28:02,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2023-02-17 01:28:02,483 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-17 01:28:02,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 84 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-17 01:28:02,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-17 01:28:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2023-02-17 01:28:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-17 01:28:02,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2023-02-17 01:28:02,506 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 78 [2023-02-17 01:28:02,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:28:02,507 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2023-02-17 01:28:02,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2023-02-17 01:28:02,507 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2023-02-17 01:28:02,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-02-17 01:28:02,511 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:28:02,511 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:28:02,530 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 01:28:02,717 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,SelfDestructingSolverStorable9 [2023-02-17 01:28:02,718 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:28:02,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:28:02,719 INFO L85 PathProgramCache]: Analyzing trace with hash -674604307, now seen corresponding path program 2 times [2023-02-17 01:28:02,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:28:02,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289884601] [2023-02-17 01:28:02,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:28:02,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:28:02,725 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:28:02,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1964011183] [2023-02-17 01:28:02,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 01:28:02,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:28:02,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:28:02,726 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 01:28:02,728 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 01:28:02,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 01:28:02,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 01:28:02,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-17 01:28:02,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:28:02,843 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 78 proven. 25 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-02-17 01:28:02,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:28:03,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:28:03,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289884601] [2023-02-17 01:28:03,021 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:28:03,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964011183] [2023-02-17 01:28:03,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964011183] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 01:28:03,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:28:03,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-17 01:28:03,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632323441] [2023-02-17 01:28:03,022 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 01:28:03,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 01:28:03,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:28:03,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 01:28:03,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-02-17 01:28:03,024 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2023-02-17 01:28:03,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:28:03,364 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2023-02-17 01:28:03,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 01:28:03,364 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 99 [2023-02-17 01:28:03,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:28:03,365 INFO L225 Difference]: With dead ends: 111 [2023-02-17 01:28:03,365 INFO L226 Difference]: Without dead ends: 98 [2023-02-17 01:28:03,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2023-02-17 01:28:03,366 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 01:28:03,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 79 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 01:28:03,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-17 01:28:03,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-02-17 01:28:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 59 states have internal predecessors, (60), 24 states have call successors, (24), 15 states have call predecessors, (24), 15 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-17 01:28:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2023-02-17 01:28:03,387 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 99 [2023-02-17 01:28:03,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:28:03,388 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2023-02-17 01:28:03,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2023-02-17 01:28:03,388 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2023-02-17 01:28:03,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-17 01:28:03,390 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:28:03,390 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:28:03,397 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 01:28:03,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:28:03,594 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:28:03,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:28:03,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1837317061, now seen corresponding path program 2 times [2023-02-17 01:28:03,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:28:03,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134264758] [2023-02-17 01:28:03,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:28:03,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:28:03,603 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:28:03,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445517918] [2023-02-17 01:28:03,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 01:28:03,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:28:03,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:28:03,622 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 01:28:03,632 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 01:28:03,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 01:28:03,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 01:28:03,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-17 01:28:03,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:28:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 101 proven. 43 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-02-17 01:28:03,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:28:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 122 proven. 1 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2023-02-17 01:28:04,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:28:04,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134264758] [2023-02-17 01:28:04,115 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:28:04,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445517918] [2023-02-17 01:28:04,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445517918] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:28:04,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:28:04,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2023-02-17 01:28:04,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884496852] [2023-02-17 01:28:04,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:28:04,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-17 01:28:04,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:28:04,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-17 01:28:04,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2023-02-17 01:28:04,117 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2023-02-17 01:28:06,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:28:06,835 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2023-02-17 01:28:06,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 01:28:06,835 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 121 [2023-02-17 01:28:06,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:28:06,836 INFO L225 Difference]: With dead ends: 127 [2023-02-17 01:28:06,836 INFO L226 Difference]: Without dead ends: 125 [2023-02-17 01:28:06,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2023-02-17 01:28:06,837 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-02-17 01:28:06,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 119 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-02-17 01:28:06,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-17 01:28:06,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2023-02-17 01:28:06,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 64 states have (on average 1.03125) internal successors, (66), 65 states have internal predecessors, (66), 24 states have call successors, (24), 17 states have call predecessors, (24), 17 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-17 01:28:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2023-02-17 01:28:06,855 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 121 [2023-02-17 01:28:06,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:28:06,856 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2023-02-17 01:28:06,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2023-02-17 01:28:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2023-02-17 01:28:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-02-17 01:28:06,857 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:28:06,857 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:28:06,876 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 01:28:07,062 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,SelfDestructingSolverStorable11 [2023-02-17 01:28:07,062 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:28:07,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:28:07,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1974193296, now seen corresponding path program 3 times [2023-02-17 01:28:07,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:28:07,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358943570] [2023-02-17 01:28:07,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:28:07,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:28:07,069 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:28:07,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [151063059] [2023-02-17 01:28:07,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 01:28:07,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:28:07,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:28:07,079 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 01:28:07,081 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 01:28:07,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-17 01:28:07,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 01:28:07,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-17 01:28:07,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:28:07,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 181 proven. 69 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-02-17 01:28:07,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:28:07,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 148 proven. 39 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2023-02-17 01:28:07,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:28:07,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358943570] [2023-02-17 01:28:07,790 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:28:07,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151063059] [2023-02-17 01:28:07,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151063059] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:28:07,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:28:07,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2023-02-17 01:28:07,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599211715] [2023-02-17 01:28:07,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:28:07,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 01:28:07,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:28:07,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 01:28:07,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2023-02-17 01:28:07,792 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 8 states have call predecessors, (31), 9 states have call successors, (31) [2023-02-17 01:28:09,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:28:09,068 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2023-02-17 01:28:09,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 01:28:09,068 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 8 states have call predecessors, (31), 9 states have call successors, (31) Word has length 126 [2023-02-17 01:28:09,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:28:09,069 INFO L225 Difference]: With dead ends: 112 [2023-02-17 01:28:09,069 INFO L226 Difference]: Without dead ends: 108 [2023-02-17 01:28:09,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 230 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2023-02-17 01:28:09,070 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:28:09,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 53 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-17 01:28:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-17 01:28:09,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-02-17 01:28:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 24 states have call successors, (24), 18 states have call predecessors, (24), 17 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-17 01:28:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2023-02-17 01:28:09,105 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 126 [2023-02-17 01:28:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:28:09,106 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2023-02-17 01:28:09,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 8 states have call predecessors, (31), 9 states have call successors, (31) [2023-02-17 01:28:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2023-02-17 01:28:09,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-02-17 01:28:09,108 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:28:09,108 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:28:09,131 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 01:28:09,315 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,SelfDestructingSolverStorable12 [2023-02-17 01:28:09,315 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:28:09,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:28:09,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1520954085, now seen corresponding path program 1 times [2023-02-17 01:28:09,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:28:09,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772728556] [2023-02-17 01:28:09,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:28:09,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:28:09,328 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:28:09,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1033311040] [2023-02-17 01:28:09,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:28:09,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:28:09,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:28:09,330 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 01:28:09,333 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 01:28:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:28:09,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-17 01:28:09,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:28:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 104 proven. 110 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2023-02-17 01:28:10,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:28:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 104 proven. 110 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2023-02-17 01:28:14,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:28:14,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772728556] [2023-02-17 01:28:14,724 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:28:14,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033311040] [2023-02-17 01:28:14,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033311040] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:28:14,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:28:14,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2023-02-17 01:28:14,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085304745] [2023-02-17 01:28:14,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:28:14,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-17 01:28:14,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:28:14,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-17 01:28:14,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=299, Unknown=3, NotChecked=0, Total=380 [2023-02-17 01:28:14,727 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand has 20 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 11 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) [2023-02-17 01:28:18,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:28:23,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:28:27,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:28:30,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:28:33,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:28:35,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:28:38,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:28:41,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:28:44,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:28:47,360 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 01:28:49,664 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 01:28:52,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:28:53,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:28:53,863 INFO L93 Difference]: Finished difference Result 163 states and 202 transitions. [2023-02-17 01:28:53,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-17 01:28:53,863 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 11 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) Word has length 131 [2023-02-17 01:28:53,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:28:53,864 INFO L225 Difference]: With dead ends: 163 [2023-02-17 01:28:53,864 INFO L226 Difference]: Without dead ends: 151 [2023-02-17 01:28:53,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=191, Invalid=618, Unknown=3, NotChecked=0, Total=812 [2023-02-17 01:28:53,865 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 106 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.3s IncrementalHoareTripleChecker+Time [2023-02-17 01:28:53,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 123 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 845 Invalid, 12 Unknown, 0 Unchecked, 35.3s Time] [2023-02-17 01:28:53,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-17 01:28:53,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2023-02-17 01:28:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 49 states have call successors, (49), 20 states have call predecessors, (49), 19 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-02-17 01:28:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 180 transitions. [2023-02-17 01:28:53,935 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 180 transitions. Word has length 131 [2023-02-17 01:28:53,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:28:53,936 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 180 transitions. [2023-02-17 01:28:53,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 11 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) [2023-02-17 01:28:53,936 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 180 transitions. [2023-02-17 01:28:53,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2023-02-17 01:28:53,938 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:28:53,938 INFO L195 NwaCegarLoop]: trace histogram [49, 48, 48, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:28:53,962 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 01:28:54,160 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,SelfDestructingSolverStorable13 [2023-02-17 01:28:54,160 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:28:54,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:28:54,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1512061602, now seen corresponding path program 2 times [2023-02-17 01:28:54,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:28:54,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566999914] [2023-02-17 01:28:54,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:28:54,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:28:54,171 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:28:54,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [523928525] [2023-02-17 01:28:54,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 01:28:54,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:28:54,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:28:54,172 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:28:54,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-17 01:28:54,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 01:28:54,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 01:28:54,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 87 conjunts are in the unsatisfiable core [2023-02-17 01:28:54,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:28:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4860 backedges. 230 proven. 259 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2023-02-17 01:28:54,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:29:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4860 backedges. 230 proven. 252 refuted. 7 times theorem prover too weak. 4371 trivial. 0 not checked. [2023-02-17 01:29:09,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:29:09,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566999914] [2023-02-17 01:29:09,946 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:29:09,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523928525] [2023-02-17 01:29:09,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523928525] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:29:09,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:29:09,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2023-02-17 01:29:09,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266961188] [2023-02-17 01:29:09,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:29:09,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-17 01:29:09,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:29:09,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-17 01:29:09,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=591, Unknown=5, NotChecked=0, Total=756 [2023-02-17 01:29:09,952 INFO L87 Difference]: Start difference. First operand 151 states and 180 transitions. Second operand has 28 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 20 states have call successors, (98), 3 states have call predecessors, (98), 2 states have return successors, (96), 20 states have call predecessors, (96), 20 states have call successors, (96) [2023-02-17 01:29:17,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:29:19,064 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 01:29:21,236 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 01:29:25,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:29:28,174 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 01:29:30,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:29:32,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:29:36,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:29:38,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:29:40,937 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 01:29:47,478 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 01:29:50,050 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 01:29:53,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:29:55,054 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 01:29:55,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:29:55,089 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2023-02-17 01:29:55,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-17 01:29:55,090 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 20 states have call successors, (98), 3 states have call predecessors, (98), 2 states have return successors, (96), 20 states have call predecessors, (96), 20 states have call successors, (96) Word has length 266 [2023-02-17 01:29:55,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:29:55,090 INFO L225 Difference]: With dead ends: 187 [2023-02-17 01:29:55,090 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 01:29:55,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 504 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=241, Invalid=807, Unknown=8, NotChecked=0, Total=1056 [2023-02-17 01:29:55,092 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 21 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 177 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.4s IncrementalHoareTripleChecker+Time [2023-02-17 01:29:55,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 215 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1595 Invalid, 12 Unknown, 0 Unchecked, 38.4s Time] [2023-02-17 01:29:55,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 01:29:55,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 01:29:55,093 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 01:29:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 01:29:55,093 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 266 [2023-02-17 01:29:55,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:29:55,093 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 01:29:55,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 20 states have call successors, (98), 3 states have call predecessors, (98), 2 states have return successors, (96), 20 states have call predecessors, (96), 20 states have call successors, (96) [2023-02-17 01:29:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 01:29:55,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 01:29:55,103 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 01:29:55,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-17 01:29:55,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-17 01:29:55,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 01:29:55,392 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 01:29:55,395 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 46) the Hoare annotation is: (let ((.cse46 (+ |ULTIMATE.start_main_~n~0#1| 1))) (let ((.cse71 (+ .cse46 1))) (let ((.cse171 (+ .cse71 1))) (let ((.cse115 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse170 (+ .cse171 1))) (let ((.cse169 (+ .cse170 1)) (.cse106 (* .cse46 6)) (.cse155 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse114 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse112 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse136 (* 6 .cse71)) (.cse6 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse115)))) (let ((.cse32 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse57 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse34 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse80 (not .cse6)) (.cse18 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse60 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse110 (+ 6 .cse136)) (.cse151 (+ .cse114 .cse112)) (.cse161 (+ .cse155 .cse112)) (.cse121 (+ 6 .cse106)) (.cse163 (+ .cse169 1))) (let ((.cse27 (+ 1 1)) (.cse56 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse17 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse83 (* (- 1) |ULTIMATE.start_main_~x~0#1|)) (.cse98 (* 6 .cse163)) (.cse140 (* 6 .cse171)) (.cse149 (* 6 .cse170)) (.cse105 (+ .cse121 .cse112)) (.cse130 (* .cse169 6)) (.cse69 (+ .cse151 .cse161)) (.cse132 (+ .cse110 .cse151)) (.cse150 (+ .cse114 6)) (.cse59 (or .cse6 (let ((.cse168 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse167 (<= (+ .cse168 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse80 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse167) (or (not .cse167) (not (<= (+ .cse168 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse18)) .cse60))))) (.cse164 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse162 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse58 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse9 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse10 (<= |ULTIMATE.start_main_~a~0#1| 10)) (.cse76 (= (+ .cse32 (+ (* |ULTIMATE.start_main_~x~0#1| .cse57) .cse34)) 0)) (.cse77 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (let ((.cse4 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse41 (or .cse80 .cse76 .cse77)) (.cse3 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse10) (not .cse9))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse9 .cse10))) (.cse39 (= (+ (- 6) (+ (+ .cse164 (+ .cse162 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse58)) 0)) (.cse79 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse49 (let ((.cse165 (= (+ (let ((.cse166 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse166 (* .cse166 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|))) (or (and .cse59 .cse165) (and .cse59 (or .cse80 .cse165))))) (.cse81 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse164 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse101 (+ .cse163 1)) (.cse122 (not (= .cse150 .cse110))) (.cse128 (+ .cse69 .cse132)) (.cse100 (+ 6 .cse130)) (.cse16 (+ (* (- 1) .cse18) |ULTIMATE.start_main_~y~0#1|)) (.cse107 (not (= .cse121 .cse114))) (.cse104 (+ .cse105 .cse161)) (.cse131 (+ 6 .cse149)) (.cse90 (+ .cse140 6)) (.cse99 (+ .cse98 6)) (.cse42 (+ .cse17 |ULTIMATE.start_main_~y~0#1| .cse83)) (.cse50 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse152 (+ (- 5) 12)) (.cse67 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse162 (+ (* .cse56 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse156 (+ 42 85)) (.cse109 (* 3 .cse161)) (.cse111 (- (* 18 .cse161))) (.cse22 (+ .cse27 1)) (.cse45 (= (+ (+ (- (* .cse114 .cse155)) (* .cse155 .cse57)) (* .cse155 12)) 0)) (.cse44 (not .cse77)) (.cse142 (* 3 .cse155)) (.cse141 (* (* 2 .cse112) .cse112)) (.cse120 (- (* .cse155 18))) (.cse143 (- (* .cse112 10))) (.cse36 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse37 (+ 0 1)) (.cse157 (+ (* 30 4) (- 59)))) (let ((.cse12 (+ 30 .cse157)) (.cse0 (+ 30 6)) (.cse48 (<= |ULTIMATE.start_main_~n~0#1| .cse37)) (.cse51 (= |ULTIMATE.start_main_~z~0#1| (+ .cse36 6))) (.cse1 (or (not .cse45) .cse44 (= (+ (+ (+ (+ (+ (- (* .cse114 .cse142)) .cse141) .cse120) .cse143) (* .cse114 3)) (- 10)) 0))) (.cse5 (+ .cse22 1)) (.cse15 (or (= (+ (- 10) (+ (* .cse150 3) (+ (+ (+ (- (* .cse150 .cse109)) (* (* 2 .cse151) .cse151)) .cse111) (- (* .cse151 10))))) 0) (not (= (+ (+ (- (* .cse150 .cse161)) (* .cse57 .cse161)) (* 12 .cse161)) 0)) (not (<= .cse46 |ULTIMATE.start_main_~a~0#1|)))) (.cse54 (+ 42 .cse156)) (.cse53 (+ 42 6)) (.cse7 (let ((.cse160 (+ 30 (- 6)))) (+ (let ((.cse159 (+ .cse160 (- 6)))) (let ((.cse158 (+ (- 17) (* 2 .cse159)))) (+ (+ (* 2 .cse158) (* (- 3) .cse159) 24) .cse158))) (+ .cse157 (* (- 1) .cse160))))) (.cse8 (* (- 1) .cse157)) (.cse55 (* (- 1) .cse156)) (.cse13 (or .cse67 (not .cse76))) (.cse19 (+ 5 1)) (.cse38 (+ 6 1)) (.cse26 (+ 6 12)) (.cse29 (+ (+ (+ .cse152 (* (- 1) (+ (- 1) .cse152))) 0) .cse152)) (.cse47 (= .cse155 (* .cse46 (* .cse46 .cse46)))) (.cse30 (let ((.cse153 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse153 .cse50) (let ((.cse154 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (and (< .cse154 65536) (<= 0 .cse154) (not .cse153)))))) (.cse43 (+ 6 6)) (.cse28 (+ .cse152 12)) (.cse40 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse42))) (.cse70 (+ .cse150 6)) (.cse68 (+ .cse150 .cse151)) (.cse84 (or .cse107 (= (+ (+ (let ((.cse148 (+ (+ .cse121 6) .cse105))) (let ((.cse147 (+ .cse90 .cse148))) (let ((.cse146 (+ .cse147 .cse131))) (let ((.cse144 (+ (+ .cse149 12) .cse146))) (+ (- (* 10 .cse144)) (let ((.cse145 (+ .cse146 (+ .cse147 (+ .cse104 .cse148))))) (+ (+ (* (* 2 .cse144) .cse144) (- (* (* .cse145 3) .cse99))) (- (* .cse145 18))))))))) (* 3 .cse99)) (- 10)) 0))) (.cse2 (= (+ (+ (- (* .cse18 6)) (+ (* .cse18 .cse18) (- (* .cse16 12)))) 12) 0)) (.cse85 (or (= (+ (- 10) (+ (+ (+ (+ .cse141 (- (* .cse121 .cse142))) .cse120) .cse143) (* .cse121 3))) 0) .cse107)) (.cse86 (or .cse122 (= (+ (+ (let ((.cse139 (+ .cse90 .cse132))) (let ((.cse138 (+ (+ .cse140 12) .cse139))) (+ (let ((.cse137 (+ .cse128 .cse139))) (+ (- (* .cse137 18)) (+ (* .cse138 (* 2 .cse138)) (- (* .cse100 (* 3 .cse137)))))) (- (* .cse138 10))))) (* 3 .cse100)) (- 10)) 0))) (.cse87 (or (= (+ (+ (let ((.cse135 (+ .cse105 .cse110))) (let ((.cse133 (+ .cse135 (+ 12 .cse136)))) (+ (- (* .cse133 10)) (let ((.cse134 (+ .cse135 .cse104))) (+ (- (* .cse134 18)) (+ (* (* 2 .cse133) .cse133) (- (* .cse131 (* .cse134 3))))))))) (* 3 .cse131)) (- 10)) 0) .cse107)) (.cse88 (or .cse122 (= (+ (- 10) (let ((.cse123 (+ (* 6 .cse101) 6))) (+ (* 3 .cse123) (let ((.cse129 (+ .cse132 (+ 6 .cse110)))) (let ((.cse127 (+ .cse131 .cse129))) (let ((.cse126 (+ .cse127 .cse100))) (let ((.cse124 (+ .cse126 (+ .cse130 12)))) (+ (- (* .cse124 10)) (let ((.cse125 (+ .cse126 (+ .cse127 (+ .cse128 .cse129))))) (+ (- (* .cse125 18)) (+ (- (* .cse123 (* 3 .cse125))) (* .cse124 (* .cse124 2))))))))))))) 0))) (.cse11 (let ((.cse116 (let ((.cse118 (or .cse107 (= (+ (+ (+ (- (* .cse112 12)) (+ .cse120 (* .cse121 .cse112))) (* .cse121 2)) (- 6)) 0))) (.cse119 (or (= 0 (+ (- 6) (+ (* 2 .cse110) (+ (+ (* .cse105 .cse110) .cse111) (- (* .cse105 12)))))) .cse107))) (or (and .cse3 .cse118 .cse9 .cse10 .cse79 .cse49 .cse81 .cse119 (or .cse80 .cse39)) (and .cse3 .cse39 .cse118 .cse9 .cse10 .cse79 .cse49 .cse81 .cse119))))) (or (and .cse41 .cse116) (let ((.cse117 (+ (- 11) 19))) (and (= (+ (+ (+ 19 (* (- 1) .cse117) 1) 6) 6) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| (+ 19 .cse117)) .cse116 (= (+ 2 1) |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~a~0#1|)))))) (.cse89 (let ((.cse113 (+ 12 .cse115))) (or (= (+ (+ (let ((.cse108 (+ .cse112 .cse113))) (+ (- (* 10 .cse108)) (+ (+ (- (* .cse109 .cse110)) (* (* 2 .cse108) .cse108)) .cse111))) (* 3 .cse110)) (- 10)) 0) (not (= .cse114 .cse113))))) (.cse14 (<= .cse4 |ULTIMATE.start_main_~a~0#1|)) (.cse102 (or (= (+ (- 10) (+ (let ((.cse103 (+ .cse105 (+ 12 .cse106)))) (+ (- (* 10 .cse103)) (+ (+ (* (* 2 .cse103) .cse103) (- (* (* 3 .cse104) .cse90))) (- (* .cse104 18))))) (* .cse90 3))) 0) .cse107))) (or (and (= .cse0 |ULTIMATE.start_main_~z~0#1|) .cse1 .cse2 .cse3 (= .cse4 .cse5) .cse6 (= .cse7 (+ .cse8 |ULTIMATE.start_main_~x~0#1|)) .cse9 .cse10 .cse11 (= .cse12 |ULTIMATE.start_main_~y~0#1|) .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 (= .cse16 .cse12) .cse6 (= .cse7 (+ .cse8 .cse17)) .cse9 .cse10 .cse11 (= .cse0 .cse18) .cse13 (= .cse19 |ULTIMATE.start_main_~n~0#1|) .cse14) (let ((.cse20 (+ (* .cse18 2) (- 17)))) (let ((.cse21 (+ (* .cse18 (- 3)) (* .cse20 2) 24))) (and .cse2 (= (+ .cse20 .cse21) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~n~0#1| .cse22) .cse3 (= (let ((.cse24 (+ (* (- 1) .cse20) .cse18 (- 6) .cse21))) (let ((.cse25 (+ .cse20 .cse24 (* (- 1) .cse21)))) (let ((.cse23 (+ .cse20 (* (- 1) .cse25)))) (+ (+ (* (- 1) .cse23) (- 6) .cse24 .cse25) .cse23 (* (- 1) .cse24))))) 6) (= .cse18 .cse26) (<= .cse27 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ .cse20 .cse18)) .cse6 (= |ULTIMATE.start_main_~y~0#1| (+ .cse28 .cse18)) .cse9 .cse10 .cse11 (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse28)) .cse29) .cse30 (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse33 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (let ((.cse31 (+ 65536 .cse33))) (and (<= 0 .cse31) (= (+ .cse32 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse33)) .cse34)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= .cse27 .cse33) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (< .cse31 65536))))) (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse35 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (and (< .cse35 65536) (= (+ .cse32 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse35)) .cse34)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= .cse27 .cse35) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse35) (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767))))) .cse14))) (and (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) .cse2 (= .cse36 6) (= .cse4 0) (= |ULTIMATE.start_main_~x~0#1| .cse37) .cse3 (= |ULTIMATE.start_main_~n~0#1| .cse37) (= |ULTIMATE.start_main_~y~0#1| .cse38) .cse39 (= .cse40 1) .cse41 (= 6 .cse42) (= .cse43 |ULTIMATE.start_main_~z~0#1|) (or .cse44 .cse45 (< .cse46 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) .cse6 (= |ULTIMATE.start_main_~y~0#1| (+ .cse18 1)) .cse47 .cse9 .cse48 .cse10 .cse49 (= |ULTIMATE.start_main_~y~0#1| (+ .cse18 |ULTIMATE.start_main_~x~0#1|)) .cse30 (= (+ (* (- 1) 6) |ULTIMATE.start_main_~y~0#1|) 1) .cse50 .cse51 (= .cse18 6) (= .cse17 0) .cse14 (= (+ (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse36)) 0) |ULTIMATE.start_main_~x~0#1|)) (let ((.cse52 (+ (- 169) |ULTIMATE.start_main_~y~0#1|))) (and (= (+ 6 .cse52) |ULTIMATE.start_main_~z~0#1|) .cse2 .cse3 (= .cse53 .cse52) .cse6 .cse9 .cse10 .cse11 (= .cse7 (+ .cse8 (+ (+ (+ (* .cse54 (- 1)) |ULTIMATE.start_main_~x~0#1|) .cse55) 42 (- 6) .cse55))) .cse14 (= |ULTIMATE.start_main_~n~0#1| (+ 7 1)))) (and (= (+ (+ (+ (- .cse56) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse57))) .cse58) (- 10)) 0) .cse2 .cse3 .cse59 .cse6 (= |ULTIMATE.start_main_~y~0#1| 1) .cse9 .cse48 .cse10 .cse60 .cse30 .cse50 .cse51 (= |ULTIMATE.start_main_~x~0#1| 0) .cse14 (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse66 (+ .cse18 (- 6)))) (let ((.cse64 (+ (- 17) (* .cse66 2)))) (let ((.cse65 (+ (* .cse64 2) 24 (* .cse66 (- 3))))) (and .cse1 (= 6 (let ((.cse62 (+ (* (- 1) .cse64) .cse66 .cse65 (- 6)))) (let ((.cse63 (+ .cse64 (* (- 1) .cse65) .cse62))) (let ((.cse61 (+ .cse64 (* (- 1) .cse63)))) (+ (+ (* (- 1) .cse61) .cse62 (- 6) .cse63) (* (- 1) .cse62) .cse61))))) .cse2 .cse3 .cse67 .cse6 (= .cse16 (+ .cse64 .cse66)) (or (= (+ (+ (+ (- (* .cse68 10)) (+ (- (* .cse69 18)) (+ (- (* .cse70 (* .cse69 3))) (* .cse68 (* .cse68 2))))) (* .cse70 3)) (- 10)) 0) (not (<= .cse71 |ULTIMATE.start_main_~a~0#1|)) (not (= (+ (* .cse69 12) (+ (- (* .cse70 .cse69)) (* .cse69 .cse57))) 0))) .cse9 .cse10 .cse11 .cse30 (= |ULTIMATE.start_main_~n~0#1| .cse5) .cse14 .cse15 (= |ULTIMATE.start_main_~x~0#1| (+ .cse16 (+ .cse64 .cse65))))))) (and .cse2 .cse3 (= .cse54 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| .cse53) (= .cse7 (+ .cse8 (+ 42 (- 6) .cse55 (+ |ULTIMATE.start_main_~x~0#1| .cse55)))) .cse6 .cse9 .cse10 .cse11 .cse13 (= .cse19 .cse4) .cse14) (let ((.cse75 (+ .cse17 (- 6) .cse42 (* .cse40 (- 1)))) (.cse78 (+ |ULTIMATE.start_main_~y~0#1| .cse83 1))) (let ((.cse72 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse74 (+ .cse78 (- 6))) (.cse82 (+ .cse40 .cse75 (* (- 1) .cse17)))) (and (= .cse16 .cse38) .cse2 .cse3 (= |ULTIMATE.start_main_~x~0#1| (+ .cse16 1)) .cse41 (= .cse43 .cse72) (let ((.cse73 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse73)) .cse74) .cse73)) (= .cse75 0) .cse6 (= |ULTIMATE.start_main_~z~0#1| .cse26) (or .cse76 .cse77) (= (+ .cse78 6) |ULTIMATE.start_main_~z~0#1|) (= (+ 6 .cse72) |ULTIMATE.start_main_~z~0#1|) .cse9 (= .cse29 |ULTIMATE.start_main_~x~0#1|) .cse10 .cse79 .cse49 (or .cse80 .cse47) .cse30 (= 6 .cse74) (= .cse4 .cse37) .cse81 (= .cse43 .cse18) (= .cse27 |ULTIMATE.start_main_~n~0#1|) .cse14 (= .cse28 |ULTIMATE.start_main_~y~0#1|) (= (+ .cse40 (* (- 1) .cse82)) 1) (= .cse82 6) (= 0 (+ (- 1) .cse4))))) (and .cse84 .cse2 .cse3 .cse85 .cse86 .cse67 .cse87 .cse88 .cse6 .cse9 .cse10 .cse11 .cse89 (or (not (= .cse90 .cse70)) (= (+ (let ((.cse93 (+ 6 (* 6 (+ .cse101 1))))) (+ (let ((.cse96 (+ .cse68 .cse90))) (let ((.cse95 (+ .cse96 (+ .cse90 6)))) (let ((.cse97 (+ .cse95 .cse100))) (let ((.cse94 (+ .cse99 .cse97))) (let ((.cse91 (+ .cse94 (+ .cse98 12)))) (+ (- (* .cse91 10)) (let ((.cse92 (+ .cse94 (+ (+ .cse95 (+ .cse96 (+ .cse68 .cse69))) .cse97)))) (+ (- (* .cse92 18)) (+ (* (* 2 .cse91) .cse91) (- (* (* .cse92 3) .cse93))))))))))) (* 3 .cse93))) (- 10)) 0)) .cse14 .cse102) (and .cse84 .cse2 (or .cse80 .cse67) .cse3 .cse85 .cse86 .cse87 .cse88 .cse6 .cse9 .cse10 .cse11 .cse89 .cse14 .cse102))))))))))) [2023-02-17 01:29:55,397 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 46) the Hoare annotation is: (let ((.cse116 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse93 (* 6 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse90 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse17 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse93))) (.cse92 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse115 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse124 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse114 (+ .cse116 1)) (.cse106 (* .cse116 6))) (let ((.cse60 (+ 6 .cse106)) (.cse77 (* 6 .cse114)) (.cse24 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse26 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse45 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse123 (= (+ (+ (- (* .cse92 .cse124)) (* .cse124 .cse115)) (* .cse124 12)) 0)) (.cse8 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse122 (not .cse17)) (.cse6 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse40 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse125 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse118 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse9 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse10 (<= |ULTIMATE.start_main_~a~0#1| 10)) (.cse109 (+ .cse92 6)) (.cse110 (+ .cse92 .cse90)) (.cse107 (+ .cse124 .cse90))) (let ((.cse88 (* 3 .cse107)) (.cse47 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse101 (+ .cse109 .cse110)) (.cse94 (+ .cse109 6)) (.cse102 (+ .cse110 .cse107)) (.cse117 (+ (- 1) (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (.cse1 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse10) (not .cse9))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse9 .cse10))) (.cse2 (= (+ (- 6) (+ (+ .cse125 (+ .cse118 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse3 (or .cse17 (let ((.cse128 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse127 (<= (+ .cse128 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse122 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse127) (or (not .cse127) (not (<= (+ .cse128 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse6)) .cse40))))) (.cse4 (= (+ (let ((.cse126 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse126 (* .cse126 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse5 (or .cse45 .cse123 (< .cse116 .cse8))) (.cse7 (= .cse124 (* .cse116 (* .cse116 .cse116)))) (.cse11 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse42 (= (+ .cse24 (+ (* |ULTIMATE.start_main_~x~0#1| .cse115) .cse26)) 0)) (.cse46 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse125 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse78 (+ 6 .cse77)) (.cse89 (- (* 18 .cse107))) (.cse61 (+ .cse60 .cse90)) (.cse49 (not (= .cse60 .cse92))) (.cse41 (+ (* (- 1) .cse6) |ULTIMATE.start_main_~y~0#1|)) (.cse63 (* 3 .cse124)) (.cse62 (* (* 2 .cse90) .cse90)) (.cse64 (- (* .cse124 18))) (.cse65 (- (* .cse90 10)))) (let ((.cse12 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse30 (or (not .cse123) .cse45 (= (+ (+ (+ (+ (+ (- (* .cse92 .cse63)) .cse62) .cse64) .cse65) (* .cse92 3)) (- 10)) 0))) (.cse13 (= (+ (+ (- (* .cse6 6)) (+ (* .cse6 .cse6) (- (* .cse41 12)))) 12) 0)) (.cse14 (let ((.cse120 (or .cse49 (= (+ (+ (+ (- (* .cse90 12)) (+ .cse64 (* .cse60 .cse90))) (* .cse60 2)) (- 6)) 0))) (.cse121 (or (= 0 (+ (- 6) (+ (* 2 .cse78) (+ (+ (* .cse61 .cse78) .cse89) (- (* .cse61 12)))))) .cse49))) (or (let ((.cse119 (+ (- 11) 19))) (and .cse1 .cse2 .cse3 .cse4 (= (+ (+ (+ 19 (* (- 1) .cse119) 1) 6) 6) |ULTIMATE.start_main_~z~0#1|) .cse5 .cse120 .cse45 .cse7 (= |ULTIMATE.start_main_~x~0#1| (+ 19 .cse119)) .cse9 .cse10 .cse11 (= (+ 2 1) |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse46 .cse121)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse120 .cse7 .cse9 .cse10 .cse11 (or .cse122 .cse42) .cse46 .cse121)))) (.cse48 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse118 (+ (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse16 (<= (+ (- 1) .cse117) |ULTIMATE.start_main_~a~0#1|)) (.cse32 (or (= (+ (+ (+ (- (* .cse101 10)) (+ (- (* .cse102 18)) (+ (- (* .cse94 (* .cse102 3))) (* .cse101 (* .cse101 2))))) (* .cse94 3)) (- 10)) 0) (not (<= .cse114 |ULTIMATE.start_main_~a~0#1|)) (not (= (+ (* .cse102 12) (+ (- (* .cse94 .cse102)) (* .cse102 .cse115))) 0)))) (.cse19 (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)) (.cse28 (not (<= .cse117 |ULTIMATE.start_main_~a~0#1|))) (.cse29 (<= .cse47 |ULTIMATE.start_main_~a~0#1|)) (.cse39 (or (= (+ (- 10) (+ (* .cse109 3) (+ (+ (+ (- (* .cse109 .cse88)) (* (* 2 .cse110) .cse110)) .cse89) (- (* .cse110 10))))) 0) (not (= (+ (+ (- (* .cse109 .cse107)) (* .cse115 .cse107)) (* 12 .cse107)) 0)) (not (<= .cse116 |ULTIMATE.start_main_~a~0#1|))))) (or (let ((.cse0 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse0) .cse1 (= |ULTIMATE.start_main_~n~0#1| .cse0) .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse6 1)) .cse7 (<= .cse8 1) .cse9 (<= |ULTIMATE.start_main_~n~0#1| .cse0) .cse10 .cse11 .cse12 (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6)) (= .cse6 6))) (let ((.cse20 (+ (- 5) 12))) (let ((.cse18 (+ .cse20 12)) (.cse15 (+ 1 1))) (and .cse13 .cse14 .cse1 (= .cse6 (+ 6 12)) (<= .cse15 |ULTIMATE.start_main_~a~0#1|) .cse16 .cse17 (= |ULTIMATE.start_main_~y~0#1| (+ .cse18 .cse6)) .cse9 .cse10 .cse19 (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse18)) (+ (+ (+ .cse20 (* (- 1) (+ (- 1) .cse20))) 0) .cse20)) (let ((.cse21 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse21 .cse12) (let ((.cse22 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (and (< .cse22 65536) (<= 0 .cse22) (not .cse21))))) (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse25 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (let ((.cse23 (+ 65536 .cse25))) (and (<= 0 .cse23) (= (+ .cse24 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse25)) .cse26)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= .cse15 .cse25) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (< .cse23 65536))))) (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse27 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (and (< .cse27 65536) (= (+ .cse24 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse27)) .cse26)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= .cse15 .cse27) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse27) (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767))))) .cse28 .cse29))) (let ((.cse31 (+ (- 169) |ULTIMATE.start_main_~y~0#1|))) (and .cse30 (= (+ 6 .cse31) |ULTIMATE.start_main_~z~0#1|) .cse13 .cse14 .cse1 (= (+ 42 6) .cse31) .cse16 .cse17 .cse32 .cse9 .cse10 .cse19 .cse28 (let ((.cse36 (+ (* 30 4) (- 59)))) (= (let ((.cse35 (+ 30 (- 6)))) (+ (let ((.cse34 (+ .cse35 (- 6)))) (let ((.cse33 (+ (- 17) (* 2 .cse34)))) (+ (+ (* 2 .cse33) (* (- 3) .cse34) 24) .cse33))) (+ .cse36 (* (- 1) .cse35)))) (+ (* (- 1) .cse36) (let ((.cse37 (+ 42 85))) (let ((.cse38 (* (- 1) .cse37))) (+ (+ (+ (* (+ 42 .cse37) (- 1)) |ULTIMATE.start_main_~x~0#1|) .cse38) 42 (- 6) .cse38)))))) .cse29 (= |ULTIMATE.start_main_~n~0#1| (+ 7 1)) .cse39)) (and .cse3 (= |ULTIMATE.start_main_~y~0#1| 1) .cse40 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse44 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse43 (+ 6 6))) (and (= .cse41 (+ 6 1)) .cse42 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~x~0#1| (+ .cse41 1)) (= .cse43 .cse44) .cse5 .cse45 .cse7 (= (+ 6 .cse44) |ULTIMATE.start_main_~z~0#1|) .cse9 .cse10 .cse11 .cse46 (= .cse43 .cse6) .cse29 (= 0 (+ (- 1) .cse47)))) (and .cse30 .cse13 .cse14 .cse1 .cse16 .cse17 .cse32 .cse9 .cse10 .cse19 .cse28 (or .cse48 (not .cse42)) .cse29 .cse39) (let ((.cse113 (+ .cse114 1))) (let ((.cse111 (+ .cse113 1))) (let ((.cse112 (+ .cse111 1))) (let ((.cse108 (+ .cse112 1))) (let ((.cse72 (* 6 .cse113)) (.cse85 (* .cse112 6)) (.cse104 (* 6 .cse108)) (.cse57 (* 6 .cse111)) (.cse73 (+ .cse78 .cse110))) (let ((.cse66 (not (= .cse109 .cse78))) (.cse70 (+ .cse102 .cse73)) (.cse58 (+ 6 .cse57)) (.cse52 (+ .cse104 6)) (.cse69 (+ 6 .cse85)) (.cse86 (+ .cse108 1)) (.cse55 (+ .cse61 .cse107)) (.cse59 (+ .cse72 6))) (and .cse30 (or .cse49 (= (+ (+ (let ((.cse56 (+ (+ .cse60 6) .cse61))) (let ((.cse54 (+ .cse59 .cse56))) (let ((.cse53 (+ .cse54 .cse58))) (let ((.cse50 (+ (+ .cse57 12) .cse53))) (+ (- (* 10 .cse50)) (let ((.cse51 (+ .cse53 (+ .cse54 (+ .cse55 .cse56))))) (+ (+ (* (* 2 .cse50) .cse50) (- (* (* .cse51 3) .cse52))) (- (* .cse51 18))))))))) (* 3 .cse52)) (- 10)) 0)) .cse13 .cse14 .cse1 (or (= (+ (- 10) (+ (+ (+ (+ .cse62 (- (* .cse60 .cse63))) .cse64) .cse65) (* .cse60 3))) 0) .cse49) (or .cse66 (= (+ (+ (let ((.cse71 (+ .cse59 .cse73))) (let ((.cse68 (+ (+ .cse72 12) .cse71))) (+ (let ((.cse67 (+ .cse70 .cse71))) (+ (- (* .cse67 18)) (+ (* .cse68 (* 2 .cse68)) (- (* .cse69 (* 3 .cse67)))))) (- (* .cse68 10))))) (* 3 .cse69)) (- 10)) 0)) .cse48 .cse16 (or (= (+ (+ (let ((.cse76 (+ .cse61 .cse78))) (let ((.cse74 (+ .cse76 (+ 12 .cse77)))) (+ (- (* .cse74 10)) (let ((.cse75 (+ .cse76 .cse55))) (+ (- (* .cse75 18)) (+ (* (* 2 .cse74) .cse74) (- (* .cse58 (* .cse75 3))))))))) (* 3 .cse58)) (- 10)) 0) .cse49) (or .cse66 (= (+ (- 10) (let ((.cse79 (+ (* 6 .cse86) 6))) (+ (* 3 .cse79) (let ((.cse84 (+ .cse73 (+ 6 .cse78)))) (let ((.cse83 (+ .cse58 .cse84))) (let ((.cse82 (+ .cse83 .cse69))) (let ((.cse80 (+ .cse82 (+ .cse85 12)))) (+ (- (* .cse80 10)) (let ((.cse81 (+ .cse82 (+ .cse83 (+ .cse70 .cse84))))) (+ (- (* .cse81 18)) (+ (- (* .cse79 (* 3 .cse81))) (* .cse80 (* .cse80 2))))))))))))) 0)) .cse17 .cse32 .cse9 .cse10 (let ((.cse91 (+ 12 .cse93))) (or (= (+ (+ (let ((.cse87 (+ .cse90 .cse91))) (+ (- (* 10 .cse87)) (+ (+ (- (* .cse88 .cse78)) (* (* 2 .cse87) .cse87)) .cse89))) (* 3 .cse78)) (- 10)) 0) (not (= .cse92 .cse91)))) .cse19 (or (not (= .cse59 .cse94)) (= (+ (let ((.cse97 (+ 6 (* 6 (+ .cse86 1))))) (+ (let ((.cse100 (+ .cse101 .cse59))) (let ((.cse99 (+ .cse100 (+ .cse59 6)))) (let ((.cse103 (+ .cse99 .cse69))) (let ((.cse98 (+ .cse52 .cse103))) (let ((.cse95 (+ .cse98 (+ .cse104 12)))) (+ (- (* .cse95 10)) (let ((.cse96 (+ .cse98 (+ (+ .cse99 (+ .cse100 (+ .cse101 .cse102))) .cse103)))) (+ (- (* .cse96 18)) (+ (* (* 2 .cse95) .cse95) (- (* (* .cse96 3) .cse97))))))))))) (* 3 .cse97))) (- 10)) 0)) .cse28 .cse29 .cse39 (or (= (+ (- 10) (+ (let ((.cse105 (+ .cse61 (+ 12 .cse106)))) (+ (- (* 10 .cse105)) (+ (+ (* (* 2 .cse105) .cse105) (- (* (* 3 .cse55) .cse59))) (- (* .cse55 18))))) (* .cse59 3))) 0) .cse49)))))))))))))) [2023-02-17 01:29:55,398 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_main_~x~0#1| 0)) (.cse1 (= |ULTIMATE.start_main_~y~0#1| 1)) (.cse4 (= 6 |ULTIMATE.start_main_~z~0#1|)) (.cse2 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse0 (let ((.cse5 (let ((.cse6 (let ((.cse8 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse8 (let ((.cse10 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse9 (<= (+ .cse10 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse8) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse9) (or (not .cse9) (not (<= (+ .cse10 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 (+ |ULTIMATE.start_main_~z~0#1| (- 6)))) .cse2))))))) (or (and .cse6 (= (+ (let ((.cse7 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse7 (* .cse7 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (and .cse6 .cse1 .cse2 .cse4))))) (or (and (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))) .cse5) (and .cse2 .cse3 .cse5 .cse4))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= (+ (- 6) (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 12)) (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0))))) [2023-02-17 01:29:55,399 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse115 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse76 (* 6 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse12 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse76))) (.cse4 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse31 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse121 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse116 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse14 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse15 (<= |ULTIMATE.start_main_~a~0#1| 10)) (.cse104 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse114 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse106 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse97 (+ .cse115 1)) (.cse89 (* .cse115 6)) (.cse118 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse73 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse75 (+ 6 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse92 (+ .cse75 6)) (.cse93 (+ .cse75 .cse73)) (.cse90 (+ .cse118 .cse73)) (.cse43 (+ 6 .cse89)) (.cse60 (* 6 .cse97)) (.cse113 (= (+ .cse104 (+ (* |ULTIMATE.start_main_~x~0#1| .cse114) .cse106)) 0)) (.cse9 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse15) (not .cse14))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse14 .cse15))) (.cse1 (= (+ (- 6) (+ (+ .cse121 (+ .cse116 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse2 (or .cse12 (let ((.cse124 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse123 (<= (+ .cse124 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse12) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse123) (or (not .cse123) (not (<= (+ .cse124 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse4)) .cse31))))) (.cse3 (= (+ (let ((.cse122 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse122 (* .cse122 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse5 (= .cse118 (* .cse115 (* .cse115 .cse115)))) (.cse6 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse111 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse117 (= (+ (+ (- (* .cse75 .cse118)) (* .cse118 .cse114)) (* .cse118 12)) 0))) (let ((.cse23 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse22 (let ((.cse119 (or .cse111 .cse117 (< .cse115 (+ |ULTIMATE.start_main_~a~0#1| 1)))) (.cse120 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse121 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0))) (or (and .cse9 .cse1 .cse2 .cse3 .cse119 .cse5 .cse14 .cse15 .cse6 .cse120) (and .cse113 .cse9 .cse1 .cse2 .cse3 .cse119 .cse5 .cse14 .cse15 .cse6 .cse120)))) (.cse61 (+ 6 .cse60)) (.cse44 (+ .cse43 .cse73)) (.cse32 (not (= .cse43 .cse75))) (.cse108 (+ (- 1) (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (.cse21 (+ (* (- 1) .cse4) |ULTIMATE.start_main_~y~0#1|)) (.cse71 (* 3 .cse90)) (.cse72 (- (* 18 .cse90))) (.cse84 (+ .cse92 .cse93)) (.cse77 (+ .cse92 6)) (.cse85 (+ .cse93 .cse90)) (.cse46 (* 3 .cse118)) (.cse45 (* (* 2 .cse73) .cse73)) (.cse47 (- (* .cse118 18))) (.cse48 (- (* .cse73 10)))) (let ((.cse7 (or (not .cse117) .cse111 (= (+ (+ (+ (+ (+ (- (* .cse75 .cse46)) .cse45) .cse47) .cse48) (* .cse75 3)) (- 10)) 0))) (.cse10 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse116 (+ (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse13 (or (= (+ (+ (+ (- (* .cse84 10)) (+ (- (* .cse85 18)) (+ (- (* .cse77 (* .cse85 3))) (* .cse84 (* .cse84 2))))) (* .cse77 3)) (- 10)) 0) (not (<= .cse97 |ULTIMATE.start_main_~a~0#1|)) (not (= (+ (* .cse85 12) (+ (- (* .cse77 .cse85)) (* .cse85 .cse114))) 0)))) (.cse20 (or (= (+ (- 10) (+ (* .cse92 3) (+ (+ (+ (- (* .cse92 .cse71)) (* (* 2 .cse93) .cse93)) .cse72) (- (* .cse93 10))))) 0) (not (= (+ (+ (- (* .cse92 .cse90)) (* .cse114 .cse90)) (* 12 .cse90)) 0)) (not (<= .cse115 |ULTIMATE.start_main_~a~0#1|)))) (.cse8 (= (+ (+ (- (* .cse4 6)) (+ (* .cse4 .cse4) (- (* .cse21 12)))) 12) 0)) (.cse11 (<= (+ (- 1) .cse108) |ULTIMATE.start_main_~a~0#1|)) (.cse16 (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)) (.cse17 (let ((.cse110 (or .cse32 (= (+ (+ (+ (- (* .cse73 12)) (+ .cse47 (* .cse43 .cse73))) (* .cse43 2)) (- 6)) 0))) (.cse112 (or (= 0 (+ (- 6) (+ (* 2 .cse61) (+ (+ (* .cse44 .cse61) .cse72) (- (* .cse44 12)))))) .cse32))) (or (let ((.cse109 (+ (- 11) 19))) (and .cse22 .cse9 .cse1 (= (+ (+ (+ 19 (* (- 1) .cse109) 1) 6) 6) |ULTIMATE.start_main_~z~0#1|) .cse110 .cse111 (= |ULTIMATE.start_main_~x~0#1| (+ 19 .cse109)) .cse14 .cse15 (= (+ 2 1) |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse112)) (and .cse113 .cse22 .cse9 .cse1 .cse110 .cse14 .cse15 .cse112)))) (.cse18 (not (<= .cse108 |ULTIMATE.start_main_~a~0#1|))) (.cse19 (<= .cse23 |ULTIMATE.start_main_~a~0#1|))) (or (let ((.cse0 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse0) (= |ULTIMATE.start_main_~n~0#1| .cse0) .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~y~0#1| (+ .cse4 1)) .cse5 .cse6 (= .cse4 6))) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and (= .cse21 (+ 6 1)) .cse22 .cse9 (= |ULTIMATE.start_main_~x~0#1| (+ .cse21 1)) .cse14 .cse15 (= (+ 6 6) .cse4) (= 0 (+ (- 1) .cse23))) (let ((.cse24 (+ (- 169) |ULTIMATE.start_main_~y~0#1|))) (and .cse7 (= (+ 6 .cse24) |ULTIMATE.start_main_~z~0#1|) .cse8 .cse9 (= (+ 42 6) .cse24) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (let ((.cse28 (+ (* 30 4) (- 59)))) (= (let ((.cse27 (+ 30 (- 6)))) (+ (let ((.cse26 (+ .cse27 (- 6)))) (let ((.cse25 (+ (- 17) (* 2 .cse26)))) (+ (+ (* 2 .cse25) (* (- 3) .cse26) 24) .cse25))) (+ .cse28 (* (- 1) .cse27)))) (+ (* (- 1) .cse28) (let ((.cse29 (+ 42 85))) (let ((.cse30 (* (- 1) .cse29))) (+ (+ (+ (* (+ 42 .cse29) (- 1)) |ULTIMATE.start_main_~x~0#1|) .cse30) 42 (- 6) .cse30)))))) .cse19 (= |ULTIMATE.start_main_~n~0#1| (+ 7 1)) .cse20)) (and .cse2 (= |ULTIMATE.start_main_~y~0#1| 1) .cse31 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse96 (+ .cse97 1))) (let ((.cse94 (+ .cse96 1))) (let ((.cse95 (+ .cse94 1))) (let ((.cse91 (+ .cse95 1))) (let ((.cse55 (* 6 .cse96)) (.cse68 (* .cse95 6)) (.cse87 (* 6 .cse91)) (.cse40 (* 6 .cse94)) (.cse56 (+ .cse61 .cse93))) (let ((.cse49 (not (= .cse92 .cse61))) (.cse53 (+ .cse85 .cse56)) (.cse41 (+ 6 .cse40)) (.cse35 (+ .cse87 6)) (.cse52 (+ 6 .cse68)) (.cse69 (+ .cse91 1)) (.cse38 (+ .cse44 .cse90)) (.cse42 (+ .cse55 6))) (and .cse7 (or .cse32 (= (+ (+ (let ((.cse39 (+ (+ .cse43 6) .cse44))) (let ((.cse37 (+ .cse42 .cse39))) (let ((.cse36 (+ .cse37 .cse41))) (let ((.cse33 (+ (+ .cse40 12) .cse36))) (+ (- (* 10 .cse33)) (let ((.cse34 (+ .cse36 (+ .cse37 (+ .cse38 .cse39))))) (+ (+ (* (* 2 .cse33) .cse33) (- (* (* .cse34 3) .cse35))) (- (* .cse34 18))))))))) (* 3 .cse35)) (- 10)) 0)) .cse8 .cse9 (or (= (+ (- 10) (+ (+ (+ (+ .cse45 (- (* .cse43 .cse46))) .cse47) .cse48) (* .cse43 3))) 0) .cse32) (or .cse49 (= (+ (+ (let ((.cse54 (+ .cse42 .cse56))) (let ((.cse51 (+ (+ .cse55 12) .cse54))) (+ (let ((.cse50 (+ .cse53 .cse54))) (+ (- (* .cse50 18)) (+ (* .cse51 (* 2 .cse51)) (- (* .cse52 (* 3 .cse50)))))) (- (* .cse51 10))))) (* 3 .cse52)) (- 10)) 0)) .cse10 .cse11 (or (= (+ (+ (let ((.cse59 (+ .cse44 .cse61))) (let ((.cse57 (+ .cse59 (+ 12 .cse60)))) (+ (- (* .cse57 10)) (let ((.cse58 (+ .cse59 .cse38))) (+ (- (* .cse58 18)) (+ (* (* 2 .cse57) .cse57) (- (* .cse41 (* .cse58 3))))))))) (* 3 .cse41)) (- 10)) 0) .cse32) (or .cse49 (= (+ (- 10) (let ((.cse62 (+ (* 6 .cse69) 6))) (+ (* 3 .cse62) (let ((.cse67 (+ .cse56 (+ 6 .cse61)))) (let ((.cse66 (+ .cse41 .cse67))) (let ((.cse65 (+ .cse66 .cse52))) (let ((.cse63 (+ .cse65 (+ .cse68 12)))) (+ (- (* .cse63 10)) (let ((.cse64 (+ .cse65 (+ .cse66 (+ .cse53 .cse67))))) (+ (- (* .cse64 18)) (+ (- (* .cse62 (* 3 .cse64))) (* .cse63 (* .cse63 2))))))))))))) 0)) .cse12 .cse13 .cse14 .cse15 (let ((.cse74 (+ 12 .cse76))) (or (= (+ (+ (let ((.cse70 (+ .cse73 .cse74))) (+ (- (* 10 .cse70)) (+ (+ (- (* .cse71 .cse61)) (* (* 2 .cse70) .cse70)) .cse72))) (* 3 .cse61)) (- 10)) 0) (not (= .cse75 .cse74)))) .cse16 .cse17 (or (not (= .cse42 .cse77)) (= (+ (let ((.cse80 (+ 6 (* 6 (+ .cse69 1))))) (+ (let ((.cse83 (+ .cse84 .cse42))) (let ((.cse82 (+ .cse83 (+ .cse42 6)))) (let ((.cse86 (+ .cse82 .cse52))) (let ((.cse81 (+ .cse35 .cse86))) (let ((.cse78 (+ .cse81 (+ .cse87 12)))) (+ (- (* .cse78 10)) (let ((.cse79 (+ .cse81 (+ (+ .cse82 (+ .cse83 (+ .cse84 .cse85))) .cse86)))) (+ (- (* .cse79 18)) (+ (* (* 2 .cse78) .cse78) (- (* (* .cse79 3) .cse80))))))))))) (* 3 .cse80))) (- 10)) 0)) .cse18 .cse19 .cse20 (or (= (+ (- 10) (+ (let ((.cse88 (+ .cse44 (+ 12 .cse89)))) (+ (- (* 10 .cse88)) (+ (+ (* (* 2 .cse88) .cse88) (- (* (* 3 .cse38) .cse42))) (- (* .cse38 18))))) (* .cse42 3))) 0) .cse32)))))))) (let ((.cse100 (+ (- 5) 12))) (let ((.cse99 (+ .cse100 12)) (.cse98 (+ 1 1))) (and .cse8 .cse9 (= .cse4 (+ 6 12)) (<= .cse98 |ULTIMATE.start_main_~a~0#1|) .cse11 .cse12 (= |ULTIMATE.start_main_~y~0#1| (+ .cse99 .cse4)) .cse14 .cse15 .cse16 (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse99)) (+ (+ (+ .cse100 (* (- 1) (+ (- 1) .cse100))) 0) .cse100)) (let ((.cse101 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse101 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (let ((.cse102 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (and (< .cse102 65536) (<= 0 .cse102) (not .cse101))))) .cse17 (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse105 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (let ((.cse103 (+ 65536 .cse105))) (and (<= 0 .cse103) (= (+ .cse104 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse105)) .cse106)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= .cse98 .cse105) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (< .cse103 65536))))) (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse107 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (and (< .cse107 65536) (= (+ .cse104 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse107)) .cse106)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= .cse98 .cse107) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse107) (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767))))) .cse18 .cse19))))))))) [2023-02-17 01:29:55,401 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse120 (+ |ULTIMATE.start_main_~n~0#1| 1))) (let ((.cse75 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse119 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse96 (+ .cse120 1)) (.cse88 (* .cse120 6)) (.cse123 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse72 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse74 (+ 6 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse91 (+ .cse74 6)) (.cse92 (+ .cse74 .cse72)) (.cse89 (+ .cse123 .cse72)) (.cse41 (+ 6 .cse88)) (.cse59 (* 6 .cse96)) (.cse102 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse122 (= (+ (+ (- (* .cse74 .cse123)) (* .cse123 .cse119)) (* .cse123 12)) 0)) (.cse8 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse18 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse75))) (.cse98 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse124 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse121 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse9 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse10 (<= |ULTIMATE.start_main_~a~0#1| 10)) (.cse111 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse113 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse6 (+ |ULTIMATE.start_main_~z~0#1| (- 6)))) (let ((.cse104 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse115 (+ (- 1) (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (.cse99 (+ (* (- 1) .cse6) |ULTIMATE.start_main_~y~0#1|)) (.cse97 (= (+ .cse111 (+ (* |ULTIMATE.start_main_~x~0#1| .cse119) .cse113)) 0)) (.cse1 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse10) (not .cse9))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse9 .cse10))) (.cse2 (= (+ (- 6) (+ (+ .cse124 (+ .cse121 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse3 (or .cse18 (let ((.cse127 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse126 (<= (+ .cse127 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse18) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse126) (or (not .cse126) (not (<= (+ .cse127 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse6)) .cse98))))) (.cse4 (= (+ (let ((.cse125 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse125 (* .cse125 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse5 (or .cse102 .cse122 (< .cse120 .cse8))) (.cse7 (= .cse123 (* .cse120 (* .cse120 .cse120)))) (.cse11 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse103 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse124 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse60 (+ 6 .cse59)) (.cse42 (+ .cse41 .cse72)) (.cse30 (not (= .cse41 .cse74))) (.cse70 (* 3 .cse89)) (.cse71 (- (* 18 .cse89))) (.cse83 (+ .cse91 .cse92)) (.cse76 (+ .cse91 6)) (.cse84 (+ .cse92 .cse89)) (.cse44 (* 3 .cse123)) (.cse43 (* (* 2 .cse72) .cse72)) (.cse45 (- (* .cse123 18))) (.cse46 (- (* .cse72 10)))) (let ((.cse14 (or (not .cse122) .cse102 (= (+ (+ (+ (+ (+ (- (* .cse74 .cse44)) .cse43) .cse45) .cse46) (* .cse74 3)) (- 10)) 0))) (.cse19 (or (= (+ (+ (+ (- (* .cse83 10)) (+ (- (* .cse84 18)) (+ (- (* .cse76 (* .cse84 3))) (* .cse83 (* .cse83 2))))) (* .cse76 3)) (- 10)) 0) (not (<= .cse96 |ULTIMATE.start_main_~a~0#1|)) (not (= (+ (* .cse84 12) (+ (- (* .cse76 .cse84)) (* .cse84 .cse119))) 0)))) (.cse55 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse121 (+ (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse29 (or (= (+ (- 10) (+ (* .cse91 3) (+ (+ (+ (- (* .cse91 .cse70)) (* (* 2 .cse92) .cse92)) .cse71) (- (* .cse92 10))))) 0) (not (= (+ (+ (- (* .cse91 .cse89)) (* .cse119 .cse89)) (* 12 .cse89)) 0)) (not (<= .cse120 |ULTIMATE.start_main_~a~0#1|)))) (.cse13 (let ((.cse116 (or .cse30 (= (+ (+ (+ (- (* .cse72 12)) (+ .cse45 (* .cse41 .cse72))) (* .cse41 2)) (- 6)) 0))) (.cse117 (or (= 0 (+ (- 6) (+ (* 2 .cse60) (+ (+ (* .cse42 .cse60) .cse71) (- (* .cse42 12)))))) .cse30))) (or (and .cse97 .cse1 .cse2 .cse3 .cse4 .cse5 .cse116 .cse7 .cse9 .cse10 .cse11 .cse103 .cse117) (let ((.cse118 (+ (- 11) 19))) (and .cse1 .cse2 .cse3 .cse4 (= (+ (+ (+ 19 (* (- 1) .cse118) 1) 6) 6) |ULTIMATE.start_main_~z~0#1|) .cse5 .cse116 .cse102 .cse7 (= |ULTIMATE.start_main_~x~0#1| (+ 19 .cse118)) .cse9 .cse10 .cse11 (= (+ 2 1) |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse103 .cse117))))) (.cse16 (= (+ (+ (- (* .cse6 6)) (+ (* .cse6 .cse6) (- (* .cse99 12)))) 12) 0)) (.cse17 (<= (+ (- 1) .cse115) |ULTIMATE.start_main_~a~0#1|)) (.cse20 (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)) (.cse12 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse21 (not (<= .cse115 |ULTIMATE.start_main_~a~0#1|))) (.cse28 (<= .cse104 |ULTIMATE.start_main_~a~0#1|))) (or (let ((.cse0 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse0) .cse1 (= |ULTIMATE.start_main_~n~0#1| .cse0) .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse6 1)) .cse7 (<= .cse8 1) .cse9 (<= |ULTIMATE.start_main_~n~0#1| .cse0) .cse10 .cse11 .cse12 (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6)) (= .cse6 6))) (let ((.cse15 (+ (- 169) |ULTIMATE.start_main_~y~0#1|))) (and .cse13 .cse14 (= (+ 6 .cse15) |ULTIMATE.start_main_~z~0#1|) .cse16 .cse1 (= (+ 42 6) .cse15) .cse17 .cse18 .cse19 .cse9 .cse10 .cse20 .cse21 (let ((.cse25 (+ (* 30 4) (- 59)))) (= (let ((.cse24 (+ 30 (- 6)))) (+ (let ((.cse23 (+ .cse24 (- 6)))) (let ((.cse22 (+ (- 17) (* 2 .cse23)))) (+ (+ (* 2 .cse22) (* (- 3) .cse23) 24) .cse22))) (+ .cse25 (* (- 1) .cse24)))) (+ (* (- 1) .cse25) (let ((.cse26 (+ 42 85))) (let ((.cse27 (* (- 1) .cse26))) (+ (+ (+ (* (+ 42 .cse26) (- 1)) |ULTIMATE.start_main_~x~0#1|) .cse27) 42 (- 6) .cse27)))))) .cse28 (= |ULTIMATE.start_main_~n~0#1| (+ 7 1)) .cse29)) (let ((.cse95 (+ .cse96 1))) (let ((.cse93 (+ .cse95 1))) (let ((.cse94 (+ .cse93 1))) (let ((.cse90 (+ .cse94 1))) (let ((.cse53 (* 6 .cse95)) (.cse67 (* .cse94 6)) (.cse86 (* 6 .cse90)) (.cse38 (* 6 .cse93)) (.cse54 (+ .cse60 .cse92))) (let ((.cse47 (not (= .cse91 .cse60))) (.cse51 (+ .cse84 .cse54)) (.cse39 (+ 6 .cse38)) (.cse33 (+ .cse86 6)) (.cse50 (+ 6 .cse67)) (.cse68 (+ .cse90 1)) (.cse36 (+ .cse42 .cse89)) (.cse40 (+ .cse53 6))) (and .cse13 .cse14 (or .cse30 (= (+ (+ (let ((.cse37 (+ (+ .cse41 6) .cse42))) (let ((.cse35 (+ .cse40 .cse37))) (let ((.cse34 (+ .cse35 .cse39))) (let ((.cse31 (+ (+ .cse38 12) .cse34))) (+ (- (* 10 .cse31)) (let ((.cse32 (+ .cse34 (+ .cse35 (+ .cse36 .cse37))))) (+ (+ (* (* 2 .cse31) .cse31) (- (* (* .cse32 3) .cse33))) (- (* .cse32 18))))))))) (* 3 .cse33)) (- 10)) 0)) .cse16 .cse1 (or (= (+ (- 10) (+ (+ (+ (+ .cse43 (- (* .cse41 .cse44))) .cse45) .cse46) (* .cse41 3))) 0) .cse30) (or .cse47 (= (+ (+ (let ((.cse52 (+ .cse40 .cse54))) (let ((.cse49 (+ (+ .cse53 12) .cse52))) (+ (let ((.cse48 (+ .cse51 .cse52))) (+ (- (* .cse48 18)) (+ (* .cse49 (* 2 .cse49)) (- (* .cse50 (* 3 .cse48)))))) (- (* .cse49 10))))) (* 3 .cse50)) (- 10)) 0)) .cse55 .cse17 (or (= (+ (+ (let ((.cse58 (+ .cse42 .cse60))) (let ((.cse56 (+ .cse58 (+ 12 .cse59)))) (+ (- (* .cse56 10)) (let ((.cse57 (+ .cse58 .cse36))) (+ (- (* .cse57 18)) (+ (* (* 2 .cse56) .cse56) (- (* .cse39 (* .cse57 3))))))))) (* 3 .cse39)) (- 10)) 0) .cse30) (or .cse47 (= (+ (- 10) (let ((.cse61 (+ (* 6 .cse68) 6))) (+ (* 3 .cse61) (let ((.cse66 (+ .cse54 (+ 6 .cse60)))) (let ((.cse65 (+ .cse39 .cse66))) (let ((.cse64 (+ .cse65 .cse50))) (let ((.cse62 (+ .cse64 (+ .cse67 12)))) (+ (- (* .cse62 10)) (let ((.cse63 (+ .cse64 (+ .cse65 (+ .cse51 .cse66))))) (+ (- (* .cse63 18)) (+ (- (* .cse61 (* 3 .cse63))) (* .cse62 (* .cse62 2))))))))))))) 0)) .cse18 .cse19 .cse9 .cse10 (let ((.cse73 (+ 12 .cse75))) (or (= (+ (+ (let ((.cse69 (+ .cse72 .cse73))) (+ (- (* 10 .cse69)) (+ (+ (- (* .cse70 .cse60)) (* (* 2 .cse69) .cse69)) .cse71))) (* 3 .cse60)) (- 10)) 0) (not (= .cse74 .cse73)))) .cse20 (or (not (= .cse40 .cse76)) (= (+ (let ((.cse79 (+ 6 (* 6 (+ .cse68 1))))) (+ (let ((.cse82 (+ .cse83 .cse40))) (let ((.cse81 (+ .cse82 (+ .cse40 6)))) (let ((.cse85 (+ .cse81 .cse50))) (let ((.cse80 (+ .cse33 .cse85))) (let ((.cse77 (+ .cse80 (+ .cse86 12)))) (+ (- (* .cse77 10)) (let ((.cse78 (+ .cse80 (+ (+ .cse81 (+ .cse82 (+ .cse83 .cse84))) .cse85)))) (+ (- (* .cse78 18)) (+ (* (* 2 .cse77) .cse77) (- (* (* .cse78 3) .cse79))))))))))) (* 3 .cse79))) (- 10)) 0)) .cse21 .cse28 .cse29 (or (= (+ (- 10) (+ (let ((.cse87 (+ .cse42 (+ 12 .cse88)))) (+ (- (* 10 .cse87)) (+ (+ (* (* 2 .cse87) .cse87) (- (* (* 3 .cse36) .cse40))) (- (* .cse36 18))))) (* .cse40 3))) 0) .cse30)))))))) (and .cse13 .cse14 .cse16 .cse1 .cse17 .cse18 .cse19 .cse9 .cse10 .cse20 .cse21 (or .cse55 (not .cse97)) .cse28 .cse29) (and .cse3 (= |ULTIMATE.start_main_~y~0#1| 1) .cse98 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse101 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse100 (+ 6 6))) (and (= .cse99 (+ 6 1)) .cse97 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~x~0#1| (+ .cse99 1)) (= .cse100 .cse101) .cse5 .cse102 .cse7 (= (+ 6 .cse101) |ULTIMATE.start_main_~z~0#1|) .cse9 .cse10 .cse11 .cse103 (= .cse100 .cse6) .cse28 (= 0 (+ (- 1) .cse104)))) (let ((.cse107 (+ (- 5) 12))) (let ((.cse106 (+ .cse107 12)) (.cse105 (+ 1 1))) (and .cse13 .cse16 .cse1 (= .cse6 (+ 6 12)) (<= .cse105 |ULTIMATE.start_main_~a~0#1|) .cse17 .cse18 (= |ULTIMATE.start_main_~y~0#1| (+ .cse106 .cse6)) .cse9 .cse10 .cse20 (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse106)) (+ (+ (+ .cse107 (* (- 1) (+ (- 1) .cse107))) 0) .cse107)) (let ((.cse108 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse108 .cse12) (let ((.cse109 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (and (< .cse109 65536) (<= 0 .cse109) (not .cse108))))) (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse112 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (let ((.cse110 (+ 65536 .cse112))) (and (<= 0 .cse110) (= (+ .cse111 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse112)) .cse113)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= .cse105 .cse112) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (< .cse110 65536))))) (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse114 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (and (< .cse114 65536) (= (+ .cse111 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse114)) .cse113)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= .cse105 .cse114) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse114) (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767))))) .cse21 .cse28))))))))) [2023-02-17 01:29:55,401 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2023-02-17 01:29:55,402 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 01:29:55,402 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 56) the Hoare annotation is: true [2023-02-17 01:29:55,402 INFO L899 garLoopResultBuilder]: For program point L38(lines 33 46) no Hoare annotation was computed. [2023-02-17 01:29:55,403 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse101 (+ |ULTIMATE.start_main_~n~0#1| 1))) (let ((.cse96 (+ .cse101 1))) (let ((.cse169 (+ .cse96 1))) (let ((.cse168 (+ .cse169 1))) (let ((.cse167 (+ .cse168 1)) (.cse130 (* .cse101 6)) (.cse159 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse118 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse111 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse148 (* 6 .cse96)) (.cse133 (* 6 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse8 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse133))) (.cse64 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse40 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse66 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse107 (+ 6 .cse148)) (.cse124 (+ .cse118 .cse111)) (.cse125 (+ .cse159 .cse111)) (.cse113 (+ 6 .cse130)) (.cse160 (+ .cse167 1))) (let ((.cse23 (* 6 .cse160)) (.cse152 (* 6 .cse169)) (.cse158 (* 6 .cse168)) (.cse108 (+ .cse113 .cse111)) (.cse142 (* .cse167 6)) (.cse21 (+ .cse124 .cse125)) (.cse144 (+ .cse107 .cse124)) (.cse122 (+ .cse118 6)) (.cse60 (+ 1 1)) (.cse39 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse77 (= (+ .cse64 (+ (* |ULTIMATE.start_main_~x~0#1| .cse40) .cse66)) 0)) (.cse78 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse163 (not .cse8)) (.cse44 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse162 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse161 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse41 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse9 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse10 (<= |ULTIMATE.start_main_~a~0#1| 10)) (.cse58 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse86 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse87 (* (- 1) |ULTIMATE.start_main_~x~0#1|))) (let ((.cse32 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse97 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse46 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse82 (+ 0 1)) (.cse88 (+ .cse86 |ULTIMATE.start_main_~y~0#1| .cse87)) (.cse68 (+ (* (- 1) .cse58) |ULTIMATE.start_main_~y~0#1|)) (.cse2 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse10) (not .cse9))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse9 .cse10))) (.cse98 (= (+ (- 6) (+ (+ .cse162 (+ .cse161 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse41)) 0)) (.cse42 (or .cse8 (let ((.cse166 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse165 (<= (+ .cse166 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse163 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse165) (or (not .cse165) (not (<= (+ .cse166 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse58)) .cse44))))) (.cse70 (= (+ (let ((.cse164 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse164 (* .cse164 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse71 (or .cse163 .cse77 .cse78)) (.cse79 (= .cse159 (* .cse101 (* .cse101 .cse101)))) (.cse81 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse83 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse162 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse5 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse161 (+ (* .cse39 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse114 (+ (* 30 4) (- 59))) (.cse100 (= (+ (+ (- (* .cse118 .cse159)) (* .cse159 .cse40)) (* .cse159 12)) 0)) (.cse99 (not .cse78)) (.cse54 (+ .cse60 1)) (.cse126 (+ 42 85)) (.cse127 (+ (- 5) 12)) (.cse123 (* 3 .cse125)) (.cse109 (- (* 18 .cse125))) (.cse26 (+ .cse160 1)) (.cse134 (not (= .cse122 .cse107))) (.cse140 (+ .cse21 .cse144)) (.cse25 (+ 6 .cse142)) (.cse120 (* (* 2 .cse111) .cse111)) (.cse119 (* 3 .cse159)) (.cse112 (- (* .cse159 18))) (.cse121 (- (* .cse111 10))) (.cse110 (not (= .cse113 .cse118))) (.cse129 (+ .cse108 .cse125)) (.cse143 (+ 6 .cse158)) (.cse12 (+ .cse152 6)) (.cse24 (+ .cse23 6))) (let ((.cse0 (or .cse110 (= (+ (+ (let ((.cse157 (+ (+ .cse113 6) .cse108))) (let ((.cse156 (+ .cse12 .cse157))) (let ((.cse155 (+ .cse156 .cse143))) (let ((.cse153 (+ (+ .cse158 12) .cse155))) (+ (- (* 10 .cse153)) (let ((.cse154 (+ .cse155 (+ .cse156 (+ .cse129 .cse157))))) (+ (+ (* (* 2 .cse153) .cse153) (- (* (* .cse154 3) .cse24))) (- (* .cse154 18))))))))) (* 3 .cse24)) (- 10)) 0))) (.cse3 (or (= (+ (- 10) (+ (+ (+ (+ .cse120 (- (* .cse113 .cse119))) .cse112) .cse121) (* .cse113 3))) 0) .cse110)) (.cse4 (or .cse134 (= (+ (+ (let ((.cse151 (+ .cse12 .cse144))) (let ((.cse150 (+ (+ .cse152 12) .cse151))) (+ (let ((.cse149 (+ .cse140 .cse151))) (+ (- (* .cse149 18)) (+ (* .cse150 (* 2 .cse150)) (- (* .cse25 (* 3 .cse149)))))) (- (* .cse150 10))))) (* 3 .cse25)) (- 10)) 0))) (.cse6 (or (= (+ (+ (let ((.cse147 (+ .cse108 .cse107))) (let ((.cse145 (+ .cse147 (+ 12 .cse148)))) (+ (- (* .cse145 10)) (let ((.cse146 (+ .cse147 .cse129))) (+ (- (* .cse146 18)) (+ (* (* 2 .cse145) .cse145) (- (* .cse143 (* .cse146 3))))))))) (* 3 .cse143)) (- 10)) 0) .cse110)) (.cse7 (or .cse134 (= (+ (- 10) (let ((.cse135 (+ (* 6 .cse26) 6))) (+ (* 3 .cse135) (let ((.cse141 (+ .cse144 (+ 6 .cse107)))) (let ((.cse139 (+ .cse143 .cse141))) (let ((.cse138 (+ .cse139 .cse25))) (let ((.cse136 (+ .cse138 (+ .cse142 12)))) (+ (- (* .cse136 10)) (let ((.cse137 (+ .cse138 (+ .cse139 (+ .cse140 .cse141))))) (+ (- (* .cse137 18)) (+ (- (* .cse135 (* 3 .cse137))) (* .cse136 (* .cse136 2))))))))))))) 0))) (.cse11 (let ((.cse132 (+ 12 .cse133))) (or (= (+ (+ (let ((.cse131 (+ .cse111 .cse132))) (+ (- (* 10 .cse131)) (+ (+ (- (* .cse123 .cse107)) (* (* 2 .cse131) .cse131)) .cse109))) (* 3 .cse107)) (- 10)) 0) (not (= .cse118 .cse132))))) (.cse29 (or (= (+ (- 10) (+ (let ((.cse128 (+ .cse108 (+ 12 .cse130)))) (+ (- (* 10 .cse128)) (+ (+ (* (* 2 .cse128) .cse128) (- (* (* 3 .cse129) .cse12))) (- (* .cse129 18))))) (* .cse12 3))) 0) .cse110)) (.cse59 (+ 6 12)) (.cse62 (+ (+ (+ .cse127 (* (- 1) (+ (- 1) .cse127))) 0) .cse127)) (.cse61 (+ .cse127 12)) (.cse49 (+ 42 6)) (.cse48 (+ 42 .cse126)) (.cse50 (* (- 1) .cse126)) (.cse20 (+ .cse122 .cse124)) (.cse13 (+ .cse122 6)) (.cse33 (+ .cse54 1)) (.cse38 (or (= (+ (- 10) (+ (* .cse122 3) (+ (+ (+ (- (* .cse122 .cse123)) (* (* 2 .cse124) .cse124)) .cse109) (- (* .cse124 10))))) 0) (not (= (+ (+ (- (* .cse122 .cse125)) (* .cse40 .cse125)) (* 12 .cse125)) 0)) (not (<= .cse101 |ULTIMATE.start_main_~a~0#1|)))) (.cse31 (or (not .cse100) .cse99 (= (+ (+ (+ (+ (+ (- (* .cse118 .cse119)) .cse120) .cse112) .cse121) (* .cse118 3)) (- 10)) 0))) (.cse36 (+ 30 .cse114)) (.cse34 (let ((.cse117 (+ 30 (- 6)))) (+ (let ((.cse116 (+ .cse117 (- 6)))) (let ((.cse115 (+ (- 17) (* 2 .cse116)))) (+ (+ (* 2 .cse115) (* (- 3) .cse116) 24) .cse115))) (+ .cse114 (* (- 1) .cse117))))) (.cse35 (* (- 1) .cse114)) (.cse30 (+ 30 6)) (.cse37 (or .cse5 (not .cse77))) (.cse51 (+ 5 1)) (.cse28 (let ((.cse105 (or .cse110 (= (+ (+ (+ (- (* .cse111 12)) (+ .cse112 (* .cse113 .cse111))) (* .cse113 2)) (- 6)) 0))) (.cse106 (or (= 0 (+ (- 6) (+ (* 2 .cse107) (+ (+ (* .cse108 .cse107) .cse109) (- (* .cse108 12)))))) .cse110))) (or (let ((.cse104 (+ (- 11) 19))) (and .cse2 .cse98 .cse42 .cse70 (= (+ (+ (+ 19 (* (- 1) .cse104) 1) 6) 6) |ULTIMATE.start_main_~z~0#1|) .cse105 .cse79 (= |ULTIMATE.start_main_~x~0#1| (+ 19 .cse104)) .cse9 .cse10 .cse81 (= (+ 2 1) |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse83 .cse106)) (and .cse2 .cse98 .cse42 .cse70 .cse71 .cse105 .cse79 .cse9 .cse10 .cse81 .cse83 .cse106)))) (.cse1 (= (+ (+ (- (* .cse58 6)) (+ (* .cse58 .cse58) (- (* .cse68 12)))) 12) 0)) (.cse69 (+ 6 1)) (.cse84 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse88))) (.cse72 (+ 6 6)) (.cse43 (<= |ULTIMATE.start_main_~n~0#1| .cse82)) (.cse45 (let ((.cse102 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse102 .cse46) (let ((.cse103 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (and (< .cse103 65536) (<= 0 .cse103) (not .cse102)))))) (.cse47 (= |ULTIMATE.start_main_~z~0#1| (+ .cse97 6))) (.cse27 (<= .cse32 |ULTIMATE.start_main_~a~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or (not (= .cse12 .cse13)) (= (+ (let ((.cse16 (+ 6 (* 6 (+ .cse26 1))))) (+ (let ((.cse19 (+ .cse20 .cse12))) (let ((.cse18 (+ .cse19 (+ .cse12 6)))) (let ((.cse22 (+ .cse18 .cse25))) (let ((.cse17 (+ .cse24 .cse22))) (let ((.cse14 (+ .cse17 (+ .cse23 12)))) (+ (- (* .cse14 10)) (let ((.cse15 (+ .cse17 (+ (+ .cse18 (+ .cse19 (+ .cse20 .cse21))) .cse22)))) (+ (- (* .cse15 18)) (+ (* (* 2 .cse14) .cse14) (- (* (* .cse15 3) .cse16))))))))))) (* 3 .cse16))) (- 10)) 0)) .cse27 .cse28 .cse29) (and (= .cse30 |ULTIMATE.start_main_~z~0#1|) .cse31 .cse1 .cse2 (= .cse32 .cse33) .cse8 (= .cse34 (+ .cse35 |ULTIMATE.start_main_~x~0#1|)) .cse9 .cse10 (= .cse36 |ULTIMATE.start_main_~y~0#1|) .cse37 .cse27 .cse28 .cse38) (and (= (+ (+ (+ (- .cse39) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse40))) .cse41) (- 10)) 0) .cse1 .cse2 .cse42 .cse8 (= |ULTIMATE.start_main_~y~0#1| 1) .cse9 .cse43 .cse10 .cse44 .cse45 .cse46 .cse47 (= |ULTIMATE.start_main_~x~0#1| 0) .cse27 (= 6 |ULTIMATE.start_main_~z~0#1|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse28 .cse29) (and .cse1 .cse2 (= .cse48 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| .cse49) (= .cse34 (+ .cse35 (+ 42 (- 6) .cse50 (+ |ULTIMATE.start_main_~x~0#1| .cse50)))) .cse8 .cse9 .cse10 .cse37 (= .cse51 .cse32) .cse27 .cse28) (let ((.cse52 (+ (* .cse58 2) (- 17)))) (let ((.cse53 (+ (* .cse58 (- 3)) (* .cse52 2) 24))) (and .cse1 (= (+ .cse52 .cse53) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~n~0#1| .cse54) .cse2 (= (let ((.cse56 (+ (* (- 1) .cse52) .cse58 (- 6) .cse53))) (let ((.cse57 (+ .cse52 .cse56 (* (- 1) .cse53)))) (let ((.cse55 (+ .cse52 (* (- 1) .cse57)))) (+ (+ (* (- 1) .cse55) (- 6) .cse56 .cse57) .cse55 (* (- 1) .cse56))))) 6) (= .cse58 .cse59) (<= .cse60 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ .cse52 .cse58)) .cse8 (= |ULTIMATE.start_main_~y~0#1| (+ .cse61 .cse58)) .cse9 .cse10 (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse61)) .cse62) .cse45 (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse65 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (let ((.cse63 (+ 65536 .cse65))) (and (<= 0 .cse63) (= (+ .cse64 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse65)) .cse66)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= .cse60 .cse65) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (< .cse63 65536))))) (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse67 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (and (< .cse67 65536) (= (+ .cse64 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse67)) .cse66)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= .cse60 .cse67) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse67) (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767))))) .cse27 .cse28))) (let ((.cse76 (+ .cse86 (- 6) .cse88 (* .cse84 (- 1)))) (.cse80 (+ |ULTIMATE.start_main_~y~0#1| .cse87 1))) (let ((.cse73 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse75 (+ .cse80 (- 6))) (.cse85 (+ .cse84 .cse76 (* (- 1) .cse86)))) (and (= .cse68 .cse69) .cse1 .cse2 .cse42 .cse70 (= |ULTIMATE.start_main_~x~0#1| (+ .cse68 1)) .cse71 (= .cse72 .cse73) (let ((.cse74 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse74)) .cse75) .cse74)) (= .cse76 0) .cse8 (= |ULTIMATE.start_main_~z~0#1| .cse59) (or .cse77 .cse78) .cse79 (= (+ .cse80 6) |ULTIMATE.start_main_~z~0#1|) (= (+ 6 .cse73) |ULTIMATE.start_main_~z~0#1|) .cse9 (= .cse62 |ULTIMATE.start_main_~x~0#1|) .cse10 .cse81 .cse45 (= 6 .cse75) (= .cse32 .cse82) .cse83 (= .cse72 .cse58) (= .cse60 |ULTIMATE.start_main_~n~0#1|) .cse27 (= .cse61 |ULTIMATE.start_main_~y~0#1|) (= (+ .cse84 (* (- 1) .cse85)) 1) (= .cse85 6) (= 0 (+ (- 1) .cse32))))) (let ((.cse89 (+ (- 169) |ULTIMATE.start_main_~y~0#1|))) (and (= (+ 6 .cse89) |ULTIMATE.start_main_~z~0#1|) .cse1 .cse2 (= .cse49 .cse89) .cse8 .cse9 .cse10 (= .cse34 (+ .cse35 (+ (+ (+ (* .cse48 (- 1)) |ULTIMATE.start_main_~x~0#1|) .cse50) 42 (- 6) .cse50))) .cse27 (= |ULTIMATE.start_main_~n~0#1| (+ 7 1)) .cse28)) (let ((.cse95 (+ .cse58 (- 6)))) (let ((.cse93 (+ (- 17) (* .cse95 2)))) (let ((.cse94 (+ (* .cse93 2) 24 (* .cse95 (- 3))))) (and .cse31 (= 6 (let ((.cse91 (+ (* (- 1) .cse93) .cse95 .cse94 (- 6)))) (let ((.cse92 (+ .cse93 (* (- 1) .cse94) .cse91))) (let ((.cse90 (+ .cse93 (* (- 1) .cse92)))) (+ (+ (* (- 1) .cse90) .cse91 (- 6) .cse92) (* (- 1) .cse91) .cse90))))) .cse1 .cse2 .cse5 .cse8 (= .cse68 (+ .cse93 .cse95)) (or (= (+ (+ (+ (- (* .cse20 10)) (+ (- (* .cse21 18)) (+ (- (* .cse13 (* .cse21 3))) (* .cse20 (* .cse20 2))))) (* .cse13 3)) (- 10)) 0) (not (<= .cse96 |ULTIMATE.start_main_~a~0#1|)) (not (= (+ (* .cse21 12) (+ (- (* .cse13 .cse21)) (* .cse21 .cse40))) 0))) .cse9 .cse10 .cse45 (= |ULTIMATE.start_main_~n~0#1| .cse33) .cse27 .cse28 .cse38 (= |ULTIMATE.start_main_~x~0#1| (+ .cse68 (+ .cse93 .cse94))))))) (and .cse31 .cse1 .cse2 (= .cse68 .cse36) .cse8 (= .cse34 (+ .cse35 .cse86)) .cse9 .cse10 (= .cse30 .cse58) .cse37 (= .cse51 |ULTIMATE.start_main_~n~0#1|) .cse27 .cse28) (and (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) .cse1 (= .cse97 6) (= .cse32 0) (= |ULTIMATE.start_main_~x~0#1| .cse82) .cse2 (= |ULTIMATE.start_main_~n~0#1| .cse82) (= |ULTIMATE.start_main_~y~0#1| .cse69) .cse98 .cse42 (= .cse84 1) .cse70 .cse71 (= 6 .cse88) (= .cse72 |ULTIMATE.start_main_~z~0#1|) (or .cse99 .cse100 (< .cse101 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) .cse8 (= |ULTIMATE.start_main_~y~0#1| (+ .cse58 1)) .cse79 .cse9 .cse43 .cse10 .cse81 (= |ULTIMATE.start_main_~y~0#1| (+ .cse58 |ULTIMATE.start_main_~x~0#1|)) .cse45 (= (+ (* (- 1) 6) |ULTIMATE.start_main_~y~0#1|) 1) .cse46 .cse47 (= .cse58 6) (= .cse86 0) .cse27 (= (+ (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse97)) 0) |ULTIMATE.start_main_~x~0#1|)))))))))))) [2023-02-17 01:29:55,405 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse46 (+ |ULTIMATE.start_main_~n~0#1| 1))) (let ((.cse71 (+ .cse46 1))) (let ((.cse171 (+ .cse71 1))) (let ((.cse115 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse170 (+ .cse171 1))) (let ((.cse169 (+ .cse170 1)) (.cse106 (* .cse46 6)) (.cse155 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse114 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse112 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse136 (* 6 .cse71)) (.cse6 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse115)))) (let ((.cse32 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse57 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse34 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse80 (not .cse6)) (.cse18 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse60 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse110 (+ 6 .cse136)) (.cse151 (+ .cse114 .cse112)) (.cse161 (+ .cse155 .cse112)) (.cse121 (+ 6 .cse106)) (.cse163 (+ .cse169 1))) (let ((.cse27 (+ 1 1)) (.cse56 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse17 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse83 (* (- 1) |ULTIMATE.start_main_~x~0#1|)) (.cse98 (* 6 .cse163)) (.cse140 (* 6 .cse171)) (.cse149 (* 6 .cse170)) (.cse105 (+ .cse121 .cse112)) (.cse130 (* .cse169 6)) (.cse69 (+ .cse151 .cse161)) (.cse132 (+ .cse110 .cse151)) (.cse150 (+ .cse114 6)) (.cse59 (or .cse6 (let ((.cse168 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse167 (<= (+ .cse168 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse80 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse167) (or (not .cse167) (not (<= (+ .cse168 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse18)) .cse60))))) (.cse164 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse162 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse58 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse9 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse10 (<= |ULTIMATE.start_main_~a~0#1| 10)) (.cse76 (= (+ .cse32 (+ (* |ULTIMATE.start_main_~x~0#1| .cse57) .cse34)) 0)) (.cse77 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (let ((.cse4 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse41 (or .cse80 .cse76 .cse77)) (.cse3 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse10) (not .cse9))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse9 .cse10))) (.cse39 (= (+ (- 6) (+ (+ .cse164 (+ .cse162 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse58)) 0)) (.cse79 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse49 (let ((.cse165 (= (+ (let ((.cse166 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse166 (* .cse166 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|))) (or (and .cse59 .cse165) (and .cse59 (or .cse80 .cse165))))) (.cse81 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse164 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse101 (+ .cse163 1)) (.cse122 (not (= .cse150 .cse110))) (.cse128 (+ .cse69 .cse132)) (.cse100 (+ 6 .cse130)) (.cse16 (+ (* (- 1) .cse18) |ULTIMATE.start_main_~y~0#1|)) (.cse107 (not (= .cse121 .cse114))) (.cse104 (+ .cse105 .cse161)) (.cse131 (+ 6 .cse149)) (.cse90 (+ .cse140 6)) (.cse99 (+ .cse98 6)) (.cse42 (+ .cse17 |ULTIMATE.start_main_~y~0#1| .cse83)) (.cse50 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse152 (+ (- 5) 12)) (.cse67 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse162 (+ (* .cse56 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse156 (+ 42 85)) (.cse109 (* 3 .cse161)) (.cse111 (- (* 18 .cse161))) (.cse22 (+ .cse27 1)) (.cse45 (= (+ (+ (- (* .cse114 .cse155)) (* .cse155 .cse57)) (* .cse155 12)) 0)) (.cse44 (not .cse77)) (.cse142 (* 3 .cse155)) (.cse141 (* (* 2 .cse112) .cse112)) (.cse120 (- (* .cse155 18))) (.cse143 (- (* .cse112 10))) (.cse36 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse37 (+ 0 1)) (.cse157 (+ (* 30 4) (- 59)))) (let ((.cse12 (+ 30 .cse157)) (.cse0 (+ 30 6)) (.cse48 (<= |ULTIMATE.start_main_~n~0#1| .cse37)) (.cse51 (= |ULTIMATE.start_main_~z~0#1| (+ .cse36 6))) (.cse1 (or (not .cse45) .cse44 (= (+ (+ (+ (+ (+ (- (* .cse114 .cse142)) .cse141) .cse120) .cse143) (* .cse114 3)) (- 10)) 0))) (.cse5 (+ .cse22 1)) (.cse15 (or (= (+ (- 10) (+ (* .cse150 3) (+ (+ (+ (- (* .cse150 .cse109)) (* (* 2 .cse151) .cse151)) .cse111) (- (* .cse151 10))))) 0) (not (= (+ (+ (- (* .cse150 .cse161)) (* .cse57 .cse161)) (* 12 .cse161)) 0)) (not (<= .cse46 |ULTIMATE.start_main_~a~0#1|)))) (.cse54 (+ 42 .cse156)) (.cse53 (+ 42 6)) (.cse7 (let ((.cse160 (+ 30 (- 6)))) (+ (let ((.cse159 (+ .cse160 (- 6)))) (let ((.cse158 (+ (- 17) (* 2 .cse159)))) (+ (+ (* 2 .cse158) (* (- 3) .cse159) 24) .cse158))) (+ .cse157 (* (- 1) .cse160))))) (.cse8 (* (- 1) .cse157)) (.cse55 (* (- 1) .cse156)) (.cse13 (or .cse67 (not .cse76))) (.cse19 (+ 5 1)) (.cse38 (+ 6 1)) (.cse26 (+ 6 12)) (.cse29 (+ (+ (+ .cse152 (* (- 1) (+ (- 1) .cse152))) 0) .cse152)) (.cse47 (= .cse155 (* .cse46 (* .cse46 .cse46)))) (.cse30 (let ((.cse153 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse153 .cse50) (let ((.cse154 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (and (< .cse154 65536) (<= 0 .cse154) (not .cse153)))))) (.cse43 (+ 6 6)) (.cse28 (+ .cse152 12)) (.cse40 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse42))) (.cse70 (+ .cse150 6)) (.cse68 (+ .cse150 .cse151)) (.cse84 (or .cse107 (= (+ (+ (let ((.cse148 (+ (+ .cse121 6) .cse105))) (let ((.cse147 (+ .cse90 .cse148))) (let ((.cse146 (+ .cse147 .cse131))) (let ((.cse144 (+ (+ .cse149 12) .cse146))) (+ (- (* 10 .cse144)) (let ((.cse145 (+ .cse146 (+ .cse147 (+ .cse104 .cse148))))) (+ (+ (* (* 2 .cse144) .cse144) (- (* (* .cse145 3) .cse99))) (- (* .cse145 18))))))))) (* 3 .cse99)) (- 10)) 0))) (.cse2 (= (+ (+ (- (* .cse18 6)) (+ (* .cse18 .cse18) (- (* .cse16 12)))) 12) 0)) (.cse85 (or (= (+ (- 10) (+ (+ (+ (+ .cse141 (- (* .cse121 .cse142))) .cse120) .cse143) (* .cse121 3))) 0) .cse107)) (.cse86 (or .cse122 (= (+ (+ (let ((.cse139 (+ .cse90 .cse132))) (let ((.cse138 (+ (+ .cse140 12) .cse139))) (+ (let ((.cse137 (+ .cse128 .cse139))) (+ (- (* .cse137 18)) (+ (* .cse138 (* 2 .cse138)) (- (* .cse100 (* 3 .cse137)))))) (- (* .cse138 10))))) (* 3 .cse100)) (- 10)) 0))) (.cse87 (or (= (+ (+ (let ((.cse135 (+ .cse105 .cse110))) (let ((.cse133 (+ .cse135 (+ 12 .cse136)))) (+ (- (* .cse133 10)) (let ((.cse134 (+ .cse135 .cse104))) (+ (- (* .cse134 18)) (+ (* (* 2 .cse133) .cse133) (- (* .cse131 (* .cse134 3))))))))) (* 3 .cse131)) (- 10)) 0) .cse107)) (.cse88 (or .cse122 (= (+ (- 10) (let ((.cse123 (+ (* 6 .cse101) 6))) (+ (* 3 .cse123) (let ((.cse129 (+ .cse132 (+ 6 .cse110)))) (let ((.cse127 (+ .cse131 .cse129))) (let ((.cse126 (+ .cse127 .cse100))) (let ((.cse124 (+ .cse126 (+ .cse130 12)))) (+ (- (* .cse124 10)) (let ((.cse125 (+ .cse126 (+ .cse127 (+ .cse128 .cse129))))) (+ (- (* .cse125 18)) (+ (- (* .cse123 (* 3 .cse125))) (* .cse124 (* .cse124 2))))))))))))) 0))) (.cse11 (let ((.cse116 (let ((.cse118 (or .cse107 (= (+ (+ (+ (- (* .cse112 12)) (+ .cse120 (* .cse121 .cse112))) (* .cse121 2)) (- 6)) 0))) (.cse119 (or (= 0 (+ (- 6) (+ (* 2 .cse110) (+ (+ (* .cse105 .cse110) .cse111) (- (* .cse105 12)))))) .cse107))) (or (and .cse3 .cse118 .cse9 .cse10 .cse79 .cse49 .cse81 .cse119 (or .cse80 .cse39)) (and .cse3 .cse39 .cse118 .cse9 .cse10 .cse79 .cse49 .cse81 .cse119))))) (or (and .cse41 .cse116) (let ((.cse117 (+ (- 11) 19))) (and (= (+ (+ (+ 19 (* (- 1) .cse117) 1) 6) 6) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| (+ 19 .cse117)) .cse116 (= (+ 2 1) |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~a~0#1|)))))) (.cse89 (let ((.cse113 (+ 12 .cse115))) (or (= (+ (+ (let ((.cse108 (+ .cse112 .cse113))) (+ (- (* 10 .cse108)) (+ (+ (- (* .cse109 .cse110)) (* (* 2 .cse108) .cse108)) .cse111))) (* 3 .cse110)) (- 10)) 0) (not (= .cse114 .cse113))))) (.cse14 (<= .cse4 |ULTIMATE.start_main_~a~0#1|)) (.cse102 (or (= (+ (- 10) (+ (let ((.cse103 (+ .cse105 (+ 12 .cse106)))) (+ (- (* 10 .cse103)) (+ (+ (* (* 2 .cse103) .cse103) (- (* (* 3 .cse104) .cse90))) (- (* .cse104 18))))) (* .cse90 3))) 0) .cse107))) (or (and (= .cse0 |ULTIMATE.start_main_~z~0#1|) .cse1 .cse2 .cse3 (= .cse4 .cse5) .cse6 (= .cse7 (+ .cse8 |ULTIMATE.start_main_~x~0#1|)) .cse9 .cse10 .cse11 (= .cse12 |ULTIMATE.start_main_~y~0#1|) .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 (= .cse16 .cse12) .cse6 (= .cse7 (+ .cse8 .cse17)) .cse9 .cse10 .cse11 (= .cse0 .cse18) .cse13 (= .cse19 |ULTIMATE.start_main_~n~0#1|) .cse14) (let ((.cse20 (+ (* .cse18 2) (- 17)))) (let ((.cse21 (+ (* .cse18 (- 3)) (* .cse20 2) 24))) (and .cse2 (= (+ .cse20 .cse21) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~n~0#1| .cse22) .cse3 (= (let ((.cse24 (+ (* (- 1) .cse20) .cse18 (- 6) .cse21))) (let ((.cse25 (+ .cse20 .cse24 (* (- 1) .cse21)))) (let ((.cse23 (+ .cse20 (* (- 1) .cse25)))) (+ (+ (* (- 1) .cse23) (- 6) .cse24 .cse25) .cse23 (* (- 1) .cse24))))) 6) (= .cse18 .cse26) (<= .cse27 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ .cse20 .cse18)) .cse6 (= |ULTIMATE.start_main_~y~0#1| (+ .cse28 .cse18)) .cse9 .cse10 .cse11 (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse28)) .cse29) .cse30 (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse33 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (let ((.cse31 (+ 65536 .cse33))) (and (<= 0 .cse31) (= (+ .cse32 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse33)) .cse34)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= .cse27 .cse33) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (< .cse31 65536))))) (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse35 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (and (< .cse35 65536) (= (+ .cse32 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse35)) .cse34)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= .cse27 .cse35) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse35) (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767))))) .cse14))) (and (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) .cse2 (= .cse36 6) (= .cse4 0) (= |ULTIMATE.start_main_~x~0#1| .cse37) .cse3 (= |ULTIMATE.start_main_~n~0#1| .cse37) (= |ULTIMATE.start_main_~y~0#1| .cse38) .cse39 (= .cse40 1) .cse41 (= 6 .cse42) (= .cse43 |ULTIMATE.start_main_~z~0#1|) (or .cse44 .cse45 (< .cse46 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) .cse6 (= |ULTIMATE.start_main_~y~0#1| (+ .cse18 1)) .cse47 .cse9 .cse48 .cse10 .cse49 (= |ULTIMATE.start_main_~y~0#1| (+ .cse18 |ULTIMATE.start_main_~x~0#1|)) .cse30 (= (+ (* (- 1) 6) |ULTIMATE.start_main_~y~0#1|) 1) .cse50 .cse51 (= .cse18 6) (= .cse17 0) .cse14 (= (+ (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse36)) 0) |ULTIMATE.start_main_~x~0#1|)) (let ((.cse52 (+ (- 169) |ULTIMATE.start_main_~y~0#1|))) (and (= (+ 6 .cse52) |ULTIMATE.start_main_~z~0#1|) .cse2 .cse3 (= .cse53 .cse52) .cse6 .cse9 .cse10 .cse11 (= .cse7 (+ .cse8 (+ (+ (+ (* .cse54 (- 1)) |ULTIMATE.start_main_~x~0#1|) .cse55) 42 (- 6) .cse55))) .cse14 (= |ULTIMATE.start_main_~n~0#1| (+ 7 1)))) (and (= (+ (+ (+ (- .cse56) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse57))) .cse58) (- 10)) 0) .cse2 .cse3 .cse59 .cse6 (= |ULTIMATE.start_main_~y~0#1| 1) .cse9 .cse48 .cse10 .cse60 .cse30 .cse50 .cse51 (= |ULTIMATE.start_main_~x~0#1| 0) .cse14 (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse66 (+ .cse18 (- 6)))) (let ((.cse64 (+ (- 17) (* .cse66 2)))) (let ((.cse65 (+ (* .cse64 2) 24 (* .cse66 (- 3))))) (and .cse1 (= 6 (let ((.cse62 (+ (* (- 1) .cse64) .cse66 .cse65 (- 6)))) (let ((.cse63 (+ .cse64 (* (- 1) .cse65) .cse62))) (let ((.cse61 (+ .cse64 (* (- 1) .cse63)))) (+ (+ (* (- 1) .cse61) .cse62 (- 6) .cse63) (* (- 1) .cse62) .cse61))))) .cse2 .cse3 .cse67 .cse6 (= .cse16 (+ .cse64 .cse66)) (or (= (+ (+ (+ (- (* .cse68 10)) (+ (- (* .cse69 18)) (+ (- (* .cse70 (* .cse69 3))) (* .cse68 (* .cse68 2))))) (* .cse70 3)) (- 10)) 0) (not (<= .cse71 |ULTIMATE.start_main_~a~0#1|)) (not (= (+ (* .cse69 12) (+ (- (* .cse70 .cse69)) (* .cse69 .cse57))) 0))) .cse9 .cse10 .cse11 .cse30 (= |ULTIMATE.start_main_~n~0#1| .cse5) .cse14 .cse15 (= |ULTIMATE.start_main_~x~0#1| (+ .cse16 (+ .cse64 .cse65))))))) (and .cse2 .cse3 (= .cse54 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| .cse53) (= .cse7 (+ .cse8 (+ 42 (- 6) .cse55 (+ |ULTIMATE.start_main_~x~0#1| .cse55)))) .cse6 .cse9 .cse10 .cse11 .cse13 (= .cse19 .cse4) .cse14) (let ((.cse75 (+ .cse17 (- 6) .cse42 (* .cse40 (- 1)))) (.cse78 (+ |ULTIMATE.start_main_~y~0#1| .cse83 1))) (let ((.cse72 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse74 (+ .cse78 (- 6))) (.cse82 (+ .cse40 .cse75 (* (- 1) .cse17)))) (and (= .cse16 .cse38) .cse2 .cse3 (= |ULTIMATE.start_main_~x~0#1| (+ .cse16 1)) .cse41 (= .cse43 .cse72) (let ((.cse73 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse73)) .cse74) .cse73)) (= .cse75 0) .cse6 (= |ULTIMATE.start_main_~z~0#1| .cse26) (or .cse76 .cse77) (= (+ .cse78 6) |ULTIMATE.start_main_~z~0#1|) (= (+ 6 .cse72) |ULTIMATE.start_main_~z~0#1|) .cse9 (= .cse29 |ULTIMATE.start_main_~x~0#1|) .cse10 .cse79 .cse49 (or .cse80 .cse47) .cse30 (= 6 .cse74) (= .cse4 .cse37) .cse81 (= .cse43 .cse18) (= .cse27 |ULTIMATE.start_main_~n~0#1|) .cse14 (= .cse28 |ULTIMATE.start_main_~y~0#1|) (= (+ .cse40 (* (- 1) .cse82)) 1) (= .cse82 6) (= 0 (+ (- 1) .cse4))))) (and .cse84 .cse2 .cse3 .cse85 .cse86 .cse67 .cse87 .cse88 .cse6 .cse9 .cse10 .cse11 .cse89 (or (not (= .cse90 .cse70)) (= (+ (let ((.cse93 (+ 6 (* 6 (+ .cse101 1))))) (+ (let ((.cse96 (+ .cse68 .cse90))) (let ((.cse95 (+ .cse96 (+ .cse90 6)))) (let ((.cse97 (+ .cse95 .cse100))) (let ((.cse94 (+ .cse99 .cse97))) (let ((.cse91 (+ .cse94 (+ .cse98 12)))) (+ (- (* .cse91 10)) (let ((.cse92 (+ .cse94 (+ (+ .cse95 (+ .cse96 (+ .cse68 .cse69))) .cse97)))) (+ (- (* .cse92 18)) (+ (* (* 2 .cse91) .cse91) (- (* (* .cse92 3) .cse93))))))))))) (* 3 .cse93))) (- 10)) 0)) .cse14 .cse102) (and .cse84 .cse2 (or .cse80 .cse67) .cse3 .cse85 .cse86 .cse87 .cse88 .cse6 .cse9 .cse10 .cse11 .cse89 .cse14 .cse102))))))))))) [2023-02-17 01:29:55,407 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse43 (+ |ULTIMATE.start_main_~n~0#1| 1))) (let ((.cse89 (+ .cse43 1))) (let ((.cse169 (+ .cse89 1))) (let ((.cse168 (+ .cse169 1))) (let ((.cse167 (+ .cse168 1)) (.cse126 (* .cse43 6)) (.cse123 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse116 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse113 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse145 (* 6 .cse89)) (.cse130 (* 6 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse74 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse60 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse76 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse9 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse130))) (.cse109 (+ 6 .cse145)) (.cse158 (+ .cse116 .cse113)) (.cse159 (+ .cse123 .cse113)) (.cse115 (+ 6 .cse126)) (.cse160 (+ .cse167 1))) (let ((.cse70 (+ 1 1)) (.cse24 (* 6 .cse160)) (.cse149 (* 6 .cse169)) (.cse155 (* 6 .cse168)) (.cse110 (+ .cse115 .cse113)) (.cse139 (* .cse167 6)) (.cse22 (+ .cse158 .cse159)) (.cse141 (+ .cse109 .cse158)) (.cse157 (+ .cse116 6)) (.cse50 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse101 (* (- 1) |ULTIMATE.start_main_~x~0#1|)) (.cse44 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse62 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse161 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse61 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse10 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse11 (<= |ULTIMATE.start_main_~a~0#1| 10)) (.cse163 (not .cse9)) (.cse95 (= (+ .cse74 (+ (* |ULTIMATE.start_main_~x~0#1| .cse60) .cse76)) 0)) (.cse96 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse166 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse59 (* 2 |ULTIMATE.start_main_~y~0#1|))) (let ((.cse31 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse6 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse166 (+ (* .cse59 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse38 (or .cse163 .cse95 .cse96)) (.cse2 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse11) (not .cse10))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse10 .cse11))) (.cse34 (= (+ (- 6) (+ (+ .cse161 (+ .cse166 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse61)) 0)) (.cse35 (or .cse9 (let ((.cse165 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse164 (<= (+ .cse165 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse163 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse164) (or (not .cse164) (not (<= (+ .cse165 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse44)) .cse62))))) (.cse37 (= (+ (let ((.cse162 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse162 (* .cse162 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse98 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse99 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse161 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse102 (+ (* 30 4) (- 59))) (.cse88 (+ (* (- 1) .cse44) |ULTIMATE.start_main_~y~0#1|)) (.cse42 (= (+ (+ (- (* .cse116 .cse123)) (* .cse123 .cse60)) (* .cse123 12)) 0)) (.cse41 (not .cse96)) (.cse39 (+ .cse50 |ULTIMATE.start_main_~y~0#1| .cse101)) (.cse48 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse120 (+ (- 5) 12)) (.cse27 (+ .cse160 1)) (.cse131 (not (= .cse157 .cse109))) (.cse137 (+ .cse22 .cse141)) (.cse26 (+ 6 .cse139)) (.cse118 (* (* 2 .cse113) .cse113)) (.cse117 (* 3 .cse123)) (.cse114 (- (* .cse123 18))) (.cse119 (- (* .cse113 10))) (.cse112 (not (= .cse115 .cse116))) (.cse125 (+ .cse110 .cse159)) (.cse140 (+ 6 .cse155)) (.cse13 (+ .cse149 6)) (.cse25 (+ .cse24 6)) (.cse156 (+ 42 85)) (.cse128 (* 3 .cse159)) (.cse111 (- (* 18 .cse159))) (.cse65 (+ .cse70 1)) (.cse30 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse32 (+ 0 1))) (let ((.cse46 (<= |ULTIMATE.start_main_~n~0#1| .cse32)) (.cse49 (= |ULTIMATE.start_main_~z~0#1| (+ .cse30 6))) (.cse21 (+ .cse157 .cse158)) (.cse14 (+ .cse157 6)) (.cse53 (+ .cse65 1)) (.cse58 (or (= (+ (- 10) (+ (* .cse157 3) (+ (+ (+ (- (* .cse157 .cse128)) (* (* 2 .cse158) .cse158)) .cse111) (- (* .cse158 10))))) 0) (not (= (+ (+ (- (* .cse157 .cse159)) (* .cse60 .cse159)) (* 12 .cse159)) 0)) (not (<= .cse43 |ULTIMATE.start_main_~a~0#1|)))) (.cse79 (+ 42 6)) (.cse78 (+ 42 .cse156)) (.cse80 (* (- 1) .cse156)) (.cse0 (or .cse112 (= (+ (+ (let ((.cse154 (+ (+ .cse115 6) .cse110))) (let ((.cse153 (+ .cse13 .cse154))) (let ((.cse152 (+ .cse153 .cse140))) (let ((.cse150 (+ (+ .cse155 12) .cse152))) (+ (- (* 10 .cse150)) (let ((.cse151 (+ .cse152 (+ .cse153 (+ .cse125 .cse154))))) (+ (+ (* (* 2 .cse150) .cse150) (- (* (* .cse151 3) .cse25))) (- (* .cse151 18))))))))) (* 3 .cse25)) (- 10)) 0))) (.cse3 (or (= (+ (- 10) (+ (+ (+ (+ .cse118 (- (* .cse115 .cse117))) .cse114) .cse119) (* .cse115 3))) 0) .cse112)) (.cse5 (or .cse131 (= (+ (+ (let ((.cse148 (+ .cse13 .cse141))) (let ((.cse147 (+ (+ .cse149 12) .cse148))) (+ (let ((.cse146 (+ .cse137 .cse148))) (+ (- (* .cse146 18)) (+ (* .cse147 (* 2 .cse147)) (- (* .cse26 (* 3 .cse146)))))) (- (* .cse147 10))))) (* 3 .cse26)) (- 10)) 0))) (.cse7 (or (= (+ (+ (let ((.cse144 (+ .cse110 .cse109))) (let ((.cse142 (+ .cse144 (+ 12 .cse145)))) (+ (- (* .cse142 10)) (let ((.cse143 (+ .cse144 .cse125))) (+ (- (* .cse143 18)) (+ (* (* 2 .cse142) .cse142) (- (* .cse140 (* .cse143 3))))))))) (* 3 .cse140)) (- 10)) 0) .cse112)) (.cse8 (or .cse131 (= (+ (- 10) (let ((.cse132 (+ (* 6 .cse27) 6))) (+ (* 3 .cse132) (let ((.cse138 (+ .cse141 (+ 6 .cse109)))) (let ((.cse136 (+ .cse140 .cse138))) (let ((.cse135 (+ .cse136 .cse26))) (let ((.cse133 (+ .cse135 (+ .cse139 12)))) (+ (- (* .cse133 10)) (let ((.cse134 (+ .cse135 (+ .cse136 (+ .cse137 .cse138))))) (+ (- (* .cse134 18)) (+ (- (* .cse132 (* 3 .cse134))) (* .cse133 (* .cse133 2))))))))))))) 0))) (.cse12 (let ((.cse129 (+ 12 .cse130))) (or (= (+ (+ (let ((.cse127 (+ .cse113 .cse129))) (+ (- (* 10 .cse127)) (+ (+ (- (* .cse128 .cse109)) (* (* 2 .cse127) .cse127)) .cse111))) (* 3 .cse109)) (- 10)) 0) (not (= .cse116 .cse129))))) (.cse29 (or (= (+ (- 10) (+ (let ((.cse124 (+ .cse110 (+ 12 .cse126)))) (+ (- (* 10 .cse124)) (+ (+ (* (* 2 .cse124) .cse124) (- (* (* 3 .cse125) .cse13))) (- (* .cse125 18))))) (* .cse13 3))) 0) .cse112)) (.cse33 (+ 6 1)) (.cse69 (+ 6 12)) (.cse45 (= .cse123 (* .cse43 (* .cse43 .cse43)))) (.cse72 (+ (+ (+ .cse120 (* (- 1) (+ (- 1) .cse120))) 0) .cse120)) (.cse47 (let ((.cse121 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse121 .cse48) (let ((.cse122 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (and (< .cse122 65536) (<= 0 .cse122) (not .cse121)))))) (.cse40 (+ 6 6)) (.cse71 (+ .cse120 12)) (.cse36 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse39))) (.cse52 (or (not .cse42) .cse41 (= (+ (+ (+ (+ (+ (- (* .cse116 .cse117)) .cse118) .cse114) .cse119) (* .cse116 3)) (- 10)) 0))) (.cse1 (= (+ (+ (- (* .cse44 6)) (+ (* .cse44 .cse44) (- (* .cse88 12)))) 12) 0)) (.cse56 (+ 30 .cse102)) (.cse4 (let ((.cse106 (or .cse112 (= (+ (+ (+ (- (* .cse113 12)) (+ .cse114 (* .cse115 .cse113))) (* .cse115 2)) (- 6)) 0))) (.cse107 (or (= 0 (+ (- 6) (+ (* 2 .cse109) (+ (+ (* .cse110 .cse109) .cse111) (- (* .cse110 12)))))) .cse112))) (or (and .cse2 .cse34 .cse35 .cse37 .cse38 .cse106 .cse10 .cse11 .cse98 .cse99 .cse107) (let ((.cse108 (+ (- 11) 19))) (and .cse2 .cse34 .cse35 .cse37 (= (+ (+ (+ 19 (* (- 1) .cse108) 1) 6) 6) |ULTIMATE.start_main_~z~0#1|) .cse106 (= |ULTIMATE.start_main_~x~0#1| (+ 19 .cse108)) .cse10 .cse11 .cse98 (= (+ 2 1) |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse99 .cse107))))) (.cse54 (let ((.cse105 (+ 30 (- 6)))) (+ (let ((.cse104 (+ .cse105 (- 6)))) (let ((.cse103 (+ (- 17) (* 2 .cse104)))) (+ (+ (* 2 .cse103) (* (- 3) .cse104) 24) .cse103))) (+ .cse102 (* (- 1) .cse105))))) (.cse55 (* (- 1) .cse102)) (.cse51 (+ 30 6)) (.cse57 (or .cse6 (not .cse95))) (.cse81 (+ 5 1)) (.cse28 (<= .cse31 |ULTIMATE.start_main_~a~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (or (not (= .cse13 .cse14)) (= (+ (let ((.cse17 (+ 6 (* 6 (+ .cse27 1))))) (+ (let ((.cse20 (+ .cse21 .cse13))) (let ((.cse19 (+ .cse20 (+ .cse13 6)))) (let ((.cse23 (+ .cse19 .cse26))) (let ((.cse18 (+ .cse25 .cse23))) (let ((.cse15 (+ .cse18 (+ .cse24 12)))) (+ (- (* .cse15 10)) (let ((.cse16 (+ .cse18 (+ (+ .cse19 (+ .cse20 (+ .cse21 .cse22))) .cse23)))) (+ (- (* .cse16 18)) (+ (* (* 2 .cse15) .cse15) (- (* (* .cse16 3) .cse17))))))))))) (* 3 .cse17))) (- 10)) 0)) .cse28 .cse29) (and (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) .cse1 (= .cse30 6) (= .cse31 0) (= |ULTIMATE.start_main_~x~0#1| .cse32) .cse2 (= |ULTIMATE.start_main_~n~0#1| .cse32) (= |ULTIMATE.start_main_~y~0#1| .cse33) .cse34 .cse35 (= .cse36 1) .cse37 .cse38 (= 6 .cse39) (= .cse40 |ULTIMATE.start_main_~z~0#1|) (or .cse41 .cse42 (< .cse43 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) .cse9 (= |ULTIMATE.start_main_~y~0#1| (+ .cse44 1)) .cse45 .cse10 .cse46 .cse11 (= |ULTIMATE.start_main_~y~0#1| (+ .cse44 |ULTIMATE.start_main_~x~0#1|)) .cse47 (= (+ (* (- 1) 6) |ULTIMATE.start_main_~y~0#1|) 1) .cse48 .cse49 (= .cse44 6) (= .cse50 0) .cse28 (= (+ (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse30)) 0) |ULTIMATE.start_main_~x~0#1|)) (and (= .cse51 |ULTIMATE.start_main_~z~0#1|) .cse52 .cse1 .cse2 .cse4 (= .cse31 .cse53) .cse9 (= .cse54 (+ .cse55 |ULTIMATE.start_main_~x~0#1|)) .cse10 .cse11 (= .cse56 |ULTIMATE.start_main_~y~0#1|) .cse57 .cse28 .cse58) (and (= (+ (+ (+ (- .cse59) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse60))) .cse61) (- 10)) 0) .cse1 .cse2 .cse35 .cse9 (= |ULTIMATE.start_main_~y~0#1| 1) .cse10 .cse46 .cse11 .cse62 .cse47 .cse48 .cse49 (= |ULTIMATE.start_main_~x~0#1| 0) .cse28 (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse63 (+ (* .cse44 2) (- 17)))) (let ((.cse64 (+ (* .cse44 (- 3)) (* .cse63 2) 24))) (and .cse1 (= (+ .cse63 .cse64) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~n~0#1| .cse65) .cse2 (= (let ((.cse67 (+ (* (- 1) .cse63) .cse44 (- 6) .cse64))) (let ((.cse68 (+ .cse63 .cse67 (* (- 1) .cse64)))) (let ((.cse66 (+ .cse63 (* (- 1) .cse68)))) (+ (+ (* (- 1) .cse66) (- 6) .cse67 .cse68) .cse66 (* (- 1) .cse67))))) 6) .cse4 (= .cse44 .cse69) (<= .cse70 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ .cse63 .cse44)) .cse9 (= |ULTIMATE.start_main_~y~0#1| (+ .cse71 .cse44)) .cse10 .cse11 (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse71)) .cse72) .cse47 (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse75 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (let ((.cse73 (+ 65536 .cse75))) (and (<= 0 .cse73) (= (+ .cse74 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse75)) .cse76)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= .cse70 .cse75) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (< .cse73 65536))))) (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse77 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (and (< .cse77 65536) (= (+ .cse74 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse77)) .cse76)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= .cse70 .cse77) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse77) (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767))))) .cse28))) (and .cse1 .cse2 .cse4 (= .cse78 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| .cse79) (= .cse54 (+ .cse55 (+ 42 (- 6) .cse80 (+ |ULTIMATE.start_main_~x~0#1| .cse80)))) .cse9 .cse10 .cse11 .cse57 (= .cse81 .cse31) .cse28) (let ((.cse87 (+ .cse44 (- 6)))) (let ((.cse85 (+ (- 17) (* .cse87 2)))) (let ((.cse86 (+ (* .cse85 2) 24 (* .cse87 (- 3))))) (and .cse52 (= 6 (let ((.cse83 (+ (* (- 1) .cse85) .cse87 .cse86 (- 6)))) (let ((.cse84 (+ .cse85 (* (- 1) .cse86) .cse83))) (let ((.cse82 (+ .cse85 (* (- 1) .cse84)))) (+ (+ (* (- 1) .cse82) .cse83 (- 6) .cse84) (* (- 1) .cse83) .cse82))))) .cse1 .cse2 .cse4 .cse6 .cse9 (= .cse88 (+ .cse85 .cse87)) (or (= (+ (+ (+ (- (* .cse21 10)) (+ (- (* .cse22 18)) (+ (- (* .cse14 (* .cse22 3))) (* .cse21 (* .cse21 2))))) (* .cse14 3)) (- 10)) 0) (not (<= .cse89 |ULTIMATE.start_main_~a~0#1|)) (not (= (+ (* .cse22 12) (+ (- (* .cse14 .cse22)) (* .cse22 .cse60))) 0))) .cse10 .cse11 .cse47 (= |ULTIMATE.start_main_~n~0#1| .cse53) .cse28 .cse58 (= |ULTIMATE.start_main_~x~0#1| (+ .cse88 (+ .cse85 .cse86))))))) (let ((.cse90 (+ (- 169) |ULTIMATE.start_main_~y~0#1|))) (and (= (+ 6 .cse90) |ULTIMATE.start_main_~z~0#1|) .cse1 .cse2 (= .cse79 .cse90) .cse4 .cse9 .cse10 .cse11 (= .cse54 (+ .cse55 (+ (+ (+ (* .cse78 (- 1)) |ULTIMATE.start_main_~x~0#1|) .cse80) 42 (- 6) .cse80))) .cse28 (= |ULTIMATE.start_main_~n~0#1| (+ 7 1)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse28 .cse29) (let ((.cse94 (+ .cse50 (- 6) .cse39 (* .cse36 (- 1)))) (.cse97 (+ |ULTIMATE.start_main_~y~0#1| .cse101 1))) (let ((.cse91 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse93 (+ .cse97 (- 6))) (.cse100 (+ .cse36 .cse94 (* (- 1) .cse50)))) (and (= .cse88 .cse33) .cse1 .cse2 .cse35 .cse37 (= |ULTIMATE.start_main_~x~0#1| (+ .cse88 1)) .cse38 (= .cse40 .cse91) (let ((.cse92 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse92)) .cse93) .cse92)) (= .cse94 0) .cse9 (= |ULTIMATE.start_main_~z~0#1| .cse69) (or .cse95 .cse96) .cse45 (= (+ .cse97 6) |ULTIMATE.start_main_~z~0#1|) (= (+ 6 .cse91) |ULTIMATE.start_main_~z~0#1|) .cse10 (= .cse72 |ULTIMATE.start_main_~x~0#1|) .cse11 .cse98 .cse47 (= 6 .cse93) (= .cse31 .cse32) .cse99 (= .cse40 .cse44) (= .cse70 |ULTIMATE.start_main_~n~0#1|) .cse28 (= .cse71 |ULTIMATE.start_main_~y~0#1|) (= (+ .cse36 (* (- 1) .cse100)) 1) (= .cse100 6) (= 0 (+ (- 1) .cse31))))) (and .cse52 .cse1 .cse2 (= .cse88 .cse56) .cse4 .cse9 (= .cse54 (+ .cse55 .cse50)) .cse10 .cse11 (= .cse51 .cse44) .cse57 (= .cse81 |ULTIMATE.start_main_~n~0#1|) .cse28))))))))))) [2023-02-17 01:29:55,407 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 01:29:55,407 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 01:29:55,407 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-02-17 01:29:55,407 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse3 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse2 (let ((.cse12 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse12 (let ((.cse14 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse13 (<= (+ .cse14 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse12) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse13) (or (not .cse13) (not (<= (+ .cse14 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse4)) .cse3)))))) (.cse1 (- (* |ULTIMATE.start_main_~y~0#1| 12)))) (let ((.cse0 (let ((.cse6 (= (+ (- 6) (+ (+ .cse1 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse7 (= (+ (let ((.cse11 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse11 (* .cse11 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse8 (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (let ((.cse10 (+ |ULTIMATE.start_main_~n~0#1| 1))) (* .cse10 (* .cse10 .cse10))))) (.cse9 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))))) (or (let ((.cse5 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse5) (= |ULTIMATE.start_main_~n~0#1| .cse5) .cse6 .cse2 .cse7 .cse8 .cse9)) (and .cse6 .cse2 .cse7 .cse8 .cse9))))) (or (and .cse0 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse1 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (and .cse2 (= |ULTIMATE.start_main_~y~0#1| 1) .cse3 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (and .cse0 (= |ULTIMATE.start_main_~y~0#1| (+ .cse4 1)) (= .cse4 6)))))) [2023-02-17 01:29:55,409 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse120 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse82 (* 6 |ULTIMATE.start_main_~n~0#1|)) (.cse81 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse119 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse123 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse28 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse122 (= (+ (+ (- (* .cse81 .cse123)) (* .cse123 .cse119)) (* .cse123 12)) 0)) (.cse8 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse17 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse82))) (.cse6 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse37 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse125 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse121 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse9 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse10 (<= |ULTIMATE.start_main_~a~0#1| 10)) (.cse110 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse112 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse103 (+ .cse120 1)) (.cse95 (* .cse120 6)) (.cse79 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse98 (+ .cse81 6)) (.cse99 (+ .cse81 .cse79)) (.cse96 (+ .cse123 .cse79)) (.cse49 (+ 6 .cse95)) (.cse66 (* 6 .cse103)) (.cse118 (= (+ .cse110 (+ (* |ULTIMATE.start_main_~x~0#1| .cse119) .cse112)) 0)) (.cse1 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse10) (not .cse9))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse9 .cse10))) (.cse2 (= (+ (- 6) (+ (+ .cse125 (+ .cse121 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse3 (or .cse17 (let ((.cse128 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse127 (<= (+ .cse128 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse17) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse127) (or (not .cse127) (not (<= (+ .cse128 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse6)) .cse37))))) (.cse4 (= (+ (let ((.cse126 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse126 (* .cse126 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse5 (or .cse28 .cse122 (< .cse120 .cse8))) (.cse7 (= .cse123 (* .cse120 (* .cse120 .cse120)))) (.cse11 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))))) (let ((.cse29 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse25 (let ((.cse124 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse125 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse124) (and .cse118 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse124)))) (.cse67 (+ 6 .cse66)) (.cse50 (+ .cse49 .cse79)) (.cse38 (not (= .cse49 .cse81))) (.cse114 (+ (- 1) (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (.cse24 (+ (* (- 1) .cse6) |ULTIMATE.start_main_~y~0#1|)) (.cse77 (* 3 .cse96)) (.cse78 (- (* 18 .cse96))) (.cse90 (+ .cse98 .cse99)) (.cse83 (+ .cse98 6)) (.cse91 (+ .cse99 .cse96)) (.cse52 (* 3 .cse123)) (.cse51 (* (* 2 .cse79) .cse79)) (.cse53 (- (* .cse123 18))) (.cse54 (- (* .cse79 10)))) (let ((.cse13 (or (not .cse122) .cse28 (= (+ (+ (+ (+ (+ (- (* .cse81 .cse52)) .cse51) .cse53) .cse54) (* .cse81 3)) (- 10)) 0))) (.cse15 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse121 (+ (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse18 (or (= (+ (+ (+ (- (* .cse90 10)) (+ (- (* .cse91 18)) (+ (- (* .cse83 (* .cse91 3))) (* .cse90 (* .cse90 2))))) (* .cse83 3)) (- 10)) 0) (not (<= .cse103 |ULTIMATE.start_main_~a~0#1|)) (not (= (+ (* .cse91 12) (+ (- (* .cse83 .cse91)) (* .cse91 .cse119))) 0)))) (.cse23 (or (= (+ (- 10) (+ (* .cse98 3) (+ (+ (+ (- (* .cse98 .cse77)) (* (* 2 .cse99) .cse99)) .cse78) (- (* .cse99 10))))) 0) (not (= (+ (+ (- (* .cse98 .cse96)) (* .cse119 .cse96)) (* 12 .cse96)) 0)) (not (<= .cse120 |ULTIMATE.start_main_~a~0#1|)))) (.cse14 (= (+ (+ (- (* .cse6 6)) (+ (* .cse6 .cse6) (- (* .cse24 12)))) 12) 0)) (.cse16 (<= (+ (- 1) .cse114) |ULTIMATE.start_main_~a~0#1|)) (.cse19 (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)) (.cse12 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse20 (let ((.cse116 (or .cse38 (= (+ (+ (+ (- (* .cse79 12)) (+ .cse53 (* .cse49 .cse79))) (* .cse49 2)) (- 6)) 0))) (.cse117 (or (= 0 (+ (- 6) (+ (* 2 .cse67) (+ (+ (* .cse50 .cse67) .cse78) (- (* .cse50 12)))))) .cse38))) (or (let ((.cse115 (+ (- 11) 19))) (and .cse25 .cse1 .cse2 (= (+ (+ (+ 19 (* (- 1) .cse115) 1) 6) 6) |ULTIMATE.start_main_~z~0#1|) .cse116 .cse28 (= |ULTIMATE.start_main_~x~0#1| (+ 19 .cse115)) .cse9 .cse10 (= (+ 2 1) |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse117)) (and .cse118 .cse25 .cse1 .cse2 .cse116 .cse9 .cse10 .cse117)))) (.cse21 (not (<= .cse114 |ULTIMATE.start_main_~a~0#1|))) (.cse22 (<= .cse29 |ULTIMATE.start_main_~a~0#1|))) (or (let ((.cse0 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse0) .cse1 (= |ULTIMATE.start_main_~n~0#1| .cse0) .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse6 1)) .cse7 (<= .cse8 1) .cse9 (<= |ULTIMATE.start_main_~n~0#1| .cse0) .cse10 .cse11 .cse12 (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6)) (= .cse6 6))) (and .cse13 .cse14 .cse1 .cse15 .cse16 .cse17 .cse18 .cse9 .cse10 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse27 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse26 (+ 6 6))) (and (= .cse24 (+ 6 1)) .cse25 .cse1 (= |ULTIMATE.start_main_~x~0#1| (+ .cse24 1)) (= .cse26 .cse27) .cse28 (= (+ 6 .cse27) |ULTIMATE.start_main_~z~0#1|) .cse9 .cse10 (= .cse26 .cse6) .cse22 (= 0 (+ (- 1) .cse29)))) (let ((.cse30 (+ (- 169) |ULTIMATE.start_main_~y~0#1|))) (and .cse13 (= (+ 6 .cse30) |ULTIMATE.start_main_~z~0#1|) .cse14 .cse1 (= (+ 42 6) .cse30) .cse16 .cse17 .cse18 .cse9 .cse10 .cse19 .cse20 .cse21 (let ((.cse34 (+ (* 30 4) (- 59)))) (= (let ((.cse33 (+ 30 (- 6)))) (+ (let ((.cse32 (+ .cse33 (- 6)))) (let ((.cse31 (+ (- 17) (* 2 .cse32)))) (+ (+ (* 2 .cse31) (* (- 3) .cse32) 24) .cse31))) (+ .cse34 (* (- 1) .cse33)))) (+ (* (- 1) .cse34) (let ((.cse35 (+ 42 85))) (let ((.cse36 (* (- 1) .cse35))) (+ (+ (+ (* (+ 42 .cse35) (- 1)) |ULTIMATE.start_main_~x~0#1|) .cse36) 42 (- 6) .cse36)))))) .cse22 (= |ULTIMATE.start_main_~n~0#1| (+ 7 1)) .cse23)) (and .cse3 (= |ULTIMATE.start_main_~y~0#1| 1) .cse37 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse102 (+ .cse103 1))) (let ((.cse100 (+ .cse102 1))) (let ((.cse101 (+ .cse100 1))) (let ((.cse97 (+ .cse101 1))) (let ((.cse61 (* 6 .cse102)) (.cse74 (* .cse101 6)) (.cse93 (* 6 .cse97)) (.cse46 (* 6 .cse100)) (.cse62 (+ .cse67 .cse99))) (let ((.cse55 (not (= .cse98 .cse67))) (.cse59 (+ .cse91 .cse62)) (.cse47 (+ 6 .cse46)) (.cse41 (+ .cse93 6)) (.cse58 (+ 6 .cse74)) (.cse75 (+ .cse97 1)) (.cse44 (+ .cse50 .cse96)) (.cse48 (+ .cse61 6))) (and .cse13 (or .cse38 (= (+ (+ (let ((.cse45 (+ (+ .cse49 6) .cse50))) (let ((.cse43 (+ .cse48 .cse45))) (let ((.cse42 (+ .cse43 .cse47))) (let ((.cse39 (+ (+ .cse46 12) .cse42))) (+ (- (* 10 .cse39)) (let ((.cse40 (+ .cse42 (+ .cse43 (+ .cse44 .cse45))))) (+ (+ (* (* 2 .cse39) .cse39) (- (* (* .cse40 3) .cse41))) (- (* .cse40 18))))))))) (* 3 .cse41)) (- 10)) 0)) .cse14 .cse1 (or (= (+ (- 10) (+ (+ (+ (+ .cse51 (- (* .cse49 .cse52))) .cse53) .cse54) (* .cse49 3))) 0) .cse38) (or .cse55 (= (+ (+ (let ((.cse60 (+ .cse48 .cse62))) (let ((.cse57 (+ (+ .cse61 12) .cse60))) (+ (let ((.cse56 (+ .cse59 .cse60))) (+ (- (* .cse56 18)) (+ (* .cse57 (* 2 .cse57)) (- (* .cse58 (* 3 .cse56)))))) (- (* .cse57 10))))) (* 3 .cse58)) (- 10)) 0)) .cse15 .cse16 (or (= (+ (+ (let ((.cse65 (+ .cse50 .cse67))) (let ((.cse63 (+ .cse65 (+ 12 .cse66)))) (+ (- (* .cse63 10)) (let ((.cse64 (+ .cse65 .cse44))) (+ (- (* .cse64 18)) (+ (* (* 2 .cse63) .cse63) (- (* .cse47 (* .cse64 3))))))))) (* 3 .cse47)) (- 10)) 0) .cse38) (or .cse55 (= (+ (- 10) (let ((.cse68 (+ (* 6 .cse75) 6))) (+ (* 3 .cse68) (let ((.cse73 (+ .cse62 (+ 6 .cse67)))) (let ((.cse72 (+ .cse47 .cse73))) (let ((.cse71 (+ .cse72 .cse58))) (let ((.cse69 (+ .cse71 (+ .cse74 12)))) (+ (- (* .cse69 10)) (let ((.cse70 (+ .cse71 (+ .cse72 (+ .cse59 .cse73))))) (+ (- (* .cse70 18)) (+ (- (* .cse68 (* 3 .cse70))) (* .cse69 (* .cse69 2))))))))))))) 0)) .cse17 .cse18 .cse9 .cse10 (let ((.cse80 (+ 12 .cse82))) (or (= (+ (+ (let ((.cse76 (+ .cse79 .cse80))) (+ (- (* 10 .cse76)) (+ (+ (- (* .cse77 .cse67)) (* (* 2 .cse76) .cse76)) .cse78))) (* 3 .cse67)) (- 10)) 0) (not (= .cse81 .cse80)))) .cse19 .cse20 (or (not (= .cse48 .cse83)) (= (+ (let ((.cse86 (+ 6 (* 6 (+ .cse75 1))))) (+ (let ((.cse89 (+ .cse90 .cse48))) (let ((.cse88 (+ .cse89 (+ .cse48 6)))) (let ((.cse92 (+ .cse88 .cse58))) (let ((.cse87 (+ .cse41 .cse92))) (let ((.cse84 (+ .cse87 (+ .cse93 12)))) (+ (- (* .cse84 10)) (let ((.cse85 (+ .cse87 (+ (+ .cse88 (+ .cse89 (+ .cse90 .cse91))) .cse92)))) (+ (- (* .cse85 18)) (+ (* (* 2 .cse84) .cse84) (- (* (* .cse85 3) .cse86))))))))))) (* 3 .cse86))) (- 10)) 0)) .cse21 .cse22 .cse23 (or (= (+ (- 10) (+ (let ((.cse94 (+ .cse50 (+ 12 .cse95)))) (+ (- (* 10 .cse94)) (+ (+ (* (* 2 .cse94) .cse94) (- (* (* 3 .cse44) .cse48))) (- (* .cse44 18))))) (* .cse48 3))) 0) .cse38)))))))) (let ((.cse106 (+ (- 5) 12))) (let ((.cse105 (+ .cse106 12)) (.cse104 (+ 1 1))) (and .cse14 .cse1 (= .cse6 (+ 6 12)) (<= .cse104 |ULTIMATE.start_main_~a~0#1|) .cse16 .cse17 (= |ULTIMATE.start_main_~y~0#1| (+ .cse105 .cse6)) .cse9 .cse10 .cse19 (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse105)) (+ (+ (+ .cse106 (* (- 1) (+ (- 1) .cse106))) 0) .cse106)) (let ((.cse107 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse107 .cse12) (let ((.cse108 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (and (< .cse108 65536) (<= 0 .cse108) (not .cse107))))) .cse20 (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse111 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (let ((.cse109 (+ 65536 .cse111))) (and (<= 0 .cse109) (= (+ .cse110 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse111)) .cse112)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= .cse104 .cse111) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (< .cse109 65536))))) (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse113 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (and (< .cse113 65536) (= (+ .cse110 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse113)) .cse112)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= .cse104 .cse113) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse113) (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767))))) .cse21 .cse22))))))))) [2023-02-17 01:29:55,409 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-02-17 01:29:55,410 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse144 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse50 (* 6 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse41 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse50))) (.cse108 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse84 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse110 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse73 (+ .cse144 1)) (.cse65 (* .cse144 6)) (.cse156 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse47 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse104 (+ 1 1)) (.cse66 (+ .cse156 .cse47)) (.cse83 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse49 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse11 (+ 6 .cse65)) (.cse31 (* 6 .cse73)) (.cse122 (= (+ .cse108 (+ (* |ULTIMATE.start_main_~x~0#1| .cse84) .cse110)) 0)) (.cse123 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse159 (not .cse41)) (.cse88 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse158 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse157 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse85 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse42 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse43 (<= |ULTIMATE.start_main_~a~0#1| 10)) (.cse102 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse131 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse132 (* (- 1) |ULTIMATE.start_main_~x~0#1|))) (let ((.cse76 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse141 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse90 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse127 (+ 0 1)) (.cse133 (+ .cse131 |ULTIMATE.start_main_~y~0#1| .cse132)) (.cse112 (+ (* (- 1) .cse102) |ULTIMATE.start_main_~y~0#1|)) (.cse14 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse43) (not .cse42))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse42 .cse43))) (.cse114 (= (+ (- 6) (+ (+ .cse158 (+ .cse157 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse85)) 0)) (.cse86 (or .cse41 (let ((.cse162 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse161 (<= (+ .cse162 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse159 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse161) (or (not .cse161) (not (<= (+ .cse162 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse102)) .cse88))))) (.cse115 (= (+ (let ((.cse160 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse160 (* .cse160 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse116 (or .cse159 .cse122 .cse123)) (.cse124 (= .cse156 (* .cse144 (* .cse144 .cse144)))) (.cse126 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse128 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse158 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse32 (+ 6 .cse31)) (.cse12 (+ .cse11 .cse47)) (.cse0 (not (= .cse11 .cse49))) (.cse27 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse157 (+ (* .cse83 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse150 (+ (* 30 4) (- 59))) (.cse143 (= (+ (+ (- (* .cse49 .cse156)) (* .cse156 .cse84)) (* .cse156 12)) 0)) (.cse142 (not .cse123)) (.cse16 (* 3 .cse156)) (.cse15 (* (* 2 .cse47) .cse47)) (.cse17 (- (* .cse156 18))) (.cse18 (- (* .cse47 10))) (.cse45 (* 3 .cse66)) (.cse46 (- (* 18 .cse66))) (.cse98 (+ .cse104 1)) (.cse68 (+ .cse49 6)) (.cse69 (+ .cse49 .cse47)) (.cse154 (+ 42 85)) (.cse155 (+ (- 5) 12))) (let ((.cse103 (+ 6 12)) (.cse106 (+ (+ (+ .cse155 (* (- 1) (+ (- 1) .cse155))) 0) .cse155)) (.cse105 (+ .cse155 12)) (.cse93 (+ 42 6)) (.cse92 (+ 42 .cse154)) (.cse94 (* (- 1) .cse154)) (.cse58 (+ .cse68 .cse69)) (.cse51 (+ .cse68 6)) (.cse59 (+ .cse69 .cse66)) (.cse77 (+ .cse98 1)) (.cse82 (or (= (+ (- 10) (+ (* .cse68 3) (+ (+ (+ (- (* .cse68 .cse45)) (* (* 2 .cse69) .cse69)) .cse46) (- (* .cse69 10))))) 0) (not (= (+ (+ (- (* .cse68 .cse66)) (* .cse84 .cse66)) (* 12 .cse66)) 0)) (not (<= .cse144 |ULTIMATE.start_main_~a~0#1|)))) (.cse75 (or (not .cse143) .cse142 (= (+ (+ (+ (+ (+ (- (* .cse49 .cse16)) .cse15) .cse17) .cse18) (* .cse49 3)) (- 10)) 0))) (.cse80 (+ 30 .cse150)) (.cse78 (let ((.cse153 (+ 30 (- 6)))) (+ (let ((.cse152 (+ .cse153 (- 6)))) (let ((.cse151 (+ (- 17) (* 2 .cse152)))) (+ (+ (* 2 .cse151) (* (- 3) .cse152) 24) .cse151))) (+ .cse150 (* (- 1) .cse153))))) (.cse79 (* (- 1) .cse150)) (.cse74 (+ 30 6)) (.cse81 (or .cse27 (not .cse122))) (.cse95 (+ 5 1)) (.cse63 (let ((.cse148 (or .cse0 (= (+ (+ (+ (- (* .cse47 12)) (+ .cse17 (* .cse11 .cse47))) (* .cse11 2)) (- 6)) 0))) (.cse149 (or (= 0 (+ (- 6) (+ (* 2 .cse32) (+ (+ (* .cse12 .cse32) .cse46) (- (* .cse12 12)))))) .cse0))) (or (let ((.cse147 (+ (- 11) 19))) (and .cse14 .cse114 .cse86 .cse115 (= (+ (+ (+ 19 (* (- 1) .cse147) 1) 6) 6) |ULTIMATE.start_main_~z~0#1|) .cse148 .cse124 (= |ULTIMATE.start_main_~x~0#1| (+ 19 .cse147)) .cse42 .cse43 .cse126 (= (+ 2 1) |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse128 .cse149)) (and .cse14 .cse114 .cse86 .cse115 .cse116 .cse148 .cse124 .cse42 .cse43 .cse126 .cse128 .cse149)))) (.cse13 (= (+ (+ (- (* .cse102 6)) (+ (* .cse102 .cse102) (- (* .cse112 12)))) 12) 0)) (.cse113 (+ 6 1)) (.cse129 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse133))) (.cse117 (+ 6 6)) (.cse87 (<= |ULTIMATE.start_main_~n~0#1| .cse127)) (.cse89 (let ((.cse145 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse145 .cse90) (let ((.cse146 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (and (< .cse146 65536) (<= 0 .cse146) (not .cse145)))))) (.cse91 (= |ULTIMATE.start_main_~z~0#1| (+ .cse141 6))) (.cse62 (<= .cse76 |ULTIMATE.start_main_~a~0#1|))) (or (let ((.cse72 (+ .cse73 1))) (let ((.cse70 (+ .cse72 1))) (let ((.cse71 (+ .cse70 1))) (let ((.cse67 (+ .cse71 1))) (let ((.cse25 (* 6 .cse72)) (.cse39 (* .cse71 6)) (.cse61 (* 6 .cse67)) (.cse8 (* 6 .cse70)) (.cse26 (+ .cse32 .cse69))) (let ((.cse19 (not (= .cse68 .cse32))) (.cse23 (+ .cse59 .cse26)) (.cse9 (+ 6 .cse8)) (.cse3 (+ .cse61 6)) (.cse22 (+ 6 .cse39)) (.cse40 (+ .cse67 1)) (.cse6 (+ .cse12 .cse66)) (.cse10 (+ .cse25 6))) (and (or .cse0 (= (+ (+ (let ((.cse7 (+ (+ .cse11 6) .cse12))) (let ((.cse5 (+ .cse10 .cse7))) (let ((.cse4 (+ .cse5 .cse9))) (let ((.cse1 (+ (+ .cse8 12) .cse4))) (+ (- (* 10 .cse1)) (let ((.cse2 (+ .cse4 (+ .cse5 (+ .cse6 .cse7))))) (+ (+ (* (* 2 .cse1) .cse1) (- (* (* .cse2 3) .cse3))) (- (* .cse2 18))))))))) (* 3 .cse3)) (- 10)) 0)) .cse13 .cse14 (or (= (+ (- 10) (+ (+ (+ (+ .cse15 (- (* .cse11 .cse16))) .cse17) .cse18) (* .cse11 3))) 0) .cse0) (or .cse19 (= (+ (+ (let ((.cse24 (+ .cse10 .cse26))) (let ((.cse21 (+ (+ .cse25 12) .cse24))) (+ (let ((.cse20 (+ .cse23 .cse24))) (+ (- (* .cse20 18)) (+ (* .cse21 (* 2 .cse21)) (- (* .cse22 (* 3 .cse20)))))) (- (* .cse21 10))))) (* 3 .cse22)) (- 10)) 0)) .cse27 (or (= (+ (+ (let ((.cse30 (+ .cse12 .cse32))) (let ((.cse28 (+ .cse30 (+ 12 .cse31)))) (+ (- (* .cse28 10)) (let ((.cse29 (+ .cse30 .cse6))) (+ (- (* .cse29 18)) (+ (* (* 2 .cse28) .cse28) (- (* .cse9 (* .cse29 3))))))))) (* 3 .cse9)) (- 10)) 0) .cse0) (or .cse19 (= (+ (- 10) (let ((.cse33 (+ (* 6 .cse40) 6))) (+ (* 3 .cse33) (let ((.cse38 (+ .cse26 (+ 6 .cse32)))) (let ((.cse37 (+ .cse9 .cse38))) (let ((.cse36 (+ .cse37 .cse22))) (let ((.cse34 (+ .cse36 (+ .cse39 12)))) (+ (- (* .cse34 10)) (let ((.cse35 (+ .cse36 (+ .cse37 (+ .cse23 .cse38))))) (+ (- (* .cse35 18)) (+ (- (* .cse33 (* 3 .cse35))) (* .cse34 (* .cse34 2))))))))))))) 0)) .cse41 .cse42 .cse43 (let ((.cse48 (+ 12 .cse50))) (or (= (+ (+ (let ((.cse44 (+ .cse47 .cse48))) (+ (- (* 10 .cse44)) (+ (+ (- (* .cse45 .cse32)) (* (* 2 .cse44) .cse44)) .cse46))) (* 3 .cse32)) (- 10)) 0) (not (= .cse49 .cse48)))) (or (not (= .cse10 .cse51)) (= (+ (let ((.cse54 (+ 6 (* 6 (+ .cse40 1))))) (+ (let ((.cse57 (+ .cse58 .cse10))) (let ((.cse56 (+ .cse57 (+ .cse10 6)))) (let ((.cse60 (+ .cse56 .cse22))) (let ((.cse55 (+ .cse3 .cse60))) (let ((.cse52 (+ .cse55 (+ .cse61 12)))) (+ (- (* .cse52 10)) (let ((.cse53 (+ .cse55 (+ (+ .cse56 (+ .cse57 (+ .cse58 .cse59))) .cse60)))) (+ (- (* .cse53 18)) (+ (* (* 2 .cse52) .cse52) (- (* (* .cse53 3) .cse54))))))))))) (* 3 .cse54))) (- 10)) 0)) .cse62 .cse63 (or (= (+ (- 10) (+ (let ((.cse64 (+ .cse12 (+ 12 .cse65)))) (+ (- (* 10 .cse64)) (+ (+ (* (* 2 .cse64) .cse64) (- (* (* 3 .cse6) .cse10))) (- (* .cse6 18))))) (* .cse10 3))) 0) .cse0)))))))) (and (= .cse74 |ULTIMATE.start_main_~z~0#1|) .cse75 .cse13 .cse14 (= .cse76 .cse77) .cse41 (= .cse78 (+ .cse79 |ULTIMATE.start_main_~x~0#1|)) .cse42 .cse43 (= .cse80 |ULTIMATE.start_main_~y~0#1|) .cse81 .cse62 .cse63 .cse82) (and (= (+ (+ (+ (- .cse83) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse84))) .cse85) (- 10)) 0) .cse13 .cse14 .cse86 .cse41 (= |ULTIMATE.start_main_~y~0#1| 1) .cse42 .cse87 .cse43 .cse88 .cse89 .cse90 .cse91 (= |ULTIMATE.start_main_~x~0#1| 0) .cse62 (= 6 |ULTIMATE.start_main_~z~0#1|)) (and .cse13 .cse14 (= .cse92 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| .cse93) (= .cse78 (+ .cse79 (+ 42 (- 6) .cse94 (+ |ULTIMATE.start_main_~x~0#1| .cse94)))) .cse41 .cse42 .cse43 .cse81 (= .cse95 .cse76) .cse62 .cse63) (let ((.cse96 (+ (* .cse102 2) (- 17)))) (let ((.cse97 (+ (* .cse102 (- 3)) (* .cse96 2) 24))) (and .cse13 (= (+ .cse96 .cse97) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~n~0#1| .cse98) .cse14 (= (let ((.cse100 (+ (* (- 1) .cse96) .cse102 (- 6) .cse97))) (let ((.cse101 (+ .cse96 .cse100 (* (- 1) .cse97)))) (let ((.cse99 (+ .cse96 (* (- 1) .cse101)))) (+ (+ (* (- 1) .cse99) (- 6) .cse100 .cse101) .cse99 (* (- 1) .cse100))))) 6) (= .cse102 .cse103) (<= .cse104 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ .cse96 .cse102)) .cse41 (= |ULTIMATE.start_main_~y~0#1| (+ .cse105 .cse102)) .cse42 .cse43 (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse105)) .cse106) .cse89 (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse109 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (let ((.cse107 (+ 65536 .cse109))) (and (<= 0 .cse107) (= (+ .cse108 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse109)) .cse110)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= .cse104 .cse109) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (< .cse107 65536))))) (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse111 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (and (< .cse111 65536) (= (+ .cse108 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse111)) .cse110)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= .cse104 .cse111) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse111) (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767))))) .cse62 .cse63))) (let ((.cse121 (+ .cse131 (- 6) .cse133 (* .cse129 (- 1)))) (.cse125 (+ |ULTIMATE.start_main_~y~0#1| .cse132 1))) (let ((.cse118 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse120 (+ .cse125 (- 6))) (.cse130 (+ .cse129 .cse121 (* (- 1) .cse131)))) (and (= .cse112 .cse113) .cse13 .cse14 .cse114 .cse86 .cse115 (= |ULTIMATE.start_main_~x~0#1| (+ .cse112 1)) .cse116 (= .cse117 .cse118) (let ((.cse119 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse119)) .cse120) .cse119)) (= .cse121 0) .cse41 (= |ULTIMATE.start_main_~z~0#1| .cse103) (or .cse122 .cse123) .cse124 (= (+ .cse125 6) |ULTIMATE.start_main_~z~0#1|) (= (+ 6 .cse118) |ULTIMATE.start_main_~z~0#1|) .cse42 (= .cse106 |ULTIMATE.start_main_~x~0#1|) .cse43 .cse126 .cse89 (= 6 .cse120) (= .cse76 .cse127) .cse128 (= .cse117 .cse102) (= .cse104 |ULTIMATE.start_main_~n~0#1|) .cse62 (= .cse105 |ULTIMATE.start_main_~y~0#1|) (= (+ .cse129 (* (- 1) .cse130)) 1) (= .cse130 6) (= 0 (+ (- 1) .cse76))))) (let ((.cse134 (+ (- 169) |ULTIMATE.start_main_~y~0#1|))) (and (= (+ 6 .cse134) |ULTIMATE.start_main_~z~0#1|) .cse13 .cse14 (= .cse93 .cse134) .cse41 .cse42 .cse43 (= .cse78 (+ .cse79 (+ (+ (+ (* .cse92 (- 1)) |ULTIMATE.start_main_~x~0#1|) .cse94) 42 (- 6) .cse94))) .cse62 (= |ULTIMATE.start_main_~n~0#1| (+ 7 1)) .cse63)) (let ((.cse140 (+ .cse102 (- 6)))) (let ((.cse138 (+ (- 17) (* .cse140 2)))) (let ((.cse139 (+ (* .cse138 2) 24 (* .cse140 (- 3))))) (and .cse75 (= 6 (let ((.cse136 (+ (* (- 1) .cse138) .cse140 .cse139 (- 6)))) (let ((.cse137 (+ .cse138 (* (- 1) .cse139) .cse136))) (let ((.cse135 (+ .cse138 (* (- 1) .cse137)))) (+ (+ (* (- 1) .cse135) .cse136 (- 6) .cse137) (* (- 1) .cse136) .cse135))))) .cse13 .cse14 .cse27 .cse41 (= .cse112 (+ .cse138 .cse140)) (or (= (+ (+ (+ (- (* .cse58 10)) (+ (- (* .cse59 18)) (+ (- (* .cse51 (* .cse59 3))) (* .cse58 (* .cse58 2))))) (* .cse51 3)) (- 10)) 0) (not (<= .cse73 |ULTIMATE.start_main_~a~0#1|)) (not (= (+ (* .cse59 12) (+ (- (* .cse51 .cse59)) (* .cse59 .cse84))) 0))) .cse42 .cse43 .cse89 (= |ULTIMATE.start_main_~n~0#1| .cse77) .cse62 .cse63 .cse82 (= |ULTIMATE.start_main_~x~0#1| (+ .cse112 (+ .cse138 .cse139))))))) (and .cse75 .cse13 .cse14 (= .cse112 .cse80) .cse41 (= .cse78 (+ .cse79 .cse131)) .cse42 .cse43 (= .cse74 .cse102) .cse81 (= .cse95 |ULTIMATE.start_main_~n~0#1|) .cse62 .cse63) (and (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) .cse13 (= .cse141 6) (= .cse76 0) (= |ULTIMATE.start_main_~x~0#1| .cse127) .cse14 (= |ULTIMATE.start_main_~n~0#1| .cse127) (= |ULTIMATE.start_main_~y~0#1| .cse113) .cse114 .cse86 (= .cse129 1) .cse115 .cse116 (= 6 .cse133) (= .cse117 |ULTIMATE.start_main_~z~0#1|) (or .cse142 .cse143 (< .cse144 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) .cse41 (= |ULTIMATE.start_main_~y~0#1| (+ .cse102 1)) .cse124 .cse42 .cse87 .cse43 .cse126 (= |ULTIMATE.start_main_~y~0#1| (+ .cse102 |ULTIMATE.start_main_~x~0#1|)) .cse89 (= (+ (* (- 1) 6) |ULTIMATE.start_main_~y~0#1|) 1) .cse90 .cse91 (= .cse102 6) (= .cse131 0) .cse62 (= (+ (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse141)) 0) |ULTIMATE.start_main_~x~0#1|)))))))) [2023-02-17 01:29:55,412 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse43 (+ |ULTIMATE.start_main_~n~0#1| 1))) (let ((.cse101 (+ .cse43 1))) (let ((.cse169 (+ .cse101 1))) (let ((.cse168 (+ .cse169 1))) (let ((.cse167 (+ .cse168 1)) (.cse130 (* .cse43 6)) (.cse159 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse116 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse109 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse148 (* 6 .cse101)) (.cse133 (* 6 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse8 (= |ULTIMATE.start_main_~z~0#1| (+ 6 .cse133))) (.cse78 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse60 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse80 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse105 (+ 6 .cse148)) (.cse122 (+ .cse116 .cse109)) (.cse123 (+ .cse159 .cse109)) (.cse111 (+ 6 .cse130)) (.cse160 (+ .cse167 1))) (let ((.cse23 (* 6 .cse160)) (.cse152 (* 6 .cse169)) (.cse158 (* 6 .cse168)) (.cse106 (+ .cse111 .cse109)) (.cse142 (* .cse167 6)) (.cse21 (+ .cse122 .cse123)) (.cse144 (+ .cse105 .cse122)) (.cse120 (+ .cse116 6)) (.cse50 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse93 (* (- 1) |ULTIMATE.start_main_~x~0#1|)) (.cse74 (+ 1 1)) (.cse59 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse87 (= (+ .cse78 (+ (* |ULTIMATE.start_main_~x~0#1| .cse60) .cse80)) 0)) (.cse88 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse163 (not .cse8)) (.cse44 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse62 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse162 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse161 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse61 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse9 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse10 (<= |ULTIMATE.start_main_~a~0#1| 10))) (let ((.cse2 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (not .cse10) (not .cse9))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse9 .cse10))) (.cse34 (= (+ (- 6) (+ (+ .cse162 (+ .cse161 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse61)) 0)) (.cse35 (or .cse8 (let ((.cse166 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse165 (<= (+ .cse166 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse163 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse165) (or (not .cse165) (not (<= (+ .cse166 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse44)) .cse62))))) (.cse37 (= (+ (let ((.cse164 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse164 (* .cse164 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse38 (or .cse163 .cse87 .cse88)) (.cse45 (= .cse159 (* .cse43 (* .cse43 .cse43)))) (.cse90 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse91 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse162 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (.cse31 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse5 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse161 (+ (* .cse59 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse112 (+ (* 30 4) (- 59))) (.cse82 (+ (* (- 1) .cse44) |ULTIMATE.start_main_~y~0#1|)) (.cse42 (= (+ (+ (- (* .cse116 .cse159)) (* .cse159 .cse60)) (* .cse159 12)) 0)) (.cse41 (not .cse88)) (.cse69 (+ .cse74 1)) (.cse48 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse126 (+ 42 85)) (.cse39 (+ .cse50 |ULTIMATE.start_main_~y~0#1| .cse93)) (.cse127 (+ (- 5) 12)) (.cse121 (* 3 .cse123)) (.cse107 (- (* 18 .cse123))) (.cse26 (+ .cse160 1)) (.cse134 (not (= .cse120 .cse105))) (.cse140 (+ .cse21 .cse144)) (.cse25 (+ 6 .cse142)) (.cse118 (* (* 2 .cse109) .cse109)) (.cse117 (* 3 .cse159)) (.cse110 (- (* .cse159 18))) (.cse119 (- (* .cse109 10))) (.cse108 (not (= .cse111 .cse116))) (.cse129 (+ .cse106 .cse123)) (.cse143 (+ 6 .cse158)) (.cse12 (+ .cse152 6)) (.cse24 (+ .cse23 6)) (.cse30 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse32 (+ 0 1))) (let ((.cse46 (<= |ULTIMATE.start_main_~n~0#1| .cse32)) (.cse49 (= |ULTIMATE.start_main_~z~0#1| (+ .cse30 6))) (.cse0 (or .cse108 (= (+ (+ (let ((.cse157 (+ (+ .cse111 6) .cse106))) (let ((.cse156 (+ .cse12 .cse157))) (let ((.cse155 (+ .cse156 .cse143))) (let ((.cse153 (+ (+ .cse158 12) .cse155))) (+ (- (* 10 .cse153)) (let ((.cse154 (+ .cse155 (+ .cse156 (+ .cse129 .cse157))))) (+ (+ (* (* 2 .cse153) .cse153) (- (* (* .cse154 3) .cse24))) (- (* .cse154 18))))))))) (* 3 .cse24)) (- 10)) 0))) (.cse3 (or (= (+ (- 10) (+ (+ (+ (+ .cse118 (- (* .cse111 .cse117))) .cse110) .cse119) (* .cse111 3))) 0) .cse108)) (.cse4 (or .cse134 (= (+ (+ (let ((.cse151 (+ .cse12 .cse144))) (let ((.cse150 (+ (+ .cse152 12) .cse151))) (+ (let ((.cse149 (+ .cse140 .cse151))) (+ (- (* .cse149 18)) (+ (* .cse150 (* 2 .cse150)) (- (* .cse25 (* 3 .cse149)))))) (- (* .cse150 10))))) (* 3 .cse25)) (- 10)) 0))) (.cse6 (or (= (+ (+ (let ((.cse147 (+ .cse106 .cse105))) (let ((.cse145 (+ .cse147 (+ 12 .cse148)))) (+ (- (* .cse145 10)) (let ((.cse146 (+ .cse147 .cse129))) (+ (- (* .cse146 18)) (+ (* (* 2 .cse145) .cse145) (- (* .cse143 (* .cse146 3))))))))) (* 3 .cse143)) (- 10)) 0) .cse108)) (.cse7 (or .cse134 (= (+ (- 10) (let ((.cse135 (+ (* 6 .cse26) 6))) (+ (* 3 .cse135) (let ((.cse141 (+ .cse144 (+ 6 .cse105)))) (let ((.cse139 (+ .cse143 .cse141))) (let ((.cse138 (+ .cse139 .cse25))) (let ((.cse136 (+ .cse138 (+ .cse142 12)))) (+ (- (* .cse136 10)) (let ((.cse137 (+ .cse138 (+ .cse139 (+ .cse140 .cse141))))) (+ (- (* .cse137 18)) (+ (- (* .cse135 (* 3 .cse137))) (* .cse136 (* .cse136 2))))))))))))) 0))) (.cse11 (let ((.cse132 (+ 12 .cse133))) (or (= (+ (+ (let ((.cse131 (+ .cse109 .cse132))) (+ (- (* 10 .cse131)) (+ (+ (- (* .cse121 .cse105)) (* (* 2 .cse131) .cse131)) .cse107))) (* 3 .cse105)) (- 10)) 0) (not (= .cse116 .cse132))))) (.cse29 (or (= (+ (- 10) (+ (let ((.cse128 (+ .cse106 (+ 12 .cse130)))) (+ (- (* 10 .cse128)) (+ (+ (* (* 2 .cse128) .cse128) (- (* (* 3 .cse129) .cse12))) (- (* .cse129 18))))) (* .cse12 3))) 0) .cse108)) (.cse33 (+ 6 1)) (.cse73 (+ 6 12)) (.cse76 (+ (+ (+ .cse127 (* (- 1) (+ (- 1) .cse127))) 0) .cse127)) (.cse40 (+ 6 6)) (.cse75 (+ .cse127 12)) (.cse36 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse39))) (.cse64 (+ 42 6)) (.cse63 (+ 42 .cse126)) (.cse65 (* (- 1) .cse126)) (.cse20 (+ .cse120 .cse122)) (.cse13 (+ .cse120 6)) (.cse47 (let ((.cse124 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse124 .cse48) (let ((.cse125 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (and (< .cse125 65536) (<= 0 .cse125) (not .cse124)))))) (.cse53 (+ .cse69 1)) (.cse58 (or (= (+ (- 10) (+ (* .cse120 3) (+ (+ (+ (- (* .cse120 .cse121)) (* (* 2 .cse122) .cse122)) .cse107) (- (* .cse122 10))))) 0) (not (= (+ (+ (- (* .cse120 .cse123)) (* .cse60 .cse123)) (* 12 .cse123)) 0)) (not (<= .cse43 |ULTIMATE.start_main_~a~0#1|)))) (.cse52 (or (not .cse42) .cse41 (= (+ (+ (+ (+ (+ (- (* .cse116 .cse117)) .cse118) .cse110) .cse119) (* .cse116 3)) (- 10)) 0))) (.cse1 (= (+ (+ (- (* .cse44 6)) (+ (* .cse44 .cse44) (- (* .cse82 12)))) 12) 0)) (.cse56 (+ 30 .cse112)) (.cse54 (let ((.cse115 (+ 30 (- 6)))) (+ (let ((.cse114 (+ .cse115 (- 6)))) (let ((.cse113 (+ (- 17) (* 2 .cse114)))) (+ (+ (* 2 .cse113) (* (- 3) .cse114) 24) .cse113))) (+ .cse112 (* (- 1) .cse115))))) (.cse55 (* (- 1) .cse112)) (.cse51 (+ 30 6)) (.cse57 (or .cse5 (not .cse87))) (.cse66 (+ 5 1)) (.cse27 (<= .cse31 |ULTIMATE.start_main_~a~0#1|)) (.cse28 (let ((.cse103 (or .cse108 (= (+ (+ (+ (- (* .cse109 12)) (+ .cse110 (* .cse111 .cse109))) (* .cse111 2)) (- 6)) 0))) (.cse104 (or (= 0 (+ (- 6) (+ (* 2 .cse105) (+ (+ (* .cse106 .cse105) .cse107) (- (* .cse106 12)))))) .cse108))) (or (let ((.cse102 (+ (- 11) 19))) (and .cse2 .cse34 .cse35 .cse37 (= (+ (+ (+ 19 (* (- 1) .cse102) 1) 6) 6) |ULTIMATE.start_main_~z~0#1|) .cse103 .cse45 (= |ULTIMATE.start_main_~x~0#1| (+ 19 .cse102)) .cse9 .cse10 .cse90 (= (+ 2 1) |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~a~0#1|) .cse91 .cse104)) (and .cse2 .cse34 .cse35 .cse37 .cse38 .cse103 .cse45 .cse9 .cse10 .cse90 .cse91 .cse104))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or (not (= .cse12 .cse13)) (= (+ (let ((.cse16 (+ 6 (* 6 (+ .cse26 1))))) (+ (let ((.cse19 (+ .cse20 .cse12))) (let ((.cse18 (+ .cse19 (+ .cse12 6)))) (let ((.cse22 (+ .cse18 .cse25))) (let ((.cse17 (+ .cse24 .cse22))) (let ((.cse14 (+ .cse17 (+ .cse23 12)))) (+ (- (* .cse14 10)) (let ((.cse15 (+ .cse17 (+ (+ .cse18 (+ .cse19 (+ .cse20 .cse21))) .cse22)))) (+ (- (* .cse15 18)) (+ (* (* 2 .cse14) .cse14) (- (* (* .cse15 3) .cse16))))))))))) (* 3 .cse16))) (- 10)) 0)) .cse27 .cse28 .cse29) (and (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) .cse1 (= .cse30 6) (= .cse31 0) (= |ULTIMATE.start_main_~x~0#1| .cse32) .cse2 (= |ULTIMATE.start_main_~n~0#1| .cse32) (= |ULTIMATE.start_main_~y~0#1| .cse33) .cse34 .cse35 (= .cse36 1) .cse37 .cse38 (= 6 .cse39) (= .cse40 |ULTIMATE.start_main_~z~0#1|) (or .cse41 .cse42 (< .cse43 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) .cse8 (= |ULTIMATE.start_main_~y~0#1| (+ .cse44 1)) .cse45 .cse9 .cse46 .cse10 (= |ULTIMATE.start_main_~y~0#1| (+ .cse44 |ULTIMATE.start_main_~x~0#1|)) .cse47 (= (+ (* (- 1) 6) |ULTIMATE.start_main_~y~0#1|) 1) .cse48 .cse49 (= .cse44 6) (= .cse50 0) .cse27 (= (+ (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) .cse30)) 0) |ULTIMATE.start_main_~x~0#1|)) (and (= .cse51 |ULTIMATE.start_main_~z~0#1|) .cse52 .cse1 .cse2 (= .cse31 .cse53) .cse8 (= .cse54 (+ .cse55 |ULTIMATE.start_main_~x~0#1|)) .cse9 .cse10 (= .cse56 |ULTIMATE.start_main_~y~0#1|) .cse57 .cse27 .cse28 .cse58) (and (= (+ (+ (+ (- .cse59) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse60))) .cse61) (- 10)) 0) .cse1 .cse2 .cse35 .cse8 (= |ULTIMATE.start_main_~y~0#1| 1) .cse9 .cse46 .cse10 .cse62 .cse47 .cse48 .cse49 (= |ULTIMATE.start_main_~x~0#1| 0) .cse27 (= 6 |ULTIMATE.start_main_~z~0#1|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse28 .cse29) (and .cse1 .cse2 (= .cse63 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| .cse64) (= .cse54 (+ .cse55 (+ 42 (- 6) .cse65 (+ |ULTIMATE.start_main_~x~0#1| .cse65)))) .cse8 .cse9 .cse10 .cse57 (= .cse66 .cse31) .cse27 .cse28) (let ((.cse67 (+ (* .cse44 2) (- 17)))) (let ((.cse68 (+ (* .cse44 (- 3)) (* .cse67 2) 24))) (and .cse1 (= (+ .cse67 .cse68) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~n~0#1| .cse69) .cse2 (= (let ((.cse71 (+ (* (- 1) .cse67) .cse44 (- 6) .cse68))) (let ((.cse72 (+ .cse67 .cse71 (* (- 1) .cse68)))) (let ((.cse70 (+ .cse67 (* (- 1) .cse72)))) (+ (+ (* (- 1) .cse70) (- 6) .cse71 .cse72) .cse70 (* (- 1) .cse71))))) 6) (= .cse44 .cse73) (<= .cse74 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ .cse67 .cse44)) .cse8 (= |ULTIMATE.start_main_~y~0#1| (+ .cse75 .cse44)) .cse9 .cse10 (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse75)) .cse76) .cse47 (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse79 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (let ((.cse77 (+ 65536 .cse79))) (and (<= 0 .cse77) (= (+ .cse78 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse79)) .cse80)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= .cse74 .cse79) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (< .cse77 65536))))) (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse81 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (and (< .cse81 65536) (= (+ .cse78 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse81)) .cse80)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= .cse74 .cse81) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse81) (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767))))) .cse27 .cse28))) (let ((.cse86 (+ .cse50 (- 6) .cse39 (* .cse36 (- 1)))) (.cse89 (+ |ULTIMATE.start_main_~y~0#1| .cse93 1))) (let ((.cse83 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse85 (+ .cse89 (- 6))) (.cse92 (+ .cse36 .cse86 (* (- 1) .cse50)))) (and (= .cse82 .cse33) .cse1 .cse2 .cse35 .cse37 (= |ULTIMATE.start_main_~x~0#1| (+ .cse82 1)) .cse38 (= .cse40 .cse83) (let ((.cse84 (+ (- 1) |ULTIMATE.start_main_~x~0#1|))) (= (+ (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) .cse84)) .cse85) .cse84)) (= .cse86 0) .cse8 (= |ULTIMATE.start_main_~z~0#1| .cse73) (or .cse87 .cse88) .cse45 (= (+ .cse89 6) |ULTIMATE.start_main_~z~0#1|) (= (+ 6 .cse83) |ULTIMATE.start_main_~z~0#1|) .cse9 (= .cse76 |ULTIMATE.start_main_~x~0#1|) .cse10 .cse90 .cse47 (= 6 .cse85) (= .cse31 .cse32) .cse91 (= .cse40 .cse44) (= .cse74 |ULTIMATE.start_main_~n~0#1|) .cse27 (= .cse75 |ULTIMATE.start_main_~y~0#1|) (= (+ .cse36 (* (- 1) .cse92)) 1) (= .cse92 6) (= 0 (+ (- 1) .cse31))))) (let ((.cse94 (+ (- 169) |ULTIMATE.start_main_~y~0#1|))) (and (= (+ 6 .cse94) |ULTIMATE.start_main_~z~0#1|) .cse1 .cse2 (= .cse64 .cse94) .cse8 .cse9 .cse10 (= .cse54 (+ .cse55 (+ (+ (+ (* .cse63 (- 1)) |ULTIMATE.start_main_~x~0#1|) .cse65) 42 (- 6) .cse65))) .cse27 (= |ULTIMATE.start_main_~n~0#1| (+ 7 1)) .cse28)) (let ((.cse100 (+ .cse44 (- 6)))) (let ((.cse98 (+ (- 17) (* .cse100 2)))) (let ((.cse99 (+ (* .cse98 2) 24 (* .cse100 (- 3))))) (and .cse52 (= 6 (let ((.cse96 (+ (* (- 1) .cse98) .cse100 .cse99 (- 6)))) (let ((.cse97 (+ .cse98 (* (- 1) .cse99) .cse96))) (let ((.cse95 (+ .cse98 (* (- 1) .cse97)))) (+ (+ (* (- 1) .cse95) .cse96 (- 6) .cse97) (* (- 1) .cse96) .cse95))))) .cse1 .cse2 .cse5 .cse8 (= .cse82 (+ .cse98 .cse100)) (or (= (+ (+ (+ (- (* .cse20 10)) (+ (- (* .cse21 18)) (+ (- (* .cse13 (* .cse21 3))) (* .cse20 (* .cse20 2))))) (* .cse13 3)) (- 10)) 0) (not (<= .cse101 |ULTIMATE.start_main_~a~0#1|)) (not (= (+ (* .cse21 12) (+ (- (* .cse13 .cse21)) (* .cse21 .cse60))) 0))) .cse9 .cse10 .cse47 (= |ULTIMATE.start_main_~n~0#1| .cse53) .cse27 .cse28 .cse58 (= |ULTIMATE.start_main_~x~0#1| (+ .cse82 (+ .cse98 .cse99))))))) (and .cse52 .cse1 .cse2 (= .cse82 .cse56) .cse8 (= .cse54 (+ .cse55 .cse50)) .cse9 .cse10 (= .cse51 .cse44) .cse57 (= .cse66 |ULTIMATE.start_main_~n~0#1|) .cse27 .cse28))))))))))) [2023-02-17 01:29:55,412 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-17 01:29:55,412 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-17 01:29:55,413 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-17 01:29:55,413 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-17 01:29:55,413 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: (let ((.cse1 (<= (+ 2 1) 2)) (.cse2 (= |__VERIFIER_assert_#in~cond| 1))) (or (let ((.cse0 (not .cse2))) (and (or .cse0 .cse1) .cse0)) (and .cse2 (not .cse1)) .cse2)) [2023-02-17 01:29:55,413 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-17 01:29:55,415 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1] [2023-02-17 01:29:55,416 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 01:29:55,439 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,440 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,441 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,441 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,441 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,441 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,441 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,441 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,441 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,442 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,442 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,442 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,442 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,442 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,443 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,443 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,443 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,443 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,443 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,443 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,444 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,444 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,494 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,496 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,496 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,496 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,496 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,496 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,496 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,497 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,497 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,497 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,497 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,497 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,498 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,498 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,498 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,498 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,498 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,499 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 01:29:55 BoogieIcfgContainer [2023-02-17 01:29:55,517 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 01:29:55,517 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 01:29:55,517 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 01:29:55,518 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 01:29:55,518 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:27:51" (3/4) ... [2023-02-17 01:29:55,521 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 01:29:55,526 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 01:29:55,530 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-02-17 01:29:55,530 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 01:29:55,530 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 01:29:55,531 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 01:29:55,550 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((30 + 6 == z && ((!(-((6 + z) * (x + y)) + (x + y) * (6 * a) + (x + y) * 12 == 0) || !(n <= a)) || -((6 + z) * (3 * (x + y))) + 2 * (y + z) * (y + z) + -((x + y) * 18) + -((y + z) * 10) + (6 + z) * 3 + -10 == 0)) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && -1 + n == 1 + 1 + 1 + 1) && z == 6 + 6 * n) && 2 * (-17 + 2 * (30 + -6 + -6)) + -3 * (30 + -6 + -6) + 24 + (-17 + 2 * (30 + -6 + -6)) + (30 * 4 + -59 + -1 * (30 + -6)) == -1 * (30 * 4 + -59) + x) && a >= 0) && a <= 10) && ((((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) || ((((19 + -1 * (-11 + 19) + 1 + 6 + 6 == z && x == 19 + (-11 + 19)) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) && 2 + 1 == n) && 2 <= a))) && 30 + (30 * 4 + -59) == y) && (-(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0 || !(x * 12 + (x * (6 * a) + -(x * z)) == 0))) && -1 + n <= a) && ((-10 + ((6 + z + 6) * 3 + (-((6 + z + 6) * (3 * (x + y + (y + z)))) + 2 * (6 + z + (y + z)) * (6 + z + (y + z)) + -(18 * (x + y + (y + z))) + -((6 + z + (y + z)) * 10))) == 0 || !(-((6 + z + 6) * (x + y + (y + z))) + 6 * a * (x + y + (y + z)) + 12 * (x + y + (y + z)) == 0)) || !(n + 1 <= a))) || ((((((((((((((!(-((6 + z) * (x + y)) + (x + y) * (6 * a) + (x + y) * 12 == 0) || !(n <= a)) || -((6 + z) * (3 * (x + y))) + 2 * (y + z) * (y + z) + -((x + y) * 18) + -((y + z) * 10) + (6 + z) * 3 + -10 == 0) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && -1 * (z + -6) + y == 30 + (30 * 4 + -59)) && z == 6 + 6 * n) && 2 * (-17 + 2 * (30 + -6 + -6)) + -3 * (30 + -6 + -6) + 24 + (-17 + 2 * (30 + -6 + -6)) + (30 * 4 + -59 + -1 * (30 + -6)) == -1 * (30 * 4 + -59) + (-1 * y + x + z + -6)) && a >= 0) && a <= 10) && ((((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) || ((((19 + -1 * (-11 + 19) + 1 + 6 + 6 == z && x == 19 + (-11 + 19)) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) && 2 + 1 == n) && 2 <= a))) && 30 + 6 == z + -6) && (-(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0 || !(x * 12 + (x * (6 * a) + -(x * z)) == 0))) && 5 + 1 == n) && -1 + n <= a)) || ((((((((((((((((-((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0 && (z + -6) * 2 + -17 + ((z + -6) * -3 + ((z + -6) * 2 + -17) * 2 + 24) == x) && n == 1 + 1 + 1) && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && -1 * ((z + -6) * 2 + -17 + -1 * ((z + -6) * 2 + -17 + (-1 * ((z + -6) * 2 + -17) + (z + -6) + -6 + ((z + -6) * -3 + ((z + -6) * 2 + -17) * 2 + 24)) + -1 * ((z + -6) * -3 + ((z + -6) * 2 + -17) * 2 + 24))) + -6 + (-1 * ((z + -6) * 2 + -17) + (z + -6) + -6 + ((z + -6) * -3 + ((z + -6) * 2 + -17) * 2 + 24)) + ((z + -6) * 2 + -17 + (-1 * ((z + -6) * 2 + -17) + (z + -6) + -6 + ((z + -6) * -3 + ((z + -6) * 2 + -17) * 2 + 24)) + -1 * ((z + -6) * -3 + ((z + -6) * 2 + -17) * 2 + 24)) + ((z + -6) * 2 + -17 + -1 * ((z + -6) * 2 + -17 + (-1 * ((z + -6) * 2 + -17) + (z + -6) + -6 + ((z + -6) * -3 + ((z + -6) * 2 + -17) * 2 + 24)) + -1 * ((z + -6) * -3 + ((z + -6) * 2 + -17) * 2 + 24))) + -1 * (-1 * ((z + -6) * 2 + -17) + (z + -6) + -6 + ((z + -6) * -3 + ((z + -6) * 2 + -17) * 2 + 24)) == 6) && z + -6 == 6 + 12) && 1 + 1 <= a) && y == (z + -6) * 2 + -17 + (z + -6)) && z == 6 + 6 * n) && y == -5 + 12 + 12 + (z + -6)) && a >= 0) && a <= 10) && ((((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) || ((((19 + -1 * (-11 + 19) + 1 + 6 + 6 == z && x == 19 + (-11 + 19)) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) && 2 + 1 == n) && 2 <= a))) && x + -1 * (-5 + 12 + 12) == -5 + 12 + -1 * (-1 + (-5 + 12)) + 0 + (-5 + 12)) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && ((\exists aux_div_ULTIMATE.start_main_~a~0#1_40 : int, aux_mod_ULTIMATE.start_main_~a~0#1_40 : int :: (((((0 <= 65536 + (aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40) && x * 12 + (x * (6 * (aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40)) + -(x * z)) == 0) && aux_mod_ULTIMATE.start_main_~a~0#1_40 < 65536) && 1 + 1 <= aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40) && 0 <= aux_mod_ULTIMATE.start_main_~a~0#1_40) && !(aux_mod_ULTIMATE.start_main_~a~0#1_40 <= 32767)) && 65536 + (aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40) < 65536) || (\exists aux_div_ULTIMATE.start_main_~a~0#1_40 : int, aux_mod_ULTIMATE.start_main_~a~0#1_40 : int :: (((((aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40 < 65536 && x * 12 + (x * (6 * (aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40)) + -(x * z)) == 0) && aux_mod_ULTIMATE.start_main_~a~0#1_40 < 65536) && 1 + 1 <= aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40) && 0 <= aux_mod_ULTIMATE.start_main_~a~0#1_40) && 0 <= aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40) && aux_mod_ULTIMATE.start_main_~a~0#1_40 <= 32767))) && -1 + n <= a)) || ((((((((((((((((((((((((((((((x + -1 * 1 == 0 && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && -1 + y == 6) && -1 + n == 0) && x == 0 + 1) && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && n == 0 + 1) && y == 6 + 1) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && y + -1 * (-1 * y + x + z + -6 + y + -1 * x) == 1) && ((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a)) && 6 == -1 * y + x + z + -6 + y + -1 * x) && 6 + 6 == z) && ((!(n <= a) || -((6 + z) * (x + y)) + (x + y) * (6 * a) + (x + y) * 12 == 0) || n + 1 < a + 1)) && x == 1) && z == 6 + 6 * n) && y == z + -6 + 1) && x + y == (n + 1) * ((n + 1) * (n + 1))) && a >= 0) && n <= 0 + 1) && a <= 10) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && y == z + -6 + x) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && -1 * 6 + y == 1) && 0 <= a) && z == -1 + y + 6) && z + -6 == 6) && -1 * y + x + z + -6 == 0) && -1 + n <= a) && y + -1 * (-1 + y) + 0 == x)) || ((((((((((6 + (-169 + y) == z && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && 42 + 6 == -169 + y) && z == 6 + 6 * n) && a >= 0) && a <= 10) && ((((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) || ((((19 + -1 * (-11 + 19) + 1 + 6 + 6 == z && x == 19 + (-11 + 19)) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) && 2 + 1 == n) && 2 <= a))) && 2 * (-17 + 2 * (30 + -6 + -6)) + -3 * (30 + -6 + -6) + 24 + (-17 + 2 * (30 + -6 + -6)) + (30 * 4 + -59 + -1 * (30 + -6)) == -1 * (30 * 4 + -59) + ((42 + (42 + 85)) * -1 + x + -1 * (42 + 85) + 42 + -6 + -1 * (42 + 85))) && -1 + n <= a) && n == 7 + 1)) || (((((((((((((((-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && (z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0))) && z == 6 + 6 * n) && y == 1) && a >= 0) && n <= 0 + 1) && a <= 10) && n == 0) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && 0 <= a) && z == -1 + y + 6) && x == 0) && -1 + n <= a) && 6 == z)) || (((((((((((((((((!(-((6 + z) * (x + y)) + (x + y) * (6 * a) + (x + y) * 12 == 0) || !(n <= a)) || -((6 + z) * (3 * (x + y))) + 2 * (y + z) * (y + z) + -((x + y) * 18) + -((y + z) * 10) + (6 + z) * 3 + -10 == 0) && 6 == -1 * (-17 + (z + -6 + -6) * 2 + -1 * (-17 + (z + -6 + -6) * 2 + -1 * ((-17 + (z + -6 + -6) * 2) * 2 + 24 + (z + -6 + -6) * -3) + (-1 * (-17 + (z + -6 + -6) * 2) + (z + -6 + -6) + ((-17 + (z + -6 + -6) * 2) * 2 + 24 + (z + -6 + -6) * -3) + -6))) + (-1 * (-17 + (z + -6 + -6) * 2) + (z + -6 + -6) + ((-17 + (z + -6 + -6) * 2) * 2 + 24 + (z + -6 + -6) * -3) + -6) + -6 + (-17 + (z + -6 + -6) * 2 + -1 * ((-17 + (z + -6 + -6) * 2) * 2 + 24 + (z + -6 + -6) * -3) + (-1 * (-17 + (z + -6 + -6) * 2) + (z + -6 + -6) + ((-17 + (z + -6 + -6) * 2) * 2 + 24 + (z + -6 + -6) * -3) + -6)) + -1 * (-1 * (-17 + (z + -6 + -6) * 2) + (z + -6 + -6) + ((-17 + (z + -6 + -6) * 2) * 2 + 24 + (z + -6 + -6) * -3) + -6) + (-17 + (z + -6 + -6) * 2 + -1 * (-17 + (z + -6 + -6) * 2 + -1 * ((-17 + (z + -6 + -6) * 2) * 2 + 24 + (z + -6 + -6) * -3) + (-1 * (-17 + (z + -6 + -6) * 2) + (z + -6 + -6) + ((-17 + (z + -6 + -6) * 2) * 2 + 24 + (z + -6 + -6) * -3) + -6)))) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && -(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0) && z == 6 + 6 * n) && -1 * (z + -6) + y == -17 + (z + -6 + -6) * 2 + (z + -6 + -6)) && ((-((6 + z + 6 + (6 + z + (y + z))) * 10) + (-((6 + z + (y + z) + (x + y + (y + z))) * 18) + (-((6 + z + 6 + 6) * ((6 + z + (y + z) + (x + y + (y + z))) * 3)) + (6 + z + 6 + (6 + z + (y + z))) * ((6 + z + 6 + (6 + z + (y + z))) * 2))) + (6 + z + 6 + 6) * 3 + -10 == 0 || !(n + 1 + 1 <= a)) || !((6 + z + (y + z) + (x + y + (y + z))) * 12 + (-((6 + z + 6 + 6) * (6 + z + (y + z) + (x + y + (y + z)))) + (6 + z + (y + z) + (x + y + (y + z))) * (6 * a)) == 0))) && a >= 0) && a <= 10) && ((((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) || ((((19 + -1 * (-11 + 19) + 1 + 6 + 6 == z && x == 19 + (-11 + 19)) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) && 2 + 1 == n) && 2 <= a))) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && n == 1 + 1 + 1 + 1) && -1 + n <= a) && ((-10 + ((6 + z + 6) * 3 + (-((6 + z + 6) * (3 * (x + y + (y + z)))) + 2 * (6 + z + (y + z)) * (6 + z + (y + z)) + -(18 * (x + y + (y + z))) + -((6 + z + (y + z)) * 10))) == 0 || !(-((6 + z + 6) * (x + y + (y + z))) + 6 * a * (x + y + (y + z)) + 12 * (x + y + (y + z)) == 0)) || !(n + 1 <= a))) && x == -1 * (z + -6) + y + (-17 + (z + -6 + -6) * 2 + ((-17 + (z + -6 + -6) * 2) * 2 + 24 + (z + -6 + -6) * -3)))) || (((((((((((-((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0 && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && 42 + (42 + 85) == y) && z == 42 + 6) && 2 * (-17 + 2 * (30 + -6 + -6)) + -3 * (30 + -6 + -6) + 24 + (-17 + 2 * (30 + -6 + -6)) + (30 * 4 + -59 + -1 * (30 + -6)) == -1 * (30 * 4 + -59) + (42 + -6 + -1 * (42 + 85) + (x + -1 * (42 + 85)))) && z == 6 + 6 * n) && a >= 0) && a <= 10) && ((((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) || ((((19 + -1 * (-11 + 19) + 1 + 6 + 6 == z && x == 19 + (-11 + 19)) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) && 2 + 1 == n) && 2 <= a))) && (-(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0 || !(x * 12 + (x * (6 * a) + -(x * z)) == 0))) && 5 + 1 == -1 + n) && -1 + n <= a)) || (((((((((((((((((((((((((((((-1 * (z + -6) + y == 6 + 1 && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && x == -1 * (z + -6) + y + 1) && ((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a)) && 6 + 6 == -7 + y) && x + -1 * (-1 + x) + (y + -1 * x + 1 + -6) == -1 + x) && -1 * y + x + z + -6 + -6 + (-1 * y + x + z + -6 + y + -1 * x) + (y + -1 * (-1 * y + x + z + -6 + y + -1 * x)) * -1 == 0) && z == 6 + 6 * n) && z == 6 + 12) && (x * 12 + (x * (6 * a) + -(x * z)) == 0 || n <= a)) && y + -1 * x + 1 + 6 == z) && 6 + (-7 + y) == z) && a >= 0) && -5 + 12 + -1 * (-1 + (-5 + 12)) + 0 + (-5 + 12) == x) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && (!(z == 6 + 6 * n) || x + y == (n + 1) * ((n + 1) * (n + 1)))) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && 6 == y + -1 * x + 1 + -6) && -1 + n == 0 + 1) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && 6 + 6 == z + -6) && 1 + 1 == n) && -1 + n <= a) && -5 + 12 + 12 == y) && y + -1 * (-1 * y + x + z + -6 + y + -1 * x) + -1 * (y + -1 * (-1 * y + x + z + -6 + y + -1 * x) + (-1 * y + x + z + -6 + -6 + (-1 * y + x + z + -6 + y + -1 * x) + (y + -1 * (-1 * y + x + z + -6 + y + -1 * x)) * -1) + -1 * (-1 * y + x + z + -6)) == 1) && y + -1 * (-1 * y + x + z + -6 + y + -1 * x) + (-1 * y + x + z + -6 + -6 + (-1 * y + x + z + -6 + y + -1 * x) + (y + -1 * (-1 * y + x + z + -6 + y + -1 * x)) * -1) + -1 * (-1 * y + x + z + -6) == 6) && 0 == -1 + (-1 + n))) || ((((((((((((((((!(6 + (n + 1) * 6 == 6 + z) || -(10 * (6 * (n + 1 + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + 6 * (n + 1 + 1 + 1 + 1))))) + (2 * (6 * (n + 1 + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + 6 * (n + 1 + 1 + 1 + 1)))) * (6 * (n + 1 + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + 6 * (n + 1 + 1 + 1 + 1)))) + -((6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + 6 * (n + 1 + 1 + 1 + 1)) + (6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + (n + 1) * 6 + (y + z) + (x + y + (y + z)) + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z)))))) * 3 * (6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 6)) + -((6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + 6 * (n + 1 + 1 + 1 + 1)) + (6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + (n + 1) * 6 + (y + z) + (x + y + (y + z)) + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z)))))) * 18)) + 3 * (6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 6) + -10 == 0) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && (-10 + (2 * (y + z) * (y + z) + -((6 + (n + 1) * 6) * (3 * (x + y))) + -((x + y) * 18) + -((y + z) * 10) + (6 + (n + 1) * 6) * 3) == 0 || !(6 + (n + 1) * 6 == 6 + z))) && (!(6 + z + 6 == 6 + 6 * (n + 1 + 1)) || -((6 + z + (y + z) + (x + y + (y + z)) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))) + (6 * (n + 1 + 1 + 1) + 6 + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))))) * 18) + ((6 * (n + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))))) * (2 * (6 * (n + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)))))) + -((6 + (n + 1 + 1 + 1 + 1 + 1) * 6) * (3 * (6 + z + (y + z) + (x + y + (y + z)) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))) + (6 * (n + 1 + 1 + 1) + 6 + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)))))))) + -((6 * (n + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))))) * 10) + 3 * (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + -10 == 0)) && -(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0) && (-((6 + (n + 1) * 6 + (y + z) + (6 + 6 * (n + 1 + 1)) + (12 + 6 * (n + 1 + 1))) * 10) + (-((6 + (n + 1) * 6 + (y + z) + (6 + 6 * (n + 1 + 1)) + (6 + (n + 1) * 6 + (y + z) + (x + y + (y + z)))) * 18) + (2 * (6 + (n + 1) * 6 + (y + z) + (6 + 6 * (n + 1 + 1)) + (12 + 6 * (n + 1 + 1))) * (6 + (n + 1) * 6 + (y + z) + (6 + 6 * (n + 1 + 1)) + (12 + 6 * (n + 1 + 1))) + -((6 + 6 * (n + 1 + 1 + 1 + 1)) * ((6 + (n + 1) * 6 + (y + z) + (6 + 6 * (n + 1 + 1)) + (6 + (n + 1) * 6 + (y + z) + (x + y + (y + z)))) * 3)))) + 3 * (6 + 6 * (n + 1 + 1 + 1 + 1)) + -10 == 0 || !(6 + (n + 1) * 6 == 6 + z))) && (!(6 + z + 6 == 6 + 6 * (n + 1 + 1)) || -10 + (3 * (6 * (n + 1 + 1 + 1 + 1 + 1 + 1 + 1) + 6) + (-((6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + ((n + 1 + 1 + 1 + 1 + 1) * 6 + 12)) * 10) + (-((6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + (6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + z + (y + z) + (x + y + (y + z)) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1))))))) * 18) + (-((6 * (n + 1 + 1 + 1 + 1 + 1 + 1 + 1) + 6) * (3 * (6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + (6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + z + (y + z) + (x + y + (y + z)) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1))))))))) + (6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + ((n + 1 + 1 + 1 + 1 + 1) * 6 + 12)) * ((6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + ((n + 1 + 1 + 1 + 1 + 1) * 6 + 12)) * 2))))) == 0)) && z == 6 + 6 * n) && a >= 0) && a <= 10) && ((((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) || ((((19 + -1 * (-11 + 19) + 1 + 6 + 6 == z && x == 19 + (-11 + 19)) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) && 2 + 1 == n) && 2 <= a))) && (-(10 * (y + z + (12 + 6 * n))) + (-(3 * (x + y + (y + z)) * (6 + 6 * (n + 1 + 1))) + 2 * (y + z + (12 + 6 * n)) * (y + z + (12 + 6 * n)) + -(18 * (x + y + (y + z)))) + 3 * (6 + 6 * (n + 1 + 1)) + -10 == 0 || !(6 + z == 12 + 6 * n))) && (!(6 * (n + 1 + 1 + 1) + 6 == 6 + z + 6 + 6) || -((6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 6 + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 * (n + 1 + 1 + 1) + 6 + 6) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6)) + (6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 12)) * 10) + (-((6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 6 + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 * (n + 1 + 1 + 1) + 6 + 6) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6)) + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 * (n + 1 + 1 + 1) + 6 + 6) + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 + z + 6 + (6 + z + (y + z)) + (6 + z + (y + z) + (x + y + (y + z))))) + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 * (n + 1 + 1 + 1) + 6 + 6) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6)))) * 18) + (2 * (6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 6 + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 * (n + 1 + 1 + 1) + 6 + 6) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6)) + (6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 12)) * (6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 6 + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 * (n + 1 + 1 + 1) + 6 + 6) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6)) + (6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 12)) + -((6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 6 + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 * (n + 1 + 1 + 1) + 6 + 6) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6)) + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 * (n + 1 + 1 + 1) + 6 + 6) + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 + z + 6 + (6 + z + (y + z)) + (6 + z + (y + z) + (x + y + (y + z))))) + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 * (n + 1 + 1 + 1) + 6 + 6) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6)))) * 3 * (6 + 6 * (n + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1))))) + 3 * (6 + 6 * (n + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) + -10 == 0)) && -1 + n <= a) && (-10 + (-(10 * (6 + (n + 1) * 6 + (y + z) + (12 + (n + 1) * 6))) + (2 * (6 + (n + 1) * 6 + (y + z) + (12 + (n + 1) * 6)) * (6 + (n + 1) * 6 + (y + z) + (12 + (n + 1) * 6)) + -(3 * (6 + (n + 1) * 6 + (y + z) + (x + y + (y + z))) * (6 * (n + 1 + 1 + 1) + 6)) + -((6 + (n + 1) * 6 + (y + z) + (x + y + (y + z))) * 18)) + (6 * (n + 1 + 1 + 1) + 6) * 3) == 0 || !(6 + (n + 1) * 6 == 6 + z)))) || (((((((((((((((!(6 + (n + 1) * 6 == 6 + z) || -(10 * (6 * (n + 1 + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + 6 * (n + 1 + 1 + 1 + 1))))) + (2 * (6 * (n + 1 + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + 6 * (n + 1 + 1 + 1 + 1)))) * (6 * (n + 1 + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + 6 * (n + 1 + 1 + 1 + 1)))) + -((6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + 6 * (n + 1 + 1 + 1 + 1)) + (6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + (n + 1) * 6 + (y + z) + (x + y + (y + z)) + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z)))))) * 3 * (6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 6)) + -((6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + 6 * (n + 1 + 1 + 1 + 1)) + (6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + (n + 1) * 6 + (y + z) + (x + y + (y + z)) + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z)))))) * 18)) + 3 * (6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 6) + -10 == 0) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && (!(z == 6 + 6 * n) || -(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0)) && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && (-10 + (2 * (y + z) * (y + z) + -((6 + (n + 1) * 6) * (3 * (x + y))) + -((x + y) * 18) + -((y + z) * 10) + (6 + (n + 1) * 6) * 3) == 0 || !(6 + (n + 1) * 6 == 6 + z))) && (!(6 + z + 6 == 6 + 6 * (n + 1 + 1)) || -((6 + z + (y + z) + (x + y + (y + z)) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))) + (6 * (n + 1 + 1 + 1) + 6 + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))))) * 18) + ((6 * (n + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))))) * (2 * (6 * (n + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)))))) + -((6 + (n + 1 + 1 + 1 + 1 + 1) * 6) * (3 * (6 + z + (y + z) + (x + y + (y + z)) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))) + (6 * (n + 1 + 1 + 1) + 6 + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)))))))) + -((6 * (n + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))))) * 10) + 3 * (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + -10 == 0)) && (-((6 + (n + 1) * 6 + (y + z) + (6 + 6 * (n + 1 + 1)) + (12 + 6 * (n + 1 + 1))) * 10) + (-((6 + (n + 1) * 6 + (y + z) + (6 + 6 * (n + 1 + 1)) + (6 + (n + 1) * 6 + (y + z) + (x + y + (y + z)))) * 18) + (2 * (6 + (n + 1) * 6 + (y + z) + (6 + 6 * (n + 1 + 1)) + (12 + 6 * (n + 1 + 1))) * (6 + (n + 1) * 6 + (y + z) + (6 + 6 * (n + 1 + 1)) + (12 + 6 * (n + 1 + 1))) + -((6 + 6 * (n + 1 + 1 + 1 + 1)) * ((6 + (n + 1) * 6 + (y + z) + (6 + 6 * (n + 1 + 1)) + (6 + (n + 1) * 6 + (y + z) + (x + y + (y + z)))) * 3)))) + 3 * (6 + 6 * (n + 1 + 1 + 1 + 1)) + -10 == 0 || !(6 + (n + 1) * 6 == 6 + z))) && (!(6 + z + 6 == 6 + 6 * (n + 1 + 1)) || -10 + (3 * (6 * (n + 1 + 1 + 1 + 1 + 1 + 1 + 1) + 6) + (-((6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + ((n + 1 + 1 + 1 + 1 + 1) * 6 + 12)) * 10) + (-((6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + (6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + z + (y + z) + (x + y + (y + z)) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1))))))) * 18) + (-((6 * (n + 1 + 1 + 1 + 1 + 1 + 1 + 1) + 6) * (3 * (6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + (6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + z + (y + z) + (x + y + (y + z)) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1))))))))) + (6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + ((n + 1 + 1 + 1 + 1 + 1) * 6 + 12)) * ((6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + ((n + 1 + 1 + 1 + 1 + 1) * 6 + 12)) * 2))))) == 0)) && z == 6 + 6 * n) && a >= 0) && a <= 10) && ((((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) || ((((19 + -1 * (-11 + 19) + 1 + 6 + 6 == z && x == 19 + (-11 + 19)) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) && 2 + 1 == n) && 2 <= a))) && (-(10 * (y + z + (12 + 6 * n))) + (-(3 * (x + y + (y + z)) * (6 + 6 * (n + 1 + 1))) + 2 * (y + z + (12 + 6 * n)) * (y + z + (12 + 6 * n)) + -(18 * (x + y + (y + z)))) + 3 * (6 + 6 * (n + 1 + 1)) + -10 == 0 || !(6 + z == 12 + 6 * n))) && -1 + n <= a) && (-10 + (-(10 * (6 + (n + 1) * 6 + (y + z) + (12 + (n + 1) * 6))) + (2 * (6 + (n + 1) * 6 + (y + z) + (12 + (n + 1) * 6)) * (6 + (n + 1) * 6 + (y + z) + (12 + (n + 1) * 6)) + -(3 * (6 + (n + 1) * 6 + (y + z) + (x + y + (y + z))) * (6 * (n + 1 + 1 + 1) + 6)) + -((6 + (n + 1) * 6 + (y + z) + (x + y + (y + z))) * 18)) + (6 * (n + 1 + 1 + 1) + 6) * 3) == 0 || !(6 + (n + 1) * 6 == 6 + z))) [2023-02-17 01:29:55,559 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 01:29:55,560 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 01:29:55,560 INFO L158 Benchmark]: Toolchain (without parser) took 124207.99ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 95.8MB in the beginning and 114.9MB in the end (delta: -19.2MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2023-02-17 01:29:55,560 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:29:55,560 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.30ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 84.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 01:29:55,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.32ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 83.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:29:55,561 INFO L158 Benchmark]: Boogie Preprocessor took 18.27ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 82.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 01:29:55,561 INFO L158 Benchmark]: RCFGBuilder took 249.28ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 70.9MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 01:29:55,561 INFO L158 Benchmark]: TraceAbstraction took 123691.05ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 70.6MB in the beginning and 118.3MB in the end (delta: -47.7MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. [2023-02-17 01:29:55,563 INFO L158 Benchmark]: Witness Printer took 42.52ms. Allocated memory is still 182.5MB. Free memory was 118.3MB in the beginning and 114.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 01:29:55,567 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.30ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 84.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.32ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 83.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.27ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 82.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 249.28ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 70.9MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 123691.05ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 70.6MB in the beginning and 118.3MB in the end (delta: -47.7MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. * Witness Printer took 42.52ms. Allocated memory is still 182.5MB. Free memory was 118.3MB in the beginning and 114.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] * 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, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 123.5s, OverallIterations: 15, TraceHistogramMax: 49, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 95.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 25 mSolverCounterUnknown, 362 SdHoareTripleChecker+Valid, 83.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 267 mSDsluCounter, 1335 SdHoareTripleChecker+Invalid, 82.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 893 mSDsCounter, 778 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5809 IncrementalHoareTripleChecker+Invalid, 6612 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 778 mSolverCounterUnsat, 442 mSDtfsCounter, 5809 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2196 GetRequests, 1946 SyntacticMatches, 10 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 32.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151occurred in iteration=14, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 28 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 111 PreInvPairs, 210 NumberOfFragments, 131825 HoareAnnotationTreeSize, 111 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 23.7s InterpolantComputationTime, 1137 NumberOfCodeBlocks, 1025 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2059 ConstructedInterpolants, 2 QuantifiedInterpolants, 43478 SizeOfPredicates, 65 NumberOfNonLiveVariables, 2400 ConjunctsInSsa, 444 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 17376/18486 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: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant [2023-02-17 01:29:55,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,604 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,604 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,604 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,604 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,605 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,605 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,605 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,605 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,605 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,605 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,606 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,606 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,606 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-17 01:29:55,606 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((30 + 6 == z && ((!(-((6 + z) * (x + y)) + (x + y) * (6 * a) + (x + y) * 12 == 0) || !(n <= a)) || -((6 + z) * (3 * (x + y))) + 2 * (y + z) * (y + z) + -((x + y) * 18) + -((y + z) * 10) + (6 + z) * 3 + -10 == 0)) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && -1 + n == 1 + 1 + 1 + 1) && z == 6 + 6 * n) && 2 * (-17 + 2 * (30 + -6 + -6)) + -3 * (30 + -6 + -6) + 24 + (-17 + 2 * (30 + -6 + -6)) + (30 * 4 + -59 + -1 * (30 + -6)) == -1 * (30 * 4 + -59) + x) && a >= 0) && a <= 10) && ((((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) || ((((19 + -1 * (-11 + 19) + 1 + 6 + 6 == z && x == 19 + (-11 + 19)) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) && 2 + 1 == n) && 2 <= a))) && 30 + (30 * 4 + -59) == y) && (-(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0 || !(x * 12 + (x * (6 * a) + -(x * z)) == 0))) && -1 + n <= a) && ((-10 + ((6 + z + 6) * 3 + (-((6 + z + 6) * (3 * (x + y + (y + z)))) + 2 * (6 + z + (y + z)) * (6 + z + (y + z)) + -(18 * (x + y + (y + z))) + -((6 + z + (y + z)) * 10))) == 0 || !(-((6 + z + 6) * (x + y + (y + z))) + 6 * a * (x + y + (y + z)) + 12 * (x + y + (y + z)) == 0)) || !(n + 1 <= a))) || ((((((((((((((!(-((6 + z) * (x + y)) + (x + y) * (6 * a) + (x + y) * 12 == 0) || !(n <= a)) || -((6 + z) * (3 * (x + y))) + 2 * (y + z) * (y + z) + -((x + y) * 18) + -((y + z) * 10) + (6 + z) * 3 + -10 == 0) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && -1 * (z + -6) + y == 30 + (30 * 4 + -59)) && z == 6 + 6 * n) && 2 * (-17 + 2 * (30 + -6 + -6)) + -3 * (30 + -6 + -6) + 24 + (-17 + 2 * (30 + -6 + -6)) + (30 * 4 + -59 + -1 * (30 + -6)) == -1 * (30 * 4 + -59) + (-1 * y + x + z + -6)) && a >= 0) && a <= 10) && ((((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) || ((((19 + -1 * (-11 + 19) + 1 + 6 + 6 == z && x == 19 + (-11 + 19)) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) && 2 + 1 == n) && 2 <= a))) && 30 + 6 == z + -6) && (-(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0 || !(x * 12 + (x * (6 * a) + -(x * z)) == 0))) && 5 + 1 == n) && -1 + n <= a)) || ((((((((((((((((-((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0 && (z + -6) * 2 + -17 + ((z + -6) * -3 + ((z + -6) * 2 + -17) * 2 + 24) == x) && n == 1 + 1 + 1) && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && -1 * ((z + -6) * 2 + -17 + -1 * ((z + -6) * 2 + -17 + (-1 * ((z + -6) * 2 + -17) + (z + -6) + -6 + ((z + -6) * -3 + ((z + -6) * 2 + -17) * 2 + 24)) + -1 * ((z + -6) * -3 + ((z + -6) * 2 + -17) * 2 + 24))) + -6 + (-1 * ((z + -6) * 2 + -17) + (z + -6) + -6 + ((z + -6) * -3 + ((z + -6) * 2 + -17) * 2 + 24)) + ((z + -6) * 2 + -17 + (-1 * ((z + -6) * 2 + -17) + (z + -6) + -6 + ((z + -6) * -3 + ((z + -6) * 2 + -17) * 2 + 24)) + -1 * ((z + -6) * -3 + ((z + -6) * 2 + -17) * 2 + 24)) + ((z + -6) * 2 + -17 + -1 * ((z + -6) * 2 + -17 + (-1 * ((z + -6) * 2 + -17) + (z + -6) + -6 + ((z + -6) * -3 + ((z + -6) * 2 + -17) * 2 + 24)) + -1 * ((z + -6) * -3 + ((z + -6) * 2 + -17) * 2 + 24))) + -1 * (-1 * ((z + -6) * 2 + -17) + (z + -6) + -6 + ((z + -6) * -3 + ((z + -6) * 2 + -17) * 2 + 24)) == 6) && z + -6 == 6 + 12) && 1 + 1 <= a) && y == (z + -6) * 2 + -17 + (z + -6)) && z == 6 + 6 * n) && y == -5 + 12 + 12 + (z + -6)) && a >= 0) && a <= 10) && ((((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) || ((((19 + -1 * (-11 + 19) + 1 + 6 + 6 == z && x == 19 + (-11 + 19)) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) && 2 + 1 == n) && 2 <= a))) && x + -1 * (-5 + 12 + 12) == -5 + 12 + -1 * (-1 + (-5 + 12)) + 0 + (-5 + 12)) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && ((\exists aux_div_ULTIMATE.start_main_~a~0#1_40 : int, aux_mod_ULTIMATE.start_main_~a~0#1_40 : int :: (((((0 <= 65536 + (aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40) && x * 12 + (x * (6 * (aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40)) + -(x * z)) == 0) && aux_mod_ULTIMATE.start_main_~a~0#1_40 < 65536) && 1 + 1 <= aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40) && 0 <= aux_mod_ULTIMATE.start_main_~a~0#1_40) && !(aux_mod_ULTIMATE.start_main_~a~0#1_40 <= 32767)) && 65536 + (aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40) < 65536) || (\exists aux_div_ULTIMATE.start_main_~a~0#1_40 : int, aux_mod_ULTIMATE.start_main_~a~0#1_40 : int :: (((((aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40 < 65536 && x * 12 + (x * (6 * (aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40)) + -(x * z)) == 0) && aux_mod_ULTIMATE.start_main_~a~0#1_40 < 65536) && 1 + 1 <= aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40) && 0 <= aux_mod_ULTIMATE.start_main_~a~0#1_40) && 0 <= aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40) && aux_mod_ULTIMATE.start_main_~a~0#1_40 <= 32767))) && -1 + n <= a)) || ((((((((((((((((((((((((((((((x + -1 * 1 == 0 && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && -1 + y == 6) && -1 + n == 0) && x == 0 + 1) && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && n == 0 + 1) && y == 6 + 1) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && y + -1 * (-1 * y + x + z + -6 + y + -1 * x) == 1) && ((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a)) && 6 == -1 * y + x + z + -6 + y + -1 * x) && 6 + 6 == z) && ((!(n <= a) || -((6 + z) * (x + y)) + (x + y) * (6 * a) + (x + y) * 12 == 0) || n + 1 < a + 1)) && x == 1) && z == 6 + 6 * n) && y == z + -6 + 1) && x + y == (n + 1) * ((n + 1) * (n + 1))) && a >= 0) && n <= 0 + 1) && a <= 10) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && y == z + -6 + x) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && -1 * 6 + y == 1) && 0 <= a) && z == -1 + y + 6) && z + -6 == 6) && -1 * y + x + z + -6 == 0) && -1 + n <= a) && y + -1 * (-1 + y) + 0 == x)) || ((((((((((6 + (-169 + y) == z && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && 42 + 6 == -169 + y) && z == 6 + 6 * n) && a >= 0) && a <= 10) && ((((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) || ((((19 + -1 * (-11 + 19) + 1 + 6 + 6 == z && x == 19 + (-11 + 19)) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) && 2 + 1 == n) && 2 <= a))) && 2 * (-17 + 2 * (30 + -6 + -6)) + -3 * (30 + -6 + -6) + 24 + (-17 + 2 * (30 + -6 + -6)) + (30 * 4 + -59 + -1 * (30 + -6)) == -1 * (30 * 4 + -59) + ((42 + (42 + 85)) * -1 + x + -1 * (42 + 85) + 42 + -6 + -1 * (42 + 85))) && -1 + n <= a) && n == 7 + 1)) || (((((((((((((((-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && (z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0))) && z == 6 + 6 * n) && y == 1) && a >= 0) && n <= 0 + 1) && a <= 10) && n == 0) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && 0 <= a) && z == -1 + y + 6) && x == 0) && -1 + n <= a) && 6 == z)) || (((((((((((((((((!(-((6 + z) * (x + y)) + (x + y) * (6 * a) + (x + y) * 12 == 0) || !(n <= a)) || -((6 + z) * (3 * (x + y))) + 2 * (y + z) * (y + z) + -((x + y) * 18) + -((y + z) * 10) + (6 + z) * 3 + -10 == 0) && 6 == -1 * (-17 + (z + -6 + -6) * 2 + -1 * (-17 + (z + -6 + -6) * 2 + -1 * ((-17 + (z + -6 + -6) * 2) * 2 + 24 + (z + -6 + -6) * -3) + (-1 * (-17 + (z + -6 + -6) * 2) + (z + -6 + -6) + ((-17 + (z + -6 + -6) * 2) * 2 + 24 + (z + -6 + -6) * -3) + -6))) + (-1 * (-17 + (z + -6 + -6) * 2) + (z + -6 + -6) + ((-17 + (z + -6 + -6) * 2) * 2 + 24 + (z + -6 + -6) * -3) + -6) + -6 + (-17 + (z + -6 + -6) * 2 + -1 * ((-17 + (z + -6 + -6) * 2) * 2 + 24 + (z + -6 + -6) * -3) + (-1 * (-17 + (z + -6 + -6) * 2) + (z + -6 + -6) + ((-17 + (z + -6 + -6) * 2) * 2 + 24 + (z + -6 + -6) * -3) + -6)) + -1 * (-1 * (-17 + (z + -6 + -6) * 2) + (z + -6 + -6) + ((-17 + (z + -6 + -6) * 2) * 2 + 24 + (z + -6 + -6) * -3) + -6) + (-17 + (z + -6 + -6) * 2 + -1 * (-17 + (z + -6 + -6) * 2 + -1 * ((-17 + (z + -6 + -6) * 2) * 2 + 24 + (z + -6 + -6) * -3) + (-1 * (-17 + (z + -6 + -6) * 2) + (z + -6 + -6) + ((-17 + (z + -6 + -6) * 2) * 2 + 24 + (z + -6 + -6) * -3) + -6)))) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && -(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0) && z == 6 + 6 * n) && -1 * (z + -6) + y == -17 + (z + -6 + -6) * 2 + (z + -6 + -6)) && ((-((6 + z + 6 + (6 + z + (y + z))) * 10) + (-((6 + z + (y + z) + (x + y + (y + z))) * 18) + (-((6 + z + 6 + 6) * ((6 + z + (y + z) + (x + y + (y + z))) * 3)) + (6 + z + 6 + (6 + z + (y + z))) * ((6 + z + 6 + (6 + z + (y + z))) * 2))) + (6 + z + 6 + 6) * 3 + -10 == 0 || !(n + 1 + 1 <= a)) || !((6 + z + (y + z) + (x + y + (y + z))) * 12 + (-((6 + z + 6 + 6) * (6 + z + (y + z) + (x + y + (y + z)))) + (6 + z + (y + z) + (x + y + (y + z))) * (6 * a)) == 0))) && a >= 0) && a <= 10) && ((((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) || ((((19 + -1 * (-11 + 19) + 1 + 6 + 6 == z && x == 19 + (-11 + 19)) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) && 2 + 1 == n) && 2 <= a))) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && n == 1 + 1 + 1 + 1) && -1 + n <= a) && ((-10 + ((6 + z + 6) * 3 + (-((6 + z + 6) * (3 * (x + y + (y + z)))) + 2 * (6 + z + (y + z)) * (6 + z + (y + z)) + -(18 * (x + y + (y + z))) + -((6 + z + (y + z)) * 10))) == 0 || !(-((6 + z + 6) * (x + y + (y + z))) + 6 * a * (x + y + (y + z)) + 12 * (x + y + (y + z)) == 0)) || !(n + 1 <= a))) && x == -1 * (z + -6) + y + (-17 + (z + -6 + -6) * 2 + ((-17 + (z + -6 + -6) * 2) * 2 + 24 + (z + -6 + -6) * -3)))) || (((((((((((-((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0 && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && 42 + (42 + 85) == y) && z == 42 + 6) && 2 * (-17 + 2 * (30 + -6 + -6)) + -3 * (30 + -6 + -6) + 24 + (-17 + 2 * (30 + -6 + -6)) + (30 * 4 + -59 + -1 * (30 + -6)) == -1 * (30 * 4 + -59) + (42 + -6 + -1 * (42 + 85) + (x + -1 * (42 + 85)))) && z == 6 + 6 * n) && a >= 0) && a <= 10) && ((((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) || ((((19 + -1 * (-11 + 19) + 1 + 6 + 6 == z && x == 19 + (-11 + 19)) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) && 2 + 1 == n) && 2 <= a))) && (-(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0 || !(x * 12 + (x * (6 * a) + -(x * z)) == 0))) && 5 + 1 == -1 + n) && -1 + n <= a)) || (((((((((((((((((((((((((((((-1 * (z + -6) + y == 6 + 1 && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && x == -1 * (z + -6) + y + 1) && ((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a)) && 6 + 6 == -7 + y) && x + -1 * (-1 + x) + (y + -1 * x + 1 + -6) == -1 + x) && -1 * y + x + z + -6 + -6 + (-1 * y + x + z + -6 + y + -1 * x) + (y + -1 * (-1 * y + x + z + -6 + y + -1 * x)) * -1 == 0) && z == 6 + 6 * n) && z == 6 + 12) && (x * 12 + (x * (6 * a) + -(x * z)) == 0 || n <= a)) && y + -1 * x + 1 + 6 == z) && 6 + (-7 + y) == z) && a >= 0) && -5 + 12 + -1 * (-1 + (-5 + 12)) + 0 + (-5 + 12) == x) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && (!(z == 6 + 6 * n) || x + y == (n + 1) * ((n + 1) * (n + 1)))) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && 6 == y + -1 * x + 1 + -6) && -1 + n == 0 + 1) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && 6 + 6 == z + -6) && 1 + 1 == n) && -1 + n <= a) && -5 + 12 + 12 == y) && y + -1 * (-1 * y + x + z + -6 + y + -1 * x) + -1 * (y + -1 * (-1 * y + x + z + -6 + y + -1 * x) + (-1 * y + x + z + -6 + -6 + (-1 * y + x + z + -6 + y + -1 * x) + (y + -1 * (-1 * y + x + z + -6 + y + -1 * x)) * -1) + -1 * (-1 * y + x + z + -6)) == 1) && y + -1 * (-1 * y + x + z + -6 + y + -1 * x) + (-1 * y + x + z + -6 + -6 + (-1 * y + x + z + -6 + y + -1 * x) + (y + -1 * (-1 * y + x + z + -6 + y + -1 * x)) * -1) + -1 * (-1 * y + x + z + -6) == 6) && 0 == -1 + (-1 + n))) || ((((((((((((((((!(6 + (n + 1) * 6 == 6 + z) || -(10 * (6 * (n + 1 + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + 6 * (n + 1 + 1 + 1 + 1))))) + (2 * (6 * (n + 1 + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + 6 * (n + 1 + 1 + 1 + 1)))) * (6 * (n + 1 + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + 6 * (n + 1 + 1 + 1 + 1)))) + -((6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + 6 * (n + 1 + 1 + 1 + 1)) + (6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + (n + 1) * 6 + (y + z) + (x + y + (y + z)) + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z)))))) * 3 * (6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 6)) + -((6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + 6 * (n + 1 + 1 + 1 + 1)) + (6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + (n + 1) * 6 + (y + z) + (x + y + (y + z)) + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z)))))) * 18)) + 3 * (6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 6) + -10 == 0) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && (-10 + (2 * (y + z) * (y + z) + -((6 + (n + 1) * 6) * (3 * (x + y))) + -((x + y) * 18) + -((y + z) * 10) + (6 + (n + 1) * 6) * 3) == 0 || !(6 + (n + 1) * 6 == 6 + z))) && (!(6 + z + 6 == 6 + 6 * (n + 1 + 1)) || -((6 + z + (y + z) + (x + y + (y + z)) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))) + (6 * (n + 1 + 1 + 1) + 6 + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))))) * 18) + ((6 * (n + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))))) * (2 * (6 * (n + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)))))) + -((6 + (n + 1 + 1 + 1 + 1 + 1) * 6) * (3 * (6 + z + (y + z) + (x + y + (y + z)) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))) + (6 * (n + 1 + 1 + 1) + 6 + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)))))))) + -((6 * (n + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))))) * 10) + 3 * (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + -10 == 0)) && -(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0) && (-((6 + (n + 1) * 6 + (y + z) + (6 + 6 * (n + 1 + 1)) + (12 + 6 * (n + 1 + 1))) * 10) + (-((6 + (n + 1) * 6 + (y + z) + (6 + 6 * (n + 1 + 1)) + (6 + (n + 1) * 6 + (y + z) + (x + y + (y + z)))) * 18) + (2 * (6 + (n + 1) * 6 + (y + z) + (6 + 6 * (n + 1 + 1)) + (12 + 6 * (n + 1 + 1))) * (6 + (n + 1) * 6 + (y + z) + (6 + 6 * (n + 1 + 1)) + (12 + 6 * (n + 1 + 1))) + -((6 + 6 * (n + 1 + 1 + 1 + 1)) * ((6 + (n + 1) * 6 + (y + z) + (6 + 6 * (n + 1 + 1)) + (6 + (n + 1) * 6 + (y + z) + (x + y + (y + z)))) * 3)))) + 3 * (6 + 6 * (n + 1 + 1 + 1 + 1)) + -10 == 0 || !(6 + (n + 1) * 6 == 6 + z))) && (!(6 + z + 6 == 6 + 6 * (n + 1 + 1)) || -10 + (3 * (6 * (n + 1 + 1 + 1 + 1 + 1 + 1 + 1) + 6) + (-((6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + ((n + 1 + 1 + 1 + 1 + 1) * 6 + 12)) * 10) + (-((6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + (6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + z + (y + z) + (x + y + (y + z)) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1))))))) * 18) + (-((6 * (n + 1 + 1 + 1 + 1 + 1 + 1 + 1) + 6) * (3 * (6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + (6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + z + (y + z) + (x + y + (y + z)) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1))))))))) + (6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + ((n + 1 + 1 + 1 + 1 + 1) * 6 + 12)) * ((6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + ((n + 1 + 1 + 1 + 1 + 1) * 6 + 12)) * 2))))) == 0)) && z == 6 + 6 * n) && a >= 0) && a <= 10) && ((((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) || ((((19 + -1 * (-11 + 19) + 1 + 6 + 6 == z && x == 19 + (-11 + 19)) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) && 2 + 1 == n) && 2 <= a))) && (-(10 * (y + z + (12 + 6 * n))) + (-(3 * (x + y + (y + z)) * (6 + 6 * (n + 1 + 1))) + 2 * (y + z + (12 + 6 * n)) * (y + z + (12 + 6 * n)) + -(18 * (x + y + (y + z)))) + 3 * (6 + 6 * (n + 1 + 1)) + -10 == 0 || !(6 + z == 12 + 6 * n))) && (!(6 * (n + 1 + 1 + 1) + 6 == 6 + z + 6 + 6) || -((6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 6 + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 * (n + 1 + 1 + 1) + 6 + 6) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6)) + (6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 12)) * 10) + (-((6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 6 + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 * (n + 1 + 1 + 1) + 6 + 6) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6)) + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 * (n + 1 + 1 + 1) + 6 + 6) + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 + z + 6 + (6 + z + (y + z)) + (6 + z + (y + z) + (x + y + (y + z))))) + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 * (n + 1 + 1 + 1) + 6 + 6) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6)))) * 18) + (2 * (6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 6 + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 * (n + 1 + 1 + 1) + 6 + 6) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6)) + (6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 12)) * (6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 6 + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 * (n + 1 + 1 + 1) + 6 + 6) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6)) + (6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 12)) + -((6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 6 + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 * (n + 1 + 1 + 1) + 6 + 6) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6)) + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 * (n + 1 + 1 + 1) + 6 + 6) + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 + z + 6 + (6 + z + (y + z)) + (6 + z + (y + z) + (x + y + (y + z))))) + (6 + z + 6 + (6 + z + (y + z)) + (6 * (n + 1 + 1 + 1) + 6) + (6 * (n + 1 + 1 + 1) + 6 + 6) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6)))) * 3 * (6 + 6 * (n + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1))))) + 3 * (6 + 6 * (n + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) + -10 == 0)) && -1 + n <= a) && (-10 + (-(10 * (6 + (n + 1) * 6 + (y + z) + (12 + (n + 1) * 6))) + (2 * (6 + (n + 1) * 6 + (y + z) + (12 + (n + 1) * 6)) * (6 + (n + 1) * 6 + (y + z) + (12 + (n + 1) * 6)) + -(3 * (6 + (n + 1) * 6 + (y + z) + (x + y + (y + z))) * (6 * (n + 1 + 1 + 1) + 6)) + -((6 + (n + 1) * 6 + (y + z) + (x + y + (y + z))) * 18)) + (6 * (n + 1 + 1 + 1) + 6) * 3) == 0 || !(6 + (n + 1) * 6 == 6 + z)))) || (((((((((((((((!(6 + (n + 1) * 6 == 6 + z) || -(10 * (6 * (n + 1 + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + 6 * (n + 1 + 1 + 1 + 1))))) + (2 * (6 * (n + 1 + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + 6 * (n + 1 + 1 + 1 + 1)))) * (6 * (n + 1 + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + 6 * (n + 1 + 1 + 1 + 1)))) + -((6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + 6 * (n + 1 + 1 + 1 + 1)) + (6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + (n + 1) * 6 + (y + z) + (x + y + (y + z)) + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z)))))) * 3 * (6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 6)) + -((6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + 6 * (n + 1 + 1 + 1 + 1)) + (6 * (n + 1 + 1 + 1) + 6 + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z))) + (6 + (n + 1) * 6 + (y + z) + (x + y + (y + z)) + (6 + (n + 1) * 6 + 6 + (6 + (n + 1) * 6 + (y + z)))))) * 18)) + 3 * (6 * (n + 1 + 1 + 1 + 1 + 1 + 1) + 6) + -10 == 0) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && (!(z == 6 + 6 * n) || -(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0)) && ((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10))) && (-10 + (2 * (y + z) * (y + z) + -((6 + (n + 1) * 6) * (3 * (x + y))) + -((x + y) * 18) + -((y + z) * 10) + (6 + (n + 1) * 6) * 3) == 0 || !(6 + (n + 1) * 6 == 6 + z))) && (!(6 + z + 6 == 6 + 6 * (n + 1 + 1)) || -((6 + z + (y + z) + (x + y + (y + z)) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))) + (6 * (n + 1 + 1 + 1) + 6 + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))))) * 18) + ((6 * (n + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))))) * (2 * (6 * (n + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)))))) + -((6 + (n + 1 + 1 + 1 + 1 + 1) * 6) * (3 * (6 + z + (y + z) + (x + y + (y + z)) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))) + (6 * (n + 1 + 1 + 1) + 6 + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)))))))) + -((6 * (n + 1 + 1 + 1) + 12 + (6 * (n + 1 + 1 + 1) + 6 + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))))) * 10) + 3 * (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + -10 == 0)) && (-((6 + (n + 1) * 6 + (y + z) + (6 + 6 * (n + 1 + 1)) + (12 + 6 * (n + 1 + 1))) * 10) + (-((6 + (n + 1) * 6 + (y + z) + (6 + 6 * (n + 1 + 1)) + (6 + (n + 1) * 6 + (y + z) + (x + y + (y + z)))) * 18) + (2 * (6 + (n + 1) * 6 + (y + z) + (6 + 6 * (n + 1 + 1)) + (12 + 6 * (n + 1 + 1))) * (6 + (n + 1) * 6 + (y + z) + (6 + 6 * (n + 1 + 1)) + (12 + 6 * (n + 1 + 1))) + -((6 + 6 * (n + 1 + 1 + 1 + 1)) * ((6 + (n + 1) * 6 + (y + z) + (6 + 6 * (n + 1 + 1)) + (6 + (n + 1) * 6 + (y + z) + (x + y + (y + z)))) * 3)))) + 3 * (6 + 6 * (n + 1 + 1 + 1 + 1)) + -10 == 0 || !(6 + (n + 1) * 6 == 6 + z))) && (!(6 + z + 6 == 6 + 6 * (n + 1 + 1)) || -10 + (3 * (6 * (n + 1 + 1 + 1 + 1 + 1 + 1 + 1) + 6) + (-((6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + ((n + 1 + 1 + 1 + 1 + 1) * 6 + 12)) * 10) + (-((6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + (6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + z + (y + z) + (x + y + (y + z)) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1))))))) * 18) + (-((6 * (n + 1 + 1 + 1 + 1 + 1 + 1 + 1) + 6) * (3 * (6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + (6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + z + (y + z) + (x + y + (y + z)) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z))) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1))))))))) + (6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + ((n + 1 + 1 + 1 + 1 + 1) * 6 + 12)) * ((6 + 6 * (n + 1 + 1 + 1 + 1) + (6 + 6 * (n + 1 + 1) + (6 + z + (y + z)) + (6 + (6 + 6 * (n + 1 + 1)))) + (6 + (n + 1 + 1 + 1 + 1 + 1) * 6) + ((n + 1 + 1 + 1 + 1 + 1) * 6 + 12)) * 2))))) == 0)) && z == 6 + 6 * n) && a >= 0) && a <= 10) && ((((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) || ((((19 + -1 * (-11 + 19) + 1 + 6 + 6 == z && x == 19 + (-11 + 19)) && (((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0)) || ((((((((((cond == 0 && (!(a <= 10) || !(a >= 0))) || ((cond == 1 && a >= 0) && a <= 10)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && a <= 10) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))))) && 2 + 1 == n) && 2 <= a))) && (-(10 * (y + z + (12 + 6 * n))) + (-(3 * (x + y + (y + z)) * (6 + 6 * (n + 1 + 1))) + 2 * (y + z + (12 + 6 * n)) * (y + z + (12 + 6 * n)) + -(18 * (x + y + (y + z)))) + 3 * (6 + 6 * (n + 1 + 1)) + -10 == 0 || !(6 + z == 12 + 6 * n))) && -1 + n <= a) && (-10 + (-(10 * (6 + (n + 1) * 6 + (y + z) + (12 + (n + 1) * 6))) + (2 * (6 + (n + 1) * 6 + (y + z) + (12 + (n + 1) * 6)) * (6 + (n + 1) * 6 + (y + z) + (12 + (n + 1) * 6)) + -(3 * (6 + (n + 1) * 6 + (y + z) + (x + y + (y + z))) * (6 * (n + 1 + 1 + 1) + 6)) + -((6 + (n + 1) * 6 + (y + z) + (x + y + (y + z))) * 18)) + (6 * (n + 1 + 1 + 1) + 6) * 3) == 0 || !(6 + (n + 1) * 6 == 6 + z))) RESULT: Ultimate proved your program to be correct! [2023-02-17 01:29:55,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE