./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0521.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0521.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 21:55:36,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 21:55:36,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 21:55:36,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 21:55:36,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 21:55:36,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 21:55:36,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 21:55:36,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 21:55:36,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 21:55:36,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 21:55:36,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 21:55:36,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 21:55:36,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 21:55:36,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 21:55:36,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 21:55:36,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 21:55:36,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 21:55:36,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 21:55:36,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 21:55:36,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 21:55:36,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 21:55:36,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 21:55:36,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 21:55:36,392 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 21:55:36,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 21:55:36,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 21:55:36,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 21:55:36,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 21:55:36,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 21:55:36,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 21:55:36,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 21:55:36,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 21:55:36,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 21:55:36,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 21:55:36,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 21:55:36,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 21:55:36,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 21:55:36,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 21:55:36,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 21:55:36,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 21:55:36,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 21:55:36,405 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 21:55:36,421 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 21:55:36,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 21:55:36,422 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 21:55:36,422 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 21:55:36,422 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 21:55:36,422 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 21:55:36,423 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 21:55:36,423 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 21:55:36,423 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 21:55:36,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 21:55:36,424 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 21:55:36,424 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 21:55:36,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 21:55:36,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 21:55:36,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 21:55:36,425 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 21:55:36,425 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 21:55:36,425 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 21:55:36,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 21:55:36,425 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 21:55:36,425 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 21:55:36,426 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 21:55:36,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 21:55:36,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 21:55:36,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 21:55:36,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:55:36,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 21:55:36,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 21:55:36,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 21:55:36,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 21:55:36,427 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 21:55:36,427 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 21:55:36,428 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 21:55:36,428 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 21:55:36,428 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 [2023-02-15 21:55:36,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 21:55:36,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 21:55:36,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 21:55:36,619 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 21:55:36,619 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 21:55:36,620 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0521.i [2023-02-15 21:55:37,528 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 21:55:37,716 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 21:55:37,717 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0521.i [2023-02-15 21:55:37,723 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6307b6f6b/972a8e11e9c0402e8427c72785e14557/FLAG7311e4ad3 [2023-02-15 21:55:37,749 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6307b6f6b/972a8e11e9c0402e8427c72785e14557 [2023-02-15 21:55:37,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 21:55:37,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 21:55:37,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 21:55:37,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 21:55:37,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 21:55:37,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:55:37" (1/1) ... [2023-02-15 21:55:37,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b2be00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:55:37, skipping insertion in model container [2023-02-15 21:55:37,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:55:37" (1/1) ... [2023-02-15 21:55:37,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 21:55:37,796 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 21:55:38,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:55:38,030 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 21:55:38,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:55:38,094 INFO L208 MainTranslator]: Completed translation [2023-02-15 21:55:38,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:55:38 WrapperNode [2023-02-15 21:55:38,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 21:55:38,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 21:55:38,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 21:55:38,096 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 21:55:38,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:55:38" (1/1) ... [2023-02-15 21:55:38,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:55:38" (1/1) ... [2023-02-15 21:55:38,137 INFO L138 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 305 [2023-02-15 21:55:38,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 21:55:38,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 21:55:38,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 21:55:38,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 21:55:38,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:55:38" (1/1) ... [2023-02-15 21:55:38,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:55:38" (1/1) ... [2023-02-15 21:55:38,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:55:38" (1/1) ... [2023-02-15 21:55:38,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:55:38" (1/1) ... [2023-02-15 21:55:38,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:55:38" (1/1) ... [2023-02-15 21:55:38,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:55:38" (1/1) ... [2023-02-15 21:55:38,184 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:55:38" (1/1) ... [2023-02-15 21:55:38,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:55:38" (1/1) ... [2023-02-15 21:55:38,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 21:55:38,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 21:55:38,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 21:55:38,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 21:55:38,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:55:38" (1/1) ... [2023-02-15 21:55:38,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:55:38,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:55:38,220 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-15 21:55:38,225 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-15 21:55:38,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 21:55:38,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 21:55:38,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 21:55:38,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 21:55:38,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 21:55:38,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 21:55:38,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 21:55:38,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 21:55:38,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 21:55:38,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 21:55:38,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 21:55:38,342 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 21:55:38,344 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 21:55:38,777 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 21:55:38,783 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 21:55:38,783 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2023-02-15 21:55:38,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:55:38 BoogieIcfgContainer [2023-02-15 21:55:38,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 21:55:38,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 21:55:38,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 21:55:38,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 21:55:38,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 09:55:37" (1/3) ... [2023-02-15 21:55:38,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3556ecf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:55:38, skipping insertion in model container [2023-02-15 21:55:38,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:55:38" (2/3) ... [2023-02-15 21:55:38,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3556ecf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:55:38, skipping insertion in model container [2023-02-15 21:55:38,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:55:38" (3/3) ... [2023-02-15 21:55:38,790 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0521.i [2023-02-15 21:55:38,800 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 21:55:38,800 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 152 error locations. [2023-02-15 21:55:38,828 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 21:55:38,832 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@52d66de2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 21:55:38,832 INFO L358 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2023-02-15 21:55:38,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 313 states, 160 states have (on average 2.1875) internal successors, (350), 312 states have internal predecessors, (350), 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-15 21:55:38,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 21:55:38,839 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:38,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 21:55:38,839 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:38,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:38,843 INFO L85 PathProgramCache]: Analyzing trace with hash 28729512, now seen corresponding path program 1 times [2023-02-15 21:55:38,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:38,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972394379] [2023-02-15 21:55:38,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:38,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:38,947 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-15 21:55:38,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:38,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972394379] [2023-02-15 21:55:38,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972394379] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:38,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:38,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:55:38,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153992538] [2023-02-15 21:55:38,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:38,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 21:55:38,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:38,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 21:55:38,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 21:55:38,975 INFO L87 Difference]: Start difference. First operand has 313 states, 160 states have (on average 2.1875) internal successors, (350), 312 states have internal predecessors, (350), 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-15 21:55:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:38,997 INFO L93 Difference]: Finished difference Result 313 states and 340 transitions. [2023-02-15 21:55:38,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 21:55:38,999 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 5 [2023-02-15 21:55:39,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:39,009 INFO L225 Difference]: With dead ends: 313 [2023-02-15 21:55:39,009 INFO L226 Difference]: Without dead ends: 311 [2023-02-15 21:55:39,010 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-15 21:55:39,013 INFO L413 NwaCegarLoop]: 340 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, 340 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-15 21:55:39,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:55:39,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-02-15 21:55:39,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2023-02-15 21:55:39,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 159 states have (on average 2.1257861635220126) internal successors, (338), 310 states have internal predecessors, (338), 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-15 21:55:39,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 338 transitions. [2023-02-15 21:55:39,044 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 338 transitions. Word has length 5 [2023-02-15 21:55:39,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:39,045 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 338 transitions. [2023-02-15 21:55:39,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-15 21:55:39,045 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 338 transitions. [2023-02-15 21:55:39,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 21:55:39,045 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:39,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 21:55:39,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 21:55:39,046 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:39,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:39,047 INFO L85 PathProgramCache]: Analyzing trace with hash 889570248, now seen corresponding path program 1 times [2023-02-15 21:55:39,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:39,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61698603] [2023-02-15 21:55:39,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:39,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:39,111 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-15 21:55:39,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:39,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61698603] [2023-02-15 21:55:39,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61698603] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:39,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:39,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:55:39,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590622927] [2023-02-15 21:55:39,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:39,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:55:39,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:39,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:55:39,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:55:39,115 INFO L87 Difference]: Start difference. First operand 311 states and 338 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-15 21:55:39,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:39,295 INFO L93 Difference]: Finished difference Result 295 states and 322 transitions. [2023-02-15 21:55:39,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:55:39,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2023-02-15 21:55:39,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:39,299 INFO L225 Difference]: With dead ends: 295 [2023-02-15 21:55:39,299 INFO L226 Difference]: Without dead ends: 295 [2023-02-15 21:55:39,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:55:39,303 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 77 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:39,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 406 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:55:39,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-02-15 21:55:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2023-02-15 21:55:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 159 states have (on average 2.0251572327044025) internal successors, (322), 294 states have internal predecessors, (322), 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-15 21:55:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 322 transitions. [2023-02-15 21:55:39,325 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 322 transitions. Word has length 6 [2023-02-15 21:55:39,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:39,326 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 322 transitions. [2023-02-15 21:55:39,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-15 21:55:39,327 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 322 transitions. [2023-02-15 21:55:39,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 21:55:39,327 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:39,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 21:55:39,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 21:55:39,328 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:39,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:39,329 INFO L85 PathProgramCache]: Analyzing trace with hash 889570249, now seen corresponding path program 1 times [2023-02-15 21:55:39,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:39,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34115653] [2023-02-15 21:55:39,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:39,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:39,436 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-15 21:55:39,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:39,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34115653] [2023-02-15 21:55:39,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34115653] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:39,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:39,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:55:39,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868302566] [2023-02-15 21:55:39,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:39,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:55:39,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:39,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:55:39,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:55:39,439 INFO L87 Difference]: Start difference. First operand 295 states and 322 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-15 21:55:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:39,590 INFO L93 Difference]: Finished difference Result 279 states and 306 transitions. [2023-02-15 21:55:39,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:55:39,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2023-02-15 21:55:39,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:39,592 INFO L225 Difference]: With dead ends: 279 [2023-02-15 21:55:39,592 INFO L226 Difference]: Without dead ends: 279 [2023-02-15 21:55:39,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:55:39,611 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 61 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:39,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 415 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:55:39,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-02-15 21:55:39,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2023-02-15 21:55:39,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 159 states have (on average 1.9245283018867925) internal successors, (306), 278 states have internal predecessors, (306), 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-15 21:55:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 306 transitions. [2023-02-15 21:55:39,625 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 306 transitions. Word has length 6 [2023-02-15 21:55:39,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:39,625 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 306 transitions. [2023-02-15 21:55:39,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-15 21:55:39,625 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 306 transitions. [2023-02-15 21:55:39,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 21:55:39,626 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:39,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 21:55:39,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 21:55:39,626 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:39,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:39,627 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2023-02-15 21:55:39,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:39,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382238789] [2023-02-15 21:55:39,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:39,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:39,669 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-15 21:55:39,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:39,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382238789] [2023-02-15 21:55:39,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382238789] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:39,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:39,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:55:39,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112911355] [2023-02-15 21:55:39,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:39,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:55:39,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:39,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:55:39,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:55:39,671 INFO L87 Difference]: Start difference. First operand 279 states and 306 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-15 21:55:39,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:39,829 INFO L93 Difference]: Finished difference Result 334 states and 370 transitions. [2023-02-15 21:55:39,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:55:39,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2023-02-15 21:55:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:39,830 INFO L225 Difference]: With dead ends: 334 [2023-02-15 21:55:39,830 INFO L226 Difference]: Without dead ends: 334 [2023-02-15 21:55:39,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:55:39,835 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 76 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:39,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 481 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:55:39,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-02-15 21:55:39,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 277. [2023-02-15 21:55:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 159 states have (on average 1.9119496855345912) internal successors, (304), 276 states have internal predecessors, (304), 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-15 21:55:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 304 transitions. [2023-02-15 21:55:39,840 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 304 transitions. Word has length 6 [2023-02-15 21:55:39,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:39,841 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 304 transitions. [2023-02-15 21:55:39,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-15 21:55:39,841 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 304 transitions. [2023-02-15 21:55:39,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 21:55:39,841 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:39,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 21:55:39,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 21:55:39,842 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:39,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:39,842 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2023-02-15 21:55:39,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:39,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350231354] [2023-02-15 21:55:39,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:39,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:39,897 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-15 21:55:39,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:39,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350231354] [2023-02-15 21:55:39,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350231354] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:39,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:39,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:55:39,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244772461] [2023-02-15 21:55:39,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:39,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:55:39,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:39,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:55:39,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:55:39,899 INFO L87 Difference]: Start difference. First operand 277 states and 304 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-15 21:55:40,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:40,087 INFO L93 Difference]: Finished difference Result 466 states and 515 transitions. [2023-02-15 21:55:40,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:55:40,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2023-02-15 21:55:40,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:40,089 INFO L225 Difference]: With dead ends: 466 [2023-02-15 21:55:40,089 INFO L226 Difference]: Without dead ends: 466 [2023-02-15 21:55:40,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:55:40,089 INFO L413 NwaCegarLoop]: 415 mSDtfsCounter, 220 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:40,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 579 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:55:40,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2023-02-15 21:55:40,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 275. [2023-02-15 21:55:40,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 159 states have (on average 1.89937106918239) internal successors, (302), 274 states have internal predecessors, (302), 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-15 21:55:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 302 transitions. [2023-02-15 21:55:40,095 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 302 transitions. Word has length 6 [2023-02-15 21:55:40,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:40,095 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 302 transitions. [2023-02-15 21:55:40,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-15 21:55:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 302 transitions. [2023-02-15 21:55:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 21:55:40,096 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:40,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:40,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 21:55:40,099 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:40,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:40,099 INFO L85 PathProgramCache]: Analyzing trace with hash 178517033, now seen corresponding path program 1 times [2023-02-15 21:55:40,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:40,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76627355] [2023-02-15 21:55:40,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:40,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:40,133 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-15 21:55:40,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:40,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76627355] [2023-02-15 21:55:40,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76627355] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:40,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:40,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:55:40,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419464692] [2023-02-15 21:55:40,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:40,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:55:40,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:40,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:55:40,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:55:40,135 INFO L87 Difference]: Start difference. First operand 275 states and 302 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-15 21:55:40,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:40,170 INFO L93 Difference]: Finished difference Result 678 states and 747 transitions. [2023-02-15 21:55:40,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 21:55:40,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) Word has length 8 [2023-02-15 21:55:40,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:40,172 INFO L225 Difference]: With dead ends: 678 [2023-02-15 21:55:40,173 INFO L226 Difference]: Without dead ends: 678 [2023-02-15 21:55:40,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:55:40,173 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 597 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:40,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 870 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:55:40,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2023-02-15 21:55:40,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 280. [2023-02-15 21:55:40,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 164 states have (on average 1.8780487804878048) internal successors, (308), 279 states have internal predecessors, (308), 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-15 21:55:40,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 308 transitions. [2023-02-15 21:55:40,178 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 308 transitions. Word has length 8 [2023-02-15 21:55:40,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:40,178 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 308 transitions. [2023-02-15 21:55:40,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-15 21:55:40,179 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 308 transitions. [2023-02-15 21:55:40,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 21:55:40,179 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:40,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:40,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 21:55:40,179 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:40,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:40,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2119660206, now seen corresponding path program 1 times [2023-02-15 21:55:40,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:40,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034717381] [2023-02-15 21:55:40,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:40,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:40,229 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-15 21:55:40,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:40,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034717381] [2023-02-15 21:55:40,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034717381] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:40,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:40,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:55:40,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701673821] [2023-02-15 21:55:40,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:40,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:55:40,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:40,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:55:40,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:55:40,231 INFO L87 Difference]: Start difference. First operand 280 states and 308 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-15 21:55:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:40,366 INFO L93 Difference]: Finished difference Result 330 states and 365 transitions. [2023-02-15 21:55:40,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:55:40,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) Word has length 11 [2023-02-15 21:55:40,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:40,367 INFO L225 Difference]: With dead ends: 330 [2023-02-15 21:55:40,367 INFO L226 Difference]: Without dead ends: 330 [2023-02-15 21:55:40,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:55:40,368 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 72 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:40,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 476 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:55:40,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2023-02-15 21:55:40,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 278. [2023-02-15 21:55:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 164 states have (on average 1.8658536585365855) internal successors, (306), 277 states have internal predecessors, (306), 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-15 21:55:40,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 306 transitions. [2023-02-15 21:55:40,372 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 306 transitions. Word has length 11 [2023-02-15 21:55:40,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:40,372 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 306 transitions. [2023-02-15 21:55:40,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-15 21:55:40,372 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 306 transitions. [2023-02-15 21:55:40,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 21:55:40,372 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:40,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:40,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 21:55:40,373 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:40,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:40,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2119660205, now seen corresponding path program 1 times [2023-02-15 21:55:40,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:40,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202733555] [2023-02-15 21:55:40,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:40,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:40,408 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-15 21:55:40,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:40,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202733555] [2023-02-15 21:55:40,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202733555] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:40,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:40,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:55:40,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572099993] [2023-02-15 21:55:40,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:40,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:55:40,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:40,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:55:40,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:55:40,410 INFO L87 Difference]: Start difference. First operand 278 states and 306 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-15 21:55:40,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:40,585 INFO L93 Difference]: Finished difference Result 462 states and 510 transitions. [2023-02-15 21:55:40,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:55:40,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) Word has length 11 [2023-02-15 21:55:40,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:40,587 INFO L225 Difference]: With dead ends: 462 [2023-02-15 21:55:40,587 INFO L226 Difference]: Without dead ends: 462 [2023-02-15 21:55:40,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:55:40,588 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 216 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:40,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 574 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:55:40,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2023-02-15 21:55:40,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 276. [2023-02-15 21:55:40,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 164 states have (on average 1.853658536585366) internal successors, (304), 275 states have internal predecessors, (304), 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-15 21:55:40,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 304 transitions. [2023-02-15 21:55:40,592 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 304 transitions. Word has length 11 [2023-02-15 21:55:40,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:40,592 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 304 transitions. [2023-02-15 21:55:40,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-15 21:55:40,592 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 304 transitions. [2023-02-15 21:55:40,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 21:55:40,593 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:40,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:40,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 21:55:40,593 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:40,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:40,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1231388841, now seen corresponding path program 1 times [2023-02-15 21:55:40,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:40,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047376123] [2023-02-15 21:55:40,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:40,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:40,660 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-15 21:55:40,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:40,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047376123] [2023-02-15 21:55:40,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047376123] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:40,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:40,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 21:55:40,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788223844] [2023-02-15 21:55:40,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:40,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:55:40,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:40,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:55:40,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:55:40,662 INFO L87 Difference]: Start difference. First operand 276 states and 304 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-15 21:55:40,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:40,827 INFO L93 Difference]: Finished difference Result 666 states and 735 transitions. [2023-02-15 21:55:40,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 21:55:40,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) Word has length 13 [2023-02-15 21:55:40,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:40,829 INFO L225 Difference]: With dead ends: 666 [2023-02-15 21:55:40,829 INFO L226 Difference]: Without dead ends: 666 [2023-02-15 21:55:40,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 21:55:40,830 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 585 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:40,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 1363 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:55:40,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2023-02-15 21:55:40,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 279. [2023-02-15 21:55:40,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 167 states have (on average 1.8383233532934131) internal successors, (307), 278 states have internal predecessors, (307), 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-15 21:55:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 307 transitions. [2023-02-15 21:55:40,835 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 307 transitions. Word has length 13 [2023-02-15 21:55:40,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:40,835 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 307 transitions. [2023-02-15 21:55:40,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-15 21:55:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 307 transitions. [2023-02-15 21:55:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 21:55:40,836 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:40,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:40,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 21:55:40,836 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:40,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:40,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2035528525, now seen corresponding path program 1 times [2023-02-15 21:55:40,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:40,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244898408] [2023-02-15 21:55:40,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:40,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:40,876 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-15 21:55:40,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:40,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244898408] [2023-02-15 21:55:40,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244898408] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:40,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:40,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 21:55:40,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299214922] [2023-02-15 21:55:40,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:40,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:55:40,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:40,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:55:40,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:55:40,878 INFO L87 Difference]: Start difference. First operand 279 states and 307 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-15 21:55:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:40,938 INFO L93 Difference]: Finished difference Result 408 states and 447 transitions. [2023-02-15 21:55:40,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 21:55:40,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) Word has length 15 [2023-02-15 21:55:40,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:40,940 INFO L225 Difference]: With dead ends: 408 [2023-02-15 21:55:40,940 INFO L226 Difference]: Without dead ends: 408 [2023-02-15 21:55:40,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:55:40,940 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 240 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:40,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1120 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:55:40,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2023-02-15 21:55:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 343. [2023-02-15 21:55:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 231 states have (on average 1.8831168831168832) internal successors, (435), 342 states have internal predecessors, (435), 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-15 21:55:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 435 transitions. [2023-02-15 21:55:40,944 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 435 transitions. Word has length 15 [2023-02-15 21:55:40,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:40,945 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 435 transitions. [2023-02-15 21:55:40,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-15 21:55:40,945 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 435 transitions. [2023-02-15 21:55:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 21:55:40,945 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:40,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:40,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 21:55:40,946 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:40,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:40,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1316385230, now seen corresponding path program 1 times [2023-02-15 21:55:40,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:40,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875170162] [2023-02-15 21:55:40,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:40,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:40,962 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-15 21:55:40,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:40,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875170162] [2023-02-15 21:55:40,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875170162] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:40,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:40,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:55:40,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941519723] [2023-02-15 21:55:40,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:40,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:55:40,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:40,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:55:40,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:55:40,964 INFO L87 Difference]: Start difference. First operand 343 states and 435 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-15 21:55:40,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:40,972 INFO L93 Difference]: Finished difference Result 328 states and 410 transitions. [2023-02-15 21:55:40,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:55:40,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) Word has length 16 [2023-02-15 21:55:40,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:40,973 INFO L225 Difference]: With dead ends: 328 [2023-02-15 21:55:40,973 INFO L226 Difference]: Without dead ends: 328 [2023-02-15 21:55:40,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:55:40,974 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 223 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:40,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 363 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:55:40,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-02-15 21:55:40,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2023-02-15 21:55:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 216 states have (on average 1.8981481481481481) internal successors, (410), 327 states have internal predecessors, (410), 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-15 21:55:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 410 transitions. [2023-02-15 21:55:40,978 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 410 transitions. Word has length 16 [2023-02-15 21:55:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:40,978 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 410 transitions. [2023-02-15 21:55:40,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-15 21:55:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 410 transitions. [2023-02-15 21:55:40,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 21:55:40,978 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:40,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:40,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 21:55:40,979 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:40,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:40,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1932989585, now seen corresponding path program 1 times [2023-02-15 21:55:40,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:40,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216099717] [2023-02-15 21:55:40,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:40,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:40,997 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-15 21:55:40,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:40,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216099717] [2023-02-15 21:55:40,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216099717] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:40,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:40,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:55:40,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804018132] [2023-02-15 21:55:40,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:40,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:55:40,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:40,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:55:40,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:55:40,999 INFO L87 Difference]: Start difference. First operand 328 states and 410 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-15 21:55:41,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:41,111 INFO L93 Difference]: Finished difference Result 312 states and 378 transitions. [2023-02-15 21:55:41,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:55:41,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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) Word has length 17 [2023-02-15 21:55:41,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:41,112 INFO L225 Difference]: With dead ends: 312 [2023-02-15 21:55:41,112 INFO L226 Difference]: Without dead ends: 312 [2023-02-15 21:55:41,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:55:41,113 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 77 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:41,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 346 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:55:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-02-15 21:55:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2023-02-15 21:55:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 216 states have (on average 1.75) internal successors, (378), 311 states have internal predecessors, (378), 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-15 21:55:41,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 378 transitions. [2023-02-15 21:55:41,116 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 378 transitions. Word has length 17 [2023-02-15 21:55:41,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:41,117 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 378 transitions. [2023-02-15 21:55:41,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-15 21:55:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 378 transitions. [2023-02-15 21:55:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 21:55:41,117 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:41,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:41,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 21:55:41,118 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:41,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:41,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1932989586, now seen corresponding path program 1 times [2023-02-15 21:55:41,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:41,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305674918] [2023-02-15 21:55:41,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:41,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:41,146 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-15 21:55:41,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:41,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305674918] [2023-02-15 21:55:41,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305674918] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:41,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:41,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:55:41,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988578247] [2023-02-15 21:55:41,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:41,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:55:41,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:41,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:55:41,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:55:41,148 INFO L87 Difference]: Start difference. First operand 312 states and 378 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-15 21:55:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:41,251 INFO L93 Difference]: Finished difference Result 296 states and 346 transitions. [2023-02-15 21:55:41,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:55:41,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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) Word has length 17 [2023-02-15 21:55:41,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:41,253 INFO L225 Difference]: With dead ends: 296 [2023-02-15 21:55:41,253 INFO L226 Difference]: Without dead ends: 296 [2023-02-15 21:55:41,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:55:41,253 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 61 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:41,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 355 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:55:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-02-15 21:55:41,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2023-02-15 21:55:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 216 states have (on average 1.6018518518518519) internal successors, (346), 295 states have internal predecessors, (346), 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-15 21:55:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 346 transitions. [2023-02-15 21:55:41,257 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 346 transitions. Word has length 17 [2023-02-15 21:55:41,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:41,257 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 346 transitions. [2023-02-15 21:55:41,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-15 21:55:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 346 transitions. [2023-02-15 21:55:41,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 21:55:41,258 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:41,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:41,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 21:55:41,258 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:41,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:41,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2117838446, now seen corresponding path program 1 times [2023-02-15 21:55:41,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:41,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060227932] [2023-02-15 21:55:41,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:41,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:41,309 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-15 21:55:41,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:41,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060227932] [2023-02-15 21:55:41,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060227932] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:41,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:41,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 21:55:41,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731447943] [2023-02-15 21:55:41,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:41,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:55:41,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:41,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:55:41,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:55:41,311 INFO L87 Difference]: Start difference. First operand 296 states and 346 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-15 21:55:41,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:41,379 INFO L93 Difference]: Finished difference Result 394 states and 436 transitions. [2023-02-15 21:55:41,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 21:55:41,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) Word has length 19 [2023-02-15 21:55:41,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:41,381 INFO L225 Difference]: With dead ends: 394 [2023-02-15 21:55:41,381 INFO L226 Difference]: Without dead ends: 394 [2023-02-15 21:55:41,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:55:41,382 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 278 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:41,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 994 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:55:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-02-15 21:55:41,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 293. [2023-02-15 21:55:41,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 213 states have (on average 1.596244131455399) internal successors, (340), 292 states have internal predecessors, (340), 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-15 21:55:41,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 340 transitions. [2023-02-15 21:55:41,386 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 340 transitions. Word has length 19 [2023-02-15 21:55:41,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:41,386 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 340 transitions. [2023-02-15 21:55:41,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-15 21:55:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 340 transitions. [2023-02-15 21:55:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 21:55:41,387 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:41,387 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:41,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 21:55:41,387 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:41,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:41,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1413279430, now seen corresponding path program 1 times [2023-02-15 21:55:41,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:41,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989484984] [2023-02-15 21:55:41,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:41,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:55:41,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:41,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989484984] [2023-02-15 21:55:41,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989484984] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:41,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:41,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 21:55:41,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005628437] [2023-02-15 21:55:41,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:41,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:55:41,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:41,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:55:41,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:55:41,481 INFO L87 Difference]: Start difference. First operand 293 states and 340 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-15 21:55:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:41,667 INFO L93 Difference]: Finished difference Result 316 states and 364 transitions. [2023-02-15 21:55:41,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 21:55:41,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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) Word has length 19 [2023-02-15 21:55:41,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:41,668 INFO L225 Difference]: With dead ends: 316 [2023-02-15 21:55:41,668 INFO L226 Difference]: Without dead ends: 316 [2023-02-15 21:55:41,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:55:41,669 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 270 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:41,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 557 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:55:41,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-02-15 21:55:41,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 295. [2023-02-15 21:55:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 217 states have (on average 1.5898617511520738) internal successors, (345), 294 states have internal predecessors, (345), 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-15 21:55:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 345 transitions. [2023-02-15 21:55:41,672 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 345 transitions. Word has length 19 [2023-02-15 21:55:41,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:41,673 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 345 transitions. [2023-02-15 21:55:41,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-15 21:55:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 345 transitions. [2023-02-15 21:55:41,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 21:55:41,673 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:41,673 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:41,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 21:55:41,674 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:41,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:41,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1413279429, now seen corresponding path program 1 times [2023-02-15 21:55:41,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:41,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571459828] [2023-02-15 21:55:41,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:41,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:55:41,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:41,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571459828] [2023-02-15 21:55:41,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571459828] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:41,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:41,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:55:41,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022173115] [2023-02-15 21:55:41,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:41,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:55:41,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:41,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:55:41,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:55:41,785 INFO L87 Difference]: Start difference. First operand 295 states and 345 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-15 21:55:42,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:42,041 INFO L93 Difference]: Finished difference Result 409 states and 475 transitions. [2023-02-15 21:55:42,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 21:55:42,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) Word has length 19 [2023-02-15 21:55:42,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:42,042 INFO L225 Difference]: With dead ends: 409 [2023-02-15 21:55:42,042 INFO L226 Difference]: Without dead ends: 409 [2023-02-15 21:55:42,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:55:42,043 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 437 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:42,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 647 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:55:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-02-15 21:55:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 294. [2023-02-15 21:55:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 217 states have (on average 1.5852534562211982) internal successors, (344), 293 states have internal predecessors, (344), 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-15 21:55:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 344 transitions. [2023-02-15 21:55:42,049 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 344 transitions. Word has length 19 [2023-02-15 21:55:42,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:42,049 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 344 transitions. [2023-02-15 21:55:42,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-15 21:55:42,049 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 344 transitions. [2023-02-15 21:55:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 21:55:42,049 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:42,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:42,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 21:55:42,050 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:42,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:42,050 INFO L85 PathProgramCache]: Analyzing trace with hash -805519643, now seen corresponding path program 1 times [2023-02-15 21:55:42,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:42,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289883612] [2023-02-15 21:55:42,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:42,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:42,168 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-15 21:55:42,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:42,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289883612] [2023-02-15 21:55:42,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289883612] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:42,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:42,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 21:55:42,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882451386] [2023-02-15 21:55:42,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:42,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 21:55:42,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:42,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 21:55:42,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:55:42,170 INFO L87 Difference]: Start difference. First operand 294 states and 344 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-15 21:55:42,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:42,346 INFO L93 Difference]: Finished difference Result 394 states and 442 transitions. [2023-02-15 21:55:42,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 21:55:42,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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) Word has length 24 [2023-02-15 21:55:42,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:42,348 INFO L225 Difference]: With dead ends: 394 [2023-02-15 21:55:42,348 INFO L226 Difference]: Without dead ends: 394 [2023-02-15 21:55:42,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-02-15 21:55:42,348 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 265 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:42,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 1409 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:55:42,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-02-15 21:55:42,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 280. [2023-02-15 21:55:42,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 203 states have (on average 1.5812807881773399) internal successors, (321), 279 states have internal predecessors, (321), 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-15 21:55:42,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 321 transitions. [2023-02-15 21:55:42,352 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 321 transitions. Word has length 24 [2023-02-15 21:55:42,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:42,352 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 321 transitions. [2023-02-15 21:55:42,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-15 21:55:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 321 transitions. [2023-02-15 21:55:42,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 21:55:42,352 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:42,352 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:42,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 21:55:42,352 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:42,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:42,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1972902682, now seen corresponding path program 1 times [2023-02-15 21:55:42,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:42,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913601964] [2023-02-15 21:55:42,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:42,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:42,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:55:42,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:42,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913601964] [2023-02-15 21:55:42,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913601964] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:42,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:42,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 21:55:42,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864213154] [2023-02-15 21:55:42,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:42,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:55:42,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:42,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:55:42,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:55:42,389 INFO L87 Difference]: Start difference. First operand 280 states and 321 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-15 21:55:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:42,427 INFO L93 Difference]: Finished difference Result 298 states and 331 transitions. [2023-02-15 21:55:42,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 21:55:42,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) Word has length 24 [2023-02-15 21:55:42,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:42,428 INFO L225 Difference]: With dead ends: 298 [2023-02-15 21:55:42,428 INFO L226 Difference]: Without dead ends: 298 [2023-02-15 21:55:42,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:55:42,429 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 667 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:42,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 560 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:55:42,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-02-15 21:55:42,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 280. [2023-02-15 21:55:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 203 states have (on average 1.5763546798029557) internal successors, (320), 279 states have internal predecessors, (320), 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-15 21:55:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 320 transitions. [2023-02-15 21:55:42,432 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 320 transitions. Word has length 24 [2023-02-15 21:55:42,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:42,433 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 320 transitions. [2023-02-15 21:55:42,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-15 21:55:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 320 transitions. [2023-02-15 21:55:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 21:55:42,433 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:42,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:42,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 21:55:42,433 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr151ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:42,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:42,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1021020451, now seen corresponding path program 1 times [2023-02-15 21:55:42,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:42,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255632671] [2023-02-15 21:55:42,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:42,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:55:42,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:42,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255632671] [2023-02-15 21:55:42,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255632671] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:42,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:42,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:55:42,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036595384] [2023-02-15 21:55:42,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:42,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:55:42,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:42,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:55:42,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:55:42,512 INFO L87 Difference]: Start difference. First operand 280 states and 320 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-15 21:55:42,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:42,695 INFO L93 Difference]: Finished difference Result 288 states and 321 transitions. [2023-02-15 21:55:42,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 21:55:42,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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) Word has length 26 [2023-02-15 21:55:42,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:42,696 INFO L225 Difference]: With dead ends: 288 [2023-02-15 21:55:42,696 INFO L226 Difference]: Without dead ends: 284 [2023-02-15 21:55:42,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:55:42,697 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 26 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:42,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 663 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:55:42,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-02-15 21:55:42,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 278. [2023-02-15 21:55:42,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 201 states have (on average 1.5771144278606966) internal successors, (317), 277 states have internal predecessors, (317), 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-15 21:55:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 317 transitions. [2023-02-15 21:55:42,700 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 317 transitions. Word has length 26 [2023-02-15 21:55:42,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:42,700 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 317 transitions. [2023-02-15 21:55:42,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-15 21:55:42,700 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 317 transitions. [2023-02-15 21:55:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 21:55:42,700 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:42,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:42,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-15 21:55:42,700 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr123REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:42,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:42,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1580222949, now seen corresponding path program 1 times [2023-02-15 21:55:42,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:42,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682365202] [2023-02-15 21:55:42,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:42,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:42,729 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-15 21:55:42,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:42,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682365202] [2023-02-15 21:55:42,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682365202] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:42,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:42,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:55:42,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250607194] [2023-02-15 21:55:42,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:42,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:55:42,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:42,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:55:42,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:55:42,731 INFO L87 Difference]: Start difference. First operand 278 states and 317 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-15 21:55:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:42,739 INFO L93 Difference]: Finished difference Result 263 states and 292 transitions. [2023-02-15 21:55:42,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:55:42,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) Word has length 27 [2023-02-15 21:55:42,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:42,740 INFO L225 Difference]: With dead ends: 263 [2023-02-15 21:55:42,740 INFO L226 Difference]: Without dead ends: 245 [2023-02-15 21:55:42,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:55:42,741 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 31 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:42,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 485 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:55:42,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-02-15 21:55:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2023-02-15 21:55:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 168 states have (on average 1.630952380952381) internal successors, (274), 244 states have internal predecessors, (274), 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-15 21:55:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 274 transitions. [2023-02-15 21:55:42,746 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 274 transitions. Word has length 27 [2023-02-15 21:55:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:42,746 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 274 transitions. [2023-02-15 21:55:42,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-15 21:55:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2023-02-15 21:55:42,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 21:55:42,747 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:42,747 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:42,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-15 21:55:42,747 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:42,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:42,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1161321696, now seen corresponding path program 1 times [2023-02-15 21:55:42,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:42,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920402652] [2023-02-15 21:55:42,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:42,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:55:43,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:43,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920402652] [2023-02-15 21:55:43,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920402652] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:43,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:43,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 21:55:43,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871564246] [2023-02-15 21:55:43,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:43,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 21:55:43,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:43,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 21:55:43,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-02-15 21:55:43,025 INFO L87 Difference]: Start difference. First operand 245 states and 274 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 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-15 21:55:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:43,637 INFO L93 Difference]: Finished difference Result 251 states and 280 transitions. [2023-02-15 21:55:43,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 21:55:43,638 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 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) Word has length 27 [2023-02-15 21:55:43,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:43,639 INFO L225 Difference]: With dead ends: 251 [2023-02-15 21:55:43,639 INFO L226 Difference]: Without dead ends: 251 [2023-02-15 21:55:43,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2023-02-15 21:55:43,639 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 289 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:43,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1314 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 21:55:43,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-02-15 21:55:43,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 244. [2023-02-15 21:55:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 168 states have (on average 1.625) internal successors, (273), 243 states have internal predecessors, (273), 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-15 21:55:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 273 transitions. [2023-02-15 21:55:43,653 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 273 transitions. Word has length 27 [2023-02-15 21:55:43,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:43,654 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 273 transitions. [2023-02-15 21:55:43,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 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-15 21:55:43,654 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 273 transitions. [2023-02-15 21:55:43,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 21:55:43,654 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:43,654 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:43,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 21:55:43,654 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:43,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:43,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1161321697, now seen corresponding path program 1 times [2023-02-15 21:55:43,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:43,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585182860] [2023-02-15 21:55:43,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:43,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:55:44,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:44,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585182860] [2023-02-15 21:55:44,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585182860] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:44,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:44,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 21:55:44,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120490526] [2023-02-15 21:55:44,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:44,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 21:55:44,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:44,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 21:55:44,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-02-15 21:55:44,026 INFO L87 Difference]: Start difference. First operand 244 states and 273 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 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-15 21:55:45,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:45,117 INFO L93 Difference]: Finished difference Result 397 states and 450 transitions. [2023-02-15 21:55:45,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 21:55:45,119 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 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) Word has length 27 [2023-02-15 21:55:45,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:45,120 INFO L225 Difference]: With dead ends: 397 [2023-02-15 21:55:45,120 INFO L226 Difference]: Without dead ends: 397 [2023-02-15 21:55:45,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2023-02-15 21:55:45,121 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 875 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 1825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:45,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 1653 Invalid, 1825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 21:55:45,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-02-15 21:55:45,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 243. [2023-02-15 21:55:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 168 states have (on average 1.619047619047619) internal successors, (272), 242 states have internal predecessors, (272), 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-15 21:55:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 272 transitions. [2023-02-15 21:55:45,124 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 272 transitions. Word has length 27 [2023-02-15 21:55:45,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:45,124 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 272 transitions. [2023-02-15 21:55:45,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 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-15 21:55:45,124 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 272 transitions. [2023-02-15 21:55:45,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 21:55:45,125 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:45,125 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:45,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-15 21:55:45,126 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:45,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:45,126 INFO L85 PathProgramCache]: Analyzing trace with hash -672116074, now seen corresponding path program 1 times [2023-02-15 21:55:45,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:45,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390318044] [2023-02-15 21:55:45,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:45,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:55:45,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:45,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390318044] [2023-02-15 21:55:45,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390318044] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:45,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:45,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 21:55:45,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761331168] [2023-02-15 21:55:45,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:45,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 21:55:45,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:45,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 21:55:45,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:55:45,206 INFO L87 Difference]: Start difference. First operand 243 states and 272 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-15 21:55:45,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:45,338 INFO L93 Difference]: Finished difference Result 269 states and 300 transitions. [2023-02-15 21:55:45,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 21:55:45,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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) Word has length 29 [2023-02-15 21:55:45,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:45,339 INFO L225 Difference]: With dead ends: 269 [2023-02-15 21:55:45,339 INFO L226 Difference]: Without dead ends: 269 [2023-02-15 21:55:45,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-02-15 21:55:45,340 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 743 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:45,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 768 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:55:45,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-02-15 21:55:45,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 243. [2023-02-15 21:55:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 168 states have (on average 1.6130952380952381) internal successors, (271), 242 states have internal predecessors, (271), 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-15 21:55:45,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 271 transitions. [2023-02-15 21:55:45,342 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 271 transitions. Word has length 29 [2023-02-15 21:55:45,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:45,342 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 271 transitions. [2023-02-15 21:55:45,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-15 21:55:45,343 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 271 transitions. [2023-02-15 21:55:45,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 21:55:45,343 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:45,343 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:45,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-15 21:55:45,343 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:45,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:45,343 INFO L85 PathProgramCache]: Analyzing trace with hash 102015914, now seen corresponding path program 1 times [2023-02-15 21:55:45,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:45,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515522873] [2023-02-15 21:55:45,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:45,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 21:55:45,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:45,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515522873] [2023-02-15 21:55:45,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515522873] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:45,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:45,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:55:45,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496733981] [2023-02-15 21:55:45,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:45,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:55:45,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:45,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:55:45,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:55:45,451 INFO L87 Difference]: Start difference. First operand 243 states and 271 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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-15 21:55:45,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:45,614 INFO L93 Difference]: Finished difference Result 259 states and 290 transitions. [2023-02-15 21:55:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 21:55:45,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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) Word has length 31 [2023-02-15 21:55:45,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:45,615 INFO L225 Difference]: With dead ends: 259 [2023-02-15 21:55:45,615 INFO L226 Difference]: Without dead ends: 259 [2023-02-15 21:55:45,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:55:45,615 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 52 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:45,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 673 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:55:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-02-15 21:55:45,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 242. [2023-02-15 21:55:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 168 states have (on average 1.6071428571428572) internal successors, (270), 241 states have internal predecessors, (270), 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-15 21:55:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 270 transitions. [2023-02-15 21:55:45,618 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 270 transitions. Word has length 31 [2023-02-15 21:55:45,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:45,618 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 270 transitions. [2023-02-15 21:55:45,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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-15 21:55:45,618 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 270 transitions. [2023-02-15 21:55:45,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 21:55:45,618 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:45,618 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:45,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-15 21:55:45,618 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:45,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:45,619 INFO L85 PathProgramCache]: Analyzing trace with hash 102015915, now seen corresponding path program 1 times [2023-02-15 21:55:45,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:45,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564546420] [2023-02-15 21:55:45,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:45,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:45,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:55:45,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:45,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564546420] [2023-02-15 21:55:45,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564546420] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:45,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:45,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 21:55:45,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949332982] [2023-02-15 21:55:45,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:45,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 21:55:45,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:45,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 21:55:45,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 21:55:45,895 INFO L87 Difference]: Start difference. First operand 242 states and 270 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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-15 21:55:46,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:46,343 INFO L93 Difference]: Finished difference Result 374 states and 421 transitions. [2023-02-15 21:55:46,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:55:46,345 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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) Word has length 31 [2023-02-15 21:55:46,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:46,345 INFO L225 Difference]: With dead ends: 374 [2023-02-15 21:55:46,346 INFO L226 Difference]: Without dead ends: 374 [2023-02-15 21:55:46,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2023-02-15 21:55:46,346 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 564 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:46,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 947 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 21:55:46,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-02-15 21:55:46,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 241. [2023-02-15 21:55:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 168 states have (on average 1.6011904761904763) internal successors, (269), 240 states have internal predecessors, (269), 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-15 21:55:46,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 269 transitions. [2023-02-15 21:55:46,349 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 269 transitions. Word has length 31 [2023-02-15 21:55:46,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:46,349 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 269 transitions. [2023-02-15 21:55:46,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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-15 21:55:46,349 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 269 transitions. [2023-02-15 21:55:46,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 21:55:46,349 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:46,350 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:46,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-15 21:55:46,350 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:46,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:46,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1705778921, now seen corresponding path program 1 times [2023-02-15 21:55:46,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:46,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660934145] [2023-02-15 21:55:46,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:46,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:55:46,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:46,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660934145] [2023-02-15 21:55:46,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660934145] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:46,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:46,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 21:55:46,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509571865] [2023-02-15 21:55:46,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:46,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 21:55:46,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:46,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 21:55:46,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:55:46,438 INFO L87 Difference]: Start difference. First operand 241 states and 269 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 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-15 21:55:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:46,759 INFO L93 Difference]: Finished difference Result 398 states and 443 transitions. [2023-02-15 21:55:46,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 21:55:46,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 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) Word has length 34 [2023-02-15 21:55:46,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:46,760 INFO L225 Difference]: With dead ends: 398 [2023-02-15 21:55:46,760 INFO L226 Difference]: Without dead ends: 398 [2023-02-15 21:55:46,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-15 21:55:46,760 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 527 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:46,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 625 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 21:55:46,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2023-02-15 21:55:46,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 244. [2023-02-15 21:55:46,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 173 states have (on average 1.5953757225433527) internal successors, (276), 243 states have internal predecessors, (276), 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-15 21:55:46,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 276 transitions. [2023-02-15 21:55:46,763 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 276 transitions. Word has length 34 [2023-02-15 21:55:46,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:46,764 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 276 transitions. [2023-02-15 21:55:46,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 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-15 21:55:46,764 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 276 transitions. [2023-02-15 21:55:46,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 21:55:46,764 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:46,764 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:46,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-15 21:55:46,764 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:46,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:46,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1705778920, now seen corresponding path program 1 times [2023-02-15 21:55:46,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:46,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642668624] [2023-02-15 21:55:46,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:46,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 21:55:46,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:46,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642668624] [2023-02-15 21:55:46,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642668624] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:46,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:46,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 21:55:46,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890269470] [2023-02-15 21:55:46,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:46,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 21:55:46,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:46,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 21:55:46,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:55:46,853 INFO L87 Difference]: Start difference. First operand 244 states and 276 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 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-15 21:55:47,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:47,034 INFO L93 Difference]: Finished difference Result 267 states and 302 transitions. [2023-02-15 21:55:47,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 21:55:47,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 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) Word has length 34 [2023-02-15 21:55:47,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:47,035 INFO L225 Difference]: With dead ends: 267 [2023-02-15 21:55:47,035 INFO L226 Difference]: Without dead ends: 267 [2023-02-15 21:55:47,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-02-15 21:55:47,035 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 475 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:47,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 380 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:55:47,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-02-15 21:55:47,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 245. [2023-02-15 21:55:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 174 states have (on average 1.5919540229885059) internal successors, (277), 244 states have internal predecessors, (277), 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-15 21:55:47,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 277 transitions. [2023-02-15 21:55:47,038 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 277 transitions. Word has length 34 [2023-02-15 21:55:47,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:47,038 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 277 transitions. [2023-02-15 21:55:47,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 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-15 21:55:47,038 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 277 transitions. [2023-02-15 21:55:47,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 21:55:47,039 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:47,039 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:47,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-15 21:55:47,039 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:47,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:47,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1332799064, now seen corresponding path program 1 times [2023-02-15 21:55:47,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:47,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298962434] [2023-02-15 21:55:47,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:47,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:55:47,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:47,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298962434] [2023-02-15 21:55:47,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298962434] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:47,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:47,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-02-15 21:55:47,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114089567] [2023-02-15 21:55:47,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:47,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 21:55:47,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:47,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 21:55:47,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2023-02-15 21:55:47,615 INFO L87 Difference]: Start difference. First operand 245 states and 277 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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-15 21:55:48,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:48,443 INFO L93 Difference]: Finished difference Result 247 states and 278 transitions. [2023-02-15 21:55:48,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 21:55:48,443 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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) Word has length 35 [2023-02-15 21:55:48,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:48,444 INFO L225 Difference]: With dead ends: 247 [2023-02-15 21:55:48,444 INFO L226 Difference]: Without dead ends: 247 [2023-02-15 21:55:48,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2023-02-15 21:55:48,445 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 350 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:48,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1727 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 21:55:48,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-02-15 21:55:48,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2023-02-15 21:55:48,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 174 states have (on average 1.5862068965517242) internal successors, (276), 244 states have internal predecessors, (276), 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-15 21:55:48,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 276 transitions. [2023-02-15 21:55:48,447 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 276 transitions. Word has length 35 [2023-02-15 21:55:48,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:48,447 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 276 transitions. [2023-02-15 21:55:48,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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-15 21:55:48,448 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 276 transitions. [2023-02-15 21:55:48,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 21:55:48,448 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:48,448 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:48,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-02-15 21:55:48,448 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:48,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:48,448 INFO L85 PathProgramCache]: Analyzing trace with hash -561839822, now seen corresponding path program 1 times [2023-02-15 21:55:48,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:48,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541841164] [2023-02-15 21:55:48,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:48,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:49,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:55:49,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:49,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541841164] [2023-02-15 21:55:49,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541841164] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:55:49,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418270676] [2023-02-15 21:55:49,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:49,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:55:49,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:55:49,009 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-15 21:55:49,037 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-15 21:55:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:49,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 53 conjunts are in the unsatisfiable core [2023-02-15 21:55:49,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:55:49,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:55:49,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:55:49,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:55:49,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 21:55:49,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:55:49,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 21:55:49,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:55:49,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 21:55:49,454 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-02-15 21:55:49,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 42 [2023-02-15 21:55:49,507 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-02-15 21:55:49,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 42 [2023-02-15 21:55:49,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:55:49,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 21:55:49,569 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:55:49,574 INFO L321 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2023-02-15 21:55:49,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 38 [2023-02-15 21:55:49,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:55:49,582 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 21:55:49,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2023-02-15 21:55:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:55:49,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:55:58,061 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:55:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:55:58,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418270676] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:55:58,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:55:58,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 11] total 27 [2023-02-15 21:55:58,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246247774] [2023-02-15 21:55:58,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:55:58,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-15 21:55:58,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:58,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-15 21:55:58,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=621, Unknown=2, NotChecked=0, Total=702 [2023-02-15 21:55:58,112 INFO L87 Difference]: Start difference. First operand 245 states and 276 transitions. Second operand has 27 states, 27 states have (on average 3.185185185185185) internal successors, (86), 27 states have internal predecessors, (86), 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-15 21:55:59,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:59,274 INFO L93 Difference]: Finished difference Result 305 states and 341 transitions. [2023-02-15 21:55:59,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 21:55:59,274 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.185185185185185) internal successors, (86), 27 states have internal predecessors, (86), 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) Word has length 35 [2023-02-15 21:55:59,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:59,275 INFO L225 Difference]: With dead ends: 305 [2023-02-15 21:55:59,275 INFO L226 Difference]: Without dead ends: 305 [2023-02-15 21:55:59,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=171, Invalid=1017, Unknown=2, NotChecked=0, Total=1190 [2023-02-15 21:55:59,275 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 83 mSDsluCounter, 3161 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 3387 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:59,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 3387 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 21:55:59,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-02-15 21:55:59,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 274. [2023-02-15 21:55:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 203 states have (on average 1.5073891625615763) internal successors, (306), 273 states have internal predecessors, (306), 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-15 21:55:59,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 306 transitions. [2023-02-15 21:55:59,278 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 306 transitions. Word has length 35 [2023-02-15 21:55:59,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:59,278 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 306 transitions. [2023-02-15 21:55:59,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.185185185185185) internal successors, (86), 27 states have internal predecessors, (86), 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-15 21:55:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 306 transitions. [2023-02-15 21:55:59,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 21:55:59,279 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:59,279 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:59,299 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-15 21:55:59,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-15 21:55:59,480 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:59,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:59,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2034656951, now seen corresponding path program 1 times [2023-02-15 21:55:59,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:59,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460890307] [2023-02-15 21:55:59,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:59,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:55:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 21:55:59,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:55:59,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460890307] [2023-02-15 21:55:59,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460890307] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:55:59,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:55:59,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 21:55:59,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713086701] [2023-02-15 21:55:59,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:55:59,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:55:59,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:55:59,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:55:59,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:55:59,614 INFO L87 Difference]: Start difference. First operand 274 states and 306 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-15 21:55:59,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:55:59,728 INFO L93 Difference]: Finished difference Result 280 states and 312 transitions. [2023-02-15 21:55:59,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 21:55:59,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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) Word has length 40 [2023-02-15 21:55:59,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:55:59,729 INFO L225 Difference]: With dead ends: 280 [2023-02-15 21:55:59,729 INFO L226 Difference]: Without dead ends: 280 [2023-02-15 21:55:59,729 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-15 21:55:59,729 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 3 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:55:59,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 845 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:55:59,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-02-15 21:55:59,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2023-02-15 21:55:59,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 207 states have (on average 1.497584541062802) internal successors, (310), 277 states have internal predecessors, (310), 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-15 21:55:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 310 transitions. [2023-02-15 21:55:59,732 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 310 transitions. Word has length 40 [2023-02-15 21:55:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:55:59,732 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 310 transitions. [2023-02-15 21:55:59,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-15 21:55:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 310 transitions. [2023-02-15 21:55:59,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 21:55:59,732 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:55:59,732 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:55:59,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-02-15 21:55:59,733 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:55:59,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:55:59,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1029093428, now seen corresponding path program 1 times [2023-02-15 21:55:59,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:55:59,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958266984] [2023-02-15 21:55:59,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:55:59,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:55:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:00,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:56:00,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:00,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958266984] [2023-02-15 21:56:00,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958266984] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:56:00,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:56:00,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 21:56:00,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083688318] [2023-02-15 21:56:00,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:56:00,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 21:56:00,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:00,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 21:56:00,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 21:56:00,002 INFO L87 Difference]: Start difference. First operand 278 states and 310 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 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-15 21:56:00,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:00,425 INFO L93 Difference]: Finished difference Result 423 states and 476 transitions. [2023-02-15 21:56:00,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 21:56:00,426 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 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) Word has length 42 [2023-02-15 21:56:00,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:00,426 INFO L225 Difference]: With dead ends: 423 [2023-02-15 21:56:00,426 INFO L226 Difference]: Without dead ends: 423 [2023-02-15 21:56:00,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2023-02-15 21:56:00,427 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 856 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:00,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 902 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 21:56:00,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2023-02-15 21:56:00,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 342. [2023-02-15 21:56:00,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 271 states have (on average 1.5018450184501846) internal successors, (407), 341 states have internal predecessors, (407), 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-15 21:56:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 407 transitions. [2023-02-15 21:56:00,430 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 407 transitions. Word has length 42 [2023-02-15 21:56:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:00,431 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 407 transitions. [2023-02-15 21:56:00,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 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-15 21:56:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 407 transitions. [2023-02-15 21:56:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 21:56:00,431 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:00,431 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:56:00,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-02-15 21:56:00,431 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:56:00,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:00,431 INFO L85 PathProgramCache]: Analyzing trace with hash -783385736, now seen corresponding path program 1 times [2023-02-15 21:56:00,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:00,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299372629] [2023-02-15 21:56:00,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:00,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:56:00,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:00,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299372629] [2023-02-15 21:56:00,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299372629] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:56:00,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:56:00,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 21:56:00,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285493350] [2023-02-15 21:56:00,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:56:00,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:56:00,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:00,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:56:00,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:56:00,493 INFO L87 Difference]: Start difference. First operand 342 states and 407 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-15 21:56:00,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:00,595 INFO L93 Difference]: Finished difference Result 462 states and 515 transitions. [2023-02-15 21:56:00,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 21:56:00,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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) Word has length 46 [2023-02-15 21:56:00,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:00,596 INFO L225 Difference]: With dead ends: 462 [2023-02-15 21:56:00,596 INFO L226 Difference]: Without dead ends: 462 [2023-02-15 21:56:00,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-15 21:56:00,597 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 942 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:00,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 784 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:56:00,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2023-02-15 21:56:00,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 341. [2023-02-15 21:56:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 270 states have (on average 1.4925925925925927) internal successors, (403), 340 states have internal predecessors, (403), 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-15 21:56:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 403 transitions. [2023-02-15 21:56:00,600 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 403 transitions. Word has length 46 [2023-02-15 21:56:00,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:00,600 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 403 transitions. [2023-02-15 21:56:00,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-15 21:56:00,600 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 403 transitions. [2023-02-15 21:56:00,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 21:56:00,602 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:00,602 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:56:00,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-02-15 21:56:00,602 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:56:00,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:00,602 INFO L85 PathProgramCache]: Analyzing trace with hash 767246721, now seen corresponding path program 2 times [2023-02-15 21:56:00,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:00,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490522130] [2023-02-15 21:56:00,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:00,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:01,597 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:01,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:01,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490522130] [2023-02-15 21:56:01,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490522130] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:56:01,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903944958] [2023-02-15 21:56:01,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 21:56:01,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:56:01,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:56:01,599 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-15 21:56:01,601 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-15 21:56:01,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 21:56:01,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:56:01,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 78 conjunts are in the unsatisfiable core [2023-02-15 21:56:01,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:56:01,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 21:56:01,765 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 21:56:01,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 21:56:01,788 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 21:56:01,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 21:56:01,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 21:56:01,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:01,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-15 21:56:01,939 INFO L321 Elim1Store]: treesize reduction 48, result has 44.8 percent of original size [2023-02-15 21:56:01,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 65 [2023-02-15 21:56:01,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 21:56:01,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:01,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2023-02-15 21:56:02,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:02,131 INFO L321 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2023-02-15 21:56:02,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 57 [2023-02-15 21:56:02,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 21:56:02,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 21:56:02,515 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:02,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:02,517 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:02,535 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-15 21:56:02,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 65 [2023-02-15 21:56:02,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 21:56:02,769 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:02,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:02,777 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 21:56:02,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 53 [2023-02-15 21:56:02,894 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:02,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:02,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 97 treesize of output 85 [2023-02-15 21:56:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:03,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:56:03,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903944958] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:56:03,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 21:56:03,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [21] total 35 [2023-02-15 21:56:03,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702737465] [2023-02-15 21:56:03,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:56:03,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 21:56:03,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:03,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 21:56:03,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1133, Unknown=0, NotChecked=0, Total=1260 [2023-02-15 21:56:03,097 INFO L87 Difference]: Start difference. First operand 341 states and 403 transitions. Second operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 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-15 21:56:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:05,330 INFO L93 Difference]: Finished difference Result 385 states and 453 transitions. [2023-02-15 21:56:05,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 21:56:05,330 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 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) Word has length 46 [2023-02-15 21:56:05,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:05,331 INFO L225 Difference]: With dead ends: 385 [2023-02-15 21:56:05,331 INFO L226 Difference]: Without dead ends: 385 [2023-02-15 21:56:05,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=486, Invalid=2484, Unknown=0, NotChecked=0, Total=2970 [2023-02-15 21:56:05,333 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 367 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 2276 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:05,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 2369 Invalid, 2318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2276 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-15 21:56:05,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2023-02-15 21:56:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 340. [2023-02-15 21:56:05,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 270 states have (on average 1.488888888888889) internal successors, (402), 339 states have internal predecessors, (402), 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-15 21:56:05,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 402 transitions. [2023-02-15 21:56:05,351 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 402 transitions. Word has length 46 [2023-02-15 21:56:05,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:05,352 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 402 transitions. [2023-02-15 21:56:05,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 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-15 21:56:05,352 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 402 transitions. [2023-02-15 21:56:05,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 21:56:05,352 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:05,352 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:56:05,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 21:56:05,557 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,SelfDestructingSolverStorable32 [2023-02-15 21:56:05,557 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:56:05,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:05,558 INFO L85 PathProgramCache]: Analyzing trace with hash 767246722, now seen corresponding path program 1 times [2023-02-15 21:56:05,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:05,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907809876] [2023-02-15 21:56:05,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:05,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:06,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:06,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907809876] [2023-02-15 21:56:06,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907809876] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:56:06,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450767909] [2023-02-15 21:56:06,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:06,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:56:06,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:56:06,774 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-15 21:56:06,776 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-15 21:56:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:06,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 85 conjunts are in the unsatisfiable core [2023-02-15 21:56:06,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:56:06,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 21:56:06,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 21:56:07,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:07,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 21:56:07,016 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 21:56:07,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 21:56:07,123 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 21:56:07,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 21:56:07,148 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 21:56:07,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-15 21:56:07,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:56:07,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:56:07,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:07,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 21:56:07,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:07,415 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-15 21:56:07,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 21 [2023-02-15 21:56:07,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-02-15 21:56:07,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 21:56:07,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 21:56:07,536 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-02-15 21:56:07,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 52 [2023-02-15 21:56:07,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 21:56:07,613 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-02-15 21:56:07,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 52 [2023-02-15 21:56:07,743 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:07,760 INFO L321 Elim1Store]: treesize reduction 99, result has 17.5 percent of original size [2023-02-15 21:56:07,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 112 treesize of output 77 [2023-02-15 21:56:07,766 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 21:56:07,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 46 [2023-02-15 21:56:07,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2023-02-15 21:56:07,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2023-02-15 21:56:07,841 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:07,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:56:15,620 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:15,622 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:25,465 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 21:56:33,629 WARN L233 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 21:56:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:33,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450767909] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:56:33,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:56:33,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 14] total 44 [2023-02-15 21:56:33,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316985758] [2023-02-15 21:56:33,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:56:33,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-15 21:56:33,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:33,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-15 21:56:33,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1829, Unknown=1, NotChecked=0, Total=1980 [2023-02-15 21:56:33,716 INFO L87 Difference]: Start difference. First operand 340 states and 402 transitions. Second operand has 45 states, 44 states have (on average 2.8636363636363638) internal successors, (126), 45 states have internal predecessors, (126), 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-15 21:56:43,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:43,312 INFO L93 Difference]: Finished difference Result 708 states and 818 transitions. [2023-02-15 21:56:43,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 21:56:43,313 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.8636363636363638) internal successors, (126), 45 states have internal predecessors, (126), 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) Word has length 46 [2023-02-15 21:56:43,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:43,314 INFO L225 Difference]: With dead ends: 708 [2023-02-15 21:56:43,314 INFO L226 Difference]: Without dead ends: 708 [2023-02-15 21:56:43,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 30.3s TimeCoverageRelationStatistics Valid=760, Invalid=3931, Unknown=1, NotChecked=0, Total=4692 [2023-02-15 21:56:43,315 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 1642 mSDsluCounter, 3570 mSDsCounter, 0 mSdLazyCounter, 5618 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1642 SdHoareTripleChecker+Valid, 3738 SdHoareTripleChecker+Invalid, 5706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 5618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:43,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1642 Valid, 3738 Invalid, 5706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 5618 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-02-15 21:56:43,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2023-02-15 21:56:43,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 339. [2023-02-15 21:56:43,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 270 states have (on average 1.4851851851851852) internal successors, (401), 338 states have internal predecessors, (401), 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-15 21:56:43,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 401 transitions. [2023-02-15 21:56:43,320 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 401 transitions. Word has length 46 [2023-02-15 21:56:43,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:43,320 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 401 transitions. [2023-02-15 21:56:43,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.8636363636363638) internal successors, (126), 45 states have internal predecessors, (126), 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-15 21:56:43,320 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 401 transitions. [2023-02-15 21:56:43,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 21:56:43,320 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:43,320 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:56:43,325 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-15 21:56:43,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:56:43,521 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:56:43,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:43,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2037167035, now seen corresponding path program 1 times [2023-02-15 21:56:43,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:43,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235057355] [2023-02-15 21:56:43,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:43,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:43,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 21:56:43,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:43,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235057355] [2023-02-15 21:56:43,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235057355] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:56:43,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:56:43,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:56:43,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628057281] [2023-02-15 21:56:43,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:56:43,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:56:43,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:43,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:56:43,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:56:43,601 INFO L87 Difference]: Start difference. First operand 339 states and 401 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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-15 21:56:43,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:43,797 INFO L93 Difference]: Finished difference Result 444 states and 519 transitions. [2023-02-15 21:56:43,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 21:56:43,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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) Word has length 48 [2023-02-15 21:56:43,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:43,799 INFO L225 Difference]: With dead ends: 444 [2023-02-15 21:56:43,799 INFO L226 Difference]: Without dead ends: 444 [2023-02-15 21:56:43,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:56:43,799 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 357 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:43,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 417 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:56:43,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2023-02-15 21:56:43,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 343. [2023-02-15 21:56:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 274 states have (on average 1.4817518248175183) internal successors, (406), 342 states have internal predecessors, (406), 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-15 21:56:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 406 transitions. [2023-02-15 21:56:43,803 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 406 transitions. Word has length 48 [2023-02-15 21:56:43,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:43,803 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 406 transitions. [2023-02-15 21:56:43,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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-15 21:56:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 406 transitions. [2023-02-15 21:56:43,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 21:56:43,803 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:43,803 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:56:43,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-02-15 21:56:43,803 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:56:43,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:43,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2037167036, now seen corresponding path program 1 times [2023-02-15 21:56:43,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:43,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271641411] [2023-02-15 21:56:43,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:43,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:56:44,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:44,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271641411] [2023-02-15 21:56:44,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271641411] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:56:44,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:56:44,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 21:56:44,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201322485] [2023-02-15 21:56:44,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:56:44,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 21:56:44,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:44,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 21:56:44,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-15 21:56:44,080 INFO L87 Difference]: Start difference. First operand 343 states and 406 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 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-15 21:56:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:44,521 INFO L93 Difference]: Finished difference Result 510 states and 577 transitions. [2023-02-15 21:56:44,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 21:56:44,522 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 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) Word has length 48 [2023-02-15 21:56:44,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:44,523 INFO L225 Difference]: With dead ends: 510 [2023-02-15 21:56:44,523 INFO L226 Difference]: Without dead ends: 510 [2023-02-15 21:56:44,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-02-15 21:56:44,524 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 862 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:44,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 777 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 21:56:44,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2023-02-15 21:56:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 343. [2023-02-15 21:56:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 274 states have (on average 1.4781021897810218) internal successors, (405), 342 states have internal predecessors, (405), 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-15 21:56:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 405 transitions. [2023-02-15 21:56:44,527 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 405 transitions. Word has length 48 [2023-02-15 21:56:44,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:44,527 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 405 transitions. [2023-02-15 21:56:44,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 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-15 21:56:44,528 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 405 transitions. [2023-02-15 21:56:44,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 21:56:44,528 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:44,528 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:56:44,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-02-15 21:56:44,528 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:56:44,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:44,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1330545387, now seen corresponding path program 1 times [2023-02-15 21:56:44,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:44,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205429422] [2023-02-15 21:56:44,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:44,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:44,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:56:44,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:44,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205429422] [2023-02-15 21:56:44,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205429422] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:56:44,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:56:44,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 21:56:44,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404809501] [2023-02-15 21:56:44,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:56:44,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 21:56:44,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:44,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 21:56:44,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 21:56:44,814 INFO L87 Difference]: Start difference. First operand 343 states and 405 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 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-15 21:56:45,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:45,480 INFO L93 Difference]: Finished difference Result 460 states and 513 transitions. [2023-02-15 21:56:45,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 21:56:45,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 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) Word has length 49 [2023-02-15 21:56:45,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:45,481 INFO L225 Difference]: With dead ends: 460 [2023-02-15 21:56:45,481 INFO L226 Difference]: Without dead ends: 460 [2023-02-15 21:56:45,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-02-15 21:56:45,482 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 1012 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:45,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 575 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 21:56:45,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2023-02-15 21:56:45,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 375. [2023-02-15 21:56:45,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 306 states have (on average 1.526143790849673) internal successors, (467), 374 states have internal predecessors, (467), 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-15 21:56:45,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 467 transitions. [2023-02-15 21:56:45,485 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 467 transitions. Word has length 49 [2023-02-15 21:56:45,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:45,485 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 467 transitions. [2023-02-15 21:56:45,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 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-15 21:56:45,486 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 467 transitions. [2023-02-15 21:56:45,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 21:56:45,486 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:45,486 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:56:45,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-02-15 21:56:45,486 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:56:45,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:45,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1246142357, now seen corresponding path program 1 times [2023-02-15 21:56:45,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:45,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006636953] [2023-02-15 21:56:45,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:45,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:56:46,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:46,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006636953] [2023-02-15 21:56:46,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006636953] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:56:46,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891278719] [2023-02-15 21:56:46,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:46,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:56:46,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:56:46,162 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-15 21:56:46,163 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-15 21:56:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:46,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-15 21:56:46,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:56:46,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:56:46,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:56:46,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:46,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 21:56:46,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:46,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 21:56:46,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:46,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-02-15 21:56:46,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:46,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 21:56:46,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:46,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 21:56:46,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:46,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-02-15 21:56:46,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:46,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 21:56:46,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:46,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 21:56:46,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 21:56:46,765 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:46,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-15 21:56:46,767 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:46,770 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:46,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2023-02-15 21:56:46,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:56:46,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:56:47,170 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:47,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-15 21:56:47,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-02-15 21:56:47,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 21:56:47,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:47,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-15 21:56:47,189 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:47,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2023-02-15 21:56:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:56:47,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891278719] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:56:47,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:56:47,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 32 [2023-02-15 21:56:47,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53652115] [2023-02-15 21:56:47,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:56:47,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-15 21:56:47,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:47,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 21:56:47,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=885, Unknown=1, NotChecked=0, Total=992 [2023-02-15 21:56:47,240 INFO L87 Difference]: Start difference. First operand 375 states and 467 transitions. Second operand has 32 states, 32 states have (on average 4.09375) internal successors, (131), 32 states have internal predecessors, (131), 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-15 21:56:48,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:48,238 INFO L93 Difference]: Finished difference Result 392 states and 484 transitions. [2023-02-15 21:56:48,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 21:56:48,239 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.09375) internal successors, (131), 32 states have internal predecessors, (131), 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) Word has length 51 [2023-02-15 21:56:48,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:48,240 INFO L225 Difference]: With dead ends: 392 [2023-02-15 21:56:48,240 INFO L226 Difference]: Without dead ends: 392 [2023-02-15 21:56:48,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=259, Invalid=1632, Unknown=1, NotChecked=0, Total=1892 [2023-02-15 21:56:48,241 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 146 mSDsluCounter, 2962 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 3190 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:48,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 3190 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 21:56:48,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-02-15 21:56:48,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 386. [2023-02-15 21:56:48,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 317 states have (on average 1.5078864353312302) internal successors, (478), 385 states have internal predecessors, (478), 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-15 21:56:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 478 transitions. [2023-02-15 21:56:48,244 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 478 transitions. Word has length 51 [2023-02-15 21:56:48,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:48,244 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 478 transitions. [2023-02-15 21:56:48,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.09375) internal successors, (131), 32 states have internal predecessors, (131), 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-15 21:56:48,244 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 478 transitions. [2023-02-15 21:56:48,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 21:56:48,244 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:48,245 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:56:48,269 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-15 21:56:48,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-02-15 21:56:48,445 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:56:48,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:48,445 INFO L85 PathProgramCache]: Analyzing trace with hash 997414492, now seen corresponding path program 1 times [2023-02-15 21:56:48,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:48,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878938638] [2023-02-15 21:56:48,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:48,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:56:48,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:48,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878938638] [2023-02-15 21:56:48,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878938638] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:56:48,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:56:48,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 21:56:48,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017399268] [2023-02-15 21:56:48,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:56:48,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:56:48,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:48,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:56:48,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:56:48,506 INFO L87 Difference]: Start difference. First operand 386 states and 478 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-15 21:56:48,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:48,605 INFO L93 Difference]: Finished difference Result 470 states and 523 transitions. [2023-02-15 21:56:48,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 21:56:48,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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) Word has length 53 [2023-02-15 21:56:48,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:48,606 INFO L225 Difference]: With dead ends: 470 [2023-02-15 21:56:48,606 INFO L226 Difference]: Without dead ends: 470 [2023-02-15 21:56:48,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-15 21:56:48,610 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 1019 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:48,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 790 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:56:48,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2023-02-15 21:56:48,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 386. [2023-02-15 21:56:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 317 states have (on average 1.5047318611987381) internal successors, (477), 385 states have internal predecessors, (477), 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-15 21:56:48,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 477 transitions. [2023-02-15 21:56:48,615 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 477 transitions. Word has length 53 [2023-02-15 21:56:48,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:48,615 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 477 transitions. [2023-02-15 21:56:48,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-15 21:56:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 477 transitions. [2023-02-15 21:56:48,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 21:56:48,615 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:48,615 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:56:48,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-02-15 21:56:48,616 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2023-02-15 21:56:48,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:48,616 INFO L85 PathProgramCache]: Analyzing trace with hash -471775986, now seen corresponding path program 1 times [2023-02-15 21:56:48,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:48,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340717136] [2023-02-15 21:56:48,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:48,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:50,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:50,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340717136] [2023-02-15 21:56:50,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340717136] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:56:50,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835447480] [2023-02-15 21:56:50,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:50,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:56:50,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:56:50,518 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-15 21:56:50,518 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-15 21:56:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:50,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 120 conjunts are in the unsatisfiable core [2023-02-15 21:56:50,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:56:50,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 21:56:50,735 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:56:50,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 21:56:50,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 21:56:50,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:50,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-02-15 21:56:50,894 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2023-02-15 21:56:50,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2023-02-15 21:56:50,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 21:56:51,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 21:56:51,100 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2023-02-15 21:56:51,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2023-02-15 21:56:51,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 21:56:51,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2023-02-15 21:56:51,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:51,328 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 21:56:51,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 47 [2023-02-15 21:56:51,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:56:51,550 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 21:56:51,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 21:56:51,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:51,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:51,581 INFO L321 Elim1Store]: treesize reduction 78, result has 28.4 percent of original size [2023-02-15 21:56:51,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 63 [2023-02-15 21:56:51,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 21:56:51,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:51,685 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-15 21:56:51,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 70 [2023-02-15 21:56:51,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:51,942 INFO L321 Elim1Store]: treesize reduction 160, result has 16.7 percent of original size [2023-02-15 21:56:51,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 259 treesize of output 117 [2023-02-15 21:56:51,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 189 [2023-02-15 21:56:52,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 189 [2023-02-15 21:56:52,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:52,598 INFO L321 Elim1Store]: treesize reduction 208, result has 13.3 percent of original size [2023-02-15 21:56:52,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 261 treesize of output 125 [2023-02-15 21:56:52,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-02-15 21:56:53,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:53,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:53,012 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:53,046 INFO L321 Elim1Store]: treesize reduction 203, result has 16.8 percent of original size [2023-02-15 21:56:53,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 284 treesize of output 134 [2023-02-15 21:56:53,061 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 21:56:53,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 153 [2023-02-15 21:56:53,245 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:53,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2023-02-15 21:56:53,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:53,434 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:53,448 INFO L321 Elim1Store]: treesize reduction 108, result has 9.2 percent of original size [2023-02-15 21:56:53,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 136 treesize of output 93 [2023-02-15 21:56:53,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:53,661 INFO L321 Elim1Store]: treesize reduction 31, result has 11.4 percent of original size [2023-02-15 21:56:53,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 58 [2023-02-15 21:56:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:53,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:56:56,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2278 treesize of output 2266 [2023-02-15 21:57:06,039 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse23 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse9 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) .cse23 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse62 (store .cse9 |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse60 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| 1))) (let ((.cse84 (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse268 (store .cse9 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse267 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse268 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911)) (.cse266 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (= (select .cse266 (select .cse267 v_ArrVal_1910)) 1) (< |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse266 v_ArrVal_1911))) (= (select .cse266 (select .cse267 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse266 (select .cse268 |c_ULTIMATE.start_main_~item~0#1.offset|))))))))) (.cse12 (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse265 (store .cse9 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse264 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse265 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911)) (.cse263 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (= (select .cse263 (select .cse264 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse263 v_ArrVal_1911))) (= (select .cse263 (select .cse264 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse263 (select .cse265 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|)))))) (.cse160 (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (or (= (select .cse60 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse62 .cse23 v_ArrVal_1911) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911) v_ArrVal_1910)) 1) (not (= 1 (select .cse60 v_ArrVal_1911)))))) (.cse25 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 8)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| .cse9)) (.cse192 (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse261 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898)) (.cse262 (store .cse9 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse261 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse262 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911) v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse261 v_ArrVal_1911))) (not (= 1 (select .cse261 (select .cse262 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|))))) (.cse205 (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse260 (store .cse9 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse259 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse260 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911)) (.cse258 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (= (select .cse258 (select .cse259 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse258 v_ArrVal_1911))) (= (select .cse258 (select .cse259 v_arrayElimCell_149)) 1) (not (= 1 (select .cse258 (select .cse260 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|)))))) (.cse10 (not (= 0 (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|)))) (.cse11 (not (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~item~0#1.base|)))) (and (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse5 (store .cse2 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse4 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse5) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse3 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse5 |ULTIMATE.start_main_~#iter~0#1.offset| .cse4)) .cse4))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse0 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse2) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse0 (select .cse3 v_arrayElimCell_149)) 1) (= (select .cse0 (select .cse3 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse0 .cse4))) (= (select .cse0 (select .cse3 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse0 (select .cse3 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))) (or (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse8 (store .cse9 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse7 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse8 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911)) (.cse6 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (= (select .cse6 (select .cse7 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse6 v_ArrVal_1911))) (= (select .cse6 (select .cse7 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse6 (select .cse7 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse6 (select .cse8 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|))))) .cse10 .cse11) (or .cse10 .cse12 .cse11) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse13 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse14 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse13 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse14) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (let ((.cse18 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (or (forall ((v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse17 (store .cse14 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse16 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse17) |c_ULTIMATE.start_main_~item~0#1.base|) .cse18))) (let ((.cse15 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse17 |ULTIMATE.start_main_~#iter~0#1.offset| .cse16)) .cse16))) (or (= (select .cse13 (select .cse15 v_arrayElimCell_149)) 1) (= (select .cse13 (select .cse15 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse13 .cse16))) (= (select .cse13 (select .cse15 v_ArrVal_1910)) 1) (= (select .cse13 (select .cse15 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse18 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse21 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse24 (store .cse21 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse22 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse24) |c_ULTIMATE.start_main_~item~0#1.base|) .cse23))) (let ((.cse20 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse24 |ULTIMATE.start_main_~#iter~0#1.offset| .cse22)) .cse22)) (.cse19 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898))) (or (= (select .cse19 (select .cse20 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse19 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse21) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse19 (select .cse20 v_ArrVal_1910)) 1) (not (= 1 (select .cse19 .cse22))) (= .cse23 |ULTIMATE.start_main_~#iter~0#1.offset|))))))) (forall ((v_ArrVal_1899 Int)) (< (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|) .cse25)))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse26 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse27 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse26 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse27) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse28 (store .cse27 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse30 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse29 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse28) |c_ULTIMATE.start_main_~item~0#1.base|) .cse30))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (= (select .cse26 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse28 |ULTIMATE.start_main_~#iter~0#1.offset| .cse29)) .cse29) v_arrayElimCell_149)) 1) (not (= 1 (select .cse26 .cse29))) (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse30 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse31 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse32 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse31 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse32) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (or (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (let ((.cse35 (store .cse32 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse34 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse35) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse33 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse35 |ULTIMATE.start_main_~#iter~0#1.offset| .cse34)) .cse34))) (or (= (select .cse31 (select .cse33 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse31 .cse34))) (= (select .cse31 (select .cse33 v_ArrVal_1910)) 1) (forall ((v_arrayElimCell_149 Int)) (= (select .cse31 (select .cse33 v_arrayElimCell_149)) 1)) (= (select .cse31 (select .cse33 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse39 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse37 (store .cse39 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse36 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse38 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse37) |c_ULTIMATE.start_main_~item~0#1.base|) .cse23))) (or (= (select .cse36 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse37 |ULTIMATE.start_main_~#iter~0#1.offset| .cse38)) .cse38) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse36 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse39) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (not (= 1 (select .cse36 .cse38)))))))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|) (forall ((v_ArrVal_1899 Int)) (< (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|) .cse25)))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse40 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse41 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse40 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse41) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse45 (store .cse41 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse44 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse43 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse45) |c_ULTIMATE.start_main_~item~0#1.base|) .cse44))) (let ((.cse42 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse45 |ULTIMATE.start_main_~#iter~0#1.offset| .cse43)) .cse43))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (= (select .cse40 (select .cse42 v_arrayElimCell_149)) 1) (not (= 1 (select .cse40 .cse43))) (= (select .cse40 (select .cse42 v_ArrVal_1910)) 1) (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse44 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse40 (select .cse42 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse47 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse50 (store .cse47 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse49 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse50) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse46 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse48 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse50 |ULTIMATE.start_main_~#iter~0#1.offset| .cse49)) .cse49))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse46 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse47) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse46 (select .cse48 v_arrayElimCell_149)) 1) (not (= 1 (select .cse46 .cse49))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse46 (select .cse48 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int) (v_ArrVal_1899 Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (< (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|) .cse25) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse54 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse52 (store .cse54 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse51 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse53 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse52) |c_ULTIMATE.start_main_~item~0#1.base|) .cse23))) (or (= (select .cse51 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse52 |ULTIMATE.start_main_~#iter~0#1.offset| .cse53)) .cse53) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse51 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse54) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (not (= 1 (select .cse51 .cse53))) (= .cse23 |ULTIMATE.start_main_~#iter~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse55 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse59 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse58 (store .cse59 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse57 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse58) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse56 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse58 |ULTIMATE.start_main_~#iter~0#1.offset| .cse57)) .cse57))) (or (= (select .cse55 (select .cse56 v_arrayElimCell_149)) 1) (not (= 1 (select .cse55 .cse57))) (= (select .cse55 (select .cse56 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))))) (not (= 1 (select .cse55 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse59) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))))))))) (or .cse10 (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (let ((.cse61 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse62 .cse23 v_ArrVal_1911) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911))) (or (= (select .cse60 (select .cse61 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (= (select .cse60 (select .cse61 v_ArrVal_1910)) 1) (not (= 1 (select .cse60 v_ArrVal_1911)))))) .cse11) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse64 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse68 (store .cse64 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse67 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse66 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse68) |c_ULTIMATE.start_main_~item~0#1.base|) .cse67))) (let ((.cse63 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse65 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse68 |ULTIMATE.start_main_~#iter~0#1.offset| .cse66)) .cse66))) (or (not (= 1 (select .cse63 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse64) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse63 (select .cse65 v_arrayElimCell_149)) 1) (= (select .cse63 (select .cse65 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse63 .cse66))) (= (select .cse63 (select .cse65 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse67 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse63 (select .cse65 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse69 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse70 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse69 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse70) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (let ((.cse74 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (or (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (let ((.cse73 (store .cse70 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse72 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse73) |c_ULTIMATE.start_main_~item~0#1.base|) .cse74))) (let ((.cse71 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse73 |ULTIMATE.start_main_~#iter~0#1.offset| .cse72)) .cse72))) (or (= (select .cse69 (select .cse71 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse69 .cse72))) (= (select .cse69 (select .cse71 v_ArrVal_1910)) 1) (forall ((v_arrayElimCell_149 Int)) (= (select .cse69 (select .cse71 v_arrayElimCell_149)) 1)) (= (select .cse69 (select .cse71 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse74 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse76 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse80 (store .cse76 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse79 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse78 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse80) |c_ULTIMATE.start_main_~item~0#1.base|) .cse79))) (let ((.cse75 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse77 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse80 |ULTIMATE.start_main_~#iter~0#1.offset| .cse78)) .cse78))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse75 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse76) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse75 (select .cse77 v_arrayElimCell_149)) 1) (not (= 1 (select .cse75 .cse78))) (= (select .cse75 (select .cse77 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse79 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse75 (select .cse77 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))) (or .cse10 (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse83 (store .cse9 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse82 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse83 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911)) (.cse81 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (= (select .cse81 (select .cse82 v_ArrVal_1910)) 1) (< |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse81 v_ArrVal_1911))) (= (select .cse81 (select .cse82 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse81 (select .cse82 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse81 (select .cse83 |c_ULTIMATE.start_main_~item~0#1.offset|)))))))) .cse11) (or .cse10 .cse84 .cse11) (or (and .cse84 (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse87 (store .cse9 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse86 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse87 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911)) (.cse85 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (= (select .cse85 (select .cse86 v_ArrVal_1910)) 1) (< |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse85 v_ArrVal_1911))) (= (select .cse85 (select .cse86 v_arrayElimCell_149)) 1) (= (select .cse85 (select .cse86 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse85 (select .cse87 |c_ULTIMATE.start_main_~item~0#1.offset|))))))))) .cse10 .cse11) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int) (v_ArrVal_1899 Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse91 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse89 (store .cse91 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse88 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse90 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse89) |c_ULTIMATE.start_main_~item~0#1.base|) .cse23))) (or (= (select .cse88 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse89 |ULTIMATE.start_main_~#iter~0#1.offset| .cse90)) .cse90) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse88 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse91) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|) (not (= 1 (select .cse88 .cse90))) (= .cse23 |ULTIMATE.start_main_~#iter~0#1.offset|)))))) (< (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|) .cse25) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse92 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse93 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse92 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse93) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (or (forall ((v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse96 (store .cse93 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse95 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse96) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse94 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse96 |ULTIMATE.start_main_~#iter~0#1.offset| .cse95)) .cse95))) (or (= (select .cse92 (select .cse94 v_arrayElimCell_149)) 1) (= (select .cse92 (select .cse94 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse92 .cse95))) (= (select .cse92 (select .cse94 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))) (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse98 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse101 (store .cse98 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse100 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse101) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse97 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse99 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse101 |ULTIMATE.start_main_~#iter~0#1.offset| .cse100)) .cse100))) (or (not (= 1 (select .cse97 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse98) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse97 (select .cse99 v_arrayElimCell_149)) 1) (= (select .cse97 (select .cse99 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse97 .cse100))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse97 (select .cse99 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse103 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse107 (store .cse103 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse106 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse105 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse107) |c_ULTIMATE.start_main_~item~0#1.base|) .cse106))) (let ((.cse102 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse104 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse107 |ULTIMATE.start_main_~#iter~0#1.offset| .cse105)) .cse105))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse102 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse103) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse102 (select .cse104 v_arrayElimCell_149)) 1) (= (select .cse102 (select .cse104 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse102 .cse105))) (= (select .cse102 (select .cse104 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse106 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse102 (select .cse104 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))) (or .cse10 (and (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse110 (store .cse9 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse109 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse110 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911)) (.cse108 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (= (select .cse108 (select .cse109 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse108 v_ArrVal_1911))) (= (select .cse108 (select .cse109 v_arrayElimCell_149)) 1) (= (select .cse108 (select .cse109 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse108 (select .cse110 |c_ULTIMATE.start_main_~item~0#1.offset|)))))))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse113 (store .cse9 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse112 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse113 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911)) (.cse111 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (= (select .cse111 (select .cse112 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse111 v_ArrVal_1911))) (= (select .cse111 (select .cse112 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse111 (select .cse113 |c_ULTIMATE.start_main_~item~0#1.offset|))))))))) .cse11) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse114 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse115 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse114 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse115) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse119 (store .cse115 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse118 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse117 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse119) |c_ULTIMATE.start_main_~item~0#1.base|) .cse118))) (let ((.cse116 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse119 |ULTIMATE.start_main_~#iter~0#1.offset| .cse117)) .cse117))) (or (= (select .cse114 (select .cse116 v_arrayElimCell_149)) 1) (= (select .cse114 (select .cse116 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse114 .cse117))) (= (select .cse114 (select .cse116 v_ArrVal_1910)) 1) (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse118 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse114 (select .cse116 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int) (v_ArrVal_1899 Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (< (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|) .cse25) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((v_ArrVal_1898 Int)) (let ((.cse120 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse124 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (let ((.cse123 (store .cse124 .cse23 v_ArrVal_1911))) (let ((.cse122 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse123) |c_ULTIMATE.start_main_~item~0#1.base|) .cse23))) (let ((.cse121 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse123 |c_ULTIMATE.start_main_~item~0#1.offset| .cse122)) .cse122))) (or (= (select .cse120 (select .cse121 v_ArrVal_1910)) 1) (not (= 1 (select .cse120 .cse122))) (= (select .cse120 (select .cse121 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1)))))) (not (= 1 (select .cse120 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse124) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))))))))) (or .cse10 (and .cse12 (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse127 (store .cse9 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse126 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse127 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911)) (.cse125 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (= (select .cse125 (select .cse126 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse125 v_ArrVal_1911))) (= (select .cse125 (select .cse126 v_arrayElimCell_149)) 1) (= (select .cse125 (select .cse126 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse125 (select .cse127 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|)))))) .cse11) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse128 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse129 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse128 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse129) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse133 (store .cse129 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse132 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse131 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse133) |c_ULTIMATE.start_main_~item~0#1.base|) .cse132))) (let ((.cse130 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse133 |ULTIMATE.start_main_~#iter~0#1.offset| .cse131)) .cse131))) (or (= (select .cse128 (select .cse130 v_arrayElimCell_149)) 1) (= (select .cse128 (select .cse130 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse128 .cse131))) (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse132 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))))))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse134 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse135 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse134 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse135) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (let ((.cse138 (store .cse135 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse137 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse138) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse136 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse138 |ULTIMATE.start_main_~#iter~0#1.offset| .cse137)) .cse137))) (or (= (select .cse134 (select .cse136 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse134 .cse137))) (= (select .cse134 (select .cse136 v_ArrVal_1910)) 1) (forall ((v_arrayElimCell_149 Int)) (= (select .cse134 (select .cse136 v_arrayElimCell_149)) 1)) (= (select .cse134 (select .cse136 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse139 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse140 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse139 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse140) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (let ((.cse144 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (let ((.cse143 (store .cse140 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse141 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse143) |c_ULTIMATE.start_main_~item~0#1.base|) .cse144))) (let ((.cse142 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse143 |ULTIMATE.start_main_~#iter~0#1.offset| .cse141)) .cse141))) (or (not (= 1 (select .cse139 .cse141))) (= (select .cse139 (select .cse142 v_ArrVal_1910)) 1) (forall ((v_arrayElimCell_149 Int)) (= (select .cse139 (select .cse142 v_arrayElimCell_149)) 1))))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse144 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))))))))))) (or .cse10 (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse145 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898)) (.cse146 (store .cse9 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse145 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse146 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911) v_ArrVal_1910)) 1) (< |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse145 v_ArrVal_1911))) (not (= 1 (select .cse145 (select .cse146 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|)))) .cse11) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse147 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse148 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse147 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse148) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (let ((.cse151 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (forall ((v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse149 (store .cse148 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse150 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse149) |c_ULTIMATE.start_main_~item~0#1.base|) .cse151))) (or (= (select .cse147 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse149 |ULTIMATE.start_main_~#iter~0#1.offset| .cse150)) .cse150) v_arrayElimCell_149)) 1) (not (= 1 (select .cse147 .cse150))))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse151 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse152 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse153 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse152 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse153) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (let ((.cse156 (store .cse153 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse154 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse156) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse155 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse156 |ULTIMATE.start_main_~#iter~0#1.offset| .cse154)) .cse154))) (or (not (= 1 (select .cse152 .cse154))) (= (select .cse152 (select .cse155 v_ArrVal_1910)) 1) (forall ((v_arrayElimCell_149 Int)) (= (select .cse152 (select .cse155 v_arrayElimCell_149)) 1)) (= (select .cse152 (select .cse155 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))))))) (or (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse159 (store .cse9 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse158 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse159 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911)) (.cse157 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (= (select .cse157 (select .cse158 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse157 v_ArrVal_1911))) (= (select .cse157 (select .cse158 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse157 (select .cse158 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse157 (select .cse159 |c_ULTIMATE.start_main_~item~0#1.offset|)))))))) .cse10 .cse11) (or .cse10 .cse160 .cse11) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((v_ArrVal_1899 Int)) (< (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|) .cse25)) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse163 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse165 (store .cse163 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse164 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse165) |c_ULTIMATE.start_main_~item~0#1.base|) .cse23))) (let ((.cse162 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse165 |ULTIMATE.start_main_~#iter~0#1.offset| .cse164)) .cse164)) (.cse161 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898))) (or (= (select .cse161 (select .cse162 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse161 (select .cse162 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse161 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse163) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse161 (select .cse162 v_ArrVal_1910)) 1) (not (= 1 (select .cse161 .cse164))) (= .cse23 |ULTIMATE.start_main_~#iter~0#1.offset|))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse167 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse170 (store .cse167 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse169 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse170) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse166 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse168 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse170 |ULTIMATE.start_main_~#iter~0#1.offset| .cse169)) .cse169))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse166 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse167) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse166 (select .cse168 v_arrayElimCell_149)) 1) (not (= 1 (select .cse166 .cse169))) (= (select .cse166 (select .cse168 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse166 (select .cse168 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))) (or .cse10 (and (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse171 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898)) (.cse172 (store .cse9 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse171 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse172 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911) v_ArrVal_1910)) 1) (< |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse171 v_ArrVal_1911))) (not (= 1 (select .cse171 (select .cse172 |c_ULTIMATE.start_main_~item~0#1.offset|))))))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse175 (store .cse9 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse174 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse175 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911)) (.cse173 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (= (select .cse173 (select .cse174 v_ArrVal_1910)) 1) (< |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse173 v_ArrVal_1911))) (= (select .cse173 (select .cse174 v_arrayElimCell_149)) 1) (not (= 1 (select .cse173 (select .cse175 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|)))))) .cse11) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int) (v_ArrVal_1899 Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (< (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|) .cse25) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int)) (or (forall ((v_ArrVal_1898 Int)) (let ((.cse176 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse177 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse176 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse177) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (let ((.cse180 (store .cse177 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse179 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse180) |c_ULTIMATE.start_main_~item~0#1.base|) .cse23))) (let ((.cse178 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse180 |ULTIMATE.start_main_~#iter~0#1.offset| .cse179)) .cse179))) (or (= (select .cse176 (select .cse178 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse176 (select .cse178 v_ArrVal_1910)) 1) (not (= 1 (select .cse176 .cse179))))))))))) (= .cse23 |ULTIMATE.start_main_~#iter~0#1.offset|))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse181 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse186 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (let ((.cse185 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (forall ((v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse184 (store .cse186 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse183 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse184) |c_ULTIMATE.start_main_~item~0#1.base|) .cse185))) (let ((.cse182 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse184 |ULTIMATE.start_main_~#iter~0#1.offset| .cse183)) .cse183))) (or (= (select .cse181 (select .cse182 v_arrayElimCell_149)) 1) (not (= 1 (select .cse181 .cse183))) (= (select .cse181 (select .cse182 v_ArrVal_1910)) 1) (= (select .cse181 (select .cse182 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse185 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))) (not (= 1 (select .cse181 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse186) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse188 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse189 (store .cse188 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse191 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse187 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse190 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse189) |c_ULTIMATE.start_main_~item~0#1.base|) .cse191))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse187 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse188) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse187 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse189 |ULTIMATE.start_main_~#iter~0#1.offset| .cse190)) .cse190) v_arrayElimCell_149)) 1) (not (= 1 (select .cse187 .cse190))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse191 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (or .cse10 (and .cse192 (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse193 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898)) (.cse194 (store .cse9 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= (select .cse193 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse194 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911) v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse193 v_ArrVal_1911))) (not (= 1 (select .cse193 (select .cse194 |c_ULTIMATE.start_main_~item~0#1.offset|))))))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse197 (store .cse9 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse196 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse197 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911)) (.cse195 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (= (select .cse195 (select .cse196 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse195 v_ArrVal_1911))) (= (select .cse195 (select .cse196 v_arrayElimCell_149)) 1) (not (= 1 (select .cse195 (select .cse197 |c_ULTIMATE.start_main_~item~0#1.offset|)))))))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse200 (store .cse9 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse199 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse200 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911)) (.cse198 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (= (select .cse198 (select .cse199 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse198 v_ArrVal_1911))) (= (select .cse198 (select .cse199 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse198 (select .cse199 v_arrayElimCell_149)) 1) (not (= 1 (select .cse198 (select .cse200 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|))))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse203 (store .cse9 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse202 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse203 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911)) (.cse201 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (= (select .cse201 (select .cse202 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse201 v_ArrVal_1911))) (= (select .cse201 (select .cse202 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse201 (select .cse203 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|))))) (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (let ((.cse204 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse62 .cse23 v_ArrVal_1911) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911))) (or (= (select .cse60 (select .cse204 v_ArrVal_1910)) 1) (= (select .cse60 (select .cse204 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse60 v_ArrVal_1911)))))) .cse160 .cse205 (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse208 (store .cse9 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse207 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse208 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911)) (.cse206 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (= (select .cse206 (select .cse207 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse206 v_ArrVal_1911))) (= (select .cse206 (select .cse207 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse206 (select .cse207 v_arrayElimCell_149)) 1) (not (= 1 (select .cse206 (select .cse208 |c_ULTIMATE.start_main_~item~0#1.offset|)))))))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse211 (store .cse9 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse210 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse211 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911)) (.cse209 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (= (select .cse209 (select .cse210 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse209 v_ArrVal_1911))) (= (select .cse209 (select .cse210 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse209 (select .cse211 |c_ULTIMATE.start_main_~item~0#1.offset|))))))))) .cse11) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse213 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse217 (store .cse213 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse216 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse215 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse217) |c_ULTIMATE.start_main_~item~0#1.base|) .cse216))) (let ((.cse214 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse217 |ULTIMATE.start_main_~#iter~0#1.offset| .cse215)) .cse215)) (.cse212 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898))) (or (not (= 1 (select .cse212 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse213) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse212 (select .cse214 v_arrayElimCell_149)) 1) (= (select .cse212 (select .cse214 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse212 .cse215))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse216 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse218 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse219 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse218 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse219) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (or (forall ((v_ArrVal_1911 Int)) (let ((.cse222 (store .cse219 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse221 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse222) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse220 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse222 |ULTIMATE.start_main_~#iter~0#1.offset| .cse221)) .cse221))) (or (= (select .cse218 (select .cse220 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse218 .cse221))) (forall ((v_arrayElimCell_149 Int)) (= (select .cse218 (select .cse220 v_arrayElimCell_149)) 1))))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse223 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse227 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (or (forall ((v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse226 (store .cse227 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse225 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse226) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse224 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse226 |ULTIMATE.start_main_~#iter~0#1.offset| .cse225)) .cse225))) (or (= (select .cse223 (select .cse224 v_arrayElimCell_149)) 1) (= (select .cse223 (select .cse224 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse223 .cse225))) (= (select .cse223 (select .cse224 v_ArrVal_1910)) 1) (= (select .cse223 (select .cse224 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))))) (not (= 1 (select .cse223 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse227) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse228 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse229 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse228 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse229) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (forall ((v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse230 (store .cse229 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse231 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse230) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (or (= (select .cse228 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse230 |ULTIMATE.start_main_~#iter~0#1.offset| .cse231)) .cse231) v_arrayElimCell_149)) 1) (not (= 1 (select .cse228 .cse231))))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse232 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse233 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse232 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse233) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse237 (store .cse233 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse236 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse235 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse237) |c_ULTIMATE.start_main_~item~0#1.base|) .cse236))) (let ((.cse234 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse237 |ULTIMATE.start_main_~#iter~0#1.offset| .cse235)) .cse235))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (= (select .cse232 (select .cse234 v_arrayElimCell_149)) 1) (= (select .cse232 (select .cse234 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse232 .cse235))) (= (select .cse232 (select .cse234 v_ArrVal_1910)) 1) (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse236 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse232 (select .cse234 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse238 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse239 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse238 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse239) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (let ((.cse242 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |ULTIMATE.start_main_~#iter~0#1.offset|) (forall ((v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse240 (store .cse239 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse241 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse240) |c_ULTIMATE.start_main_~item~0#1.base|) .cse242))) (or (= (select .cse238 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse240 |ULTIMATE.start_main_~#iter~0#1.offset| .cse241)) .cse241) v_arrayElimCell_149)) 1) (not (= 1 (select .cse238 .cse241))))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse242 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int) (v_ArrVal_1899 Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (< (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|) .cse25) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse243 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse244 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse243 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse244) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (let ((.cse247 (store .cse244 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse246 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse247) |c_ULTIMATE.start_main_~item~0#1.base|) .cse23))) (let ((.cse245 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse247 |ULTIMATE.start_main_~#iter~0#1.offset| .cse246)) .cse246))) (or (= (select .cse243 (select .cse245 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse243 (select .cse245 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (= (select .cse243 (select .cse245 v_ArrVal_1910)) 1) (not (= 1 (select .cse243 .cse246))))))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse250 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse252 (store .cse250 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse251 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse252) |c_ULTIMATE.start_main_~item~0#1.base|) .cse23))) (let ((.cse249 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse252 |ULTIMATE.start_main_~#iter~0#1.offset| .cse251)) .cse251)) (.cse248 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898))) (or (= (select .cse248 (select .cse249 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse248 (select .cse249 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse248 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse250) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse248 (select .cse249 v_ArrVal_1910)) 1) (not (= 1 (select .cse248 .cse251))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((v_ArrVal_1899 Int)) (< (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|) .cse25)))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse254 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse257 (store .cse254 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse256 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse257) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse253 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse255 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse257 |ULTIMATE.start_main_~#iter~0#1.offset| .cse256)) .cse256))) (or (not (= 1 (select .cse253 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse254) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse253 (select .cse255 v_arrayElimCell_149)) 1) (= (select .cse253 (select .cse255 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse253 .cse256))) (= (select .cse253 (select .cse255 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse253 (select .cse255 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))) (or (and .cse192 .cse205) .cse10 .cse11)))))) is different from true [2023-02-15 21:57:11,528 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse18 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~0#1.base|) .cse6 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse72 (store .cse18 |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse70 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| 1))) (let ((.cse76 (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (or (= (select .cse70 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse72 .cse6 v_ArrVal_1911) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911) v_ArrVal_1910)) 1) (not (= 1 (select .cse70 v_ArrVal_1911)))))) (.cse19 (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse267 (store .cse18 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse266 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898)) (.cse268 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse267 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911))) (or (not (= 1 (select .cse266 (select .cse267 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse266 (select .cse268 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse266 v_ArrVal_1911))) (= (select .cse266 (select .cse268 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (= |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|)))))) (.cse62 (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse264 (store .cse18 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse263 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898)) (.cse265 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse264 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911))) (or (not (= 1 (select .cse263 (select .cse264 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse263 (select .cse265 v_ArrVal_1910)) 1) (< |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse263 v_ArrVal_1911))) (= (select .cse263 (select .cse265 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))) (.cse0 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 8)) (.cse69 (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse262 (store .cse18 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse261 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (not (= 1 (select .cse261 (select .cse262 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse261 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse262 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911) v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse261 v_ArrVal_1911))) (= |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|))))) (.cse77 (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse259 (store .cse18 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse260 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse259 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911)) (.cse258 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (not (= 1 (select .cse258 (select .cse259 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse258 (select .cse260 v_arrayElimCell_149)) 1) (= (select .cse258 (select .cse260 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse258 v_ArrVal_1911))) (= |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|)))))) (.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| .cse18)) (.cse13 (not (= 0 (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|)))) (.cse14 (not (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~item~0#1.base|)))) (and (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((v_ArrVal_1899 Int)) (< (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|) .cse0)) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse3 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse7 (store .cse3 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse5 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse7) |c_ULTIMATE.start_main_~item~0#1.base|) .cse6))) (let ((.cse1 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse4 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse7 |ULTIMATE.start_main_~#iter~0#1.offset| .cse5)) .cse5))) (or (not (= 1 (select .cse1 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse3) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse1 (select .cse4 v_ArrVal_1910)) 1) (not (= 1 (select .cse1 .cse5))) (= .cse6 |ULTIMATE.start_main_~#iter~0#1.offset|) (= (select .cse1 (select .cse4 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse1 (select .cse4 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse9 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse12 (store .cse9 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse11 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse12) |c_ULTIMATE.start_main_~item~0#1.base|) .cse6))) (let ((.cse8 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse10 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse12 |ULTIMATE.start_main_~#iter~0#1.offset| .cse11)) .cse11))) (or (not (= 1 (select .cse8 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse9) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse8 (select .cse10 v_ArrVal_1910)) 1) (not (= 1 (select .cse8 .cse11))) (= (select .cse8 (select .cse10 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse8 (select .cse10 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))) (forall ((v_ArrVal_1899 Int)) (< (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|) .cse0)))) (or .cse13 .cse14 (and (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse16 (store .cse18 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse15 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898)) (.cse17 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse16 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911))) (or (not (= 1 (select .cse15 (select .cse16 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse15 (select .cse17 v_arrayElimCell_149)) 1) (= (select .cse15 (select .cse17 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse15 v_ArrVal_1911))) (= (select .cse15 (select .cse17 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (= |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|))))) .cse19)) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse21 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse24 (store .cse21 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse23 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse24) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse20 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse22 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse24 |ULTIMATE.start_main_~#iter~0#1.offset| .cse23)) .cse23))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse20 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse21) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse20 (select .cse22 v_arrayElimCell_149)) 1) (not (= 1 (select .cse20 .cse23))) (= (select .cse20 (select .cse22 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse20 (select .cse22 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))) (or .cse13 .cse14 (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse26 (store .cse18 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse25 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898)) (.cse27 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse26 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911))) (or (not (= 1 (select .cse25 (select .cse26 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse25 (select .cse27 v_ArrVal_1910)) 1) (< |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse25 v_ArrVal_1911))) (= (select .cse25 (select .cse27 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (= (select .cse25 (select .cse27 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1)))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse30 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse32 (store .cse30 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse31 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse32) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse28 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse29 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse32 |ULTIMATE.start_main_~#iter~0#1.offset| .cse31)) .cse31))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (= (select .cse28 (select .cse29 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse28 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse30) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse28 (select .cse29 v_arrayElimCell_149)) 1) (not (= 1 (select .cse28 .cse31))) (= (select .cse28 (select .cse29 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse28 (select .cse29 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int) (v_ArrVal_1899 Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (< (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|) .cse0) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse34 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse36 (store .cse34 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse33 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse35 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse36) |c_ULTIMATE.start_main_~item~0#1.base|) .cse6))) (or (not (= 1 (select .cse33 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse34) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (not (= 1 (select .cse33 .cse35))) (= .cse6 |ULTIMATE.start_main_~#iter~0#1.offset|) (= (select .cse33 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse36 |ULTIMATE.start_main_~#iter~0#1.offset| .cse35)) .cse35) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1)))))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse38 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse39 (store .cse38 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse41 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse37 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse40 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse39) |c_ULTIMATE.start_main_~item~0#1.base|) .cse41))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse37 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse38) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse37 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse39 |ULTIMATE.start_main_~#iter~0#1.offset| .cse40)) .cse40) v_arrayElimCell_149)) 1) (not (= 1 (select .cse37 .cse40))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse41 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse44 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse47 (store .cse44 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse46 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse45 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse47) |c_ULTIMATE.start_main_~item~0#1.base|) .cse46))) (let ((.cse42 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse43 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse47 |ULTIMATE.start_main_~#iter~0#1.offset| .cse45)) .cse45))) (or (= (select .cse42 (select .cse43 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse42 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse44) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse42 (select .cse43 v_arrayElimCell_149)) 1) (not (= 1 (select .cse42 .cse45))) (= (select .cse42 (select .cse43 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse46 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse42 (select .cse43 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse50 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse52 (store .cse50 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse51 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse52) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse48 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse49 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse52 |ULTIMATE.start_main_~#iter~0#1.offset| .cse51)) .cse51))) (or (= (select .cse48 (select .cse49 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse48 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse50) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse48 (select .cse49 v_arrayElimCell_149)) 1) (not (= 1 (select .cse48 .cse51))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse48 (select .cse49 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse54 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse57 (store .cse54 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse56 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse57) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse53 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse55 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse57 |ULTIMATE.start_main_~#iter~0#1.offset| .cse56)) .cse56))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse53 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse54) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse53 (select .cse55 v_arrayElimCell_149)) 1) (not (= 1 (select .cse53 .cse56))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse53 (select .cse55 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse58 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse59 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse58 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse59) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (forall ((v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse60 (store .cse59 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse61 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse60) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (or (= (select .cse58 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse60 |ULTIMATE.start_main_~#iter~0#1.offset| .cse61)) .cse61) v_arrayElimCell_149)) 1) (not (= 1 (select .cse58 .cse61))))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))))))) (or (and .cse62 (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse64 (store .cse18 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse63 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898)) (.cse65 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse64 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911))) (or (not (= 1 (select .cse63 (select .cse64 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse63 (select .cse65 v_arrayElimCell_149)) 1) (= (select .cse63 (select .cse65 v_ArrVal_1910)) 1) (< |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse63 v_ArrVal_1911))) (= (select .cse63 (select .cse65 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))) .cse13 .cse14) (or .cse13 (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse67 (store .cse18 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse66 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898)) (.cse68 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse67 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911))) (or (not (= 1 (select .cse66 (select .cse67 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse66 (select .cse68 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse66 v_ArrVal_1911))) (= (select .cse66 (select .cse68 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (= (select .cse66 (select .cse68 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1))))) .cse14) (or .cse13 (and .cse69 (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (let ((.cse71 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse72 .cse6 v_ArrVal_1911) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911))) (or (= (select .cse70 (select .cse71 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse70 (select .cse71 v_ArrVal_1910)) 1) (not (= 1 (select .cse70 v_ArrVal_1911)))))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse74 (store .cse18 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse73 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898)) (.cse75 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse74 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911))) (or (not (= 1 (select .cse73 (select .cse74 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse73 (select .cse75 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse73 v_ArrVal_1911))) (= (select .cse73 (select .cse75 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1))))) .cse76 .cse77 (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse79 (store .cse18 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse80 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse79 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911)) (.cse78 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (not (= 1 (select .cse78 (select .cse79 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse78 (select .cse80 v_arrayElimCell_149)) 1) (= (select .cse78 (select .cse80 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse78 v_ArrVal_1911))))))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse82 (store .cse18 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse81 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898)) (.cse83 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse82 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911))) (or (not (= 1 (select .cse81 (select .cse82 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse81 (select .cse83 v_arrayElimCell_149)) 1) (= (select .cse81 (select .cse83 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse81 v_ArrVal_1911))) (= (select .cse81 (select .cse83 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|))))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse85 (store .cse18 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse84 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (not (= 1 (select .cse84 (select .cse85 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse84 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse85 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911) v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse84 v_ArrVal_1911)))))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse87 (store .cse18 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse86 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898)) (.cse88 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse87 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911))) (or (not (= 1 (select .cse86 (select .cse87 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse86 (select .cse88 v_arrayElimCell_149)) 1) (= (select .cse86 (select .cse88 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse86 v_ArrVal_1911))) (= (select .cse86 (select .cse88 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1))))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse90 (store .cse18 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse89 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898)) (.cse91 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse90 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911))) (or (not (= 1 (select .cse89 (select .cse90 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse89 (select .cse91 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse89 v_ArrVal_1911))) (= (select .cse89 (select .cse91 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|)))))) .cse14) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse92 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse96 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (let ((.cse95 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (forall ((v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse93 (store .cse96 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse94 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse93) |c_ULTIMATE.start_main_~item~0#1.base|) .cse95))) (or (= (select .cse92 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse93 |ULTIMATE.start_main_~#iter~0#1.offset| .cse94)) .cse94) v_arrayElimCell_149)) 1) (not (= 1 (select .cse92 .cse94))))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse95 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))) (not (= 1 (select .cse92 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse96) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse97 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse98 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse97 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse98) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (let ((.cse101 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |ULTIMATE.start_main_~#iter~0#1.offset|) (forall ((v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse99 (store .cse98 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse100 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse99) |c_ULTIMATE.start_main_~item~0#1.base|) .cse101))) (or (= (select .cse97 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse99 |ULTIMATE.start_main_~#iter~0#1.offset| .cse100)) .cse100) v_arrayElimCell_149)) 1) (not (= 1 (select .cse97 .cse100))))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse101 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse102 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse103 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse102 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse103) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (let ((.cse104 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse104 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (let ((.cse107 (store .cse103 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse105 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse107) |c_ULTIMATE.start_main_~item~0#1.base|) .cse104))) (let ((.cse106 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse107 |ULTIMATE.start_main_~#iter~0#1.offset| .cse105)) .cse105))) (or (not (= 1 (select .cse102 .cse105))) (= (select .cse102 (select .cse106 v_ArrVal_1910)) 1) (forall ((v_arrayElimCell_149 Int)) (= (select .cse102 (select .cse106 v_arrayElimCell_149)) 1))))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse110 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse112 (store .cse110 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse111 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse112) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse108 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse109 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse112 |ULTIMATE.start_main_~#iter~0#1.offset| .cse111)) .cse111))) (or (= (select .cse108 (select .cse109 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse108 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse110) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse108 (select .cse109 v_arrayElimCell_149)) 1) (not (= 1 (select .cse108 .cse111))) (= (select .cse108 (select .cse109 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse108 (select .cse109 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))) (or .cse76 .cse13 .cse14) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse113 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse114 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse113 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse114) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse118 (store .cse114 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse117 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse116 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse118) |c_ULTIMATE.start_main_~item~0#1.base|) .cse117))) (let ((.cse115 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse118 |ULTIMATE.start_main_~#iter~0#1.offset| .cse116)) .cse116))) (or (= (select .cse113 (select .cse115 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse113 (select .cse115 v_arrayElimCell_149)) 1) (not (= 1 (select .cse113 .cse116))) (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |ULTIMATE.start_main_~#iter~0#1.offset|) (= (select .cse113 (select .cse115 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse117 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse113 (select .cse115 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse119 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse123 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse120 (store .cse123 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse122 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse121 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse120) |c_ULTIMATE.start_main_~item~0#1.base|) .cse122))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (= (select .cse119 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse120 |ULTIMATE.start_main_~#iter~0#1.offset| .cse121)) .cse121) v_arrayElimCell_149)) 1) (not (= 1 (select .cse119 .cse121))) (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse122 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))))))) (not (= 1 (select .cse119 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse123) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse126 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse129 (store .cse126 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse128 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse127 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse129) |c_ULTIMATE.start_main_~item~0#1.base|) .cse128))) (let ((.cse124 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse125 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse129 |ULTIMATE.start_main_~#iter~0#1.offset| .cse127)) .cse127))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (= (select .cse124 (select .cse125 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse124 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse126) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse124 (select .cse125 v_arrayElimCell_149)) 1) (not (= 1 (select .cse124 .cse127))) (= (select .cse124 (select .cse125 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse128 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse124 (select .cse125 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse130 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse131 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse130 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse131) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (let ((.cse135 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (or (forall ((v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse134 (store .cse131 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse133 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse134) |c_ULTIMATE.start_main_~item~0#1.base|) .cse135))) (let ((.cse132 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse134 |ULTIMATE.start_main_~#iter~0#1.offset| .cse133)) .cse133))) (or (= (select .cse130 (select .cse132 v_arrayElimCell_149)) 1) (not (= 1 (select .cse130 .cse133))) (= (select .cse130 (select .cse132 v_ArrVal_1910)) 1) (= (select .cse130 (select .cse132 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))) (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse135 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse136 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse141 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (let ((.cse140 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (or (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (let ((.cse139 (store .cse141 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse138 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse139) |c_ULTIMATE.start_main_~item~0#1.base|) .cse140))) (let ((.cse137 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse139 |ULTIMATE.start_main_~#iter~0#1.offset| .cse138)) .cse138))) (or (= (select .cse136 (select .cse137 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse136 .cse138))) (= (select .cse136 (select .cse137 v_ArrVal_1910)) 1) (= (select .cse136 (select .cse137 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (forall ((v_arrayElimCell_149 Int)) (= (select .cse136 (select .cse137 v_arrayElimCell_149)) 1))))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse140 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))) (not (= 1 (select .cse136 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse141) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse142 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse143 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse142 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse143) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (or (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (let ((.cse146 (store .cse143 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse145 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse146) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse144 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse146 |ULTIMATE.start_main_~#iter~0#1.offset| .cse145)) .cse145))) (or (= (select .cse142 (select .cse144 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse142 .cse145))) (= (select .cse142 (select .cse144 v_ArrVal_1910)) 1) (= (select .cse142 (select .cse144 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (forall ((v_arrayElimCell_149 Int)) (= (select .cse142 (select .cse144 v_arrayElimCell_149)) 1))))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse147 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse148 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse147 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse148) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (or (forall ((v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse151 (store .cse148 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse150 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse151) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse149 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse151 |ULTIMATE.start_main_~#iter~0#1.offset| .cse150)) .cse150))) (or (= (select .cse147 (select .cse149 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse147 (select .cse149 v_arrayElimCell_149)) 1) (not (= 1 (select .cse147 .cse150))) (= (select .cse147 (select .cse149 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))) (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int) (v_ArrVal_1899 Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (< (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|) .cse0) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int)) (or (forall ((v_ArrVal_1898 Int)) (let ((.cse152 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse153 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse152 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse153) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (let ((.cse156 (store .cse153 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse155 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse156) |c_ULTIMATE.start_main_~item~0#1.base|) .cse6))) (let ((.cse154 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse156 |ULTIMATE.start_main_~#iter~0#1.offset| .cse155)) .cse155))) (or (= (select .cse152 (select .cse154 v_ArrVal_1910)) 1) (not (= 1 (select .cse152 .cse155))) (= (select .cse152 (select .cse154 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1))))))))) (= .cse6 |ULTIMATE.start_main_~#iter~0#1.offset|))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int) (v_ArrVal_1899 Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (< (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|) .cse0) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((v_ArrVal_1898 Int)) (let ((.cse157 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse161 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (let ((.cse160 (store .cse161 .cse6 v_ArrVal_1911))) (let ((.cse159 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse160) |c_ULTIMATE.start_main_~item~0#1.base|) .cse6))) (let ((.cse158 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse160 |c_ULTIMATE.start_main_~item~0#1.offset| .cse159)) .cse159))) (or (= (select .cse157 (select .cse158 v_ArrVal_1910)) 1) (= (select .cse157 (select .cse158 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse157 .cse159)))))))) (not (= 1 (select .cse157 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse161) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse164 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse167 (store .cse164 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse166 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse165 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse167) |c_ULTIMATE.start_main_~item~0#1.base|) .cse166))) (let ((.cse163 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse167 |ULTIMATE.start_main_~#iter~0#1.offset| .cse165)) .cse165)) (.cse162 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898))) (or (= (select .cse162 (select .cse163 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse162 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse164) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse162 (select .cse163 v_arrayElimCell_149)) 1) (not (= 1 (select .cse162 .cse165))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse166 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))))))))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse168 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse173 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse172 (store .cse173 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse171 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse170 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse172) |c_ULTIMATE.start_main_~item~0#1.base|) .cse171))) (let ((.cse169 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse172 |ULTIMATE.start_main_~#iter~0#1.offset| .cse170)) .cse170))) (or (= (select .cse168 (select .cse169 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse168 (select .cse169 v_arrayElimCell_149)) 1) (not (= 1 (select .cse168 .cse170))) (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse171 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))))) (not (= 1 (select .cse168 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse173) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|) (forall ((v_ArrVal_1899 Int)) (< (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|) .cse0)) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse175 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse177 (store .cse175 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse174 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse176 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse177) |c_ULTIMATE.start_main_~item~0#1.base|) .cse6))) (or (not (= 1 (select .cse174 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse175) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (not (= 1 (select .cse174 .cse176))) (= (select .cse174 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse177 |ULTIMATE.start_main_~#iter~0#1.offset| .cse176)) .cse176) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1)))))))) (or .cse13 .cse14 .cse19) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int) (v_ArrVal_1899 Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (< (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|) .cse0) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse178 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse182 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (let ((.cse181 (store .cse182 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse180 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse181) |c_ULTIMATE.start_main_~item~0#1.base|) .cse6))) (let ((.cse179 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse181 |ULTIMATE.start_main_~#iter~0#1.offset| .cse180)) .cse180))) (or (= (select .cse178 (select .cse179 v_ArrVal_1910)) 1) (not (= 1 (select .cse178 .cse180))) (= (select .cse178 (select .cse179 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse178 (select .cse179 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))) (not (= 1 (select .cse178 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse182) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))))))))) (or (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse184 (store .cse18 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse183 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898)) (.cse185 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse184 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911))) (or (not (= 1 (select .cse183 (select .cse184 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse183 (select .cse185 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse183 v_ArrVal_1911))) (= (select .cse183 (select .cse185 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (= (select .cse183 (select .cse185 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|))))) .cse13 .cse14) (or .cse13 (and (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse187 (store .cse18 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse186 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898)) (.cse188 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse187 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911))) (or (not (= 1 (select .cse186 (select .cse187 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse186 (select .cse188 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse186 v_ArrVal_1911))) (= (select .cse186 (select .cse188 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse190 (store .cse18 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse189 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898)) (.cse191 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse190 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911))) (or (not (= 1 (select .cse189 (select .cse190 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse189 (select .cse191 v_arrayElimCell_149)) 1) (= (select .cse189 (select .cse191 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|)) (not (= 1 (select .cse189 v_ArrVal_1911))) (= (select .cse189 (select .cse191 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))) .cse14) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse192 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse193 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse192 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse193) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (let ((.cse196 (store .cse193 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse194 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse196) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse195 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse196 |ULTIMATE.start_main_~#iter~0#1.offset| .cse194)) .cse194))) (or (not (= 1 (select .cse192 .cse194))) (= (select .cse192 (select .cse195 v_ArrVal_1910)) 1) (= (select .cse192 (select .cse195 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (forall ((v_arrayElimCell_149 Int)) (= (select .cse192 (select .cse195 v_arrayElimCell_149)) 1))))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse197 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse198 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse197 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse198) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (or (forall ((v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse201 (store .cse198 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse200 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse201) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse199 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse201 |ULTIMATE.start_main_~#iter~0#1.offset| .cse200)) .cse200))) (or (= (select .cse197 (select .cse199 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse197 (select .cse199 v_arrayElimCell_149)) 1) (not (= 1 (select .cse197 .cse200))) (= (select .cse197 (select .cse199 v_ArrVal_1910)) 1) (= (select .cse197 (select .cse199 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (or .cse13 .cse14 (and (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse203 (store .cse18 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse202 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (not (= 1 (select .cse202 (select .cse203 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse202 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse203 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911) v_ArrVal_1910)) 1) (< |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse202 v_ArrVal_1911)))))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse205 (store .cse18 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse206 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse205 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911)) (.cse204 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (not (= 1 (select .cse204 (select .cse205 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse204 (select .cse206 v_arrayElimCell_149)) 1) (= (select .cse204 (select .cse206 v_ArrVal_1910)) 1) (< |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse204 v_ArrVal_1911))) (= |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((v_ArrVal_1899 Int)) (< (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|) .cse0)) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse208 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse211 (store .cse208 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse210 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse211) |c_ULTIMATE.start_main_~item~0#1.base|) .cse6))) (let ((.cse207 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse209 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse211 |ULTIMATE.start_main_~#iter~0#1.offset| .cse210)) .cse210))) (or (not (= 1 (select .cse207 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse208) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse207 (select .cse209 v_ArrVal_1910)) 1) (not (= 1 (select .cse207 .cse210))) (= .cse6 |ULTIMATE.start_main_~#iter~0#1.offset|) (= (select .cse207 (select .cse209 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1))))))))) (or .cse13 .cse62 .cse14) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse212 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse213 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse212 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse213) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse217 (store .cse213 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse216 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse215 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse217) |c_ULTIMATE.start_main_~item~0#1.base|) .cse216))) (let ((.cse214 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse217 |ULTIMATE.start_main_~#iter~0#1.offset| .cse215)) .cse215))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (= (select .cse212 (select .cse214 v_arrayElimCell_149)) 1) (not (= 1 (select .cse212 .cse215))) (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |ULTIMATE.start_main_~#iter~0#1.offset|) (= (select .cse212 (select .cse214 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse216 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse212 (select .cse214 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse218 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse222 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (let ((.cse221 (store .cse222 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse220 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse221) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse219 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse221 |ULTIMATE.start_main_~#iter~0#1.offset| .cse220)) .cse220))) (or (= (select .cse218 (select .cse219 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse218 .cse220))) (= (select .cse218 (select .cse219 v_ArrVal_1910)) 1) (= (select .cse218 (select .cse219 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (forall ((v_arrayElimCell_149 Int)) (= (select .cse218 (select .cse219 v_arrayElimCell_149)) 1))))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))))) (not (= 1 (select .cse218 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse222) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int) (v_ArrVal_1899 Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (< (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|) .cse0) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse224 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse226 (store .cse224 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse223 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse225 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse226) |c_ULTIMATE.start_main_~item~0#1.base|) .cse6))) (or (not (= 1 (select .cse223 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse224) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~#iter~0#1.offset|) (not (= 1 (select .cse223 .cse225))) (= .cse6 |ULTIMATE.start_main_~#iter~0#1.offset|) (= (select .cse223 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse226 |ULTIMATE.start_main_~#iter~0#1.offset| .cse225)) .cse225) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))))) (or .cse13 (forall ((v_ArrVal_1910 Int) (v_ArrVal_1911 Int)) (let ((.cse227 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse72 .cse6 v_ArrVal_1911) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911))) (or (= (select .cse70 (select .cse227 v_ArrVal_1910)) 1) (not (= 1 (select .cse70 v_ArrVal_1911))) (= (select .cse70 (select .cse227 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))) .cse14) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse228 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse233 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (let ((.cse232 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (or (forall ((v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse231 (store .cse233 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse230 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse231) |c_ULTIMATE.start_main_~item~0#1.base|) .cse232))) (let ((.cse229 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse231 |ULTIMATE.start_main_~#iter~0#1.offset| .cse230)) .cse230))) (or (= (select .cse228 (select .cse229 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse228 (select .cse229 v_arrayElimCell_149)) 1) (not (= 1 (select .cse228 .cse230))) (= (select .cse228 (select .cse229 v_ArrVal_1910)) 1) (= (select .cse228 (select .cse229 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse232 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))) (not (= 1 (select .cse228 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse233) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse234 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse235 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse234 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse235) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (or (forall ((v_ArrVal_1911 Int)) (let ((.cse238 (store .cse235 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse237 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse238) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse236 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse238 |ULTIMATE.start_main_~#iter~0#1.offset| .cse237)) .cse237))) (or (= (select .cse234 (select .cse236 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse234 .cse237))) (forall ((v_arrayElimCell_149 Int)) (= (select .cse234 (select .cse236 v_arrayElimCell_149)) 1))))))) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse239 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse240 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse239 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse240) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse244 (store .cse240 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse243 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse242 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse244) |c_ULTIMATE.start_main_~item~0#1.base|) .cse243))) (let ((.cse241 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse244 |ULTIMATE.start_main_~#iter~0#1.offset| .cse242)) .cse242))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (= (select .cse239 (select .cse241 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse239 (select .cse241 v_arrayElimCell_149)) 1) (not (= 1 (select .cse239 .cse242))) (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |ULTIMATE.start_main_~#iter~0#1.offset|) (= (select .cse239 (select .cse241 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse243 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse239 (select .cse241 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1898 Int)) (let ((.cse245 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse246 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (not (= 1 (select .cse245 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse246) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int)) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (forall ((v_arrayElimCell_149 Int) (v_ArrVal_1911 Int)) (let ((.cse249 (store .cse246 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911))) (let ((.cse248 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse249) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4)))) (let ((.cse247 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse249 |ULTIMATE.start_main_~#iter~0#1.offset| .cse248)) .cse248))) (or (= (select .cse245 (select .cse247 v_arrayElimCell_149)) 1) (not (= 1 (select .cse245 .cse248))) (= (select .cse245 (select .cse247 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))) (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))))) (or .cse13 (and .cse69 .cse77) .cse14) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (v_ArrVal_1899 Int) (v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse251 (store (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|))) (let ((.cse255 (store .cse251 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse254 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse253 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse255) |c_ULTIMATE.start_main_~item~0#1.base|) .cse254))) (let ((.cse250 (store |c_#valid| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse252 (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse255 |ULTIMATE.start_main_~#iter~0#1.offset| .cse253)) .cse253))) (or (= |v_ULTIMATE.start_main_#t~mem11#1.offset_16| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse250 (select (select (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse251) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse250 (select .cse252 v_arrayElimCell_149)) 1) (not (= 1 (select .cse250 .cse253))) (= (select .cse250 (select .cse252 v_ArrVal_1910)) 1) (not (<= |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= .cse254 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (<= (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 8) (select (store |c_#length| |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1899) |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select .cse250 (select .cse252 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))) (= |c_ULTIMATE.start_main_~item~0#1.base| |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (or .cse13 (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (v_ArrVal_1910 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse257 (store .cse18 |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse256 (store |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1898))) (or (not (= 1 (select .cse256 (select .cse257 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (= (select .cse256 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse257 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911) |ULTIMATE.start_main_~#iter~0#1.offset| v_ArrVal_1911)) v_ArrVal_1911) v_ArrVal_1910)) 1) (< |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|) (not (= 1 (select .cse256 v_ArrVal_1911))) (= |ULTIMATE.start_main_~#iter~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|)))) .cse14)))))) is different from true [2023-02-15 21:57:22,162 WARN L859 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_248 Int) (v_prenex_249 Int) (v_prenex_246 Int) (v_prenex_244 Int) (v_prenex_245 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse4 (store (select .cse3 v_prenex_245) v_prenex_244 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse6 (store .cse4 (+ v_prenex_244 4) v_prenex_249))) (let ((.cse5 (select (select (store .cse3 v_prenex_245 .cse6) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse1 (store .cse0 v_prenex_245 v_prenex_248)) (.cse2 (select (store .cse3 v_prenex_245 (store .cse6 v_prenex_244 .cse5)) .cse5))) (or (not (= 0 (select .cse0 v_prenex_245))) (= (select .cse1 (select .cse2 v_prenex_246)) 1) (not (< |c_#StackHeapBarrier| v_prenex_245)) (not (= 1 (select .cse1 (select (select (store .cse3 v_prenex_245 .cse4) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse1 (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse1 .cse5))) (= (select .cse1 (select .cse2 0)) 1)))))))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_167 Int) (v_prenex_168 Int) (v_prenex_166 Int) (v_prenex_163 Int) (v_prenex_164 Int) (v_prenex_161 Int) (v_prenex_162 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse12 (store (select .cse11 v_prenex_163) v_prenex_161 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse13 (store .cse12 (+ v_prenex_161 4) v_prenex_168))) (let ((.cse10 (select (select (store .cse11 v_prenex_163 .cse13) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_162 4))) (.cse9 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse7 (store .cse9 v_prenex_163 v_prenex_167)) (.cse8 (select (store .cse11 v_prenex_163 (store .cse13 v_prenex_161 .cse10)) .cse10))) (or (= (select .cse7 (select .cse8 v_prenex_164)) 1) (= (select .cse7 (select .cse8 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (<= 0 v_prenex_162)) (not (< |c_#StackHeapBarrier| v_prenex_163)) (not (= 0 (select .cse9 v_prenex_163))) (not (= 1 (select .cse7 .cse10))) (= (select .cse7 (select .cse8 v_prenex_166)) 1) (not (= 1 (select .cse7 (select (select (store .cse11 v_prenex_163 .cse12) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse7 (select .cse8 0)) 1) (< 0 v_prenex_162)))))))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int) (v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse16 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse17 (store (select .cse16 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse21 (store .cse17 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse18 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse19 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse20 (select (select (store .cse16 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse21) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse18))) (let ((.cse15 (select (store .cse16 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse21 |ULTIMATE.start_main_~#iter~0#1.offset| .cse20)) .cse20)) (.cse14 (store .cse19 |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898))) (or (not (<= 0 |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (= (select .cse14 (select .cse15 v_ArrVal_1910)) 1) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (< 0 |v_ULTIMATE.start_main_#t~mem11#1.offset_16|) (not (= 1 (select .cse14 (select (select (store .cse16 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse17) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse14 (select .cse15 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse14 (select .cse15 v_arrayElimCell_149)) 1) (= (select .cse14 (select .cse15 0)) 1) (= .cse18 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (= 0 (select .cse19 |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (not (= 1 (select .cse14 .cse20)))))))))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_8 Int)) (let ((.cse24 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse25 (store (select .cse24 v_prenex_4) v_prenex_2 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse28 (store .cse25 (+ v_prenex_2 4) v_prenex_8))) (let ((.cse27 (select (select (store .cse24 v_prenex_4 .cse28) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_3 4))) (.cse26 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse22 (store .cse26 v_prenex_4 v_prenex_7)) (.cse23 (select (store .cse24 v_prenex_4 (store .cse28 v_prenex_2 .cse27)) .cse27))) (or (not (<= 0 v_prenex_3)) (not (< |c_#StackHeapBarrier| v_prenex_4)) (= (select .cse22 (select .cse23 v_prenex_6)) 1) (< 0 v_prenex_3) (not (= 1 (select .cse22 (select (select (store .cse24 v_prenex_4 .cse25) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse26 v_prenex_4))) (not (= 1 (select .cse22 .cse27))) (= (select .cse22 (select .cse23 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1)))))))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_145 Int) (v_prenex_144 Int) (v_prenex_141 Int) (v_prenex_142 Int)) (let ((.cse30 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse34 (store (select .cse30 v_prenex_142) v_prenex_141 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse33 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse31 (store .cse34 (+ v_prenex_141 4) v_prenex_145))) (let ((.cse32 (select (select (store .cse30 v_prenex_142 .cse31) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse29 (store .cse33 v_prenex_142 v_prenex_144))) (or (not (< |c_#StackHeapBarrier| v_prenex_142)) (= (select .cse29 (select (select (store .cse30 v_prenex_142 (store .cse31 v_prenex_141 .cse32)) .cse32) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse29 .cse32))) (not (= 0 (select .cse33 v_prenex_142))) (not (= 1 (select .cse29 (select (select (store .cse30 v_prenex_142 .cse34) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))))))))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_200 Int) (v_prenex_199 Int) (v_prenex_196 Int) (v_prenex_197 Int) (v_prenex_195 Int)) (let ((.cse39 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse40 (store (select .cse39 v_prenex_196) v_prenex_195 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse41 (store .cse40 (+ v_prenex_195 4) v_prenex_200))) (let ((.cse38 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse37 (select (select (store .cse39 v_prenex_196 .cse41) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (let ((.cse36 (select (store .cse39 v_prenex_196 (store .cse41 v_prenex_195 .cse37)) .cse37)) (.cse35 (store .cse38 v_prenex_196 v_prenex_199))) (or (not (< |c_#StackHeapBarrier| v_prenex_196)) (= (select .cse35 (select .cse36 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse35 .cse37))) (= 4 v_prenex_195) (not (= 0 (select .cse38 v_prenex_196))) (= (select .cse35 (select .cse36 v_prenex_197)) 1) (not (= 1 (select .cse35 (select (select (store .cse39 v_prenex_196 .cse40) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0))))))))))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_77 Int) (v_prenex_79 Int) (v_prenex_76 Int) (v_prenex_75 Int) (v_prenex_80 Int)) (let ((.cse44 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse45 (store (select .cse44 v_prenex_76) v_prenex_75 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse48 (store .cse45 (+ v_prenex_75 4) v_prenex_80))) (let ((.cse47 (select (select (store .cse44 v_prenex_76 .cse48) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse46 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse42 (store .cse46 v_prenex_76 v_prenex_79)) (.cse43 (select (store .cse44 v_prenex_76 (store .cse48 v_prenex_75 .cse47)) .cse47))) (or (= (select .cse42 (select .cse43 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse42 (select (select (store .cse44 v_prenex_76 .cse45) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse42 (select .cse43 0)) 1) (not (< |c_#StackHeapBarrier| v_prenex_76)) (not (= 0 (select .cse46 v_prenex_76))) (not (= 1 (select .cse42 .cse47))) (= (select .cse42 (select .cse43 v_prenex_77)) 1)))))))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_184 Int) (v_prenex_182 Int)) (let ((.cse50 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse51 (store (select .cse50 v_prenex_182) 0 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse55 (store .cse51 4 v_prenex_186))) (let ((.cse54 (select (select (store .cse50 v_prenex_182 .cse55) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse53 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse49 (store .cse53 v_prenex_182 v_prenex_185)) (.cse52 (select (store .cse50 v_prenex_182 (store .cse55 0 .cse54)) .cse54))) (or (not (= 1 (select .cse49 (select (select (store .cse50 v_prenex_182 .cse51) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse49 (select .cse52 v_prenex_184)) 1) (not (= 0 (select .cse53 v_prenex_182))) (not (< |c_#StackHeapBarrier| v_prenex_182)) (not (= 1 (select .cse49 .cse54))) (= (select .cse49 (select .cse52 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_101 Int) (v_prenex_102 Int) (v_prenex_100 Int) (v_prenex_96 Int) (v_prenex_95 Int) (v_prenex_98 Int) (v_prenex_97 Int)) (let ((.cse59 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse60 (store (select .cse59 v_prenex_97) v_prenex_95 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse62 (store .cse60 (+ v_prenex_95 4) v_prenex_102))) (let ((.cse61 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse57 (select (select (store .cse59 v_prenex_97 .cse62) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_96 4)))) (let ((.cse58 (select (store .cse59 v_prenex_97 (store .cse62 v_prenex_95 .cse57)) .cse57)) (.cse56 (store .cse61 v_prenex_97 v_prenex_101))) (or (not (= 1 (select .cse56 .cse57))) (not (<= 0 v_prenex_96)) (not (< |c_#StackHeapBarrier| v_prenex_97)) (= (select .cse56 (select .cse58 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse56 (select .cse58 v_prenex_98)) 1) (= (select .cse56 (select .cse58 v_prenex_100)) 1) (= (select .cse56 (select .cse58 0)) 1) (not (= 1 (select .cse56 (select (select (store .cse59 v_prenex_97 .cse60) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (< 0 v_prenex_96) (not (= 0 (select .cse61 v_prenex_97)))))))))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_116 Int) (v_prenex_117 Int) (v_prenex_115 Int) (v_prenex_112 Int) (v_prenex_113 Int) (v_prenex_111 Int)) (let ((.cse67 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse68 (store (select .cse67 v_prenex_113) v_prenex_111 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse70 (store .cse68 (+ v_prenex_111 4) v_prenex_117)) (.cse66 (+ v_prenex_112 4))) (let ((.cse65 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse69 (select (select (store .cse67 v_prenex_113 .cse70) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse66))) (let ((.cse64 (select (store .cse67 v_prenex_113 (store .cse70 v_prenex_111 .cse69)) .cse69)) (.cse63 (store .cse65 v_prenex_113 v_prenex_116))) (or (= (select .cse63 (select .cse64 v_prenex_115)) 1) (not (= 0 (select .cse65 v_prenex_113))) (< 0 v_prenex_112) (= (select .cse63 (select .cse64 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= .cse66 v_prenex_111) (not (< |c_#StackHeapBarrier| v_prenex_113)) (= v_prenex_112 v_prenex_111) (not (<= 0 v_prenex_112)) (not (= 1 (select .cse63 (select (select (store .cse67 v_prenex_113 .cse68) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 1 (select .cse63 .cse69)))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_158 Int) (v_prenex_159 Int) (v_prenex_156 Int) (v_prenex_154 Int) (v_prenex_155 Int) (v_prenex_160 Int)) (let ((.cse75 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse76 (store (select .cse75 v_prenex_156) v_prenex_154 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse78 (store .cse76 (+ v_prenex_154 4) v_prenex_160)) (.cse77 (+ v_prenex_155 4))) (let ((.cse73 (select (select (store .cse75 v_prenex_156 .cse78) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse77)) (.cse74 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse71 (store .cse74 v_prenex_156 v_prenex_159)) (.cse72 (select (store .cse75 v_prenex_156 (store .cse78 v_prenex_154 .cse73)) .cse73))) (or (not (<= 0 v_prenex_155)) (< 0 v_prenex_155) (= (select .cse71 (select .cse72 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse71 .cse73))) (not (= 0 (select .cse74 v_prenex_156))) (not (= 1 (select .cse71 (select (select (store .cse75 v_prenex_156 .cse76) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (< |c_#StackHeapBarrier| v_prenex_156)) (= (select .cse71 (select .cse72 v_prenex_158)) 1) (= .cse77 v_prenex_154)))))))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_127 Int) (v_prenex_128 Int) (v_prenex_126 Int) (v_prenex_132 Int) (v_prenex_133 Int) (v_prenex_131 Int) (v_prenex_129 Int)) (let ((.cse84 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse85 (store (select .cse84 v_prenex_128) v_prenex_126 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse86 (store .cse85 (+ v_prenex_126 4) v_prenex_133)) (.cse82 (+ v_prenex_127 4))) (let ((.cse80 (select (select (store .cse84 v_prenex_128 .cse86) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse82)) (.cse83 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse79 (store .cse83 v_prenex_128 v_prenex_132)) (.cse81 (select (store .cse84 v_prenex_128 (store .cse86 v_prenex_126 .cse80)) .cse80))) (or (not (<= 0 v_prenex_127)) (not (= 1 (select .cse79 .cse80))) (= (select .cse79 (select .cse81 0)) 1) (= (select .cse79 (select .cse81 v_prenex_129)) 1) (= .cse82 v_prenex_126) (= v_prenex_127 v_prenex_126) (= (select .cse79 (select .cse81 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 0 (select .cse83 v_prenex_128))) (< 0 v_prenex_127) (not (= 1 (select .cse79 (select (select (store .cse84 v_prenex_128 .cse85) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse79 (select .cse81 v_prenex_131)) 1) (not (< |c_#StackHeapBarrier| v_prenex_128))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_19 Int)) (let ((.cse90 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse91 (store (select .cse90 v_prenex_19) v_prenex_17 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse93 (store .cse91 (+ v_prenex_17 4) v_prenex_23))) (let ((.cse92 (select (select (store .cse90 v_prenex_19 .cse93) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_18 4))) (.cse89 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse87 (store .cse89 v_prenex_19 v_prenex_22)) (.cse88 (select (store .cse90 v_prenex_19 (store .cse93 v_prenex_17 .cse92)) .cse92))) (or (not (<= 0 v_prenex_18)) (= (select .cse87 (select .cse88 v_prenex_21)) 1) (= (select .cse87 (select .cse88 0)) 1) (not (= 0 (select .cse89 v_prenex_19))) (not (< |c_#StackHeapBarrier| v_prenex_19)) (= v_prenex_18 v_prenex_17) (not (= 1 (select .cse87 (select (select (store .cse90 v_prenex_19 .cse91) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 1 (select .cse87 .cse92))) (= (select .cse87 (select .cse88 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (< 0 v_prenex_18)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_226 Int) (v_prenex_227 Int) (v_prenex_225 Int) (v_prenex_222 Int) (v_prenex_223 Int) (v_prenex_221 Int)) (let ((.cse95 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse96 (store (select .cse95 v_prenex_223) v_prenex_221 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse100 (store .cse96 (+ v_prenex_221 4) v_prenex_227))) (let ((.cse97 (select (select (store .cse95 v_prenex_223 .cse100) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_222 4))) (.cse98 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse94 (store .cse98 v_prenex_223 v_prenex_226)) (.cse99 (select (store .cse95 v_prenex_223 (store .cse100 v_prenex_221 .cse97)) .cse97))) (or (not (= 1 (select .cse94 (select (select (store .cse95 v_prenex_223 .cse96) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 1 (select .cse94 .cse97))) (not (= 0 (select .cse98 v_prenex_223))) (not (< |c_#StackHeapBarrier| v_prenex_223)) (< 0 v_prenex_222) (= (select .cse94 (select .cse99 v_prenex_225)) 1) (not (<= 0 v_prenex_222)) (= (select .cse94 (select .cse99 0)) 1) (= (select .cse94 (select .cse99 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1)))))))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_204 Int) (v_prenex_202 Int) (v_prenex_203 Int) (v_prenex_201 Int) (v_prenex_208 Int) (v_prenex_206 Int) (v_prenex_207 Int)) (let ((.cse104 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse105 (store (select .cse104 v_prenex_203) v_prenex_201 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse107 (store .cse105 (+ v_prenex_201 4) v_prenex_208))) (let ((.cse106 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse103 (select (select (store .cse104 v_prenex_203 .cse107) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_202 4)))) (let ((.cse102 (select (store .cse104 v_prenex_203 (store .cse107 v_prenex_201 .cse103)) .cse103)) (.cse101 (store .cse106 v_prenex_203 v_prenex_207))) (or (not (<= 0 v_prenex_202)) (= (select .cse101 (select .cse102 v_prenex_204)) 1) (= (select .cse101 (select .cse102 v_prenex_206)) 1) (< 0 v_prenex_202) (not (< |c_#StackHeapBarrier| v_prenex_203)) (= (select .cse101 (select .cse102 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse101 (select .cse102 0)) 1) (not (= 1 (select .cse101 .cse103))) (not (= 1 (select .cse101 (select (select (store .cse104 v_prenex_203 .cse105) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse106 v_prenex_203)))))))))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_259 Int) (v_prenex_258 Int) (v_prenex_262 Int) (v_prenex_263 Int) (v_prenex_260 Int)) (let ((.cse112 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse113 (store (select .cse112 v_prenex_259) v_prenex_258 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse114 (store .cse113 (+ v_prenex_258 4) v_prenex_263))) (let ((.cse111 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse110 (select (select (store .cse112 v_prenex_259 .cse114) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (let ((.cse109 (select (store .cse112 v_prenex_259 (store .cse114 v_prenex_258 .cse110)) .cse110)) (.cse108 (store .cse111 v_prenex_259 v_prenex_262))) (or (= (select .cse108 (select .cse109 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= 4 v_prenex_258) (= (select .cse108 (select .cse109 v_prenex_260)) 1) (not (= 1 (select .cse108 .cse110))) (not (< |c_#StackHeapBarrier| v_prenex_259)) (not (= 0 (select .cse111 v_prenex_259))) (not (= 1 (select .cse108 (select (select (store .cse112 v_prenex_259 .cse113) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_235 Int) (v_prenex_233 Int) (v_prenex_234 Int) (v_prenex_231 Int) (v_prenex_230 Int) (v_prenex_228 Int) (v_prenex_229 Int)) (let ((.cse119 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse120 (store (select .cse119 v_prenex_230) v_prenex_228 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse122 (store .cse120 (+ v_prenex_228 4) v_prenex_235)) (.cse121 (+ v_prenex_229 4))) (let ((.cse118 (select (select (store .cse119 v_prenex_230 .cse122) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse121)) (.cse117 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse115 (store .cse117 v_prenex_230 v_prenex_234)) (.cse116 (select (store .cse119 v_prenex_230 (store .cse122 v_prenex_228 .cse118)) .cse118))) (or (= (select .cse115 (select .cse116 v_prenex_231)) 1) (not (= 0 (select .cse117 v_prenex_230))) (not (= 1 (select .cse115 .cse118))) (not (<= 0 v_prenex_229)) (< 0 v_prenex_229) (not (= 1 (select .cse115 (select (select (store .cse119 v_prenex_230 .cse120) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse115 (select .cse116 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (< |c_#StackHeapBarrier| v_prenex_230)) (= .cse121 v_prenex_228) (= (select .cse115 (select .cse116 v_prenex_233)) 1) (= (select .cse115 (select .cse116 0)) 1)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_216 Int) (v_prenex_220 Int) (v_prenex_219 Int) (v_prenex_217 Int)) (let ((.cse124 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse127 (store (select .cse124 v_prenex_217) v_prenex_216 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse128 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse125 (store .cse127 (+ v_prenex_216 4) v_prenex_220))) (let ((.cse126 (select (select (store .cse124 v_prenex_217 .cse125) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse123 (store .cse128 v_prenex_217 v_prenex_219))) (or (= (select .cse123 (select (select (store .cse124 v_prenex_217 (store .cse125 v_prenex_216 .cse126)) .cse126) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (< |c_#StackHeapBarrier| v_prenex_217)) (not (= 1 (select .cse123 .cse126))) (= 4 v_prenex_216) (not (= 1 (select .cse123 (select (select (store .cse124 v_prenex_217 .cse127) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse128 v_prenex_217))))))))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_59 Int) (v_prenex_55 Int) (v_prenex_58 Int) (v_prenex_57 Int) (v_prenex_52 Int) (v_prenex_54 Int) (v_prenex_53 Int)) (let ((.cse131 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse132 (store (select .cse131 v_prenex_54) v_prenex_52 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse136 (store .cse132 (+ v_prenex_52 4) v_prenex_59)) (.cse135 (+ v_prenex_53 4))) (let ((.cse130 (select (select (store .cse131 v_prenex_54 .cse136) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse135)) (.cse134 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse129 (store .cse134 v_prenex_54 v_prenex_58)) (.cse133 (select (store .cse131 v_prenex_54 (store .cse136 v_prenex_52 .cse130)) .cse130))) (or (not (= 1 (select .cse129 .cse130))) (not (= 1 (select .cse129 (select (select (store .cse131 v_prenex_54 .cse132) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse129 (select .cse133 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (< 0 v_prenex_53) (not (< |c_#StackHeapBarrier| v_prenex_54)) (not (<= 0 v_prenex_53)) (= (select .cse129 (select .cse133 0)) 1) (= (select .cse129 (select .cse133 v_prenex_57)) 1) (not (= 0 (select .cse134 v_prenex_54))) (= (select .cse129 (select .cse133 v_prenex_55)) 1) (= .cse135 v_prenex_52)))))))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_51 Int) (v_prenex_50 Int)) (let ((.cse138 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse141 (store (select .cse138 v_prenex_48) v_prenex_47 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse139 (store .cse141 (+ v_prenex_47 4) v_prenex_51)) (.cse142 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse137 (store .cse142 v_prenex_48 v_prenex_50)) (.cse140 (select (select (store .cse138 v_prenex_48 .cse139) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (or (= 0 v_prenex_47) (= (select .cse137 (select (select (store .cse138 v_prenex_48 (store .cse139 v_prenex_47 .cse140)) .cse140) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse137 (select (select (store .cse138 v_prenex_48 .cse141) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse142 v_prenex_48))) (= 4 v_prenex_47) (not (< |c_#StackHeapBarrier| v_prenex_48)) (not (= 1 (select .cse137 .cse140))))))))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_178 Int) (v_prenex_176 Int) (v_prenex_177 Int) (v_prenex_181 Int) (v_prenex_180 Int)) (let ((.cse144 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse145 (store (select .cse144 v_prenex_177) v_prenex_176 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse149 (store .cse145 (+ v_prenex_176 4) v_prenex_181))) (let ((.cse146 (select (select (store .cse144 v_prenex_177 .cse149) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse147 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse143 (store .cse147 v_prenex_177 v_prenex_180)) (.cse148 (select (store .cse144 v_prenex_177 (store .cse149 v_prenex_176 .cse146)) .cse146))) (or (= 4 v_prenex_176) (not (= 1 (select .cse143 (select (select (store .cse144 v_prenex_177 .cse145) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (< |c_#StackHeapBarrier| v_prenex_177)) (not (= 1 (select .cse143 .cse146))) (not (= 0 (select .cse147 v_prenex_177))) (= (select .cse143 (select .cse148 v_prenex_178)) 1) (= (select .cse143 (select .cse148 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse143 (select .cse148 0)) 1))))))))))) is different from true [2023-02-15 21:57:25,792 WARN L859 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_216 Int) (v_prenex_220 Int) (v_prenex_219 Int) (v_prenex_217 Int)) (let ((.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse6 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse6 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse4 (store (select .cse2 v_prenex_217) v_prenex_216 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse5 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse3 (store .cse4 (+ v_prenex_216 4) v_prenex_220))) (let ((.cse1 (select (select (store .cse2 v_prenex_217 .cse3) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse0 (store .cse5 v_prenex_217 v_prenex_219))) (or (not (< |c_#StackHeapBarrier| v_prenex_217)) (not (= 1 (select .cse0 .cse1))) (= (select .cse0 (select (select (store .cse2 v_prenex_217 (store .cse3 v_prenex_216 .cse1)) .cse1) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse0 (select (select (store .cse2 v_prenex_217 .cse4) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= 4 v_prenex_216) (not (= 0 (select .cse5 v_prenex_217))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_184 Int) (v_prenex_182 Int)) (let ((.cse11 (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse14 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse14 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse12 (store (select .cse11 v_prenex_182) 0 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse13 (store .cse12 4 v_prenex_186))) (let ((.cse7 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse9 (select (select (store .cse11 v_prenex_182 .cse13) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (let ((.cse10 (select (store .cse11 v_prenex_182 (store .cse13 0 .cse9)) .cse9)) (.cse8 (store .cse7 v_prenex_182 v_prenex_185))) (or (not (= 0 (select .cse7 v_prenex_182))) (not (< |c_#StackHeapBarrier| v_prenex_182)) (not (= 1 (select .cse8 .cse9))) (= (select .cse8 (select .cse10 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse8 (select .cse10 v_prenex_184)) 1) (not (= 1 (select .cse8 (select (select (store .cse11 v_prenex_182 .cse12) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0))))))))))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_204 Int) (v_prenex_202 Int) (v_prenex_203 Int) (v_prenex_201 Int) (v_prenex_208 Int) (v_prenex_206 Int) (v_prenex_207 Int)) (let ((.cse18 (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse22 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse22 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse19 (store (select .cse18 v_prenex_203) v_prenex_201 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse21 (store .cse19 (+ v_prenex_201 4) v_prenex_208))) (let ((.cse20 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse16 (select (select (store .cse18 v_prenex_203 .cse21) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_202 4)))) (let ((.cse17 (select (store .cse18 v_prenex_203 (store .cse21 v_prenex_201 .cse16)) .cse16)) (.cse15 (store .cse20 v_prenex_203 v_prenex_207))) (or (not (<= 0 v_prenex_202)) (< 0 v_prenex_202) (not (< |c_#StackHeapBarrier| v_prenex_203)) (not (= 1 (select .cse15 .cse16))) (= (select .cse15 (select .cse17 v_prenex_206)) 1) (= (select .cse15 (select .cse17 0)) 1) (= (select .cse15 (select .cse17 v_prenex_204)) 1) (= (select .cse15 (select .cse17 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse15 (select (select (store .cse18 v_prenex_203 .cse19) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse20 v_prenex_203)))))))))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_226 Int) (v_prenex_227 Int) (v_prenex_225 Int) (v_prenex_222 Int) (v_prenex_223 Int) (v_prenex_221 Int)) (let ((.cse25 (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse30 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse30 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse26 (store (select .cse25 v_prenex_223) v_prenex_221 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse29 (store .cse26 (+ v_prenex_221 4) v_prenex_227))) (let ((.cse27 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse28 (select (select (store .cse25 v_prenex_223 .cse29) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_222 4)))) (let ((.cse24 (select (store .cse25 v_prenex_223 (store .cse29 v_prenex_221 .cse28)) .cse28)) (.cse23 (store .cse27 v_prenex_223 v_prenex_226))) (or (= (select .cse23 (select .cse24 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse23 (select .cse24 v_prenex_225)) 1) (not (= 1 (select .cse23 (select (select (store .cse25 v_prenex_223 .cse26) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse27 v_prenex_223))) (= (select .cse23 (select .cse24 0)) 1) (not (< |c_#StackHeapBarrier| v_prenex_223)) (< 0 v_prenex_222) (not (= 1 (select .cse23 .cse28))) (not (<= 0 v_prenex_222))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_59 Int) (v_prenex_55 Int) (v_prenex_58 Int) (v_prenex_57 Int) (v_prenex_52 Int) (v_prenex_54 Int) (v_prenex_53 Int)) (let ((.cse33 (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse39 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse39 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse34 (store (select .cse33 v_prenex_54) v_prenex_52 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse38 (store .cse34 (+ v_prenex_52 4) v_prenex_59)) (.cse37 (+ v_prenex_53 4))) (let ((.cse36 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse35 (select (select (store .cse33 v_prenex_54 .cse38) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse37))) (let ((.cse32 (select (store .cse33 v_prenex_54 (store .cse38 v_prenex_52 .cse35)) .cse35)) (.cse31 (store .cse36 v_prenex_54 v_prenex_58))) (or (= (select .cse31 (select .cse32 v_prenex_57)) 1) (= (select .cse31 (select .cse32 v_prenex_55)) 1) (not (= 1 (select .cse31 (select (select (store .cse33 v_prenex_54 .cse34) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse31 (select .cse32 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (< 0 v_prenex_53) (not (< |c_#StackHeapBarrier| v_prenex_54)) (= (select .cse31 (select .cse32 0)) 1) (not (<= 0 v_prenex_53)) (not (= 1 (select .cse31 .cse35))) (not (= 0 (select .cse36 v_prenex_54))) (= .cse37 v_prenex_52)))))))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_77 Int) (v_prenex_79 Int) (v_prenex_76 Int) (v_prenex_75 Int) (v_prenex_80 Int)) (let ((.cse41 (let ((.cse47 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse47 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse47 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse42 (store (select .cse41 v_prenex_76) v_prenex_75 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse46 (store .cse42 (+ v_prenex_75 4) v_prenex_80))) (let ((.cse45 (select (select (store .cse41 v_prenex_76 .cse46) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse44 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse40 (store .cse44 v_prenex_76 v_prenex_79)) (.cse43 (select (store .cse41 v_prenex_76 (store .cse46 v_prenex_75 .cse45)) .cse45))) (or (not (< |c_#StackHeapBarrier| v_prenex_76)) (not (= 1 (select .cse40 (select (select (store .cse41 v_prenex_76 .cse42) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse40 (select .cse43 0)) 1) (not (= 0 (select .cse44 v_prenex_76))) (= (select .cse40 (select .cse43 v_prenex_77)) 1) (not (= 1 (select .cse40 .cse45))) (= (select .cse40 (select .cse43 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_248 Int) (v_prenex_249 Int) (v_prenex_246 Int) (v_prenex_244 Int) (v_prenex_245 Int)) (let ((.cse52 (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse55 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse55 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse53 (store (select .cse52 v_prenex_245) v_prenex_244 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse54 (store .cse53 (+ v_prenex_244 4) v_prenex_249))) (let ((.cse51 (select (select (store .cse52 v_prenex_245 .cse54) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse48 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse49 (store .cse48 v_prenex_245 v_prenex_248)) (.cse50 (select (store .cse52 v_prenex_245 (store .cse54 v_prenex_244 .cse51)) .cse51))) (or (not (= 0 (select .cse48 v_prenex_245))) (= (select .cse49 (select .cse50 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse49 .cse51))) (= (select .cse49 (select .cse50 0)) 1) (not (< |c_#StackHeapBarrier| v_prenex_245)) (not (= 1 (select .cse49 (select (select (store .cse52 v_prenex_245 .cse53) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse49 (select .cse50 v_prenex_246)) 1)))))))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_167 Int) (v_prenex_168 Int) (v_prenex_166 Int) (v_prenex_163 Int) (v_prenex_164 Int) (v_prenex_161 Int) (v_prenex_162 Int)) (let ((.cse58 (let ((.cse63 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse63 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse63 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse59 (store (select .cse58 v_prenex_163) v_prenex_161 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse62 (store .cse59 (+ v_prenex_161 4) v_prenex_168))) (let ((.cse61 (select (select (store .cse58 v_prenex_163 .cse62) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_162 4))) (.cse60 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse56 (store .cse60 v_prenex_163 v_prenex_167)) (.cse57 (select (store .cse58 v_prenex_163 (store .cse62 v_prenex_161 .cse61)) .cse61))) (or (= (select .cse56 (select .cse57 0)) 1) (not (<= 0 v_prenex_162)) (= (select .cse56 (select .cse57 v_prenex_164)) 1) (not (< |c_#StackHeapBarrier| v_prenex_163)) (not (= 1 (select .cse56 (select (select (store .cse58 v_prenex_163 .cse59) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse60 v_prenex_163))) (not (= 1 (select .cse56 .cse61))) (= (select .cse56 (select .cse57 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse56 (select .cse57 v_prenex_166)) 1) (< 0 v_prenex_162)))))))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int) (v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse67 (let ((.cse72 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse72 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse72 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse68 (store (select .cse67 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse71 (store .cse68 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse69 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse65 (select (select (store .cse67 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse71) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse69)) (.cse70 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse64 (store .cse70 |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse66 (select (store .cse67 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse71 |ULTIMATE.start_main_~#iter~0#1.offset| .cse65)) .cse65))) (or (not (<= 0 |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 1 (select .cse64 .cse65))) (< 0 |v_ULTIMATE.start_main_#t~mem11#1.offset_16|) (= (select .cse64 (select .cse66 v_arrayElimCell_149)) 1) (= (select .cse64 (select .cse66 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse64 (select (select (store .cse67 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse68) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse64 (select .cse66 v_ArrVal_1910)) 1) (= .cse69 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (= 0 (select .cse70 |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= (select .cse64 (select .cse66 0)) 1)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_19 Int)) (let ((.cse77 (let ((.cse80 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse80 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse80 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse78 (store (select .cse77 v_prenex_19) v_prenex_17 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse79 (store .cse78 (+ v_prenex_17 4) v_prenex_23))) (let ((.cse76 (select (select (store .cse77 v_prenex_19 .cse79) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_18 4))) (.cse75 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse73 (store .cse75 v_prenex_19 v_prenex_22)) (.cse74 (select (store .cse77 v_prenex_19 (store .cse79 v_prenex_17 .cse76)) .cse76))) (or (not (<= 0 v_prenex_18)) (= (select .cse73 (select .cse74 v_prenex_21)) 1) (not (= 0 (select .cse75 v_prenex_19))) (not (< |c_#StackHeapBarrier| v_prenex_19)) (= v_prenex_18 v_prenex_17) (not (= 1 (select .cse73 .cse76))) (not (= 1 (select .cse73 (select (select (store .cse77 v_prenex_19 .cse78) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse73 (select .cse74 0)) 1) (< 0 v_prenex_18) (= (select .cse73 (select .cse74 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_259 Int) (v_prenex_258 Int) (v_prenex_262 Int) (v_prenex_263 Int) (v_prenex_260 Int)) (let ((.cse82 (let ((.cse88 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse88 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse88 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse83 (store (select .cse82 v_prenex_259) v_prenex_258 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse87 (store .cse83 (+ v_prenex_258 4) v_prenex_263))) (let ((.cse85 (select (select (store .cse82 v_prenex_259 .cse87) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse86 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse81 (store .cse86 v_prenex_259 v_prenex_262)) (.cse84 (select (store .cse82 v_prenex_259 (store .cse87 v_prenex_258 .cse85)) .cse85))) (or (= 4 v_prenex_258) (not (= 1 (select .cse81 (select (select (store .cse82 v_prenex_259 .cse83) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse81 (select .cse84 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse81 .cse85))) (not (< |c_#StackHeapBarrier| v_prenex_259)) (not (= 0 (select .cse86 v_prenex_259))) (= (select .cse81 (select .cse84 v_prenex_260)) 1)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_116 Int) (v_prenex_117 Int) (v_prenex_115 Int) (v_prenex_112 Int) (v_prenex_113 Int) (v_prenex_111 Int)) (let ((.cse93 (let ((.cse97 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse97 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse97 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse94 (store (select .cse93 v_prenex_113) v_prenex_111 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse96 (store .cse94 (+ v_prenex_111 4) v_prenex_117)) (.cse92 (+ v_prenex_112 4))) (let ((.cse89 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse95 (select (select (store .cse93 v_prenex_113 .cse96) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse92))) (let ((.cse91 (select (store .cse93 v_prenex_113 (store .cse96 v_prenex_111 .cse95)) .cse95)) (.cse90 (store .cse89 v_prenex_113 v_prenex_116))) (or (not (= 0 (select .cse89 v_prenex_113))) (= (select .cse90 (select .cse91 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse90 (select .cse91 v_prenex_115)) 1) (< 0 v_prenex_112) (= .cse92 v_prenex_111) (not (< |c_#StackHeapBarrier| v_prenex_113)) (= v_prenex_112 v_prenex_111) (not (<= 0 v_prenex_112)) (not (= 1 (select .cse90 (select (select (store .cse93 v_prenex_113 .cse94) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 1 (select .cse90 .cse95)))))))))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_158 Int) (v_prenex_159 Int) (v_prenex_156 Int) (v_prenex_154 Int) (v_prenex_155 Int) (v_prenex_160 Int)) (let ((.cse99 (let ((.cse106 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse106 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse106 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse100 (store (select .cse99 v_prenex_156) v_prenex_154 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse105 (store .cse100 (+ v_prenex_154 4) v_prenex_160)) (.cse103 (+ v_prenex_155 4))) (let ((.cse102 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse104 (select (select (store .cse99 v_prenex_156 .cse105) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse103))) (let ((.cse101 (select (store .cse99 v_prenex_156 (store .cse105 v_prenex_154 .cse104)) .cse104)) (.cse98 (store .cse102 v_prenex_156 v_prenex_159))) (or (not (<= 0 v_prenex_155)) (< 0 v_prenex_155) (not (= 1 (select .cse98 (select (select (store .cse99 v_prenex_156 .cse100) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse98 (select .cse101 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 0 (select .cse102 v_prenex_156))) (= (select .cse98 (select .cse101 v_prenex_158)) 1) (not (< |c_#StackHeapBarrier| v_prenex_156)) (= .cse103 v_prenex_154) (not (= 1 (select .cse98 .cse104)))))))))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_51 Int) (v_prenex_50 Int)) (let ((.cse108 (let ((.cse113 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse113 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse113 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse109 (store (select .cse108 v_prenex_48) v_prenex_47 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse111 (store .cse109 (+ v_prenex_47 4) v_prenex_51)) (.cse110 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse107 (store .cse110 v_prenex_48 v_prenex_50)) (.cse112 (select (select (store .cse108 v_prenex_48 .cse111) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (or (= 0 v_prenex_47) (not (= 1 (select .cse107 (select (select (store .cse108 v_prenex_48 .cse109) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse110 v_prenex_48))) (= (select .cse107 (select (select (store .cse108 v_prenex_48 (store .cse111 v_prenex_47 .cse112)) .cse112) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= 4 v_prenex_47) (not (< |c_#StackHeapBarrier| v_prenex_48)) (not (= 1 (select .cse107 .cse112))))))))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_235 Int) (v_prenex_233 Int) (v_prenex_234 Int) (v_prenex_231 Int) (v_prenex_230 Int) (v_prenex_228 Int) (v_prenex_229 Int)) (let ((.cse117 (let ((.cse122 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse122 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse122 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse118 (store (select .cse117 v_prenex_230) v_prenex_228 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse121 (store .cse118 (+ v_prenex_228 4) v_prenex_235)) (.cse120 (+ v_prenex_229 4))) (let ((.cse119 (select (select (store .cse117 v_prenex_230 .cse121) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse120)) (.cse116 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse114 (store .cse116 v_prenex_230 v_prenex_234)) (.cse115 (select (store .cse117 v_prenex_230 (store .cse121 v_prenex_228 .cse119)) .cse119))) (or (= (select .cse114 (select .cse115 0)) 1) (not (= 0 (select .cse116 v_prenex_230))) (not (= 1 (select .cse114 (select (select (store .cse117 v_prenex_230 .cse118) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (<= 0 v_prenex_229)) (< 0 v_prenex_229) (= (select .cse114 (select .cse115 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse114 (select .cse115 v_prenex_233)) 1) (not (< |c_#StackHeapBarrier| v_prenex_230)) (not (= 1 (select .cse114 .cse119))) (= (select .cse114 (select .cse115 v_prenex_231)) 1) (= .cse120 v_prenex_228)))))))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_145 Int) (v_prenex_144 Int) (v_prenex_141 Int) (v_prenex_142 Int)) (let ((.cse124 (let ((.cse129 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse129 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse129 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse127 (store (select .cse124 v_prenex_142) v_prenex_141 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse128 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse125 (store .cse127 (+ v_prenex_141 4) v_prenex_145))) (let ((.cse126 (select (select (store .cse124 v_prenex_142 .cse125) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse123 (store .cse128 v_prenex_142 v_prenex_144))) (or (= (select .cse123 (select (select (store .cse124 v_prenex_142 (store .cse125 v_prenex_141 .cse126)) .cse126) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (< |c_#StackHeapBarrier| v_prenex_142)) (not (= 1 (select .cse123 .cse126))) (not (= 1 (select .cse123 (select (select (store .cse124 v_prenex_142 .cse127) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse128 v_prenex_142))))))))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_101 Int) (v_prenex_102 Int) (v_prenex_100 Int) (v_prenex_96 Int) (v_prenex_95 Int) (v_prenex_98 Int) (v_prenex_97 Int)) (let ((.cse131 (let ((.cse137 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse137 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse137 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse132 (store (select .cse131 v_prenex_97) v_prenex_95 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse136 (store .cse132 (+ v_prenex_95 4) v_prenex_102))) (let ((.cse134 (select (select (store .cse131 v_prenex_97 .cse136) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_96 4))) (.cse135 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse130 (store .cse135 v_prenex_97 v_prenex_101)) (.cse133 (select (store .cse131 v_prenex_97 (store .cse136 v_prenex_95 .cse134)) .cse134))) (or (not (= 1 (select .cse130 (select (select (store .cse131 v_prenex_97 .cse132) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (<= 0 v_prenex_96)) (not (< |c_#StackHeapBarrier| v_prenex_97)) (= (select .cse130 (select .cse133 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse130 (select .cse133 0)) 1) (not (= 1 (select .cse130 .cse134))) (= (select .cse130 (select .cse133 v_prenex_100)) 1) (= (select .cse130 (select .cse133 v_prenex_98)) 1) (< 0 v_prenex_96) (not (= 0 (select .cse135 v_prenex_97)))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_127 Int) (v_prenex_128 Int) (v_prenex_126 Int) (v_prenex_132 Int) (v_prenex_133 Int) (v_prenex_131 Int) (v_prenex_129 Int)) (let ((.cse143 (let ((.cse146 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse146 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse146 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse144 (store (select .cse143 v_prenex_128) v_prenex_126 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse145 (store .cse144 (+ v_prenex_126 4) v_prenex_133)) (.cse141 (+ v_prenex_127 4))) (let ((.cse140 (select (select (store .cse143 v_prenex_128 .cse145) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse141)) (.cse142 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse138 (store .cse142 v_prenex_128 v_prenex_132)) (.cse139 (select (store .cse143 v_prenex_128 (store .cse145 v_prenex_126 .cse140)) .cse140))) (or (= (select .cse138 (select .cse139 0)) 1) (= (select .cse138 (select .cse139 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (<= 0 v_prenex_127)) (not (= 1 (select .cse138 .cse140))) (= .cse141 v_prenex_126) (= v_prenex_127 v_prenex_126) (not (= 0 (select .cse142 v_prenex_128))) (not (= 1 (select .cse138 (select (select (store .cse143 v_prenex_128 .cse144) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (< 0 v_prenex_127) (= (select .cse138 (select .cse139 v_prenex_129)) 1) (= (select .cse138 (select .cse139 v_prenex_131)) 1) (not (< |c_#StackHeapBarrier| v_prenex_128))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_8 Int)) (let ((.cse151 (let ((.cse154 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse154 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse154 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse152 (store (select .cse151 v_prenex_4) v_prenex_2 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse153 (store .cse152 (+ v_prenex_2 4) v_prenex_8))) (let ((.cse149 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse150 (select (select (store .cse151 v_prenex_4 .cse153) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_3 4)))) (let ((.cse148 (select (store .cse151 v_prenex_4 (store .cse153 v_prenex_2 .cse150)) .cse150)) (.cse147 (store .cse149 v_prenex_4 v_prenex_7))) (or (= (select .cse147 (select .cse148 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (<= 0 v_prenex_3)) (= (select .cse147 (select .cse148 v_prenex_6)) 1) (not (< |c_#StackHeapBarrier| v_prenex_4)) (< 0 v_prenex_3) (not (= 0 (select .cse149 v_prenex_4))) (not (= 1 (select .cse147 .cse150))) (not (= 1 (select .cse147 (select (select (store .cse151 v_prenex_4 .cse152) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_178 Int) (v_prenex_176 Int) (v_prenex_177 Int) (v_prenex_181 Int) (v_prenex_180 Int)) (let ((.cse158 (let ((.cse162 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse162 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse162 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse159 (store (select .cse158 v_prenex_177) v_prenex_176 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse161 (store .cse159 (+ v_prenex_176 4) v_prenex_181))) (let ((.cse160 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse156 (select (select (store .cse158 v_prenex_177 .cse161) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (let ((.cse157 (select (store .cse158 v_prenex_177 (store .cse161 v_prenex_176 .cse156)) .cse156)) (.cse155 (store .cse160 v_prenex_177 v_prenex_180))) (or (not (= 1 (select .cse155 .cse156))) (= (select .cse155 (select .cse157 v_prenex_178)) 1) (= 4 v_prenex_176) (not (< |c_#StackHeapBarrier| v_prenex_177)) (= (select .cse155 (select .cse157 0)) 1) (= (select .cse155 (select .cse157 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse155 (select (select (store .cse158 v_prenex_177 .cse159) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse160 v_prenex_177)))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_200 Int) (v_prenex_199 Int) (v_prenex_196 Int) (v_prenex_197 Int) (v_prenex_195 Int)) (let ((.cse164 (let ((.cse170 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse170 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse170 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse165 (store (select .cse164 v_prenex_196) v_prenex_195 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse169 (store .cse165 (+ v_prenex_195 4) v_prenex_200))) (let ((.cse168 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse167 (select (select (store .cse164 v_prenex_196 .cse169) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (let ((.cse166 (select (store .cse164 v_prenex_196 (store .cse169 v_prenex_195 .cse167)) .cse167)) (.cse163 (store .cse168 v_prenex_196 v_prenex_199))) (or (not (< |c_#StackHeapBarrier| v_prenex_196)) (not (= 1 (select .cse163 (select (select (store .cse164 v_prenex_196 .cse165) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse163 (select .cse166 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse163 (select .cse166 v_prenex_197)) 1) (not (= 1 (select .cse163 .cse167))) (= 4 v_prenex_195) (not (= 0 (select .cse168 v_prenex_196))))))))))))) is different from true [2023-02-15 21:57:30,929 WARN L859 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_235 Int) (v_prenex_233 Int) (v_prenex_234 Int) (v_prenex_231 Int) (v_prenex_230 Int) (v_prenex_228 Int) (v_prenex_229 Int)) (let ((.cse3 (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse8 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse8 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse4 (store (select .cse3 v_prenex_230) v_prenex_228 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse7 (store .cse4 (+ v_prenex_228 4) v_prenex_235)) (.cse6 (+ v_prenex_229 4))) (let ((.cse5 (select (select (store .cse3 v_prenex_230 .cse7) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse6)) (.cse2 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse0 (store .cse2 v_prenex_230 v_prenex_234)) (.cse1 (select (store .cse3 v_prenex_230 (store .cse7 v_prenex_228 .cse5)) .cse5))) (or (= (select .cse0 (select .cse1 0)) 1) (not (= 0 (select .cse2 v_prenex_230))) (not (= 1 (select .cse0 (select (select (store .cse3 v_prenex_230 .cse4) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (<= 0 v_prenex_229)) (< 0 v_prenex_229) (= (select .cse0 (select .cse1 v_prenex_233)) 1) (= (select .cse0 (select .cse1 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (< |c_#StackHeapBarrier| v_prenex_230)) (not (= 1 (select .cse0 .cse5))) (= (select .cse0 (select .cse1 v_prenex_231)) 1) (= .cse6 v_prenex_228)))))))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_216 Int) (v_prenex_220 Int) (v_prenex_219 Int) (v_prenex_217 Int)) (let ((.cse11 (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse15 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse15 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse13 (store (select .cse11 v_prenex_217) v_prenex_216 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse14 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse12 (store .cse13 (+ v_prenex_216 4) v_prenex_220))) (let ((.cse10 (select (select (store .cse11 v_prenex_217 .cse12) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse9 (store .cse14 v_prenex_217 v_prenex_219))) (or (not (< |c_#StackHeapBarrier| v_prenex_217)) (not (= 1 (select .cse9 .cse10))) (= (select .cse9 (select (select (store .cse11 v_prenex_217 (store .cse12 v_prenex_216 .cse10)) .cse10) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse9 (select (select (store .cse11 v_prenex_217 .cse13) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= 4 v_prenex_216) (not (= 0 (select .cse14 v_prenex_217))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_184 Int) (v_prenex_182 Int)) (let ((.cse20 (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse23 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse23 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse21 (store (select .cse20 v_prenex_182) 0 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse22 (store .cse21 4 v_prenex_186))) (let ((.cse16 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse18 (select (select (store .cse20 v_prenex_182 .cse22) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (let ((.cse19 (select (store .cse20 v_prenex_182 (store .cse22 0 .cse18)) .cse18)) (.cse17 (store .cse16 v_prenex_182 v_prenex_185))) (or (not (= 0 (select .cse16 v_prenex_182))) (not (< |c_#StackHeapBarrier| v_prenex_182)) (not (= 1 (select .cse17 .cse18))) (= (select .cse17 (select .cse19 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse17 (select .cse19 v_prenex_184)) 1) (not (= 1 (select .cse17 (select (select (store .cse20 v_prenex_182 .cse21) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0))))))))))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_204 Int) (v_prenex_202 Int) (v_prenex_203 Int) (v_prenex_201 Int) (v_prenex_208 Int) (v_prenex_206 Int) (v_prenex_207 Int)) (let ((.cse27 (let ((.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse31 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse31 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse28 (store (select .cse27 v_prenex_203) v_prenex_201 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse30 (store .cse28 (+ v_prenex_201 4) v_prenex_208))) (let ((.cse29 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse25 (select (select (store .cse27 v_prenex_203 .cse30) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_202 4)))) (let ((.cse26 (select (store .cse27 v_prenex_203 (store .cse30 v_prenex_201 .cse25)) .cse25)) (.cse24 (store .cse29 v_prenex_203 v_prenex_207))) (or (not (<= 0 v_prenex_202)) (< 0 v_prenex_202) (not (< |c_#StackHeapBarrier| v_prenex_203)) (not (= 1 (select .cse24 .cse25))) (= (select .cse24 (select .cse26 v_prenex_206)) 1) (= (select .cse24 (select .cse26 0)) 1) (= (select .cse24 (select .cse26 v_prenex_204)) 1) (= (select .cse24 (select .cse26 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse24 (select (select (store .cse27 v_prenex_203 .cse28) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse29 v_prenex_203)))))))))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_226 Int) (v_prenex_227 Int) (v_prenex_225 Int) (v_prenex_222 Int) (v_prenex_223 Int) (v_prenex_221 Int)) (let ((.cse34 (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse39 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse39 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse35 (store (select .cse34 v_prenex_223) v_prenex_221 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse38 (store .cse35 (+ v_prenex_221 4) v_prenex_227))) (let ((.cse36 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse37 (select (select (store .cse34 v_prenex_223 .cse38) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_222 4)))) (let ((.cse33 (select (store .cse34 v_prenex_223 (store .cse38 v_prenex_221 .cse37)) .cse37)) (.cse32 (store .cse36 v_prenex_223 v_prenex_226))) (or (= (select .cse32 (select .cse33 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse32 (select .cse33 v_prenex_225)) 1) (not (= 1 (select .cse32 (select (select (store .cse34 v_prenex_223 .cse35) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse36 v_prenex_223))) (= (select .cse32 (select .cse33 0)) 1) (not (< |c_#StackHeapBarrier| v_prenex_223)) (< 0 v_prenex_222) (not (= 1 (select .cse32 .cse37))) (not (<= 0 v_prenex_222))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_77 Int) (v_prenex_79 Int) (v_prenex_76 Int) (v_prenex_75 Int) (v_prenex_80 Int)) (let ((.cse41 (let ((.cse47 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse47 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse47 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse42 (store (select .cse41 v_prenex_76) v_prenex_75 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse46 (store .cse42 (+ v_prenex_75 4) v_prenex_80))) (let ((.cse45 (select (select (store .cse41 v_prenex_76 .cse46) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse44 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse40 (store .cse44 v_prenex_76 v_prenex_79)) (.cse43 (select (store .cse41 v_prenex_76 (store .cse46 v_prenex_75 .cse45)) .cse45))) (or (not (< |c_#StackHeapBarrier| v_prenex_76)) (not (= 1 (select .cse40 (select (select (store .cse41 v_prenex_76 .cse42) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse40 (select .cse43 0)) 1) (not (= 0 (select .cse44 v_prenex_76))) (= (select .cse40 (select .cse43 v_prenex_77)) 1) (not (= 1 (select .cse40 .cse45))) (= (select .cse40 (select .cse43 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_248 Int) (v_prenex_249 Int) (v_prenex_246 Int) (v_prenex_244 Int) (v_prenex_245 Int)) (let ((.cse52 (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse55 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse55 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse53 (store (select .cse52 v_prenex_245) v_prenex_244 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse54 (store .cse53 (+ v_prenex_244 4) v_prenex_249))) (let ((.cse51 (select (select (store .cse52 v_prenex_245 .cse54) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse48 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse49 (store .cse48 v_prenex_245 v_prenex_248)) (.cse50 (select (store .cse52 v_prenex_245 (store .cse54 v_prenex_244 .cse51)) .cse51))) (or (not (= 0 (select .cse48 v_prenex_245))) (= (select .cse49 (select .cse50 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse49 .cse51))) (= (select .cse49 (select .cse50 0)) 1) (not (< |c_#StackHeapBarrier| v_prenex_245)) (not (= 1 (select .cse49 (select (select (store .cse52 v_prenex_245 .cse53) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse49 (select .cse50 v_prenex_246)) 1)))))))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int) (v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse59 (let ((.cse64 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse64 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse64 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse60 (store (select .cse59 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse63 (store .cse60 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse61 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse57 (select (select (store .cse59 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse63) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse61)) (.cse62 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse56 (store .cse62 |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse58 (select (store .cse59 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse63 |ULTIMATE.start_main_~#iter~0#1.offset| .cse57)) .cse57))) (or (not (<= 0 |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (not (= 1 (select .cse56 .cse57))) (< 0 |v_ULTIMATE.start_main_#t~mem11#1.offset_16|) (= (select .cse56 (select .cse58 v_arrayElimCell_149)) 1) (= (select .cse56 (select .cse58 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse56 (select (select (store .cse59 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse60) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse56 (select .cse58 v_ArrVal_1910)) 1) (= .cse61 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (= 0 (select .cse62 |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= (select .cse56 (select .cse58 0)) 1)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_167 Int) (v_prenex_168 Int) (v_prenex_166 Int) (v_prenex_163 Int) (v_prenex_164 Int) (v_prenex_161 Int) (v_prenex_162 Int)) (let ((.cse67 (let ((.cse72 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse72 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse72 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse68 (store (select .cse67 v_prenex_163) v_prenex_161 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse71 (store .cse68 (+ v_prenex_161 4) v_prenex_168))) (let ((.cse70 (select (select (store .cse67 v_prenex_163 .cse71) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_162 4))) (.cse69 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse65 (store .cse69 v_prenex_163 v_prenex_167)) (.cse66 (select (store .cse67 v_prenex_163 (store .cse71 v_prenex_161 .cse70)) .cse70))) (or (= (select .cse65 (select .cse66 0)) 1) (not (<= 0 v_prenex_162)) (= (select .cse65 (select .cse66 v_prenex_164)) 1) (not (< |c_#StackHeapBarrier| v_prenex_163)) (not (= 1 (select .cse65 (select (select (store .cse67 v_prenex_163 .cse68) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse69 v_prenex_163))) (not (= 1 (select .cse65 .cse70))) (= (select .cse65 (select .cse66 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse65 (select .cse66 v_prenex_166)) 1) (< 0 v_prenex_162)))))))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_19 Int)) (let ((.cse77 (let ((.cse80 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse80 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse80 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse78 (store (select .cse77 v_prenex_19) v_prenex_17 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse79 (store .cse78 (+ v_prenex_17 4) v_prenex_23))) (let ((.cse76 (select (select (store .cse77 v_prenex_19 .cse79) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_18 4))) (.cse75 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse73 (store .cse75 v_prenex_19 v_prenex_22)) (.cse74 (select (store .cse77 v_prenex_19 (store .cse79 v_prenex_17 .cse76)) .cse76))) (or (not (<= 0 v_prenex_18)) (= (select .cse73 (select .cse74 v_prenex_21)) 1) (not (= 0 (select .cse75 v_prenex_19))) (not (< |c_#StackHeapBarrier| v_prenex_19)) (= v_prenex_18 v_prenex_17) (not (= 1 (select .cse73 .cse76))) (not (= 1 (select .cse73 (select (select (store .cse77 v_prenex_19 .cse78) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse73 (select .cse74 0)) 1) (< 0 v_prenex_18) (= (select .cse73 (select .cse74 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_116 Int) (v_prenex_117 Int) (v_prenex_115 Int) (v_prenex_112 Int) (v_prenex_113 Int) (v_prenex_111 Int)) (let ((.cse85 (let ((.cse89 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse89 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse89 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse86 (store (select .cse85 v_prenex_113) v_prenex_111 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse88 (store .cse86 (+ v_prenex_111 4) v_prenex_117)) (.cse84 (+ v_prenex_112 4))) (let ((.cse81 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse87 (select (select (store .cse85 v_prenex_113 .cse88) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse84))) (let ((.cse83 (select (store .cse85 v_prenex_113 (store .cse88 v_prenex_111 .cse87)) .cse87)) (.cse82 (store .cse81 v_prenex_113 v_prenex_116))) (or (not (= 0 (select .cse81 v_prenex_113))) (= (select .cse82 (select .cse83 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse82 (select .cse83 v_prenex_115)) 1) (< 0 v_prenex_112) (= .cse84 v_prenex_111) (not (< |c_#StackHeapBarrier| v_prenex_113)) (= v_prenex_112 v_prenex_111) (not (<= 0 v_prenex_112)) (not (= 1 (select .cse82 (select (select (store .cse85 v_prenex_113 .cse86) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 1 (select .cse82 .cse87)))))))))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_158 Int) (v_prenex_159 Int) (v_prenex_156 Int) (v_prenex_154 Int) (v_prenex_155 Int) (v_prenex_160 Int)) (let ((.cse91 (let ((.cse98 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse98 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse98 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse92 (store (select .cse91 v_prenex_156) v_prenex_154 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse97 (store .cse92 (+ v_prenex_154 4) v_prenex_160)) (.cse95 (+ v_prenex_155 4))) (let ((.cse94 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse96 (select (select (store .cse91 v_prenex_156 .cse97) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse95))) (let ((.cse93 (select (store .cse91 v_prenex_156 (store .cse97 v_prenex_154 .cse96)) .cse96)) (.cse90 (store .cse94 v_prenex_156 v_prenex_159))) (or (not (<= 0 v_prenex_155)) (< 0 v_prenex_155) (not (= 1 (select .cse90 (select (select (store .cse91 v_prenex_156 .cse92) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse90 (select .cse93 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 0 (select .cse94 v_prenex_156))) (= (select .cse90 (select .cse93 v_prenex_158)) 1) (not (< |c_#StackHeapBarrier| v_prenex_156)) (= .cse95 v_prenex_154) (not (= 1 (select .cse90 .cse96)))))))))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_51 Int) (v_prenex_50 Int)) (let ((.cse100 (let ((.cse105 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse105 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse105 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse101 (store (select .cse100 v_prenex_48) v_prenex_47 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse103 (store .cse101 (+ v_prenex_47 4) v_prenex_51)) (.cse102 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse99 (store .cse102 v_prenex_48 v_prenex_50)) (.cse104 (select (select (store .cse100 v_prenex_48 .cse103) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (or (= 0 v_prenex_47) (not (= 1 (select .cse99 (select (select (store .cse100 v_prenex_48 .cse101) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse102 v_prenex_48))) (= (select .cse99 (select (select (store .cse100 v_prenex_48 (store .cse103 v_prenex_47 .cse104)) .cse104) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= 4 v_prenex_47) (not (< |c_#StackHeapBarrier| v_prenex_48)) (not (= 1 (select .cse99 .cse104))))))))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_259 Int) (v_prenex_258 Int) (v_prenex_262 Int) (v_prenex_263 Int) (v_prenex_260 Int)) (let ((.cse107 (let ((.cse113 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse113 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse113 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse108 (store (select .cse107 v_prenex_259) v_prenex_258 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse112 (store .cse108 (+ v_prenex_258 4) v_prenex_263))) (let ((.cse110 (select (select (store .cse107 v_prenex_259 .cse112) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse111 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse106 (store .cse111 v_prenex_259 v_prenex_262)) (.cse109 (select (store .cse107 v_prenex_259 (store .cse112 v_prenex_258 .cse110)) .cse110))) (or (not (= 1 (select .cse106 (select (select (store .cse107 v_prenex_259 .cse108) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= 4 v_prenex_258) (= (select .cse106 (select .cse109 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse106 .cse110))) (not (< |c_#StackHeapBarrier| v_prenex_259)) (not (= 0 (select .cse111 v_prenex_259))) (= (select .cse106 (select .cse109 v_prenex_260)) 1)))))))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_59 Int) (v_prenex_55 Int) (v_prenex_58 Int) (v_prenex_57 Int) (v_prenex_52 Int) (v_prenex_54 Int) (v_prenex_53 Int)) (let ((.cse116 (let ((.cse122 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse122 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse122 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse117 (store (select .cse116 v_prenex_54) v_prenex_52 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse121 (store .cse117 (+ v_prenex_52 4) v_prenex_59)) (.cse120 (+ v_prenex_53 4))) (let ((.cse119 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse118 (select (select (store .cse116 v_prenex_54 .cse121) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse120))) (let ((.cse115 (select (store .cse116 v_prenex_54 (store .cse121 v_prenex_52 .cse118)) .cse118)) (.cse114 (store .cse119 v_prenex_54 v_prenex_58))) (or (= (select .cse114 (select .cse115 v_prenex_57)) 1) (= (select .cse114 (select .cse115 v_prenex_55)) 1) (= (select .cse114 (select .cse115 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse114 (select (select (store .cse116 v_prenex_54 .cse117) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (< 0 v_prenex_53) (not (< |c_#StackHeapBarrier| v_prenex_54)) (= (select .cse114 (select .cse115 0)) 1) (not (<= 0 v_prenex_53)) (not (= 1 (select .cse114 .cse118))) (not (= 0 (select .cse119 v_prenex_54))) (= .cse120 v_prenex_52)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_145 Int) (v_prenex_144 Int) (v_prenex_141 Int) (v_prenex_142 Int)) (let ((.cse124 (let ((.cse129 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse129 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse129 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse127 (store (select .cse124 v_prenex_142) v_prenex_141 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse128 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse125 (store .cse127 (+ v_prenex_141 4) v_prenex_145))) (let ((.cse126 (select (select (store .cse124 v_prenex_142 .cse125) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse123 (store .cse128 v_prenex_142 v_prenex_144))) (or (= (select .cse123 (select (select (store .cse124 v_prenex_142 (store .cse125 v_prenex_141 .cse126)) .cse126) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (< |c_#StackHeapBarrier| v_prenex_142)) (not (= 1 (select .cse123 .cse126))) (not (= 1 (select .cse123 (select (select (store .cse124 v_prenex_142 .cse127) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse128 v_prenex_142))))))))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_101 Int) (v_prenex_102 Int) (v_prenex_100 Int) (v_prenex_96 Int) (v_prenex_95 Int) (v_prenex_98 Int) (v_prenex_97 Int)) (let ((.cse131 (let ((.cse137 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse137 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse137 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse132 (store (select .cse131 v_prenex_97) v_prenex_95 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse136 (store .cse132 (+ v_prenex_95 4) v_prenex_102))) (let ((.cse134 (select (select (store .cse131 v_prenex_97 .cse136) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_96 4))) (.cse135 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse130 (store .cse135 v_prenex_97 v_prenex_101)) (.cse133 (select (store .cse131 v_prenex_97 (store .cse136 v_prenex_95 .cse134)) .cse134))) (or (not (= 1 (select .cse130 (select (select (store .cse131 v_prenex_97 .cse132) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (<= 0 v_prenex_96)) (not (< |c_#StackHeapBarrier| v_prenex_97)) (= (select .cse130 (select .cse133 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse130 (select .cse133 0)) 1) (not (= 1 (select .cse130 .cse134))) (= (select .cse130 (select .cse133 v_prenex_100)) 1) (= (select .cse130 (select .cse133 v_prenex_98)) 1) (< 0 v_prenex_96) (not (= 0 (select .cse135 v_prenex_97)))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_127 Int) (v_prenex_128 Int) (v_prenex_126 Int) (v_prenex_132 Int) (v_prenex_133 Int) (v_prenex_131 Int) (v_prenex_129 Int)) (let ((.cse143 (let ((.cse146 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse146 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse146 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse144 (store (select .cse143 v_prenex_128) v_prenex_126 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse145 (store .cse144 (+ v_prenex_126 4) v_prenex_133)) (.cse141 (+ v_prenex_127 4))) (let ((.cse140 (select (select (store .cse143 v_prenex_128 .cse145) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse141)) (.cse142 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse138 (store .cse142 v_prenex_128 v_prenex_132)) (.cse139 (select (store .cse143 v_prenex_128 (store .cse145 v_prenex_126 .cse140)) .cse140))) (or (= (select .cse138 (select .cse139 0)) 1) (= (select .cse138 (select .cse139 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (<= 0 v_prenex_127)) (not (= 1 (select .cse138 .cse140))) (= .cse141 v_prenex_126) (= v_prenex_127 v_prenex_126) (not (= 0 (select .cse142 v_prenex_128))) (not (= 1 (select .cse138 (select (select (store .cse143 v_prenex_128 .cse144) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (< 0 v_prenex_127) (= (select .cse138 (select .cse139 v_prenex_129)) 1) (= (select .cse138 (select .cse139 v_prenex_131)) 1) (not (< |c_#StackHeapBarrier| v_prenex_128))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_8 Int)) (let ((.cse151 (let ((.cse154 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse154 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse154 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse152 (store (select .cse151 v_prenex_4) v_prenex_2 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse153 (store .cse152 (+ v_prenex_2 4) v_prenex_8))) (let ((.cse149 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse150 (select (select (store .cse151 v_prenex_4 .cse153) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_3 4)))) (let ((.cse148 (select (store .cse151 v_prenex_4 (store .cse153 v_prenex_2 .cse150)) .cse150)) (.cse147 (store .cse149 v_prenex_4 v_prenex_7))) (or (= (select .cse147 (select .cse148 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (<= 0 v_prenex_3)) (= (select .cse147 (select .cse148 v_prenex_6)) 1) (not (< |c_#StackHeapBarrier| v_prenex_4)) (< 0 v_prenex_3) (not (= 0 (select .cse149 v_prenex_4))) (not (= 1 (select .cse147 .cse150))) (not (= 1 (select .cse147 (select (select (store .cse151 v_prenex_4 .cse152) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (forall ((v_prenex_178 Int) (v_prenex_176 Int) (v_prenex_177 Int) (v_prenex_181 Int) (v_prenex_180 Int)) (let ((.cse158 (let ((.cse162 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse162 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse162 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse159 (store (select .cse158 v_prenex_177) v_prenex_176 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse161 (store .cse159 (+ v_prenex_176 4) v_prenex_181))) (let ((.cse160 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse156 (select (select (store .cse158 v_prenex_177 .cse161) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (let ((.cse157 (select (store .cse158 v_prenex_177 (store .cse161 v_prenex_176 .cse156)) .cse156)) (.cse155 (store .cse160 v_prenex_177 v_prenex_180))) (or (not (= 1 (select .cse155 .cse156))) (= (select .cse155 (select .cse157 v_prenex_178)) 1) (= 4 v_prenex_176) (not (< |c_#StackHeapBarrier| v_prenex_177)) (= (select .cse155 (select .cse157 0)) 1) (= (select .cse155 (select .cse157 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse155 (select (select (store .cse158 v_prenex_177 .cse159) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse160 v_prenex_177)))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_200 Int) (v_prenex_199 Int) (v_prenex_196 Int) (v_prenex_197 Int) (v_prenex_195 Int)) (let ((.cse164 (let ((.cse170 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1889))) (store .cse170 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse170 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |c_ULTIMATE.start_main_~node~0#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse165 (store (select .cse164 v_prenex_196) v_prenex_195 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse169 (store .cse165 (+ v_prenex_195 4) v_prenex_200))) (let ((.cse168 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse167 (select (select (store .cse164 v_prenex_196 .cse169) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (let ((.cse166 (select (store .cse164 v_prenex_196 (store .cse169 v_prenex_195 .cse167)) .cse167)) (.cse163 (store .cse168 v_prenex_196 v_prenex_199))) (or (not (< |c_#StackHeapBarrier| v_prenex_196)) (not (= 1 (select .cse163 (select (select (store .cse164 v_prenex_196 .cse165) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse163 (select .cse166 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse163 (select .cse166 v_prenex_197)) 1) (not (= 1 (select .cse163 .cse167))) (= 4 v_prenex_195) (not (= 0 (select .cse168 v_prenex_196))))))))))))) is different from true [2023-02-15 21:57:37,768 WARN L859 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse6 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_51 Int) (v_prenex_50 Int)) (let ((.cse1 (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse7 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse7 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse4 (store (select .cse1 v_prenex_48) v_prenex_47 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse5 (store .cse6 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse2 (store .cse4 (+ v_prenex_47 4) v_prenex_51))) (let ((.cse3 (select (select (store .cse1 v_prenex_48 .cse2) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse0 (store .cse5 v_prenex_48 v_prenex_50))) (or (= 0 v_prenex_47) (= (select .cse0 (select (select (store .cse1 v_prenex_48 (store .cse2 v_prenex_47 .cse3)) .cse3) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse0 .cse3))) (not (= 1 (select .cse0 (select (select (store .cse1 v_prenex_48 .cse4) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= 4 v_prenex_47) (not (= 0 (select .cse5 v_prenex_48))) (not (< |c_#StackHeapBarrier| v_prenex_48)))))))) (not (= 0 (select .cse6 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse15 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_226 Int) (v_prenex_227 Int) (v_prenex_225 Int) (v_prenex_222 Int) (v_prenex_223 Int) (v_prenex_221 Int)) (let ((.cse9 (let ((.cse16 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse16 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse16 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse10 (store (select .cse9 v_prenex_223) v_prenex_221 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse14 (store .cse10 (+ v_prenex_221 4) v_prenex_227))) (let ((.cse13 (select (select (store .cse9 v_prenex_223 .cse14) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_222 4))) (.cse11 (store .cse15 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse8 (store .cse11 v_prenex_223 v_prenex_226)) (.cse12 (select (store .cse9 v_prenex_223 (store .cse14 v_prenex_221 .cse13)) .cse13))) (or (not (= 1 (select .cse8 (select (select (store .cse9 v_prenex_223 .cse10) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse11 v_prenex_223))) (= (select .cse8 (select .cse12 0)) 1) (not (= 1 (select .cse8 .cse13))) (not (< |c_#StackHeapBarrier| v_prenex_223)) (< 0 v_prenex_222) (not (<= 0 v_prenex_222)) (= (select .cse8 (select .cse12 v_prenex_225)) 1) (= (select .cse8 (select .cse12 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1)))))))) (not (= 0 (select .cse15 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse24 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_19 Int)) (let ((.cse21 (let ((.cse25 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse25 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse25 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse22 (store (select .cse21 v_prenex_19) v_prenex_17 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse23 (store .cse22 (+ v_prenex_17 4) v_prenex_23))) (let ((.cse19 (store .cse24 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse18 (select (select (store .cse21 v_prenex_19 .cse23) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_18 4)))) (let ((.cse20 (select (store .cse21 v_prenex_19 (store .cse23 v_prenex_17 .cse18)) .cse18)) (.cse17 (store .cse19 v_prenex_19 v_prenex_22))) (or (not (= 1 (select .cse17 .cse18))) (not (= 0 (select .cse19 v_prenex_19))) (not (<= 0 v_prenex_18)) (= (select .cse17 (select .cse20 0)) 1) (= (select .cse17 (select .cse20 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (< |c_#StackHeapBarrier| v_prenex_19)) (= v_prenex_18 v_prenex_17) (= (select .cse17 (select .cse20 v_prenex_21)) 1) (not (= 1 (select .cse17 (select (select (store .cse21 v_prenex_19 .cse22) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (< 0 v_prenex_18)))))))) (not (= 0 (select .cse24 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse34 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_158 Int) (v_prenex_159 Int) (v_prenex_156 Int) (v_prenex_154 Int) (v_prenex_155 Int) (v_prenex_160 Int)) (let ((.cse27 (let ((.cse35 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse35 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse35 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse28 (store (select .cse27 v_prenex_156) v_prenex_154 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse33 (store .cse28 (+ v_prenex_154 4) v_prenex_160)) (.cse31 (+ v_prenex_155 4))) (let ((.cse32 (select (select (store .cse27 v_prenex_156 .cse33) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse31)) (.cse29 (store .cse34 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse26 (store .cse29 v_prenex_156 v_prenex_159)) (.cse30 (select (store .cse27 v_prenex_156 (store .cse33 v_prenex_154 .cse32)) .cse32))) (or (not (<= 0 v_prenex_155)) (< 0 v_prenex_155) (not (= 1 (select .cse26 (select (select (store .cse27 v_prenex_156 .cse28) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse29 v_prenex_156))) (not (< |c_#StackHeapBarrier| v_prenex_156)) (= (select .cse26 (select .cse30 v_prenex_158)) 1) (= .cse31 v_prenex_154) (not (= 1 (select .cse26 .cse32))) (= (select .cse26 (select .cse30 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1)))))))) (not (= 0 (select .cse34 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse36 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse36 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_59 Int) (v_prenex_55 Int) (v_prenex_58 Int) (v_prenex_57 Int) (v_prenex_52 Int) (v_prenex_54 Int) (v_prenex_53 Int)) (let ((.cse41 (let ((.cse45 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse45 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse45 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse42 (store (select .cse41 v_prenex_54) v_prenex_52 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse44 (store .cse42 (+ v_prenex_52 4) v_prenex_59)) (.cse43 (+ v_prenex_53 4))) (let ((.cse39 (select (select (store .cse41 v_prenex_54 .cse44) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse43)) (.cse37 (store .cse36 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse38 (store .cse37 v_prenex_54 v_prenex_58)) (.cse40 (select (store .cse41 v_prenex_54 (store .cse44 v_prenex_52 .cse39)) .cse39))) (or (< 0 v_prenex_53) (not (< |c_#StackHeapBarrier| v_prenex_54)) (not (<= 0 v_prenex_53)) (not (= 0 (select .cse37 v_prenex_54))) (not (= 1 (select .cse38 .cse39))) (= (select .cse38 (select .cse40 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse38 (select (select (store .cse41 v_prenex_54 .cse42) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse38 (select .cse40 v_prenex_55)) 1) (= .cse43 v_prenex_52) (= (select .cse38 (select .cse40 0)) 1) (= (select .cse38 (select .cse40 v_prenex_57)) 1))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse46 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse46 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_235 Int) (v_prenex_233 Int) (v_prenex_234 Int) (v_prenex_231 Int) (v_prenex_230 Int) (v_prenex_228 Int) (v_prenex_229 Int)) (let ((.cse50 (let ((.cse55 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse55 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse55 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse51 (store (select .cse50 v_prenex_230) v_prenex_228 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse54 (store .cse51 (+ v_prenex_228 4) v_prenex_235)) (.cse52 (+ v_prenex_229 4))) (let ((.cse49 (store .cse46 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse53 (select (select (store .cse50 v_prenex_230 .cse54) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse52))) (let ((.cse48 (select (store .cse50 v_prenex_230 (store .cse54 v_prenex_228 .cse53)) .cse53)) (.cse47 (store .cse49 v_prenex_230 v_prenex_234))) (or (not (<= 0 v_prenex_229)) (< 0 v_prenex_229) (not (< |c_#StackHeapBarrier| v_prenex_230)) (= (select .cse47 (select .cse48 v_prenex_231)) 1) (= (select .cse47 (select .cse48 0)) 1) (= (select .cse47 (select .cse48 v_prenex_233)) 1) (not (= 0 (select .cse49 v_prenex_230))) (not (= 1 (select .cse47 (select (select (store .cse50 v_prenex_230 .cse51) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= .cse52 v_prenex_228) (= (select .cse47 (select .cse48 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse47 .cse53))))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse56 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse56 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_116 Int) (v_prenex_117 Int) (v_prenex_115 Int) (v_prenex_112 Int) (v_prenex_113 Int) (v_prenex_111 Int)) (let ((.cse59 (let ((.cse65 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse65 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse65 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse60 (store (select .cse59 v_prenex_113) v_prenex_111 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse64 (store .cse60 (+ v_prenex_111 4) v_prenex_117)) (.cse61 (+ v_prenex_112 4))) (let ((.cse62 (store .cse56 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse63 (select (select (store .cse59 v_prenex_113 .cse64) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse61))) (let ((.cse58 (select (store .cse59 v_prenex_113 (store .cse64 v_prenex_111 .cse63)) .cse63)) (.cse57 (store .cse62 v_prenex_113 v_prenex_116))) (or (= (select .cse57 (select .cse58 v_prenex_115)) 1) (not (= 1 (select .cse57 (select (select (store .cse59 v_prenex_113 .cse60) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse57 (select .cse58 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (< 0 v_prenex_112) (= .cse61 v_prenex_111) (not (< |c_#StackHeapBarrier| v_prenex_113)) (= v_prenex_112 v_prenex_111) (not (<= 0 v_prenex_112)) (not (= 0 (select .cse62 v_prenex_113))) (not (= 1 (select .cse57 .cse63))))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse72 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_145 Int) (v_prenex_144 Int) (v_prenex_141 Int) (v_prenex_142 Int)) (let ((.cse69 (let ((.cse73 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse73 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse73 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse71 (store (select .cse69 v_prenex_142) v_prenex_141 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse68 (store .cse72 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse70 (store .cse71 (+ v_prenex_141 4) v_prenex_145))) (let ((.cse67 (select (select (store .cse69 v_prenex_142 .cse70) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse66 (store .cse68 v_prenex_142 v_prenex_144))) (or (not (< |c_#StackHeapBarrier| v_prenex_142)) (not (= 1 (select .cse66 .cse67))) (not (= 0 (select .cse68 v_prenex_142))) (= (select .cse66 (select (select (store .cse69 v_prenex_142 (store .cse70 v_prenex_141 .cse67)) .cse67) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse66 (select (select (store .cse69 v_prenex_142 .cse71) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))))))))) (not (= 0 (select .cse72 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse74 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse74 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_259 Int) (v_prenex_258 Int) (v_prenex_262 Int) (v_prenex_263 Int) (v_prenex_260 Int)) (let ((.cse79 (let ((.cse82 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse82 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse82 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse80 (store (select .cse79 v_prenex_259) v_prenex_258 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse81 (store .cse80 (+ v_prenex_258 4) v_prenex_263))) (let ((.cse75 (store .cse74 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse78 (select (select (store .cse79 v_prenex_259 .cse81) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (let ((.cse77 (select (store .cse79 v_prenex_259 (store .cse81 v_prenex_258 .cse78)) .cse78)) (.cse76 (store .cse75 v_prenex_259 v_prenex_262))) (or (not (= 0 (select .cse75 v_prenex_259))) (= 4 v_prenex_258) (not (< |c_#StackHeapBarrier| v_prenex_259)) (= (select .cse76 (select .cse77 v_prenex_260)) 1) (= (select .cse76 (select .cse77 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse76 .cse78))) (not (= 1 (select .cse76 (select (select (store .cse79 v_prenex_259 .cse80) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse90 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_8 Int)) (let ((.cse86 (let ((.cse91 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse91 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse91 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse87 (store (select .cse86 v_prenex_4) v_prenex_2 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse89 (store .cse87 (+ v_prenex_2 4) v_prenex_8))) (let ((.cse88 (store .cse90 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse85 (select (select (store .cse86 v_prenex_4 .cse89) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_3 4)))) (let ((.cse84 (select (store .cse86 v_prenex_4 (store .cse89 v_prenex_2 .cse85)) .cse85)) (.cse83 (store .cse88 v_prenex_4 v_prenex_7))) (or (= (select .cse83 (select .cse84 v_prenex_6)) 1) (not (<= 0 v_prenex_3)) (not (= 1 (select .cse83 .cse85))) (not (< |c_#StackHeapBarrier| v_prenex_4)) (< 0 v_prenex_3) (= (select .cse83 (select .cse84 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse83 (select (select (store .cse86 v_prenex_4 .cse87) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse88 v_prenex_4)))))))))) (not (= 0 (select .cse90 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse99 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_248 Int) (v_prenex_249 Int) (v_prenex_246 Int) (v_prenex_244 Int) (v_prenex_245 Int)) (let ((.cse95 (let ((.cse100 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse100 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse100 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse96 (store (select .cse95 v_prenex_245) v_prenex_244 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse98 (store .cse96 (+ v_prenex_244 4) v_prenex_249))) (let ((.cse97 (select (select (store .cse95 v_prenex_245 .cse98) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse92 (store .cse99 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse93 (store .cse92 v_prenex_245 v_prenex_248)) (.cse94 (select (store .cse95 v_prenex_245 (store .cse98 v_prenex_244 .cse97)) .cse97))) (or (not (= 0 (select .cse92 v_prenex_245))) (not (< |c_#StackHeapBarrier| v_prenex_245)) (= (select .cse93 (select .cse94 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse93 (select .cse94 v_prenex_246)) 1) (not (= 1 (select .cse93 (select (select (store .cse95 v_prenex_245 .cse96) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 1 (select .cse93 .cse97))) (= (select .cse93 (select .cse94 0)) 1)))))))) (not (= 0 (select .cse99 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse108 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_184 Int) (v_prenex_182 Int)) (let ((.cse102 (let ((.cse109 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse109 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse109 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse103 (store (select .cse102 v_prenex_182) 0 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse107 (store .cse103 4 v_prenex_186))) (let ((.cse104 (select (select (store .cse102 v_prenex_182 .cse107) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse106 (store .cse108 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse101 (store .cse106 v_prenex_182 v_prenex_185)) (.cse105 (select (store .cse102 v_prenex_182 (store .cse107 0 .cse104)) .cse104))) (or (not (< |c_#StackHeapBarrier| v_prenex_182)) (not (= 1 (select .cse101 (select (select (store .cse102 v_prenex_182 .cse103) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 1 (select .cse101 .cse104))) (= (select .cse101 (select .cse105 v_prenex_184)) 1) (not (= 0 (select .cse106 v_prenex_182))) (= (select .cse101 (select .cse105 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1)))))))) (not (= 0 (select .cse108 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse110 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse110 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_216 Int) (v_prenex_220 Int) (v_prenex_219 Int) (v_prenex_217 Int)) (let ((.cse113 (let ((.cse117 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse117 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse117 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse116 (store (select .cse113 v_prenex_217) v_prenex_216 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse114 (store .cse116 (+ v_prenex_216 4) v_prenex_220)) (.cse111 (store .cse110 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse112 (store .cse111 v_prenex_217 v_prenex_219)) (.cse115 (select (select (store .cse113 v_prenex_217 .cse114) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (or (not (< |c_#StackHeapBarrier| v_prenex_217)) (not (= 0 (select .cse111 v_prenex_217))) (= (select .cse112 (select (select (store .cse113 v_prenex_217 (store .cse114 v_prenex_216 .cse115)) .cse115) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse112 (select (select (store .cse113 v_prenex_217 .cse116) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 1 (select .cse112 .cse115))) (= 4 v_prenex_216)))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse118 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse118 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_101 Int) (v_prenex_102 Int) (v_prenex_100 Int) (v_prenex_96 Int) (v_prenex_95 Int) (v_prenex_98 Int) (v_prenex_97 Int)) (let ((.cse122 (let ((.cse126 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse126 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse126 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse123 (store (select .cse122 v_prenex_97) v_prenex_95 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse125 (store .cse123 (+ v_prenex_95 4) v_prenex_102))) (let ((.cse121 (select (select (store .cse122 v_prenex_97 .cse125) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_96 4))) (.cse119 (store .cse118 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse120 (store .cse119 v_prenex_97 v_prenex_101)) (.cse124 (select (store .cse122 v_prenex_97 (store .cse125 v_prenex_95 .cse121)) .cse121))) (or (not (<= 0 v_prenex_96)) (not (= 0 (select .cse119 v_prenex_97))) (not (< |c_#StackHeapBarrier| v_prenex_97)) (not (= 1 (select .cse120 .cse121))) (not (= 1 (select .cse120 (select (select (store .cse122 v_prenex_97 .cse123) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse120 (select .cse124 v_prenex_100)) 1) (< 0 v_prenex_96) (= (select .cse120 (select .cse124 v_prenex_98)) 1) (= (select .cse120 (select .cse124 0)) 1) (= (select .cse120 (select .cse124 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse127 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse127 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_167 Int) (v_prenex_168 Int) (v_prenex_166 Int) (v_prenex_163 Int) (v_prenex_164 Int) (v_prenex_161 Int) (v_prenex_162 Int)) (let ((.cse132 (let ((.cse135 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse135 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse135 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse133 (store (select .cse132 v_prenex_163) v_prenex_161 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse134 (store .cse133 (+ v_prenex_161 4) v_prenex_168))) (let ((.cse131 (store .cse127 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse129 (select (select (store .cse132 v_prenex_163 .cse134) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_162 4)))) (let ((.cse130 (select (store .cse132 v_prenex_163 (store .cse134 v_prenex_161 .cse129)) .cse129)) (.cse128 (store .cse131 v_prenex_163 v_prenex_167))) (or (not (= 1 (select .cse128 .cse129))) (not (<= 0 v_prenex_162)) (not (< |c_#StackHeapBarrier| v_prenex_163)) (= (select .cse128 (select .cse130 v_prenex_166)) 1) (= (select .cse128 (select .cse130 v_prenex_164)) 1) (not (= 0 (select .cse131 v_prenex_163))) (= (select .cse128 (select .cse130 0)) 1) (= (select .cse128 (select .cse130 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse128 (select (select (store .cse132 v_prenex_163 .cse133) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (< 0 v_prenex_162))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse136 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse136 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int) (v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse140 (let ((.cse145 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse145 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse145 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse141 (store (select .cse140 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse144 (store .cse141 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse142 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse139 (select (select (store .cse140 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse144) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse142)) (.cse143 (store .cse136 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse137 (store .cse143 |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse138 (select (store .cse140 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse144 |ULTIMATE.start_main_~#iter~0#1.offset| .cse139)) .cse139))) (or (not (<= 0 |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (< 0 |v_ULTIMATE.start_main_#t~mem11#1.offset_16|) (= (select .cse137 (select .cse138 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse137 .cse139))) (= (select .cse137 (select .cse138 v_ArrVal_1910)) 1) (not (= 1 (select .cse137 (select (select (store .cse140 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse141) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse137 (select .cse138 0)) 1) (= (select .cse137 (select .cse138 v_arrayElimCell_149)) 1) (= .cse142 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (= 0 (select .cse143 |v_ULTIMATE.start_main_~#iter~0#1.base_58|))))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse146 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse146 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_200 Int) (v_prenex_199 Int) (v_prenex_196 Int) (v_prenex_197 Int) (v_prenex_195 Int)) (let ((.cse150 (let ((.cse154 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse154 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse154 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse151 (store (select .cse150 v_prenex_196) v_prenex_195 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse153 (store .cse151 (+ v_prenex_195 4) v_prenex_200))) (let ((.cse147 (store .cse146 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse152 (select (select (store .cse150 v_prenex_196 .cse153) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (let ((.cse149 (select (store .cse150 v_prenex_196 (store .cse153 v_prenex_195 .cse152)) .cse152)) (.cse148 (store .cse147 v_prenex_196 v_prenex_199))) (or (not (= 0 (select .cse147 v_prenex_196))) (not (< |c_#StackHeapBarrier| v_prenex_196)) (= (select .cse148 (select .cse149 v_prenex_197)) 1) (= (select .cse148 (select .cse149 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= 4 v_prenex_195) (not (= 1 (select .cse148 (select (select (store .cse150 v_prenex_196 .cse151) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 1 (select .cse148 .cse152))))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse162 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_77 Int) (v_prenex_79 Int) (v_prenex_76 Int) (v_prenex_75 Int) (v_prenex_80 Int)) (let ((.cse158 (let ((.cse163 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse163 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse163 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse159 (store (select .cse158 v_prenex_76) v_prenex_75 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse161 (store .cse159 (+ v_prenex_75 4) v_prenex_80))) (let ((.cse157 (select (select (store .cse158 v_prenex_76 .cse161) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse160 (store .cse162 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse155 (store .cse160 v_prenex_76 v_prenex_79)) (.cse156 (select (store .cse158 v_prenex_76 (store .cse161 v_prenex_75 .cse157)) .cse157))) (or (= (select .cse155 (select .cse156 0)) 1) (not (= 1 (select .cse155 .cse157))) (not (< |c_#StackHeapBarrier| v_prenex_76)) (not (= 1 (select .cse155 (select (select (store .cse158 v_prenex_76 .cse159) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse160 v_prenex_76))) (= (select .cse155 (select .cse156 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (= (select .cse155 (select .cse156 v_prenex_77)) 1)))))))) (not (= 0 (select .cse162 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse171 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_204 Int) (v_prenex_202 Int) (v_prenex_203 Int) (v_prenex_201 Int) (v_prenex_208 Int) (v_prenex_206 Int) (v_prenex_207 Int)) (let ((.cse166 (let ((.cse172 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse172 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse172 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse167 (store (select .cse166 v_prenex_203) v_prenex_201 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse170 (store .cse167 (+ v_prenex_201 4) v_prenex_208))) (let ((.cse165 (select (select (store .cse166 v_prenex_203 .cse170) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_202 4))) (.cse169 (store .cse171 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse164 (store .cse169 v_prenex_203 v_prenex_207)) (.cse168 (select (store .cse166 v_prenex_203 (store .cse170 v_prenex_201 .cse165)) .cse165))) (or (not (<= 0 v_prenex_202)) (not (= 1 (select .cse164 .cse165))) (not (= 1 (select .cse164 (select (select (store .cse166 v_prenex_203 .cse167) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (< 0 v_prenex_202) (not (< |c_#StackHeapBarrier| v_prenex_203)) (= (select .cse164 (select .cse168 v_prenex_206)) 1) (= (select .cse164 (select .cse168 0)) 1) (= (select .cse164 (select .cse168 v_prenex_204)) 1) (= (select .cse164 (select .cse168 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 0 (select .cse169 v_prenex_203)))))))))) (not (= 0 (select .cse171 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse180 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_178 Int) (v_prenex_176 Int) (v_prenex_177 Int) (v_prenex_181 Int) (v_prenex_180 Int)) (let ((.cse177 (let ((.cse181 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse181 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse181 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse178 (store (select .cse177 v_prenex_177) v_prenex_176 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse179 (store .cse178 (+ v_prenex_176 4) v_prenex_181))) (let ((.cse176 (store .cse180 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse175 (select (select (store .cse177 v_prenex_177 .cse179) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (let ((.cse174 (select (store .cse177 v_prenex_177 (store .cse179 v_prenex_176 .cse175)) .cse175)) (.cse173 (store .cse176 v_prenex_177 v_prenex_180))) (or (= (select .cse173 (select .cse174 v_prenex_178)) 1) (not (= 1 (select .cse173 .cse175))) (= 4 v_prenex_176) (not (= 0 (select .cse176 v_prenex_177))) (not (< |c_#StackHeapBarrier| v_prenex_177)) (= (select .cse173 (select .cse174 0)) 1) (= (select .cse173 (select .cse174 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= 1 (select .cse173 (select (select (store .cse177 v_prenex_177 .cse178) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0))))))))))) (not (= 0 (select .cse180 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse190 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_127 Int) (v_prenex_128 Int) (v_prenex_126 Int) (v_prenex_132 Int) (v_prenex_133 Int) (v_prenex_131 Int) (v_prenex_129 Int)) (let ((.cse187 (let ((.cse191 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse191 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse191 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse188 (store (select .cse187 v_prenex_128) v_prenex_126 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse189 (store .cse188 (+ v_prenex_126 4) v_prenex_133)) (.cse185 (+ v_prenex_127 4))) (let ((.cse186 (select (select (store .cse187 v_prenex_128 .cse189) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse185)) (.cse184 (store .cse190 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse182 (store .cse184 v_prenex_128 v_prenex_132)) (.cse183 (select (store .cse187 v_prenex_128 (store .cse189 v_prenex_126 .cse186)) .cse186))) (or (= (select .cse182 (select .cse183 v_prenex_131)) 1) (= (select .cse182 (select .cse183 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (<= 0 v_prenex_127)) (not (= 0 (select .cse184 v_prenex_128))) (= (select .cse182 (select .cse183 0)) 1) (= .cse185 v_prenex_126) (= v_prenex_127 v_prenex_126) (not (= 1 (select .cse182 .cse186))) (not (= 1 (select .cse182 (select (select (store .cse187 v_prenex_128 .cse188) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse182 (select .cse183 v_prenex_129)) 1) (< 0 v_prenex_127) (not (< |c_#StackHeapBarrier| v_prenex_128))))))))) (not (= 0 (select .cse190 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|))))) is different from true [2023-02-15 21:57:43,874 WARN L859 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_259 Int) (v_prenex_258 Int) (v_prenex_262 Int) (v_prenex_263 Int) (v_prenex_260 Int)) (let ((.cse2 (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse8 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse8 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse3 (store (select .cse2 v_prenex_259) v_prenex_258 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse7 (store .cse3 (+ v_prenex_258 4) v_prenex_263))) (let ((.cse4 (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse6 (select (select (store .cse2 v_prenex_259 .cse7) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (let ((.cse5 (select (store .cse2 v_prenex_259 (store .cse7 v_prenex_258 .cse6)) .cse6)) (.cse1 (store .cse4 v_prenex_259 v_prenex_262))) (or (not (= 1 (select .cse1 (select (select (store .cse2 v_prenex_259 .cse3) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse4 v_prenex_259))) (= 4 v_prenex_258) (not (< |c_#StackHeapBarrier| v_prenex_259)) (= (select .cse1 (select .cse5 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (= (select .cse1 (select .cse5 v_prenex_260)) 1) (not (= 1 (select .cse1 .cse6))))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse9 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse9 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_116 Int) (v_prenex_117 Int) (v_prenex_115 Int) (v_prenex_112 Int) (v_prenex_113 Int) (v_prenex_111 Int)) (let ((.cse13 (let ((.cse18 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse18 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse18 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse14 (store (select .cse13 v_prenex_113) v_prenex_111 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse17 (store .cse14 (+ v_prenex_111 4) v_prenex_117)) (.cse12 (+ v_prenex_112 4))) (let ((.cse11 (select (select (store .cse13 v_prenex_113 .cse17) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse12)) (.cse15 (store .cse9 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse10 (store .cse15 v_prenex_113 v_prenex_116)) (.cse16 (select (store .cse13 v_prenex_113 (store .cse17 v_prenex_111 .cse11)) .cse11))) (or (< 0 v_prenex_112) (not (= 1 (select .cse10 .cse11))) (= .cse12 v_prenex_111) (not (< |c_#StackHeapBarrier| v_prenex_113)) (= v_prenex_112 v_prenex_111) (not (= 1 (select .cse10 (select (select (store .cse13 v_prenex_113 .cse14) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (<= 0 v_prenex_112)) (not (= 0 (select .cse15 v_prenex_113))) (= (select .cse10 (select .cse16 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (= (select .cse10 (select .cse16 v_prenex_115)) 1))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse27 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_158 Int) (v_prenex_159 Int) (v_prenex_156 Int) (v_prenex_154 Int) (v_prenex_155 Int) (v_prenex_160 Int)) (let ((.cse20 (let ((.cse28 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse28 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse28 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse21 (store (select .cse20 v_prenex_156) v_prenex_154 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse26 (store .cse21 (+ v_prenex_154 4) v_prenex_160)) (.cse24 (+ v_prenex_155 4))) (let ((.cse23 (store .cse27 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse25 (select (select (store .cse20 v_prenex_156 .cse26) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse24))) (let ((.cse22 (select (store .cse20 v_prenex_156 (store .cse26 v_prenex_154 .cse25)) .cse25)) (.cse19 (store .cse23 v_prenex_156 v_prenex_159))) (or (not (<= 0 v_prenex_155)) (not (= 1 (select .cse19 (select (select (store .cse20 v_prenex_156 .cse21) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (< 0 v_prenex_155) (= (select .cse19 (select .cse22 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 0 (select .cse23 v_prenex_156))) (not (< |c_#StackHeapBarrier| v_prenex_156)) (= (select .cse19 (select .cse22 v_prenex_158)) 1) (= .cse24 v_prenex_154) (not (= 1 (select .cse19 .cse25)))))))))) (not (= 0 (select .cse27 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse29 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse29 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_200 Int) (v_prenex_199 Int) (v_prenex_196 Int) (v_prenex_197 Int) (v_prenex_195 Int)) (let ((.cse31 (let ((.cse37 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse37 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse37 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse32 (store (select .cse31 v_prenex_196) v_prenex_195 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse36 (store .cse32 (+ v_prenex_195 4) v_prenex_200))) (let ((.cse33 (select (select (store .cse31 v_prenex_196 .cse36) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse34 (store .cse29 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse30 (store .cse34 v_prenex_196 v_prenex_199)) (.cse35 (select (store .cse31 v_prenex_196 (store .cse36 v_prenex_195 .cse33)) .cse33))) (or (not (= 1 (select .cse30 (select (select (store .cse31 v_prenex_196 .cse32) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 1 (select .cse30 .cse33))) (not (= 0 (select .cse34 v_prenex_196))) (not (< |c_#StackHeapBarrier| v_prenex_196)) (= 4 v_prenex_195) (= (select .cse30 (select .cse35 v_prenex_197)) 1) (= (select .cse30 (select .cse35 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse46 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_127 Int) (v_prenex_128 Int) (v_prenex_126 Int) (v_prenex_132 Int) (v_prenex_133 Int) (v_prenex_131 Int) (v_prenex_129 Int)) (let ((.cse40 (let ((.cse47 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse47 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse47 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse41 (store (select .cse40 v_prenex_128) v_prenex_126 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse45 (store .cse41 (+ v_prenex_126 4) v_prenex_133)) (.cse43 (+ v_prenex_127 4))) (let ((.cse44 (select (select (store .cse40 v_prenex_128 .cse45) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse43)) (.cse42 (store .cse46 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse38 (store .cse42 v_prenex_128 v_prenex_132)) (.cse39 (select (store .cse40 v_prenex_128 (store .cse45 v_prenex_126 .cse44)) .cse44))) (or (= (select .cse38 (select .cse39 v_prenex_131)) 1) (not (<= 0 v_prenex_127)) (= (select .cse38 (select .cse39 v_prenex_129)) 1) (not (= 1 (select .cse38 (select (select (store .cse40 v_prenex_128 .cse41) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse42 v_prenex_128))) (= .cse43 v_prenex_126) (= v_prenex_127 v_prenex_126) (= (select .cse38 (select .cse39 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse38 .cse44))) (< 0 v_prenex_127) (not (< |c_#StackHeapBarrier| v_prenex_128)) (= (select .cse38 (select .cse39 0)) 1)))))))) (not (= 0 (select .cse46 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse55 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_178 Int) (v_prenex_176 Int) (v_prenex_177 Int) (v_prenex_181 Int) (v_prenex_180 Int)) (let ((.cse51 (let ((.cse56 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse56 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse56 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse52 (store (select .cse51 v_prenex_177) v_prenex_176 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse54 (store .cse52 (+ v_prenex_176 4) v_prenex_181))) (let ((.cse53 (select (select (store .cse51 v_prenex_177 .cse54) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse50 (store .cse55 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse48 (store .cse50 v_prenex_177 v_prenex_180)) (.cse49 (select (store .cse51 v_prenex_177 (store .cse54 v_prenex_176 .cse53)) .cse53))) (or (= (select .cse48 (select .cse49 0)) 1) (= 4 v_prenex_176) (not (= 0 (select .cse50 v_prenex_177))) (= (select .cse48 (select .cse49 v_prenex_178)) 1) (not (= 1 (select .cse48 (select (select (store .cse51 v_prenex_177 .cse52) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (< |c_#StackHeapBarrier| v_prenex_177)) (not (= 1 (select .cse48 .cse53))) (= (select .cse48 (select .cse49 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))))) (not (= 0 (select .cse55 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse57 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse57 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_226 Int) (v_prenex_227 Int) (v_prenex_225 Int) (v_prenex_222 Int) (v_prenex_223 Int) (v_prenex_221 Int)) (let ((.cse62 (let ((.cse65 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse65 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse65 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse63 (store (select .cse62 v_prenex_223) v_prenex_221 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse64 (store .cse63 (+ v_prenex_221 4) v_prenex_227))) (let ((.cse61 (select (select (store .cse62 v_prenex_223 .cse64) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_222 4))) (.cse58 (store .cse57 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse59 (store .cse58 v_prenex_223 v_prenex_226)) (.cse60 (select (store .cse62 v_prenex_223 (store .cse64 v_prenex_221 .cse61)) .cse61))) (or (not (= 0 (select .cse58 v_prenex_223))) (= (select .cse59 (select .cse60 0)) 1) (not (= 1 (select .cse59 .cse61))) (= (select .cse59 (select .cse60 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse59 (select (select (store .cse62 v_prenex_223 .cse63) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (< |c_#StackHeapBarrier| v_prenex_223)) (< 0 v_prenex_222) (not (<= 0 v_prenex_222)) (= (select .cse59 (select .cse60 v_prenex_225)) 1))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse66 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse66 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int) (v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse69 (let ((.cse75 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse75 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse75 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse70 (store (select .cse69 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse74 (store .cse70 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse72 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse71 (select (select (store .cse69 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse74) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse72)) (.cse73 (store .cse66 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse67 (store .cse73 |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse68 (select (store .cse69 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse74 |ULTIMATE.start_main_~#iter~0#1.offset| .cse71)) .cse71))) (or (not (<= 0 |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (< 0 |v_ULTIMATE.start_main_#t~mem11#1.offset_16|) (= (select .cse67 (select .cse68 0)) 1) (not (= 1 (select .cse67 (select (select (store .cse69 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse70) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 1 (select .cse67 .cse71))) (= (select .cse67 (select .cse68 v_ArrVal_1910)) 1) (= (select .cse67 (select .cse68 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (= .cse72 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (= 0 (select .cse73 |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= (select .cse67 (select .cse68 v_arrayElimCell_149)) 1))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse83 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_19 Int)) (let ((.cse80 (let ((.cse84 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse84 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse84 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse81 (store (select .cse80 v_prenex_19) v_prenex_17 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse82 (store .cse81 (+ v_prenex_17 4) v_prenex_23))) (let ((.cse78 (select (select (store .cse80 v_prenex_19 .cse82) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_18 4))) (.cse76 (store .cse83 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse77 (store .cse76 v_prenex_19 v_prenex_22)) (.cse79 (select (store .cse80 v_prenex_19 (store .cse82 v_prenex_17 .cse78)) .cse78))) (or (not (= 0 (select .cse76 v_prenex_19))) (not (= 1 (select .cse77 .cse78))) (not (<= 0 v_prenex_18)) (= (select .cse77 (select .cse79 0)) 1) (not (= 1 (select .cse77 (select (select (store .cse80 v_prenex_19 .cse81) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse77 (select .cse79 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (< |c_#StackHeapBarrier| v_prenex_19)) (= v_prenex_18 v_prenex_17) (= (select .cse77 (select .cse79 v_prenex_21)) 1) (< 0 v_prenex_18)))))))) (not (= 0 (select .cse83 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse91 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_145 Int) (v_prenex_144 Int) (v_prenex_141 Int) (v_prenex_142 Int)) (let ((.cse88 (let ((.cse92 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse92 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse92 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse90 (store (select .cse88 v_prenex_142) v_prenex_141 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse87 (store .cse91 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse89 (store .cse90 (+ v_prenex_141 4) v_prenex_145))) (let ((.cse86 (select (select (store .cse88 v_prenex_142 .cse89) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse85 (store .cse87 v_prenex_142 v_prenex_144))) (or (not (< |c_#StackHeapBarrier| v_prenex_142)) (not (= 1 (select .cse85 .cse86))) (not (= 0 (select .cse87 v_prenex_142))) (= (select .cse85 (select (select (store .cse88 v_prenex_142 (store .cse89 v_prenex_141 .cse86)) .cse86) |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse85 (select (select (store .cse88 v_prenex_142 .cse90) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))))))))) (not (= 0 (select .cse91 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse93 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse93 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_184 Int) (v_prenex_182 Int)) (let ((.cse96 (let ((.cse101 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse101 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse101 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse97 (store (select .cse96 v_prenex_182) 0 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse100 (store .cse97 4 v_prenex_186))) (let ((.cse98 (select (select (store .cse96 v_prenex_182 .cse100) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse99 (store .cse93 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse94 (store .cse99 v_prenex_182 v_prenex_185)) (.cse95 (select (store .cse96 v_prenex_182 (store .cse100 0 .cse98)) .cse98))) (or (= (select .cse94 (select .cse95 v_prenex_184)) 1) (not (< |c_#StackHeapBarrier| v_prenex_182)) (not (= 1 (select .cse94 (select (select (store .cse96 v_prenex_182 .cse97) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 1 (select .cse94 .cse98))) (not (= 0 (select .cse99 v_prenex_182))) (= (select .cse94 (select .cse95 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse102 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse102 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_248 Int) (v_prenex_249 Int) (v_prenex_246 Int) (v_prenex_244 Int) (v_prenex_245 Int)) (let ((.cse107 (let ((.cse110 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse110 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse110 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse108 (store (select .cse107 v_prenex_245) v_prenex_244 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse109 (store .cse108 (+ v_prenex_244 4) v_prenex_249))) (let ((.cse106 (select (select (store .cse107 v_prenex_245 .cse109) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse105 (store .cse102 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse103 (store .cse105 v_prenex_245 v_prenex_248)) (.cse104 (select (store .cse107 v_prenex_245 (store .cse109 v_prenex_244 .cse106)) .cse106))) (or (= (select .cse103 (select .cse104 v_prenex_246)) 1) (not (= 0 (select .cse105 v_prenex_245))) (not (= 1 (select .cse103 .cse106))) (not (= 1 (select .cse103 (select (select (store .cse107 v_prenex_245 .cse108) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse103 (select .cse104 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (< |c_#StackHeapBarrier| v_prenex_245)) (= (select .cse103 (select .cse104 0)) 1))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse118 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_101 Int) (v_prenex_102 Int) (v_prenex_100 Int) (v_prenex_96 Int) (v_prenex_95 Int) (v_prenex_98 Int) (v_prenex_97 Int)) (let ((.cse115 (let ((.cse119 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse119 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse119 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse116 (store (select .cse115 v_prenex_97) v_prenex_95 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse117 (store .cse116 (+ v_prenex_95 4) v_prenex_102))) (let ((.cse112 (select (select (store .cse115 v_prenex_97 .cse117) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_96 4))) (.cse113 (store .cse118 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse111 (store .cse113 v_prenex_97 v_prenex_101)) (.cse114 (select (store .cse115 v_prenex_97 (store .cse117 v_prenex_95 .cse112)) .cse112))) (or (not (= 1 (select .cse111 .cse112))) (not (<= 0 v_prenex_96)) (not (= 0 (select .cse113 v_prenex_97))) (not (< |c_#StackHeapBarrier| v_prenex_97)) (= (select .cse111 (select .cse114 v_prenex_100)) 1) (= (select .cse111 (select .cse114 0)) 1) (not (= 1 (select .cse111 (select (select (store .cse115 v_prenex_97 .cse116) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse111 (select .cse114 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (= (select .cse111 (select .cse114 v_prenex_98)) 1) (< 0 v_prenex_96)))))))) (not (= 0 (select .cse118 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse120 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse120 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_59 Int) (v_prenex_55 Int) (v_prenex_58 Int) (v_prenex_57 Int) (v_prenex_52 Int) (v_prenex_54 Int) (v_prenex_53 Int)) (let ((.cse126 (let ((.cse129 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse129 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse129 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse127 (store (select .cse126 v_prenex_54) v_prenex_52 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse128 (store .cse127 (+ v_prenex_52 4) v_prenex_59)) (.cse125 (+ v_prenex_53 4))) (let ((.cse123 (store .cse120 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse124 (select (select (store .cse126 v_prenex_54 .cse128) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse125))) (let ((.cse122 (select (store .cse126 v_prenex_54 (store .cse128 v_prenex_52 .cse124)) .cse124)) (.cse121 (store .cse123 v_prenex_54 v_prenex_58))) (or (= (select .cse121 (select .cse122 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (< 0 v_prenex_53) (not (< |c_#StackHeapBarrier| v_prenex_54)) (= (select .cse121 (select .cse122 0)) 1) (not (<= 0 v_prenex_53)) (not (= 0 (select .cse123 v_prenex_54))) (not (= 1 (select .cse121 .cse124))) (= (select .cse121 (select .cse122 v_prenex_57)) 1) (= (select .cse121 (select .cse122 v_prenex_55)) 1) (= .cse125 v_prenex_52) (not (= 1 (select .cse121 (select (select (store .cse126 v_prenex_54 .cse127) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse130 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse130 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_204 Int) (v_prenex_202 Int) (v_prenex_203 Int) (v_prenex_201 Int) (v_prenex_208 Int) (v_prenex_206 Int) (v_prenex_207 Int)) (let ((.cse133 (let ((.cse138 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse138 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse138 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse134 (store (select .cse133 v_prenex_203) v_prenex_201 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse137 (store .cse134 (+ v_prenex_201 4) v_prenex_208))) (let ((.cse136 (store .cse130 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse135 (select (select (store .cse133 v_prenex_203 .cse137) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_202 4)))) (let ((.cse132 (select (store .cse133 v_prenex_203 (store .cse137 v_prenex_201 .cse135)) .cse135)) (.cse131 (store .cse136 v_prenex_203 v_prenex_207))) (or (not (<= 0 v_prenex_202)) (= (select .cse131 (select .cse132 v_prenex_206)) 1) (< 0 v_prenex_202) (= (select .cse131 (select .cse132 0)) 1) (not (< |c_#StackHeapBarrier| v_prenex_203)) (not (= 1 (select .cse131 (select (select (store .cse133 v_prenex_203 .cse134) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse131 (select .cse132 v_prenex_204)) 1) (= (select .cse131 (select .cse132 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse131 .cse135))) (not (= 0 (select .cse136 v_prenex_203))))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse139 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse139 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_51 Int) (v_prenex_50 Int)) (let ((.cse141 (let ((.cse146 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse146 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse146 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse144 (store (select .cse141 v_prenex_48) v_prenex_47 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse145 (store .cse139 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse142 (store .cse144 (+ v_prenex_47 4) v_prenex_51))) (let ((.cse143 (select (select (store .cse141 v_prenex_48 .cse142) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse140 (store .cse145 v_prenex_48 v_prenex_50))) (or (= 0 v_prenex_47) (= (select .cse140 (select (select (store .cse141 v_prenex_48 (store .cse142 v_prenex_47 .cse143)) .cse143) |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse140 .cse143))) (not (= 1 (select .cse140 (select (select (store .cse141 v_prenex_48 .cse144) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= 4 v_prenex_47) (not (= 0 (select .cse145 v_prenex_48))) (not (< |c_#StackHeapBarrier| v_prenex_48))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse147 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse147 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_8 Int)) (let ((.cse150 (let ((.cse155 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse155 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse155 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse151 (store (select .cse150 v_prenex_4) v_prenex_2 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse154 (store .cse151 (+ v_prenex_2 4) v_prenex_8))) (let ((.cse153 (store .cse147 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse152 (select (select (store .cse150 v_prenex_4 .cse154) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_3 4)))) (let ((.cse149 (select (store .cse150 v_prenex_4 (store .cse154 v_prenex_2 .cse152)) .cse152)) (.cse148 (store .cse153 v_prenex_4 v_prenex_7))) (or (= (select .cse148 (select .cse149 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (<= 0 v_prenex_3)) (not (< |c_#StackHeapBarrier| v_prenex_4)) (< 0 v_prenex_3) (= (select .cse148 (select .cse149 v_prenex_6)) 1) (not (= 1 (select .cse148 (select (select (store .cse150 v_prenex_4 .cse151) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 1 (select .cse148 .cse152))) (not (= 0 (select .cse153 v_prenex_4))))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse164 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_235 Int) (v_prenex_233 Int) (v_prenex_234 Int) (v_prenex_231 Int) (v_prenex_230 Int) (v_prenex_228 Int) (v_prenex_229 Int)) (let ((.cse160 (let ((.cse165 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse165 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse165 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse161 (store (select .cse160 v_prenex_230) v_prenex_228 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse163 (store .cse161 (+ v_prenex_228 4) v_prenex_235)) (.cse159 (+ v_prenex_229 4))) (let ((.cse162 (select (select (store .cse160 v_prenex_230 .cse163) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse159)) (.cse156 (store .cse164 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse157 (store .cse156 v_prenex_230 v_prenex_234)) (.cse158 (select (store .cse160 v_prenex_230 (store .cse163 v_prenex_228 .cse162)) .cse162))) (or (not (<= 0 v_prenex_229)) (< 0 v_prenex_229) (not (< |c_#StackHeapBarrier| v_prenex_230)) (not (= 0 (select .cse156 v_prenex_230))) (= (select .cse157 (select .cse158 0)) 1) (= .cse159 v_prenex_228) (= (select .cse157 (select .cse158 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse157 (select (select (store .cse160 v_prenex_230 .cse161) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 1 (select .cse157 .cse162))) (= (select .cse157 (select .cse158 v_prenex_231)) 1) (= (select .cse157 (select .cse158 v_prenex_233)) 1)))))))) (not (= 0 (select .cse164 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse173 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_167 Int) (v_prenex_168 Int) (v_prenex_166 Int) (v_prenex_163 Int) (v_prenex_164 Int) (v_prenex_161 Int) (v_prenex_162 Int)) (let ((.cse169 (let ((.cse174 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse174 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse174 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse170 (store (select .cse169 v_prenex_163) v_prenex_161 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse172 (store .cse170 (+ v_prenex_161 4) v_prenex_168))) (let ((.cse171 (select (select (store .cse169 v_prenex_163 .cse172) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_162 4))) (.cse168 (store .cse173 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse166 (store .cse168 v_prenex_163 v_prenex_167)) (.cse167 (select (store .cse169 v_prenex_163 (store .cse172 v_prenex_161 .cse171)) .cse171))) (or (not (<= 0 v_prenex_162)) (not (< |c_#StackHeapBarrier| v_prenex_163)) (= (select .cse166 (select .cse167 0)) 1) (not (= 0 (select .cse168 v_prenex_163))) (= (select .cse166 (select .cse167 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse166 (select (select (store .cse169 v_prenex_163 .cse170) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 1 (select .cse166 .cse171))) (= (select .cse166 (select .cse167 v_prenex_164)) 1) (= (select .cse166 (select .cse167 v_prenex_166)) 1) (< 0 v_prenex_162)))))))) (not (= 0 (select .cse173 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse182 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_77 Int) (v_prenex_79 Int) (v_prenex_76 Int) (v_prenex_75 Int) (v_prenex_80 Int)) (let ((.cse176 (let ((.cse183 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse183 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse183 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse177 (store (select .cse176 v_prenex_76) v_prenex_75 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse181 (store .cse177 (+ v_prenex_75 4) v_prenex_80))) (let ((.cse178 (select (select (store .cse176 v_prenex_76 .cse181) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse180 (store .cse182 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse175 (store .cse180 v_prenex_76 v_prenex_79)) (.cse179 (select (store .cse176 v_prenex_76 (store .cse181 v_prenex_75 .cse178)) .cse178))) (or (not (= 1 (select .cse175 (select (select (store .cse176 v_prenex_76 .cse177) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 1 (select .cse175 .cse178))) (not (< |c_#StackHeapBarrier| v_prenex_76)) (= (select .cse175 (select .cse179 0)) 1) (= (select .cse175 (select .cse179 v_prenex_77)) 1) (= (select .cse175 (select .cse179 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 0 (select .cse180 v_prenex_76)))))))))) (not (= 0 (select .cse182 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse184 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse184 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_216 Int) (v_prenex_220 Int) (v_prenex_219 Int) (v_prenex_217 Int)) (let ((.cse188 (let ((.cse191 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse191 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse191 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse190 (store (select .cse188 v_prenex_217) v_prenex_216 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse185 (store .cse184 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse189 (store .cse190 (+ v_prenex_216 4) v_prenex_220))) (let ((.cse187 (select (select (store .cse188 v_prenex_217 .cse189) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse186 (store .cse185 v_prenex_217 v_prenex_219))) (or (not (< |c_#StackHeapBarrier| v_prenex_217)) (not (= 0 (select .cse185 v_prenex_217))) (not (= 1 (select .cse186 .cse187))) (= (select .cse186 (select (select (store .cse188 v_prenex_217 (store .cse189 v_prenex_216 .cse187)) .cse187) |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse186 (select (select (store .cse188 v_prenex_217 .cse190) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= 4 v_prenex_216)))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|))))) is different from true [2023-02-15 21:57:48,355 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse10 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_184 Int) (v_prenex_182 Int)) (let ((.cse3 (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse8 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse8 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse4 (store (select .cse3 v_prenex_182) 0 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse7 (store .cse4 4 v_prenex_186))) (let ((.cse5 (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse6 (select (select (store .cse3 v_prenex_182 .cse7) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (let ((.cse2 (select (store .cse3 v_prenex_182 (store .cse7 0 .cse6)) .cse6)) (.cse1 (store .cse5 v_prenex_182 v_prenex_185))) (or (= (select .cse1 (select .cse2 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (< |c_#StackHeapBarrier| v_prenex_182)) (not (= 1 (select .cse1 (select (select (store .cse3 v_prenex_182 .cse4) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse5 v_prenex_182))) (= (select .cse1 (select .cse2 v_prenex_184)) 1) (not (= 1 (select .cse1 .cse6))))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse19 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_235 Int) (v_prenex_233 Int) (v_prenex_234 Int) (v_prenex_231 Int) (v_prenex_230 Int) (v_prenex_228 Int) (v_prenex_229 Int)) (let ((.cse15 (let ((.cse20 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse20 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse20 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse16 (store (select .cse15 v_prenex_230) v_prenex_228 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse18 (store .cse16 (+ v_prenex_228 4) v_prenex_235)) (.cse17 (+ v_prenex_229 4))) (let ((.cse12 (select (select (store .cse15 v_prenex_230 .cse18) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse17)) (.cse14 (store .cse19 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse11 (store .cse14 v_prenex_230 v_prenex_234)) (.cse13 (select (store .cse15 v_prenex_230 (store .cse18 v_prenex_228 .cse12)) .cse12))) (or (not (<= 0 v_prenex_229)) (< 0 v_prenex_229) (not (= 1 (select .cse11 .cse12))) (= (select .cse11 (select .cse13 v_prenex_233)) 1) (not (< |c_#StackHeapBarrier| v_prenex_230)) (= (select .cse11 (select .cse13 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (= (select .cse11 (select .cse13 0)) 1) (not (= 0 (select .cse14 v_prenex_230))) (not (= 1 (select .cse11 (select (select (store .cse15 v_prenex_230 .cse16) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= .cse17 v_prenex_228) (= (select .cse11 (select .cse13 v_prenex_231)) 1)))))))) (not (= 0 (select .cse19 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse28 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_259 Int) (v_prenex_258 Int) (v_prenex_262 Int) (v_prenex_263 Int) (v_prenex_260 Int)) (let ((.cse22 (let ((.cse29 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse29 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse29 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse23 (store (select .cse22 v_prenex_259) v_prenex_258 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse27 (store .cse23 (+ v_prenex_258 4) v_prenex_263))) (let ((.cse24 (store .cse28 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse26 (select (select (store .cse22 v_prenex_259 .cse27) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (let ((.cse25 (select (store .cse22 v_prenex_259 (store .cse27 v_prenex_258 .cse26)) .cse26)) (.cse21 (store .cse24 v_prenex_259 v_prenex_262))) (or (not (= 1 (select .cse21 (select (select (store .cse22 v_prenex_259 .cse23) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse24 v_prenex_259))) (= 4 v_prenex_258) (= (select .cse21 (select .cse25 v_prenex_260)) 1) (not (< |c_#StackHeapBarrier| v_prenex_259)) (= (select .cse21 (select .cse25 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse21 .cse26)))))))))) (not (= 0 (select .cse28 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse38 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_158 Int) (v_prenex_159 Int) (v_prenex_156 Int) (v_prenex_154 Int) (v_prenex_155 Int) (v_prenex_160 Int)) (let ((.cse32 (let ((.cse39 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse39 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse39 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse33 (store (select .cse32 v_prenex_156) v_prenex_154 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse37 (store .cse33 (+ v_prenex_154 4) v_prenex_160)) (.cse36 (+ v_prenex_155 4))) (let ((.cse31 (select (select (store .cse32 v_prenex_156 .cse37) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse36)) (.cse35 (store .cse38 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse30 (store .cse35 v_prenex_156 v_prenex_159)) (.cse34 (select (store .cse32 v_prenex_156 (store .cse37 v_prenex_154 .cse31)) .cse31))) (or (not (<= 0 v_prenex_155)) (not (= 1 (select .cse30 .cse31))) (< 0 v_prenex_155) (not (= 1 (select .cse30 (select (select (store .cse32 v_prenex_156 .cse33) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse30 (select .cse34 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (= (select .cse30 (select .cse34 v_prenex_158)) 1) (not (= 0 (select .cse35 v_prenex_156))) (not (< |c_#StackHeapBarrier| v_prenex_156)) (= .cse36 v_prenex_154)))))))) (not (= 0 (select .cse38 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse47 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_200 Int) (v_prenex_199 Int) (v_prenex_196 Int) (v_prenex_197 Int) (v_prenex_195 Int)) (let ((.cse43 (let ((.cse48 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse48 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse48 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse44 (store (select .cse43 v_prenex_196) v_prenex_195 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse46 (store .cse44 (+ v_prenex_195 4) v_prenex_200))) (let ((.cse40 (store .cse47 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse45 (select (select (store .cse43 v_prenex_196 .cse46) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (let ((.cse42 (select (store .cse43 v_prenex_196 (store .cse46 v_prenex_195 .cse45)) .cse45)) (.cse41 (store .cse40 v_prenex_196 v_prenex_199))) (or (not (= 0 (select .cse40 v_prenex_196))) (not (< |c_#StackHeapBarrier| v_prenex_196)) (= (select .cse41 (select .cse42 v_prenex_197)) 1) (not (= 1 (select .cse41 (select (select (store .cse43 v_prenex_196 .cse44) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= 4 v_prenex_195) (= (select .cse41 (select .cse42 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse41 .cse45)))))))))) (not (= 0 (select .cse47 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse56 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_167 Int) (v_prenex_168 Int) (v_prenex_166 Int) (v_prenex_163 Int) (v_prenex_164 Int) (v_prenex_161 Int) (v_prenex_162 Int)) (let ((.cse52 (let ((.cse57 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse57 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse57 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse53 (store (select .cse52 v_prenex_163) v_prenex_161 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse55 (store .cse53 (+ v_prenex_161 4) v_prenex_168))) (let ((.cse50 (select (select (store .cse52 v_prenex_163 .cse55) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_162 4))) (.cse51 (store .cse56 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse49 (store .cse51 v_prenex_163 v_prenex_167)) (.cse54 (select (store .cse52 v_prenex_163 (store .cse55 v_prenex_161 .cse50)) .cse50))) (or (not (= 1 (select .cse49 .cse50))) (not (<= 0 v_prenex_162)) (not (< |c_#StackHeapBarrier| v_prenex_163)) (not (= 0 (select .cse51 v_prenex_163))) (not (= 1 (select .cse49 (select (select (store .cse52 v_prenex_163 .cse53) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse49 (select .cse54 0)) 1) (= (select .cse49 (select .cse54 v_prenex_164)) 1) (= (select .cse49 (select .cse54 v_prenex_166)) 1) (= (select .cse49 (select .cse54 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (< 0 v_prenex_162)))))))) (not (= 0 (select .cse56 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse58 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse58 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_226 Int) (v_prenex_227 Int) (v_prenex_225 Int) (v_prenex_222 Int) (v_prenex_223 Int) (v_prenex_221 Int)) (let ((.cse63 (let ((.cse66 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse66 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse66 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse64 (store (select .cse63 v_prenex_223) v_prenex_221 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse65 (store .cse64 (+ v_prenex_221 4) v_prenex_227))) (let ((.cse60 (select (select (store .cse63 v_prenex_223 .cse65) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_222 4))) (.cse61 (store .cse58 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse59 (store .cse61 v_prenex_223 v_prenex_226)) (.cse62 (select (store .cse63 v_prenex_223 (store .cse65 v_prenex_221 .cse60)) .cse60))) (or (not (= 1 (select .cse59 .cse60))) (not (= 0 (select .cse61 v_prenex_223))) (= (select .cse59 (select .cse62 v_prenex_225)) 1) (not (= 1 (select .cse59 (select (select (store .cse63 v_prenex_223 .cse64) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (< |c_#StackHeapBarrier| v_prenex_223)) (< 0 v_prenex_222) (not (<= 0 v_prenex_222)) (= (select .cse59 (select .cse62 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (= (select .cse59 (select .cse62 0)) 1))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse67 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse67 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_101 Int) (v_prenex_102 Int) (v_prenex_100 Int) (v_prenex_96 Int) (v_prenex_95 Int) (v_prenex_98 Int) (v_prenex_97 Int)) (let ((.cse72 (let ((.cse75 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse75 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse75 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse73 (store (select .cse72 v_prenex_97) v_prenex_95 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse74 (store .cse73 (+ v_prenex_95 4) v_prenex_102))) (let ((.cse71 (select (select (store .cse72 v_prenex_97 .cse74) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_96 4))) (.cse70 (store .cse67 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse68 (store .cse70 v_prenex_97 v_prenex_101)) (.cse69 (select (store .cse72 v_prenex_97 (store .cse74 v_prenex_95 .cse71)) .cse71))) (or (= (select .cse68 (select .cse69 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (<= 0 v_prenex_96)) (not (= 0 (select .cse70 v_prenex_97))) (not (< |c_#StackHeapBarrier| v_prenex_97)) (= (select .cse68 (select .cse69 v_prenex_98)) 1) (not (= 1 (select .cse68 .cse71))) (not (= 1 (select .cse68 (select (select (store .cse72 v_prenex_97 .cse73) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse68 (select .cse69 v_prenex_100)) 1) (< 0 v_prenex_96) (= (select .cse68 (select .cse69 0)) 1))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse76 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse76 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_216 Int) (v_prenex_220 Int) (v_prenex_219 Int) (v_prenex_217 Int)) (let ((.cse80 (let ((.cse83 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse83 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse83 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse82 (store (select .cse80 v_prenex_217) v_prenex_216 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse77 (store .cse76 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse81 (store .cse82 (+ v_prenex_216 4) v_prenex_220))) (let ((.cse79 (select (select (store .cse80 v_prenex_217 .cse81) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse78 (store .cse77 v_prenex_217 v_prenex_219))) (or (not (< |c_#StackHeapBarrier| v_prenex_217)) (not (= 0 (select .cse77 v_prenex_217))) (not (= 1 (select .cse78 .cse79))) (= (select .cse78 (select (select (store .cse80 v_prenex_217 (store .cse81 v_prenex_216 .cse79)) .cse79) |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (= 4 v_prenex_216) (not (= 1 (select .cse78 (select (select (store .cse80 v_prenex_217 .cse82) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0))))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse84 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse84 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_204 Int) (v_prenex_202 Int) (v_prenex_203 Int) (v_prenex_201 Int) (v_prenex_208 Int) (v_prenex_206 Int) (v_prenex_207 Int)) (let ((.cse88 (let ((.cse92 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse92 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse92 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse89 (store (select .cse88 v_prenex_203) v_prenex_201 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse91 (store .cse89 (+ v_prenex_201 4) v_prenex_208))) (let ((.cse87 (select (select (store .cse88 v_prenex_203 .cse91) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_202 4))) (.cse90 (store .cse84 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse85 (store .cse90 v_prenex_203 v_prenex_207)) (.cse86 (select (store .cse88 v_prenex_203 (store .cse91 v_prenex_201 .cse87)) .cse87))) (or (not (<= 0 v_prenex_202)) (= (select .cse85 (select .cse86 0)) 1) (= (select .cse85 (select .cse86 v_prenex_204)) 1) (< 0 v_prenex_202) (not (< |c_#StackHeapBarrier| v_prenex_203)) (not (= 1 (select .cse85 .cse87))) (= (select .cse85 (select .cse86 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse85 (select (select (store .cse88 v_prenex_203 .cse89) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse90 v_prenex_203))) (= (select .cse85 (select .cse86 v_prenex_206)) 1))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse93 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse93 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_77 Int) (v_prenex_79 Int) (v_prenex_76 Int) (v_prenex_75 Int) (v_prenex_80 Int)) (let ((.cse97 (let ((.cse101 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse101 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse101 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse98 (store (select .cse97 v_prenex_76) v_prenex_75 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse100 (store .cse98 (+ v_prenex_75 4) v_prenex_80))) (let ((.cse95 (select (select (store .cse97 v_prenex_76 .cse100) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse99 (store .cse93 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse94 (store .cse99 v_prenex_76 v_prenex_79)) (.cse96 (select (store .cse97 v_prenex_76 (store .cse100 v_prenex_75 .cse95)) .cse95))) (or (not (= 1 (select .cse94 .cse95))) (= (select .cse94 (select .cse96 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (< |c_#StackHeapBarrier| v_prenex_76)) (= (select .cse94 (select .cse96 0)) 1) (not (= 1 (select .cse94 (select (select (store .cse97 v_prenex_76 .cse98) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse99 v_prenex_76))) (= (select .cse94 (select .cse96 v_prenex_77)) 1))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse102 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse102 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_59 Int) (v_prenex_55 Int) (v_prenex_58 Int) (v_prenex_57 Int) (v_prenex_52 Int) (v_prenex_54 Int) (v_prenex_53 Int)) (let ((.cse104 (let ((.cse111 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse111 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse111 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse105 (store (select .cse104 v_prenex_54) v_prenex_52 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse110 (store .cse105 (+ v_prenex_52 4) v_prenex_59)) (.cse109 (+ v_prenex_53 4))) (let ((.cse107 (store .cse102 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse108 (select (select (store .cse104 v_prenex_54 .cse110) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse109))) (let ((.cse106 (select (store .cse104 v_prenex_54 (store .cse110 v_prenex_52 .cse108)) .cse108)) (.cse103 (store .cse107 v_prenex_54 v_prenex_58))) (or (not (= 1 (select .cse103 (select (select (store .cse104 v_prenex_54 .cse105) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse103 (select .cse106 v_prenex_55)) 1) (= (select .cse103 (select .cse106 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (< 0 v_prenex_53) (not (< |c_#StackHeapBarrier| v_prenex_54)) (not (<= 0 v_prenex_53)) (= (select .cse103 (select .cse106 v_prenex_57)) 1) (not (= 0 (select .cse107 v_prenex_54))) (= (select .cse103 (select .cse106 0)) 1) (not (= 1 (select .cse103 .cse108))) (= .cse109 v_prenex_52))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse119 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_178 Int) (v_prenex_176 Int) (v_prenex_177 Int) (v_prenex_181 Int) (v_prenex_180 Int)) (let ((.cse116 (let ((.cse120 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse120 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse120 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse117 (store (select .cse116 v_prenex_177) v_prenex_176 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse118 (store .cse117 (+ v_prenex_176 4) v_prenex_181))) (let ((.cse115 (select (select (store .cse116 v_prenex_177 .cse118) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse114 (store .cse119 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse112 (store .cse114 v_prenex_177 v_prenex_180)) (.cse113 (select (store .cse116 v_prenex_177 (store .cse118 v_prenex_176 .cse115)) .cse115))) (or (= (select .cse112 (select .cse113 v_prenex_178)) 1) (= 4 v_prenex_176) (not (= 0 (select .cse114 v_prenex_177))) (not (< |c_#StackHeapBarrier| v_prenex_177)) (= (select .cse112 (select .cse113 0)) 1) (not (= 1 (select .cse112 .cse115))) (not (= 1 (select .cse112 (select (select (store .cse116 v_prenex_177 .cse117) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse112 (select .cse113 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))))) (not (= 0 (select .cse119 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse128 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_8 Int)) (let ((.cse124 (let ((.cse129 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse129 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse129 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse125 (store (select .cse124 v_prenex_4) v_prenex_2 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse127 (store .cse125 (+ v_prenex_2 4) v_prenex_8))) (let ((.cse122 (select (select (store .cse124 v_prenex_4 .cse127) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_3 4))) (.cse126 (store .cse128 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse121 (store .cse126 v_prenex_4 v_prenex_7)) (.cse123 (select (store .cse124 v_prenex_4 (store .cse127 v_prenex_2 .cse122)) .cse122))) (or (not (<= 0 v_prenex_3)) (not (= 1 (select .cse121 .cse122))) (not (< |c_#StackHeapBarrier| v_prenex_4)) (= (select .cse121 (select .cse123 v_prenex_6)) 1) (< 0 v_prenex_3) (not (= 1 (select .cse121 (select (select (store .cse124 v_prenex_4 .cse125) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse121 (select .cse123 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 0 (select .cse126 v_prenex_4)))))))))) (not (= 0 (select .cse128 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse137 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_19 Int)) (let ((.cse132 (let ((.cse138 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse138 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse138 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse133 (store (select .cse132 v_prenex_19) v_prenex_17 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse136 (store .cse133 (+ v_prenex_17 4) v_prenex_23))) (let ((.cse134 (select (select (store .cse132 v_prenex_19 .cse136) |v_ULTIMATE.start_main_~item~0#1.base_18|) (+ v_prenex_18 4))) (.cse130 (store .cse137 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse131 (store .cse130 v_prenex_19 v_prenex_22)) (.cse135 (select (store .cse132 v_prenex_19 (store .cse136 v_prenex_17 .cse134)) .cse134))) (or (not (= 0 (select .cse130 v_prenex_19))) (not (<= 0 v_prenex_18)) (not (= 1 (select .cse131 (select (select (store .cse132 v_prenex_19 .cse133) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 1 (select .cse131 .cse134))) (not (< |c_#StackHeapBarrier| v_prenex_19)) (= v_prenex_18 v_prenex_17) (= (select .cse131 (select .cse135 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (= (select .cse131 (select .cse135 v_prenex_21)) 1) (< 0 v_prenex_18) (= (select .cse131 (select .cse135 0)) 1)))))))) (not (= 0 (select .cse137 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse139 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse139 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_248 Int) (v_prenex_249 Int) (v_prenex_246 Int) (v_prenex_244 Int) (v_prenex_245 Int)) (let ((.cse143 (let ((.cse147 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse147 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse147 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse144 (store (select .cse143 v_prenex_245) v_prenex_244 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse146 (store .cse144 (+ v_prenex_244 4) v_prenex_249))) (let ((.cse145 (select (select (store .cse143 v_prenex_245 .cse146) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4)) (.cse140 (store .cse139 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse141 (store .cse140 v_prenex_245 v_prenex_248)) (.cse142 (select (store .cse143 v_prenex_245 (store .cse146 v_prenex_244 .cse145)) .cse145))) (or (not (= 0 (select .cse140 v_prenex_245))) (= (select .cse141 (select .cse142 0)) 1) (not (= 1 (select .cse141 (select (select (store .cse143 v_prenex_245 .cse144) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 1 (select .cse141 .cse145))) (not (< |c_#StackHeapBarrier| v_prenex_245)) (= (select .cse141 (select .cse142 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (= (select .cse141 (select .cse142 v_prenex_246)) 1))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse156 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_127 Int) (v_prenex_128 Int) (v_prenex_126 Int) (v_prenex_132 Int) (v_prenex_133 Int) (v_prenex_131 Int) (v_prenex_129 Int)) (let ((.cse153 (let ((.cse157 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse157 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse157 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse154 (store (select .cse153 v_prenex_128) v_prenex_126 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse155 (store .cse154 (+ v_prenex_126 4) v_prenex_133)) (.cse152 (+ v_prenex_127 4))) (let ((.cse150 (select (select (store .cse153 v_prenex_128 .cse155) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse152)) (.cse151 (store .cse156 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse148 (store .cse151 v_prenex_128 v_prenex_132)) (.cse149 (select (store .cse153 v_prenex_128 (store .cse155 v_prenex_126 .cse150)) .cse150))) (or (not (<= 0 v_prenex_127)) (= (select .cse148 (select .cse149 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= 1 (select .cse148 .cse150))) (= (select .cse148 (select .cse149 v_prenex_131)) 1) (not (= 0 (select .cse151 v_prenex_128))) (= .cse152 v_prenex_126) (= v_prenex_127 v_prenex_126) (not (= 1 (select .cse148 (select (select (store .cse153 v_prenex_128 .cse154) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (< 0 v_prenex_127) (= (select .cse148 (select .cse149 v_prenex_129)) 1) (= (select .cse148 (select .cse149 0)) 1) (not (< |c_#StackHeapBarrier| v_prenex_128))))))))) (not (= 0 (select .cse156 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse158 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse158 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_116 Int) (v_prenex_117 Int) (v_prenex_115 Int) (v_prenex_112 Int) (v_prenex_113 Int) (v_prenex_111 Int)) (let ((.cse162 (let ((.cse167 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse167 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse167 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse163 (store (select .cse162 v_prenex_113) v_prenex_111 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse166 (store .cse163 (+ v_prenex_111 4) v_prenex_117)) (.cse161 (+ v_prenex_112 4))) (let ((.cse164 (store .cse158 |v_ULTIMATE.start_main_~item~0#1.base_18| 1)) (.cse165 (select (select (store .cse162 v_prenex_113 .cse166) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse161))) (let ((.cse160 (select (store .cse162 v_prenex_113 (store .cse166 v_prenex_111 .cse165)) .cse165)) (.cse159 (store .cse164 v_prenex_113 v_prenex_116))) (or (< 0 v_prenex_112) (= (select .cse159 (select .cse160 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (= .cse161 v_prenex_111) (not (< |c_#StackHeapBarrier| v_prenex_113)) (= v_prenex_112 v_prenex_111) (not (<= 0 v_prenex_112)) (not (= 1 (select .cse159 (select (select (store .cse162 v_prenex_113 .cse163) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (not (= 0 (select .cse164 v_prenex_113))) (= (select .cse159 (select .cse160 v_prenex_115)) 1) (not (= 1 (select .cse159 .cse165))))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse168 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse168 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((v_prenex_145 Int) (v_prenex_144 Int) (v_prenex_141 Int) (v_prenex_142 Int)) (let ((.cse172 (let ((.cse175 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse175 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse175 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse173 (store (select .cse172 v_prenex_142) v_prenex_141 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse174 (store .cse173 (+ v_prenex_141 4) v_prenex_145)) (.cse169 (store .cse168 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse170 (store .cse169 v_prenex_142 v_prenex_144)) (.cse171 (select (select (store .cse172 v_prenex_142 .cse174) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (or (not (< |c_#StackHeapBarrier| v_prenex_142)) (not (= 0 (select .cse169 v_prenex_142))) (not (= 1 (select .cse170 .cse171))) (not (= 1 (select .cse170 (select (select (store .cse172 v_prenex_142 .cse173) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse170 (select (select (store .cse172 v_prenex_142 (store .cse174 v_prenex_141 .cse171)) .cse171) |c_ULTIMATE.start_main_~item~0#1.offset|)) 1)))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse182 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (forall ((v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_51 Int) (v_prenex_50 Int)) (let ((.cse178 (let ((.cse183 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse183 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse183 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse179 (store (select .cse178 v_prenex_48) v_prenex_47 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse180 (store .cse179 (+ v_prenex_47 4) v_prenex_51)) (.cse181 (store .cse182 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse176 (store .cse181 v_prenex_48 v_prenex_50)) (.cse177 (select (select (store .cse178 v_prenex_48 .cse180) |v_ULTIMATE.start_main_~item~0#1.base_18|) 4))) (or (= 0 v_prenex_47) (not (= 1 (select .cse176 .cse177))) (not (= 1 (select .cse176 (select (select (store .cse178 v_prenex_48 .cse179) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= (select .cse176 (select (select (store .cse178 v_prenex_48 (store .cse180 v_prenex_47 .cse177)) .cse177) |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (= 4 v_prenex_47) (not (= 0 (select .cse181 v_prenex_48))) (not (< |c_#StackHeapBarrier| v_prenex_48)))))))) (not (= 0 (select .cse182 |v_ULTIMATE.start_main_~item~0#1.base_18|)))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1885 Int) (|v_ULTIMATE.start_main_~node~0#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17|))) (forall ((v_ArrVal_1889 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_18| Int) (v_ArrVal_1887 Int)) (let ((.cse184 (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1887))) (or (not (= 0 (select .cse184 |v_ULTIMATE.start_main_~item~0#1.base_18|))) (forall ((|ULTIMATE.start_main_~#iter~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem11#1.offset_16| Int) (|v_ULTIMATE.start_main_~#iter~0#1.base_58| Int) (v_ArrVal_1910 Int) (v_arrayElimCell_149 Int) (v_ArrVal_1898 Int) (v_ArrVal_1911 Int)) (let ((.cse188 (let ((.cse193 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse9 .cse10 v_ArrVal_1885)) |v_ULTIMATE.start_main_~node~0#1.base_17| v_ArrVal_1889))) (store .cse193 |v_ULTIMATE.start_main_~item~0#1.base_18| (store (store (select .cse193 |v_ULTIMATE.start_main_~item~0#1.base_18|) 0 |v_ULTIMATE.start_main_~node~0#1.base_17|) 4 |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse189 (store (select .cse188 |v_ULTIMATE.start_main_~#iter~0#1.base_58|) |ULTIMATE.start_main_~#iter~0#1.offset| |v_ULTIMATE.start_main_~item~0#1.base_18|))) (let ((.cse192 (store .cse189 (+ |ULTIMATE.start_main_~#iter~0#1.offset| 4) v_ArrVal_1911)) (.cse190 (+ |v_ULTIMATE.start_main_#t~mem11#1.offset_16| 4))) (let ((.cse186 (select (select (store .cse188 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse192) |v_ULTIMATE.start_main_~item~0#1.base_18|) .cse190)) (.cse191 (store .cse184 |v_ULTIMATE.start_main_~item~0#1.base_18| 1))) (let ((.cse185 (store .cse191 |v_ULTIMATE.start_main_~#iter~0#1.base_58| v_ArrVal_1898)) (.cse187 (select (store .cse188 |v_ULTIMATE.start_main_~#iter~0#1.base_58| (store .cse192 |ULTIMATE.start_main_~#iter~0#1.offset| .cse186)) .cse186))) (or (not (<= 0 |v_ULTIMATE.start_main_#t~mem11#1.offset_16|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#iter~0#1.base_58|)) (< 0 |v_ULTIMATE.start_main_#t~mem11#1.offset_16|) (not (= 1 (select .cse185 .cse186))) (= (select .cse185 (select .cse187 v_ArrVal_1910)) 1) (= (select .cse185 (select .cse187 v_arrayElimCell_149)) 1) (= (select .cse185 (select .cse187 0)) 1) (not (= 1 (select .cse185 (select (select (store .cse188 |v_ULTIMATE.start_main_~#iter~0#1.base_58| .cse189) |v_ULTIMATE.start_main_~item~0#1.base_18|) 0)))) (= .cse190 |ULTIMATE.start_main_~#iter~0#1.offset|) (not (= 0 (select .cse191 |v_ULTIMATE.start_main_~#iter~0#1.base_58|))) (= (select .cse185 (select .cse187 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1))))))))))) (not (< |v_ULTIMATE.start_main_~node~0#1.base_17| |c_#StackHeapBarrier|)))))) is different from true [2023-02-15 21:57:48,790 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:57:48,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 884 treesize of output 486 [2023-02-15 21:57:48,801 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:57:48,802 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:57:48,813 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:57:48,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:57:48,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 6675 treesize of output 6417 [2023-02-15 21:57:48,916 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:57:48,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11563 treesize of output 11395 [2023-02-15 21:57:49,407 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 21:57:49,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3927 treesize of output 1 [2023-02-15 21:57:50,344 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:57:50,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9596 treesize of output 9562 [2023-02-15 21:57:53,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:57:53,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1707 treesize of output 1693 [2023-02-15 21:57:56,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:57:56,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1554 treesize of output 844 [2023-02-15 21:57:56,382 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:57:56,383 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:57:56,396 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:57:56,510 INFO L321 Elim1Store]: treesize reduction 96, result has 15.0 percent of original size [2023-02-15 21:57:56,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 20531 treesize of output 18333 [2023-02-15 21:57:56,665 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:57:56,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:57:56,769 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:57:56,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 14663 treesize of output 14527 [2023-02-15 21:57:56,868 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:57:56,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:57:57,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:57:57,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 17725 treesize of output 17661