./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2971ec3e9ef2eef1d2151174358645d6ce0c6d4fe66ae89c00ded0f196979d8a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:03:35,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:03:35,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:03:35,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:03:35,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:03:35,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:03:35,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:03:35,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:03:35,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:03:35,932 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:03:35,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:03:35,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:03:35,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:03:35,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:03:35,934 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:03:35,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:03:35,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:03:35,934 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:03:35,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:03:35,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:03:35,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:03:35,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:03:35,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:03:35,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:03:35,935 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:03:35,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:03:35,935 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:03:35,935 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:03:35,935 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:03:35,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:03:35,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:03:35,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:03:35,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:03:35,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:03:35,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:03:35,936 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:03:35,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:03:35,937 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:03:35,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:03:35,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:03:35,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:03:35,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:03:35,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:03:35,937 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2971ec3e9ef2eef1d2151174358645d6ce0c6d4fe66ae89c00ded0f196979d8a [2025-02-07 20:03:36,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:03:36,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:03:36,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:03:36,189 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:03:36,189 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:03:36,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2025-02-07 20:03:37,369 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d785fb3c/fec194b91c8744b99779b747eeefa006/FLAG6b8ddaeae [2025-02-07 20:03:37,689 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:03:37,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2025-02-07 20:03:37,697 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d785fb3c/fec194b91c8744b99779b747eeefa006/FLAG6b8ddaeae [2025-02-07 20:03:37,956 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d785fb3c/fec194b91c8744b99779b747eeefa006 [2025-02-07 20:03:37,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:03:37,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:03:37,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:03:37,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:03:37,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:03:37,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:03:37" (1/1) ... [2025-02-07 20:03:37,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4602875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:37, skipping insertion in model container [2025-02-07 20:03:37,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:03:37" (1/1) ... [2025-02-07 20:03:37,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:03:38,215 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i[24291,24304] [2025-02-07 20:03:38,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:03:38,228 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:03:38,271 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i[24291,24304] [2025-02-07 20:03:38,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:03:38,291 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:03:38,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:38 WrapperNode [2025-02-07 20:03:38,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:03:38,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:03:38,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:03:38,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:03:38,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:38" (1/1) ... [2025-02-07 20:03:38,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:38" (1/1) ... [2025-02-07 20:03:38,327 INFO L138 Inliner]: procedures = 122, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 194 [2025-02-07 20:03:38,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:03:38,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:03:38,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:03:38,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:03:38,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:38" (1/1) ... [2025-02-07 20:03:38,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:38" (1/1) ... [2025-02-07 20:03:38,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:38" (1/1) ... [2025-02-07 20:03:38,382 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 26, 12]. 65 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 15 writes are split as follows [0, 10, 5]. [2025-02-07 20:03:38,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:38" (1/1) ... [2025-02-07 20:03:38,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:38" (1/1) ... [2025-02-07 20:03:38,392 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:38" (1/1) ... [2025-02-07 20:03:38,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:38" (1/1) ... [2025-02-07 20:03:38,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:38" (1/1) ... [2025-02-07 20:03:38,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:38" (1/1) ... [2025-02-07 20:03:38,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:03:38,402 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:03:38,402 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:03:38,402 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:03:38,403 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:38" (1/1) ... [2025-02-07 20:03:38,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:03:38,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:03:38,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 20:03:38,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 20:03:38,452 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-02-07 20:03:38,453 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-02-07 20:03:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 20:03:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 20:03:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 20:03:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 20:03:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 20:03:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 20:03:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 20:03:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:03:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 20:03:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 20:03:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-07 20:03:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 20:03:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 20:03:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-07 20:03:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 20:03:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:03:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 20:03:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 20:03:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:03:38,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:03:38,554 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:03:38,555 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:03:38,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-02-07 20:03:38,777 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-02-07 20:03:38,777 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:03:38,785 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:03:38,786 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:03:38,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:03:38 BoogieIcfgContainer [2025-02-07 20:03:38,786 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:03:38,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:03:38,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:03:38,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:03:38,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:03:37" (1/3) ... [2025-02-07 20:03:38,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4324e820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:03:38, skipping insertion in model container [2025-02-07 20:03:38,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:38" (2/3) ... [2025-02-07 20:03:38,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4324e820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:03:38, skipping insertion in model container [2025-02-07 20:03:38,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:03:38" (3/3) ... [2025-02-07 20:03:38,795 INFO L128 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2025-02-07 20:03:38,804 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:03:38,805 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list_and_tree_cnstr-1.i that has 2 procedures, 50 locations, 1 initial locations, 8 loop locations, and 1 error locations. [2025-02-07 20:03:38,840 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:03:38,850 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1dd69060, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:03:38,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:03:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 47 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:03:38,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 20:03:38,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:38,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:03:38,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:38,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:38,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1531692346, now seen corresponding path program 1 times [2025-02-07 20:03:38,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:38,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792192597] [2025-02-07 20:03:38,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:38,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:38,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:03:38,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:03:38,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:38,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:38,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:03:38,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:38,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792192597] [2025-02-07 20:03:38,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792192597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:03:38,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:03:38,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:03:38,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016929435] [2025-02-07 20:03:38,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:03:38,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:03:38,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:03:39,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:03:39,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:03:39,008 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 47 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 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 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2025-02-07 20:03:39,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:03:39,023 INFO L93 Difference]: Finished difference Result 97 states and 153 transitions. [2025-02-07 20:03:39,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:03:39,024 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2025-02-07 20:03:39,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:03:39,027 INFO L225 Difference]: With dead ends: 97 [2025-02-07 20:03:39,028 INFO L226 Difference]: Without dead ends: 41 [2025-02-07 20:03:39,030 INFO L434 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 [2025-02-07 20:03:39,032 INFO L435 NwaCegarLoop]: 69 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, 69 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 [2025-02-07 20:03:39,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:03:39,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-07 20:03:39,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-02-07 20:03:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.45) internal successors, (58), 40 states have internal predecessors, (58), 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) [2025-02-07 20:03:39,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2025-02-07 20:03:39,054 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 14 [2025-02-07 20:03:39,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:03:39,054 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2025-02-07 20:03:39,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2025-02-07 20:03:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2025-02-07 20:03:39,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 20:03:39,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:39,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:03:39,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:03:39,056 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:39,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:39,057 INFO L85 PathProgramCache]: Analyzing trace with hash -955677162, now seen corresponding path program 1 times [2025-02-07 20:03:39,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:39,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350360572] [2025-02-07 20:03:39,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:39,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:39,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 20:03:39,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 20:03:39,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:39,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:03:39,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:39,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350360572] [2025-02-07 20:03:39,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350360572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:03:39,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:03:39,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:03:39,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515531660] [2025-02-07 20:03:39,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:03:39,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:03:39,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:03:39,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:03:39,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:03:39,151 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 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) [2025-02-07 20:03:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:03:39,162 INFO L93 Difference]: Finished difference Result 68 states and 94 transitions. [2025-02-07 20:03:39,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:03:39,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 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 [2025-02-07 20:03:39,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:03:39,164 INFO L225 Difference]: With dead ends: 68 [2025-02-07 20:03:39,164 INFO L226 Difference]: Without dead ends: 49 [2025-02-07 20:03:39,164 INFO L434 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 [2025-02-07 20:03:39,164 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 30 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:03:39,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 90 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:03:39,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-07 20:03:39,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-07 20:03:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 48 states have internal predecessors, (71), 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) [2025-02-07 20:03:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2025-02-07 20:03:39,169 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 19 [2025-02-07 20:03:39,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:03:39,169 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2025-02-07 20:03:39,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 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) [2025-02-07 20:03:39,169 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2025-02-07 20:03:39,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 20:03:39,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:39,170 INFO L218 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] [2025-02-07 20:03:39,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:03:39,170 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:39,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:39,170 INFO L85 PathProgramCache]: Analyzing trace with hash 915772894, now seen corresponding path program 1 times [2025-02-07 20:03:39,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:39,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846437878] [2025-02-07 20:03:39,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:39,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:39,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 20:03:39,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 20:03:39,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:39,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:39,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:03:39,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:39,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846437878] [2025-02-07 20:03:39,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846437878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:03:39,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:03:39,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:03:39,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937920459] [2025-02-07 20:03:39,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:03:39,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:03:39,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:03:39,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:03:39,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:03:39,485 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2025-02-07 20:03:39,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:03:39,541 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2025-02-07 20:03:39,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:03:39,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2025-02-07 20:03:39,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:03:39,542 INFO L225 Difference]: With dead ends: 66 [2025-02-07 20:03:39,542 INFO L226 Difference]: Without dead ends: 62 [2025-02-07 20:03:39,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:03:39,543 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:03:39,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 184 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:03:39,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-07 20:03:39,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2025-02-07 20:03:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.456140350877193) internal successors, (83), 57 states have internal predecessors, (83), 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) [2025-02-07 20:03:39,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2025-02-07 20:03:39,551 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 83 transitions. Word has length 25 [2025-02-07 20:03:39,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:03:39,551 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 83 transitions. [2025-02-07 20:03:39,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2025-02-07 20:03:39,552 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 83 transitions. [2025-02-07 20:03:39,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-07 20:03:39,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:39,553 INFO L218 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] [2025-02-07 20:03:39,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:03:39,553 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:39,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:39,553 INFO L85 PathProgramCache]: Analyzing trace with hash -377145729, now seen corresponding path program 1 times [2025-02-07 20:03:39,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:39,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173205458] [2025-02-07 20:03:39,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:39,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:39,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-07 20:03:39,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-07 20:03:39,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:39,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:03:39,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:39,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173205458] [2025-02-07 20:03:39,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173205458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:03:39,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:03:39,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:03:39,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907979414] [2025-02-07 20:03:39,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:03:39,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:03:39,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:03:39,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:03:39,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:03:39,680 INFO L87 Difference]: Start difference. First operand 58 states and 83 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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) [2025-02-07 20:03:39,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:03:39,741 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2025-02-07 20:03:39,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:03:39,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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 [2025-02-07 20:03:39,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:03:39,742 INFO L225 Difference]: With dead ends: 68 [2025-02-07 20:03:39,743 INFO L226 Difference]: Without dead ends: 60 [2025-02-07 20:03:39,744 INFO L434 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 [2025-02-07 20:03:39,744 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 5 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:03:39,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 187 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:03:39,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-07 20:03:39,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2025-02-07 20:03:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 55 states have internal predecessors, (80), 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) [2025-02-07 20:03:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2025-02-07 20:03:39,749 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 27 [2025-02-07 20:03:39,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:03:39,749 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2025-02-07 20:03:39,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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) [2025-02-07 20:03:39,750 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2025-02-07 20:03:39,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-07 20:03:39,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:39,750 INFO L218 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] [2025-02-07 20:03:39,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:03:39,750 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:39,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:39,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1756102145, now seen corresponding path program 1 times [2025-02-07 20:03:39,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:39,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958830912] [2025-02-07 20:03:39,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:39,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:39,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-07 20:03:39,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-07 20:03:39,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:39,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:39,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:03:39,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:39,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958830912] [2025-02-07 20:03:39,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958830912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:03:39,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:03:39,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:03:39,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578281821] [2025-02-07 20:03:39,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:03:39,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:03:39,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:03:39,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:03:39,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:03:39,887 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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) [2025-02-07 20:03:39,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:03:39,936 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2025-02-07 20:03:39,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:03:39,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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 [2025-02-07 20:03:39,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:03:39,937 INFO L225 Difference]: With dead ends: 68 [2025-02-07 20:03:39,937 INFO L226 Difference]: Without dead ends: 57 [2025-02-07 20:03:39,938 INFO L434 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 [2025-02-07 20:03:39,938 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 5 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:03:39,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 191 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:03:39,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-07 20:03:39,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2025-02-07 20:03:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 52 states have internal predecessors, (76), 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) [2025-02-07 20:03:39,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2025-02-07 20:03:39,945 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 27 [2025-02-07 20:03:39,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:03:39,945 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2025-02-07 20:03:39,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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) [2025-02-07 20:03:39,945 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2025-02-07 20:03:39,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-07 20:03:39,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:39,946 INFO L218 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] [2025-02-07 20:03:39,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 20:03:39,946 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:39,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:39,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1872517434, now seen corresponding path program 1 times [2025-02-07 20:03:39,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:39,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922878572] [2025-02-07 20:03:39,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:39,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:39,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 20:03:39,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 20:03:39,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:39,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:03:40,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:40,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922878572] [2025-02-07 20:03:40,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922878572] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:03:40,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496405126] [2025-02-07 20:03:40,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:40,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:03:40,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:03:40,338 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:03:40,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 20:03:40,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 20:03:40,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 20:03:40,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:40,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:40,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-07 20:03:40,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:03:40,551 INFO L378 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 [2025-02-07 20:03:40,612 INFO L378 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 11 [2025-02-07 20:03:40,659 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-02-07 20:03:40,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 22 [2025-02-07 20:03:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:03:40,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:03:40,938 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_23| Int) (v_ArrVal_176 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_176))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (= 3 (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_23| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_23|) |c_ULTIMATE.start_main_~t~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= v_ArrVal_176 (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1 (select v_ArrVal_176 .cse1)))))))) is different from false [2025-02-07 20:03:40,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:40,972 INFO L378 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 181 [2025-02-07 20:03:41,137 INFO L378 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 [2025-02-07 20:03:41,143 INFO L378 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 203 treesize of output 195 [2025-02-07 20:03:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:03:41,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496405126] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:03:41,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:03:41,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 22 [2025-02-07 20:03:41,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423106977] [2025-02-07 20:03:41,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:03:41,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-07 20:03:41,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:03:41,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-07 20:03:41,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=352, Unknown=1, NotChecked=38, Total=462 [2025-02-07 20:03:41,186 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 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) [2025-02-07 20:03:41,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:03:41,568 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2025-02-07 20:03:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-07 20:03:41,569 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 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 [2025-02-07 20:03:41,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:03:41,569 INFO L225 Difference]: With dead ends: 81 [2025-02-07 20:03:41,569 INFO L226 Difference]: Without dead ends: 73 [2025-02-07 20:03:41,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=826, Unknown=1, NotChecked=60, Total=1056 [2025-02-07 20:03:41,570 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 43 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:03:41,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 636 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 232 Invalid, 0 Unknown, 48 Unchecked, 0.2s Time] [2025-02-07 20:03:41,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-07 20:03:41,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2025-02-07 20:03:41,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 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) [2025-02-07 20:03:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2025-02-07 20:03:41,576 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 29 [2025-02-07 20:03:41,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:03:41,576 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2025-02-07 20:03:41,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 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) [2025-02-07 20:03:41,576 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2025-02-07 20:03:41,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-07 20:03:41,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:41,577 INFO L218 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] [2025-02-07 20:03:41,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 20:03:41,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:03:41,778 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:41,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:41,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1073110086, now seen corresponding path program 1 times [2025-02-07 20:03:41,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:41,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377289299] [2025-02-07 20:03:41,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:41,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:41,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 20:03:41,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 20:03:41,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:41,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:42,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:03:42,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:42,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377289299] [2025-02-07 20:03:42,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377289299] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:03:42,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335194208] [2025-02-07 20:03:42,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:42,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:03:42,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:03:42,008 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:03:42,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 20:03:42,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 20:03:42,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 20:03:42,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:42,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:42,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-07 20:03:42,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:03:42,098 INFO L378 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 [2025-02-07 20:03:42,120 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:03:42,120 INFO L378 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 11 treesize of output 11 [2025-02-07 20:03:42,127 INFO L378 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 [2025-02-07 20:03:42,148 INFO L378 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 11 [2025-02-07 20:03:42,167 INFO L378 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 11 [2025-02-07 20:03:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:03:42,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:03:42,185 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= 1 (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2025-02-07 20:03:42,204 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_252) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_252 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_252 .cse0))))))) is different from false [2025-02-07 20:03:42,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:42,249 INFO L378 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 70 treesize of output 74 [2025-02-07 20:03:42,254 INFO L378 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 50 treesize of output 46 [2025-02-07 20:03:42,273 INFO L378 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 [2025-02-07 20:03:42,300 INFO L378 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 48 treesize of output 46 [2025-02-07 20:03:42,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2025-02-07 20:03:42,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335194208] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:03:42,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:03:42,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-02-07 20:03:42,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727151605] [2025-02-07 20:03:42,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:03:42,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 20:03:42,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:03:42,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 20:03:42,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=69, Unknown=2, NotChecked=34, Total=132 [2025-02-07 20:03:42,357 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 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) [2025-02-07 20:03:42,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:03:42,496 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2025-02-07 20:03:42,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 20:03:42,497 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 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 [2025-02-07 20:03:42,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:03:42,498 INFO L225 Difference]: With dead ends: 88 [2025-02-07 20:03:42,498 INFO L226 Difference]: Without dead ends: 84 [2025-02-07 20:03:42,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=158, Unknown=2, NotChecked=54, Total=272 [2025-02-07 20:03:42,498 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 27 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:03:42,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 414 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 132 Invalid, 0 Unknown, 83 Unchecked, 0.1s Time] [2025-02-07 20:03:42,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-07 20:03:42,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2025-02-07 20:03:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 72 states have internal predecessors, (100), 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) [2025-02-07 20:03:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2025-02-07 20:03:42,503 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 29 [2025-02-07 20:03:42,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:03:42,503 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2025-02-07 20:03:42,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 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) [2025-02-07 20:03:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2025-02-07 20:03:42,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-07 20:03:42,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:42,504 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 20:03:42,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 20:03:42,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:03:42,708 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:42,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:42,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1447600549, now seen corresponding path program 1 times [2025-02-07 20:03:42,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:42,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663356125] [2025-02-07 20:03:42,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:42,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:42,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 20:03:42,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 20:03:42,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:42,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:03:43,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:43,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663356125] [2025-02-07 20:03:43,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663356125] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:03:43,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435171073] [2025-02-07 20:03:43,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:43,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:03:43,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:03:43,067 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:03:43,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 20:03:43,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 20:03:43,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 20:03:43,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:43,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:43,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-07 20:03:43,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:03:43,203 INFO L378 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 15 treesize of output 1 [2025-02-07 20:03:43,206 INFO L378 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 [2025-02-07 20:03:43,247 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2025-02-07 20:03:43,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2025-02-07 20:03:43,259 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-02-07 20:03:43,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 17 [2025-02-07 20:03:43,263 INFO L378 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 15 treesize of output 9 [2025-02-07 20:03:43,270 INFO L378 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 15 treesize of output 11 [2025-02-07 20:03:43,324 INFO L378 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 19 treesize of output 11 [2025-02-07 20:03:43,327 INFO L378 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 7 treesize of output 3 [2025-02-07 20:03:43,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:03:43,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:03:43,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:43,468 INFO L378 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 94 treesize of output 97 [2025-02-07 20:03:43,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:43,556 INFO L378 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 45 treesize of output 46 [2025-02-07 20:03:43,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:43,562 INFO L378 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 35 treesize of output 36 [2025-02-07 20:03:43,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:43,575 INFO L378 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 83 treesize of output 52 [2025-02-07 20:03:43,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:43,590 INFO L378 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 58 treesize of output 57 [2025-02-07 20:03:43,593 INFO L378 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 41 treesize of output 37 [2025-02-07 20:03:43,599 INFO L378 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 37 treesize of output 33 [2025-02-07 20:03:43,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:03:43,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435171073] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:03:43,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:03:43,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2025-02-07 20:03:43,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564977015] [2025-02-07 20:03:43,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:03:43,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-07 20:03:43,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:03:43,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-07 20:03:43,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-02-07 20:03:43,701 INFO L87 Difference]: Start difference. First operand 73 states and 100 transitions. Second operand has 21 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 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) [2025-02-07 20:03:44,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:03:44,136 INFO L93 Difference]: Finished difference Result 101 states and 134 transitions. [2025-02-07 20:03:44,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-07 20:03:44,137 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 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 [2025-02-07 20:03:44,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:03:44,137 INFO L225 Difference]: With dead ends: 101 [2025-02-07 20:03:44,137 INFO L226 Difference]: Without dead ends: 90 [2025-02-07 20:03:44,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2025-02-07 20:03:44,138 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 89 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:03:44,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 399 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:03:44,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-07 20:03:44,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2025-02-07 20:03:44,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 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) [2025-02-07 20:03:44,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2025-02-07 20:03:44,147 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 111 transitions. Word has length 31 [2025-02-07 20:03:44,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:03:44,147 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 111 transitions. [2025-02-07 20:03:44,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 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) [2025-02-07 20:03:44,147 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2025-02-07 20:03:44,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 20:03:44,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:44,149 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 20:03:44,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 20:03:44,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:03:44,351 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:44,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:44,351 INFO L85 PathProgramCache]: Analyzing trace with hash 458675132, now seen corresponding path program 1 times [2025-02-07 20:03:44,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:44,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455699654] [2025-02-07 20:03:44,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:44,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:44,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 20:03:44,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 20:03:44,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:44,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:03:44,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:44,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455699654] [2025-02-07 20:03:44,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455699654] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:03:44,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949928479] [2025-02-07 20:03:44,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:44,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:03:44,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:03:44,656 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:03:44,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 20:03:44,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 20:03:44,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 20:03:44,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:44,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:44,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-07 20:03:44,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:03:44,750 INFO L378 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 [2025-02-07 20:03:44,815 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:03:44,815 INFO L378 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 11 treesize of output 11 [2025-02-07 20:03:44,836 INFO L378 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 19 treesize of output 1 [2025-02-07 20:03:44,841 INFO L378 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 19 treesize of output 1 [2025-02-07 20:03:44,872 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-07 20:03:44,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2025-02-07 20:03:44,876 INFO L378 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 29 treesize of output 19 [2025-02-07 20:03:44,879 INFO L378 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 40 treesize of output 23 [2025-02-07 20:03:44,899 INFO L378 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 39 treesize of output 21 [2025-02-07 20:03:44,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2025-02-07 20:03:44,906 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:03:44,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:03:44,945 INFO L378 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 52 treesize of output 30 [2025-02-07 20:03:44,949 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_404 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_404) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_402 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_402) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2025-02-07 20:03:44,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:44,961 INFO L378 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 [2025-02-07 20:03:44,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:44,966 INFO L378 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 38 treesize of output 31 [2025-02-07 20:03:44,969 INFO L378 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 [2025-02-07 20:03:44,977 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-07 20:03:44,978 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2025-02-07 20:03:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2025-02-07 20:03:45,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949928479] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:03:45,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:03:45,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2025-02-07 20:03:45,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384902710] [2025-02-07 20:03:45,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:03:45,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-07 20:03:45,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:03:45,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-07 20:03:45,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=326, Unknown=1, NotChecked=36, Total=420 [2025-02-07 20:03:45,045 INFO L87 Difference]: Start difference. First operand 82 states and 111 transitions. Second operand has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 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) [2025-02-07 20:03:45,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:03:45,273 INFO L93 Difference]: Finished difference Result 94 states and 123 transitions. [2025-02-07 20:03:45,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 20:03:45,273 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 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 33 [2025-02-07 20:03:45,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:03:45,274 INFO L225 Difference]: With dead ends: 94 [2025-02-07 20:03:45,274 INFO L226 Difference]: Without dead ends: 76 [2025-02-07 20:03:45,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=591, Unknown=1, NotChecked=50, Total=756 [2025-02-07 20:03:45,275 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 110 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:03:45,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 420 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 219 Invalid, 0 Unknown, 79 Unchecked, 0.1s Time] [2025-02-07 20:03:45,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-07 20:03:45,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2025-02-07 20:03:45,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.380281690140845) internal successors, (98), 71 states have internal predecessors, (98), 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) [2025-02-07 20:03:45,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2025-02-07 20:03:45,279 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 98 transitions. Word has length 33 [2025-02-07 20:03:45,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:03:45,279 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 98 transitions. [2025-02-07 20:03:45,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 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) [2025-02-07 20:03:45,279 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2025-02-07 20:03:45,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 20:03:45,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:45,280 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 20:03:45,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 20:03:45,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-07 20:03:45,484 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:45,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:45,485 INFO L85 PathProgramCache]: Analyzing trace with hash -497149674, now seen corresponding path program 1 times [2025-02-07 20:03:45,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:45,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481019207] [2025-02-07 20:03:45,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:45,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:45,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 20:03:45,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 20:03:45,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:45,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:46,031 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:03:46,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:46,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481019207] [2025-02-07 20:03:46,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481019207] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:03:46,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055536271] [2025-02-07 20:03:46,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:46,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:03:46,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:03:46,034 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:03:46,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 20:03:46,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 20:03:46,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 20:03:46,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:46,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:46,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-07 20:03:46,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:03:46,125 INFO L378 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 [2025-02-07 20:03:46,239 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-07 20:03:46,239 INFO L378 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 19 treesize of output 16 [2025-02-07 20:03:46,245 INFO L378 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 [2025-02-07 20:03:46,305 INFO L378 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 11 [2025-02-07 20:03:46,393 INFO L378 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 11 [2025-02-07 20:03:46,405 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:03:46,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-07 20:03:46,447 INFO L378 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 11 [2025-02-07 20:03:46,490 INFO L378 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 11 [2025-02-07 20:03:46,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:03:46,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:03:46,592 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_511 (Array Int Int))) (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2025-02-07 20:03:46,664 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_25| Int) (v_ArrVal_511 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_25|) 0)) (= (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_511) |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_512) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_508 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_508 .cse0))))))) is different from false [2025-02-07 20:03:46,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:46,697 INFO L378 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 496 treesize of output 494 [2025-02-07 20:03:46,728 INFO L378 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 118 treesize of output 110 [2025-02-07 20:03:46,737 INFO L378 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 50 treesize of output 46 [2025-02-07 20:03:46,803 INFO L378 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 63 treesize of output 59 [2025-02-07 20:03:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:03:47,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055536271] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:03:47,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:03:47,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 26 [2025-02-07 20:03:47,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669362024] [2025-02-07 20:03:47,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:03:47,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-07 20:03:47,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:03:47,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-07 20:03:47,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=457, Unknown=9, NotChecked=90, Total=650 [2025-02-07 20:03:47,913 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. Second operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 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) [2025-02-07 20:03:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:03:48,212 INFO L93 Difference]: Finished difference Result 85 states and 113 transitions. [2025-02-07 20:03:48,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 20:03:48,213 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 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 33 [2025-02-07 20:03:48,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:03:48,214 INFO L225 Difference]: With dead ends: 85 [2025-02-07 20:03:48,214 INFO L226 Difference]: Without dead ends: 81 [2025-02-07 20:03:48,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=155, Invalid=656, Unknown=9, NotChecked=110, Total=930 [2025-02-07 20:03:48,215 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 36 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:03:48,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 606 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 243 Invalid, 0 Unknown, 79 Unchecked, 0.2s Time] [2025-02-07 20:03:48,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-07 20:03:48,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2025-02-07 20:03:48,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 75 states have internal predecessors, (103), 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) [2025-02-07 20:03:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 103 transitions. [2025-02-07 20:03:48,224 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 103 transitions. Word has length 33 [2025-02-07 20:03:48,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:03:48,225 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 103 transitions. [2025-02-07 20:03:48,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 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) [2025-02-07 20:03:48,225 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 103 transitions. [2025-02-07 20:03:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 20:03:48,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:48,228 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-07 20:03:48,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-07 20:03:48,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-07 20:03:48,432 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:48,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:48,433 INFO L85 PathProgramCache]: Analyzing trace with hash 978215223, now seen corresponding path program 1 times [2025-02-07 20:03:48,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:48,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698064963] [2025-02-07 20:03:48,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:48,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:48,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-07 20:03:48,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 20:03:48,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:48,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:03:48,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:48,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698064963] [2025-02-07 20:03:48,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698064963] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:03:48,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318076415] [2025-02-07 20:03:48,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:48,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:03:48,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:03:48,757 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:03:48,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 20:03:48,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-07 20:03:48,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 20:03:48,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:48,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:48,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-07 20:03:48,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:03:48,857 INFO L378 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 [2025-02-07 20:03:48,896 INFO L378 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 [2025-02-07 20:03:48,909 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-07 20:03:48,910 INFO L378 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 19 treesize of output 16 [2025-02-07 20:03:48,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-07 20:03:48,965 INFO L378 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 11 [2025-02-07 20:03:48,971 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:03:48,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-07 20:03:48,996 INFO L378 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 16 treesize of output 11 [2025-02-07 20:03:49,016 INFO L378 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 11 [2025-02-07 20:03:49,040 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:03:49,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:03:49,067 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_619 (Array Int Int))) (not (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2025-02-07 20:03:49,131 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_30| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_30|) 0)) (not (= (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_615) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~t~0#1.base_30| v_ArrVal_619) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (not (= v_ArrVal_615 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_615 .cse0))))))) is different from false [2025-02-07 20:03:49,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:49,148 INFO L378 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 139 treesize of output 143 [2025-02-07 20:03:49,153 INFO L378 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 118 treesize of output 110 [2025-02-07 20:03:49,161 INFO L378 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 118 treesize of output 114 [2025-02-07 20:03:49,191 INFO L378 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 96 treesize of output 92 [2025-02-07 20:03:49,202 INFO L378 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 6 treesize of output 4 [2025-02-07 20:03:49,365 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-02-07 20:03:49,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318076415] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:03:49,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:03:49,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2025-02-07 20:03:49,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25613287] [2025-02-07 20:03:49,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:03:49,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-07 20:03:49,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:03:49,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-07 20:03:49,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=550, Unknown=7, NotChecked=98, Total=756 [2025-02-07 20:03:49,367 INFO L87 Difference]: Start difference. First operand 76 states and 103 transitions. Second operand has 28 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 28 states have internal predecessors, (75), 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) [2025-02-07 20:03:49,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:03:49,612 INFO L93 Difference]: Finished difference Result 89 states and 118 transitions. [2025-02-07 20:03:49,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 20:03:49,612 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 28 states have internal predecessors, (75), 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 [2025-02-07 20:03:49,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:03:49,613 INFO L225 Difference]: With dead ends: 89 [2025-02-07 20:03:49,613 INFO L226 Difference]: Without dead ends: 81 [2025-02-07 20:03:49,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=773, Unknown=7, NotChecked=118, Total=1056 [2025-02-07 20:03:49,614 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 29 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:03:49,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 753 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 231 Invalid, 0 Unknown, 73 Unchecked, 0.2s Time] [2025-02-07 20:03:49,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-07 20:03:49,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2025-02-07 20:03:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 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) [2025-02-07 20:03:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2025-02-07 20:03:49,618 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 35 [2025-02-07 20:03:49,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:03:49,618 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2025-02-07 20:03:49,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 28 states have internal predecessors, (75), 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) [2025-02-07 20:03:49,618 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2025-02-07 20:03:49,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 20:03:49,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:49,618 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-07 20:03:49,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-07 20:03:49,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-07 20:03:49,819 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:49,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:49,820 INFO L85 PathProgramCache]: Analyzing trace with hash -400741193, now seen corresponding path program 2 times [2025-02-07 20:03:49,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:49,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528270560] [2025-02-07 20:03:49,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:03:49,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:49,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-07 20:03:49,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 20:03:49,848 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:03:49,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:03:50,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:50,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528270560] [2025-02-07 20:03:50,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528270560] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:03:50,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776562618] [2025-02-07 20:03:50,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:03:50,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:03:50,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:03:50,281 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:03:50,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-07 20:03:50,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-07 20:03:50,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 20:03:50,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:03:50,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:50,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-02-07 20:03:50,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:03:50,391 INFO L378 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 [2025-02-07 20:03:50,451 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-07 20:03:50,451 INFO L378 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 [2025-02-07 20:03:50,516 INFO L378 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 15 treesize of output 1 [2025-02-07 20:03:50,520 INFO L378 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 15 treesize of output 1 [2025-02-07 20:03:50,594 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-07 20:03:50,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 [2025-02-07 20:03:50,603 INFO L378 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 [2025-02-07 20:03:50,622 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-07 20:03:50,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 24 [2025-02-07 20:03:50,642 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-02-07 20:03:50,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2025-02-07 20:03:50,660 INFO L378 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 [2025-02-07 20:03:50,760 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2025-02-07 20:03:50,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 147 [2025-02-07 20:03:50,762 INFO L378 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 124 [2025-02-07 20:03:50,769 INFO L378 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 55 treesize of output 19 [2025-02-07 20:03:50,911 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2025-02-07 20:03:50,911 INFO L378 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 192 treesize of output 153 [2025-02-07 20:03:50,940 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2025-02-07 20:03:50,940 INFO L378 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 148 treesize of output 142 [2025-02-07 20:03:50,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40 [2025-02-07 20:03:51,097 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-02-07 20:03:51,097 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 50 [2025-02-07 20:03:51,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2025-02-07 20:03:51,204 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:03:51,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:03:51,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:51,431 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2025-02-07 20:03:51,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:51,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1078 treesize of output 1102 [2025-02-07 20:03:51,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:51,485 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 514 treesize of output 482 [2025-02-07 20:03:51,545 INFO L378 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 6 treesize of output 4 [2025-02-07 20:03:51,553 INFO L378 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 6 treesize of output 4 [2025-02-07 20:03:53,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:53,259 INFO L378 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 82 treesize of output 86 [2025-02-07 20:03:53,312 INFO L378 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 21 treesize of output 3 [2025-02-07 20:03:53,333 INFO L378 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 21 treesize of output 3 [2025-02-07 20:03:53,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:53,371 INFO L378 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 128 treesize of output 132 [2025-02-07 20:03:53,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:53,519 INFO L378 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 82 treesize of output 86 [2025-02-07 20:03:53,587 INFO L378 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 21 treesize of output 3 [2025-02-07 20:03:53,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:53,601 INFO L378 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 127 treesize of output 131 [2025-02-07 20:03:53,706 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:53,706 INFO L378 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 74 treesize of output 73 [2025-02-07 20:03:53,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:53,724 INFO L378 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 127 treesize of output 131 [2025-02-07 20:03:53,822 INFO L378 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 21 treesize of output 3 [2025-02-07 20:03:53,840 INFO L378 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 21 treesize of output 3 [2025-02-07 20:03:53,857 INFO L378 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 21 treesize of output 3 [2025-02-07 20:03:53,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:53,874 INFO L378 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 75 treesize of output 79 [2025-02-07 20:03:53,920 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:53,921 INFO L378 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 48 treesize of output 47 [2025-02-07 20:03:53,961 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:53,961 INFO L378 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 48 treesize of output 47 [2025-02-07 20:03:53,983 INFO L378 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 21 treesize of output 3 [2025-02-07 20:03:55,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:55,920 INFO L378 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 756 treesize of output 740 [2025-02-07 20:03:55,926 INFO L378 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 42 treesize of output 24 [2025-02-07 20:03:56,002 INFO L378 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 10 treesize of output 8 [2025-02-07 20:03:56,021 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:56,021 INFO L378 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 294 treesize of output 291 [2025-02-07 20:03:56,062 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:56,063 INFO L378 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 350 treesize of output 331 [2025-02-07 20:03:56,119 INFO L378 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 42 treesize of output 24 [2025-02-07 20:03:56,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:56,138 INFO L378 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 280 treesize of output 266 [2025-02-07 20:03:56,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:56,167 INFO L378 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 313 treesize of output 299 [2025-02-07 20:03:56,228 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:56,229 INFO L378 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 359 treesize of output 340 [2025-02-07 20:03:56,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:56,275 INFO L378 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 280 treesize of output 266 [2025-02-07 20:03:56,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:56,306 INFO L378 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 313 treesize of output 299 [2025-02-07 20:03:56,365 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:56,365 INFO L378 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 359 treesize of output 340 [2025-02-07 20:03:56,414 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:56,415 INFO L378 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 782 treesize of output 761 [2025-02-07 20:03:56,423 INFO L378 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 3 [2025-02-07 20:03:56,486 INFO L378 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 647 treesize of output 611 [2025-02-07 20:03:56,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:56,499 INFO L378 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 40 treesize of output 44 [2025-02-07 20:03:56,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:56,551 INFO L378 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 756 treesize of output 740 [2025-02-07 20:03:56,556 INFO L378 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 21 treesize of output 3 [2025-02-07 20:03:56,705 INFO L378 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 10 treesize of output 8 [2025-02-07 20:03:56,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:56,729 INFO L378 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 341 treesize of output 325 [2025-02-07 20:03:56,890 INFO L378 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 160 treesize of output 142 [2025-02-07 20:03:56,911 INFO L378 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 160 treesize of output 142 [2025-02-07 20:03:56,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:56,947 INFO L378 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 924 treesize of output 854 [2025-02-07 20:03:57,112 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:57,113 INFO L378 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 187 treesize of output 168 [2025-02-07 20:03:57,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:57,125 INFO L378 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 135 treesize of output 137 [2025-02-07 20:03:57,192 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:57,192 INFO L378 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 359 treesize of output 340 [2025-02-07 20:03:57,225 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:57,225 INFO L378 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 268 treesize of output 249 [2025-02-07 20:03:57,246 INFO L378 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 647 treesize of output 611 [2025-02-07 20:03:57,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:57,299 INFO L378 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 457 treesize of output 541 [2025-02-07 20:03:58,580 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:58,581 INFO L378 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 294 treesize of output 291 [2025-02-07 20:03:58,623 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:58,624 INFO L378 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 348 treesize of output 329 [2025-02-07 20:03:58,669 INFO L378 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 160 treesize of output 142 [2025-02-07 20:03:58,687 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:58,690 INFO L378 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 315 treesize of output 294 [2025-02-07 20:03:58,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:58,740 INFO L378 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 756 treesize of output 740 [2025-02-07 20:03:58,746 INFO L378 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 21 treesize of output 3 [2025-02-07 20:03:58,853 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:58,853 INFO L378 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 289 treesize of output 268 [2025-02-07 20:03:58,889 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:58,889 INFO L378 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 268 treesize of output 265 [2025-02-07 20:03:58,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:58,920 INFO L378 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 328 treesize of output 314 [2025-02-07 20:03:59,021 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:59,021 INFO L378 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 257 treesize of output 256 [2025-02-07 20:03:59,065 INFO L378 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 160 treesize of output 142 [2025-02-07 20:03:59,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:59,090 INFO L378 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 226 treesize of output 228 [2025-02-07 20:03:59,193 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:59,193 INFO L378 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 278 treesize of output 259 [2025-02-07 20:03:59,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:59,224 INFO L378 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 246 treesize of output 232 [2025-02-07 20:03:59,261 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:59,261 INFO L378 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 257 treesize of output 256 [2025-02-07 20:03:59,285 INFO L378 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 241 treesize of output 223 [2025-02-07 20:03:59,301 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:59,302 INFO L378 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 338 treesize of output 337 [2025-02-07 20:03:59,342 INFO L378 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 160 treesize of output 142 [2025-02-07 20:03:59,356 INFO L378 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 241 treesize of output 223 [2025-02-07 20:03:59,373 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:59,374 INFO L378 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 338 treesize of output 337 [2025-02-07 20:03:59,419 INFO L378 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 42 treesize of output 24 [2025-02-07 20:03:59,426 INFO L378 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 108 treesize of output 104 [2025-02-07 20:03:59,443 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:59,444 INFO L378 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 253 treesize of output 234 [2025-02-07 20:03:59,468 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:59,468 INFO L378 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 257 treesize of output 256 [2025-02-07 20:03:59,498 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:59,498 INFO L378 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 211 treesize of output 210 [2025-02-07 20:03:59,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:59,518 INFO L378 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 178 treesize of output 182 [2025-02-07 20:03:59,554 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:59,555 INFO L378 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 299 treesize of output 280 [2025-02-07 20:03:59,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:59,586 INFO L378 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 220 treesize of output 206 [2025-02-07 20:03:59,619 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:59,619 INFO L378 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 268 treesize of output 265 [2025-02-07 20:03:59,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 42 treesize of output 24 [2025-02-07 20:03:59,646 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:59,646 INFO L378 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 268 treesize of output 265 [2025-02-07 20:03:59,662 INFO L378 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 160 treesize of output 142 [2025-02-07 20:03:59,668 INFO L378 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 10 treesize of output 8 [2025-02-07 20:03:59,682 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:59,682 INFO L378 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 294 treesize of output 291 [2025-02-07 20:03:59,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 42 treesize of output 24 [2025-02-07 20:03:59,723 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:59,723 INFO L378 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 294 treesize of output 291 [2025-02-07 20:03:59,753 INFO L378 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 160 treesize of output 142 [2025-02-07 20:03:59,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:59,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 61 treesize of output 65 [2025-02-07 20:03:59,800 INFO L378 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 42 treesize of output 24 [2025-02-07 20:03:59,810 INFO L378 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 134 treesize of output 130 [2025-02-07 20:03:59,826 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:59,827 INFO L378 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 52 treesize of output 51 [2025-02-07 20:03:59,841 INFO L378 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 42 treesize of output 24 [2025-02-07 20:03:59,844 INFO L378 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 42 treesize of output 24 [2025-02-07 20:03:59,860 INFO L378 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 42 treesize of output 24 [2025-02-07 20:03:59,867 INFO L378 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 108 treesize of output 104 [2025-02-07 20:03:59,877 INFO L378 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 108 treesize of output 104 [2025-02-07 20:03:59,925 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:59,925 INFO L378 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 294 treesize of output 291 [2025-02-07 20:03:59,971 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:03:59,971 INFO L378 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 653 treesize of output 614 [2025-02-07 20:04:00,054 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:00,054 INFO L378 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 401 treesize of output 364 [2025-02-07 20:04:00,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:04:00,096 INFO L378 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 355 treesize of output 323 [2025-02-07 20:04:00,147 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:00,147 INFO L378 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 310 treesize of output 273 [2025-02-07 20:04:00,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:04:00,170 INFO L378 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 777 treesize of output 743 [2025-02-07 20:04:00,175 INFO L378 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 42 treesize of output 24 [2025-02-07 20:04:00,226 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:00,227 INFO L378 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 675 treesize of output 638 [2025-02-07 20:04:00,231 INFO L378 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 42 treesize of output 24 [2025-02-07 20:04:00,245 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:04:00,268 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:00,268 INFO L378 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 716 treesize of output 679 [2025-02-07 20:04:00,274 INFO L378 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 42 treesize of output 24 [2025-02-07 20:04:00,315 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:00,315 INFO L378 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 257 treesize of output 256 [2025-02-07 20:04:00,345 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:00,345 INFO L378 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 211 treesize of output 210 [2025-02-07 20:04:00,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:04:00,370 INFO L378 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 178 treesize of output 182 [2025-02-07 20:04:00,422 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:00,422 INFO L378 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 299 treesize of output 280 [2025-02-07 20:04:00,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:04:00,455 INFO L378 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 220 treesize of output 206 [2025-02-07 20:04:00,494 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:00,494 INFO L378 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 380 treesize of output 361 [2025-02-07 20:04:00,531 INFO L378 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 283 treesize of output 247 [2025-02-07 20:04:00,550 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:00,550 INFO L378 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 257 treesize of output 256 [2025-02-07 20:04:00,580 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:00,580 INFO L378 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 211 treesize of output 210 [2025-02-07 20:04:00,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:04:00,600 INFO L378 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 178 treesize of output 182 [2025-02-07 20:04:00,638 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:00,638 INFO L378 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 253 treesize of output 234 [2025-02-07 20:04:00,668 INFO L378 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 202 treesize of output 166 [2025-02-07 20:04:00,684 INFO L378 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 202 treesize of output 166 [2025-02-07 20:04:00,696 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:00,696 INFO L378 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 211 treesize of output 192 [2025-02-07 20:04:00,716 INFO L378 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 160 treesize of output 142 [2025-02-07 20:04:00,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 42 treesize of output 24 [2025-02-07 20:04:00,730 INFO L378 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 160 treesize of output 142 [2025-02-07 20:04:00,734 INFO L378 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 42 treesize of output 24 [2025-02-07 20:04:00,752 INFO L378 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 160 treesize of output 142 [2025-02-07 20:04:00,766 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:00,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 52 treesize of output 51 [2025-02-07 20:04:00,793 INFO L378 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 502 treesize of output 486 [2025-02-07 20:04:00,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:04:00,813 INFO L378 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 188 treesize of output 190 [2025-02-07 20:04:00,877 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:00,877 INFO L378 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 782 treesize of output 761 [2025-02-07 20:04:00,926 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:00,927 INFO L378 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 504 treesize of output 485 [2025-02-07 20:04:00,995 INFO L378 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 160 treesize of output 142 [2025-02-07 20:04:01,012 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:01,012 INFO L378 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 338 treesize of output 337 [2025-02-07 20:04:01,060 INFO L378 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 97 treesize of output 95 [2025-02-07 20:04:01,074 INFO L378 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 241 treesize of output 223 [2025-02-07 20:04:01,098 INFO L378 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 21 treesize of output 3 [2025-02-07 20:04:01,102 INFO L378 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 21 treesize of output 3 [2025-02-07 20:04:01,105 INFO L378 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 134 treesize of output 130 [2025-02-07 20:04:01,121 INFO L378 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 21 treesize of output 3 [2025-02-07 20:04:01,125 INFO L378 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 21 treesize of output 3 [2025-02-07 20:04:01,127 INFO L378 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 108 treesize of output 104 [2025-02-07 20:04:01,145 INFO L349 Elim1Store]: treesize reduction 65, result has 27.0 percent of original size [2025-02-07 20:04:01,145 INFO L378 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 95 treesize of output 80 [2025-02-07 20:04:01,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:04:01,166 INFO L378 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 98 treesize of output 148 [2025-02-07 20:04:01,275 INFO L378 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 21 treesize of output 3 [2025-02-07 20:04:01,281 INFO L378 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 21 treesize of output 3 [2025-02-07 20:04:01,326 INFO L378 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 134 treesize of output 130 [2025-02-07 20:04:01,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:04:01,368 INFO L378 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 365 treesize of output 365 [2025-02-07 20:04:01,570 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:01,570 INFO L378 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 268 treesize of output 265 [2025-02-07 20:04:01,594 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:01,595 INFO L378 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 292 treesize of output 273 [2025-02-07 20:04:01,633 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:01,634 INFO L378 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 315 treesize of output 294 [2025-02-07 20:04:01,670 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:01,670 INFO L378 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 371 treesize of output 334 [2025-02-07 20:04:01,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:04:01,718 INFO L378 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 530 treesize of output 522 [2025-02-07 20:04:01,727 INFO L378 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 42 treesize of output 24 [2025-02-07 20:04:01,833 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:01,833 INFO L378 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 782 treesize of output 761 [2025-02-07 20:04:01,887 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:01,887 INFO L378 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 483 treesize of output 464 [2025-02-07 20:04:01,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:04:01,946 INFO L378 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 429 treesize of output 421 [2025-02-07 20:04:02,043 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:02,044 INFO L378 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 289 treesize of output 268 [2025-02-07 20:04:02,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 42 treesize of output 24 [2025-02-07 20:04:02,078 INFO L378 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 647 treesize of output 611 [2025-02-07 20:04:02,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:04:02,090 INFO L378 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 61 treesize of output 65 [2025-02-07 20:04:02,135 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:02,136 INFO L378 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 782 treesize of output 761 [2025-02-07 20:04:02,142 INFO L378 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 42 treesize of output 24 [2025-02-07 20:04:02,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:04:02,203 INFO L378 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 107 treesize of output 111 [2025-02-07 20:04:02,209 INFO L378 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 1157 treesize of output 1121 [2025-02-07 20:04:02,258 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:04:02,267 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:02,268 INFO L378 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 340 treesize of output 331 [2025-02-07 20:04:02,289 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:02,289 INFO L378 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 824 treesize of output 785 [2025-02-07 20:04:02,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:04:02,349 INFO L378 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 708 treesize of output 676 [2025-02-07 20:04:02,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:04:02,400 INFO L378 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 798 treesize of output 764 [2025-02-07 20:04:02,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:04:02,497 INFO L378 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 248 treesize of output 246 [2025-02-07 20:04:02,601 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:02,602 INFO L378 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 824 treesize of output 785 [2025-02-07 20:04:02,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:04:02,662 INFO L378 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 708 treesize of output 676 [2025-02-07 20:04:02,710 INFO L378 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 558 treesize of output 542 [2025-02-07 20:04:02,727 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:02,728 INFO L378 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 268 treesize of output 265 [2025-02-07 20:04:02,763 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:02,764 INFO L378 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 338 treesize of output 319 [2025-02-07 20:04:02,815 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:02,815 INFO L378 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 294 treesize of output 291 [2025-02-07 20:04:02,856 INFO L378 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 160 treesize of output 142 [2025-02-07 20:04:02,879 INFO L378 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 160 treesize of output 142 [2025-02-07 20:04:02,898 INFO L378 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 160 treesize of output 142 [2025-02-07 20:04:02,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:04:02,916 INFO L378 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 1075 treesize of output 987 [2025-02-07 20:04:03,066 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:03,068 INFO L378 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 268 treesize of output 265 [2025-02-07 20:04:03,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 42 treesize of output 24 [2025-02-07 20:04:03,100 INFO L378 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 283 treesize of output 247 [2025-02-07 20:04:03,123 INFO L378 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 283 treesize of output 247 [2025-02-07 20:04:03,141 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:03,141 INFO L378 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 292 treesize of output 273 [2025-02-07 20:04:03,164 INFO L378 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 647 treesize of output 611 [2025-02-07 20:04:03,176 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-02-07 20:04:03,177 INFO L378 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 52 treesize of output 51 [2025-02-07 20:04:03,193 INFO L378 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 647 treesize of output 611 [2025-02-07 20:04:03,198 INFO L378 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 42 treesize of output 24 [2025-02-07 20:04:03,222 INFO L378 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 647 treesize of output 611 [2025-02-07 20:04:03,227 INFO L378 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 42 treesize of output 24 [2025-02-07 20:04:03,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:04:03,255 INFO L378 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 299 treesize of output 295 [2025-02-07 20:04:03,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:04:03,392 INFO L378 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 310 treesize of output 296 [2025-02-07 20:04:03,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:04:03,472 INFO L378 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 523 treesize of output 487 [2025-02-07 20:04:03,891 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:03,970 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,007 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,044 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,110 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,144 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,165 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,214 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,286 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,291 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,328 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,331 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,503 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,507 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,511 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,646 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,660 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,663 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,676 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,690 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,781 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,787 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,838 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:04,988 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:05,077 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:05,196 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:05,205 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:05,239 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:05,330 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:05,336 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:05,345 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:05,877 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:05,897 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:05,901 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:06,768 INFO L378 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 56 treesize of output 40 [2025-02-07 20:04:08,898 INFO L378 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 57 treesize of output 41 [2025-02-07 20:04:08,900 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:08,902 INFO L378 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 15 treesize of output 7 [2025-02-07 20:04:08,944 INFO L378 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 56 treesize of output 40 [2025-02-07 20:04:09,476 INFO L378 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 57 treesize of output 41 [2025-02-07 20:04:09,480 INFO L378 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 8 treesize of output 4 [2025-02-07 20:04:09,673 INFO L378 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 49 treesize of output 37 [2025-02-07 20:04:14,265 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse70 (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse5)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse11 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse258 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse457 (select v_arrayElimArr_5 .cse5))) (let ((.cse458 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse457 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse457 .cse458) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse458) (not (= (select |c_#valid| .cse457) 0))))))) (.cse244 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse455 (select v_arrayElimArr_5 .cse5))) (let ((.cse456 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse455 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse455 .cse456) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse456) (not (= (select |c_#valid| .cse455) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse455 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (.cse379 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse453 (select v_arrayElimArr_5 .cse5))) (let ((.cse454 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse453 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse453 .cse454) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse454) (= .cse453 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse453) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse453 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)))))))))) (.cse68 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse450 (select v_arrayElimArr_5 .cse5))) (let ((.cse451 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse450 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse450 .cse451) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse451) (= .cse450 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse450) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse452 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse450 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse452 .cse5) (= .cse452 |c_ULTIMATE.start_main_~p~0#1.offset|))))))))))) (.cse21 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse449 (select v_arrayElimArr_5 .cse5))) (or (= .cse449 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse449) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse449 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (not (= .cse449 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse449 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))) (.cse55 (= |c_ULTIMATE.start_main_~p~0#1.offset| 0)) (.cse67 (not (= .cse5 0))) (.cse354 (not (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse1 (not .cse70)) (.cse359 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse446 (select v_arrayElimArr_5 .cse5))) (let ((.cse447 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse446 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse448 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse446 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse446 .cse447) (not (= (select |c_#valid| .cse446) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse448 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse447)) (= .cse448 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (.cse390 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse444 (select v_arrayElimArr_5 .cse5))) (let ((.cse445 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse444 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse444 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse444) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse445 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse444 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (= .cse445 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (.cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (let ((.cse65 (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse441 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse441) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse442 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse441 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse442 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse442 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (not (= .cse441 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse441 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse443 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse443) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse443 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))))) (not (= .cse443 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse443 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))))) (.cse10 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse439 (select v_arrayElimArr_5 .cse5))) (let ((.cse440 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse439 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select |c_#valid| .cse439) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse439 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse440)) (not (= .cse439 .cse440))))))) (.cse66 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse437 (select v_arrayElimArr_5 .cse5))) (let ((.cse438 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse437 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse437 .cse438) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse438) (= .cse437 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse437) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse437 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0))))))) (.cse230 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse434 (select v_arrayElimArr_5 .cse5))) (let ((.cse435 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse434 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse434 .cse435) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse435) (not (= (select |c_#valid| .cse434) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse436 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse434 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse436 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse436 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (= .cse434 |c_ULTIMATE.start_main_~a~0#1.base|)))))) (.cse275 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse433 (select v_arrayElimArr_5 .cse5))) (or (= .cse433 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse433) 0)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse433 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse433 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= .cse433 |c_ULTIMATE.start_main_~a~0#1.base|))))) (.cse276 (or .cse390 .cse6)) (.cse64 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse430 (select v_arrayElimArr_5 .cse5))) (let ((.cse431 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse430 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse432 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse430 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse430 .cse431) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse431) (not (= (select |c_#valid| .cse430) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse432 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse432 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (.cse237 (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse425 (select v_arrayElimArr_5 .cse5))) (let ((.cse426 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse425 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse425 .cse426) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse426) (not (= (select |c_#valid| .cse425) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse425 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse427 (select v_arrayElimArr_5 .cse5))) (let ((.cse428 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse427 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse427 .cse428) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse428) (not (= (select |c_#valid| .cse427) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse429 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse427 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse429 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse429 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))))) (.cse283 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse423 (select v_arrayElimArr_5 .cse5))) (or (= .cse423 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse423 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select |c_#valid| .cse423) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse424 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse423 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse424 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse424 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (not (= .cse423 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse290 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse422 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse422) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse422 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))))) (not (= .cse422 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse422 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (not (= .cse422 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse257 (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse420 (select v_arrayElimArr_5 .cse5))) (or (= .cse420 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse420) 0)) (forall ((v_ArrVal_730 (Array Int Int))) (not (= .cse420 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse420 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse421 (select v_arrayElimArr_5 .cse5))) (or (= .cse421 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse421) 0)) (forall ((v_ArrVal_730 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse421 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))))) (.cse335 (or .cse359 .cse6)) (.cse2 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse419 (select v_arrayElimArr_5 .cse5))) (or (= .cse419 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse419 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select |c_#valid| .cse419) 0)) (not (= .cse419 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse259 (and (or .cse354 .cse6) (or .cse1 .cse6))) (.cse56 (or .cse21 (and (not .cse55) .cse6 .cse67))) (.cse57 (or .cse354 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse418 (select v_arrayElimArr_5 .cse5))) (or (= .cse418 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse418) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse418 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (.cse347 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse416 (select v_arrayElimArr_5 .cse5))) (or (= .cse416 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse416) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse417 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse416 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse417 .cse5) (= .cse417 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (not (= .cse416 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse416 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))) (.cse12 (or .cse354 (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse415 (select v_arrayElimArr_5 .cse5))) (or (= .cse415 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse415) 0))))))) (.cse329 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse414 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse414) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse414 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse414 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (not (= .cse414 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse58 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse412 (select v_arrayElimArr_5 .cse5))) (let ((.cse413 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse412 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse412 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse412) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse413 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= .cse412 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse412 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (= .cse413 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (.cse336 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse410 (select v_arrayElimArr_5 .cse5))) (let ((.cse411 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse410 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse410 .cse411) (not (= (select |c_#valid| .cse410) 0)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse411)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse410 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= .cse410 |c_ULTIMATE.start_main_~a~0#1.base|)))))) (.cse277 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse408 (select v_arrayElimArr_5 .cse5))) (let ((.cse409 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse408 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse408 .cse409) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse409) (= .cse408 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse408) 0))))))) (.cse273 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse407 (select v_arrayElimArr_5 .cse5))) (or (= .cse407 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse407 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select |c_#valid| .cse407) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse407 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse407 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse323 (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse403 (select v_arrayElimArr_5 .cse5))) (let ((.cse402 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse403 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse402) (not (= (select |c_#valid| .cse403) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse404 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse403 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse404 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse404 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (not (= .cse403 .cse402)))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse406 (select v_arrayElimArr_5 .cse5))) (let ((.cse405 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse406 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse405) (not (= (select |c_#valid| .cse406) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse406 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))))) (not (= .cse406 .cse405)))))))) (.cse78 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse400 (select v_arrayElimArr_5 .cse5))) (let ((.cse401 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse400 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse400 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse400 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select |c_#valid| .cse400) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse401 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse401 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (.cse13 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse398 (select v_arrayElimArr_5 .cse5))) (or (= .cse398 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse398) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse399 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse398 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse399 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse399 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (not (= .cse398 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse398 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))) (.cse14 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse397 (select v_arrayElimArr_5 .cse5))) (or (= .cse397 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse397) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse397 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))))) (not (= .cse397 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse397 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))) (.cse211 (or (and .cse379 .cse68) .cse1)) (.cse69 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse394 (select v_arrayElimArr_5 .cse5))) (let ((.cse395 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse394 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse394 .cse395) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse395) (= .cse394 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse394) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse396 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse394 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse396 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse396 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))))) (.cse7 (or .cse354 .cse6 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse393 (select v_arrayElimArr_5 .cse5))) (or (= .cse393 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse393 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select |c_#valid| .cse393) 0))))))) (.cse278 (or .cse244 .cse6)) (.cse279 (or .cse258 .cse1 .cse6)) (.cse280 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse391 (select v_arrayElimArr_5 .cse5))) (let ((.cse392 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse391 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select |c_#valid| .cse391) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse392 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse391 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (= .cse392 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (.cse0 (not .cse11))) (and (or .cse0 (and (or (and (or .cse1 .cse2) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_5 .cse5))) (or (= .cse3 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse3 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select |c_#valid| .cse3) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse3 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= .cse3 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse6) .cse7)) (or (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_5 .cse5))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse8 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select |c_#valid| .cse8) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_ArrVal_729 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse8 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_6 .cse5) 0)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse9)) (not (= .cse8 .cse9)))))) .cse10) .cse11) (or .cse0 (and .cse12 .cse13 .cse14)) (or (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1483 (Array Int Int))) (let ((.cse15 (select v_arrayElimArr_5 .cse5))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse15 v_prenex_1483) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select |c_#valid| .cse15) 0)) (= .cse16 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse16 .cse15) (= .cse15 |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse17 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse17 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_prenex_1484 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse17 v_prenex_1484) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse18 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse18 .cse17)))) (= .cse17 |c_ULTIMATE.start_main_~a~0#1.base|)))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_prenex_1483 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse19 (select v_arrayElimArr_5 .cse5))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse19 v_prenex_1483) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select |c_#valid| .cse19) 0)) (= .cse20 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse20 .cse19) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse19 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) .cse6)) .cse11) (or .cse21 .cse6) (or (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse22 (select v_arrayElimArr_5 .cse5))) (or (= .cse22 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse22) 0)) (forall ((v_ArrVal_730 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse22 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse22 .cse23) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse23) (= .cse23 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= .cse22 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse24 (select v_arrayElimArr_5 .cse5))) (or (= .cse24 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse24) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse24 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_730 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse24 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse24 .cse25) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse25))))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse26 (select v_arrayElimArr_5 .cse5))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse26 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse26 .cse27) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse27) (not (= (select |c_#valid| .cse26) 0)) (not (= .cse26 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse26 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) .cse6)) .cse11) (or (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse29 (select v_arrayElimArr_5 .cse5))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse29 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse28 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select |c_#valid| .cse29) 0)) (forall ((v_prenex_1575 (Array Int Int))) (= .cse29 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse29 v_prenex_1575) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (= .cse29 |c_ULTIMATE.start_main_~a~0#1.base|)))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_prenex_1574 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse30 (select v_arrayElimArr_5 .cse5))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse30 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse30 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse30 v_prenex_1574) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select |c_#valid| .cse30) 0)) (not (= .cse30 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse31 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|))))) .cse6) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_prenex_1569 (Array Int Int))) (let ((.cse32 (select v_arrayElimArr_5 .cse5))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse32 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select |c_#valid| .cse32) 0)) (not (= .cse32 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse32 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse32 v_prenex_1569) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (= .cse33 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|))))) .cse6) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse34 (select v_arrayElimArr_5 .cse5))) (or (forall ((v_ArrVal_730 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse34 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse34 .cse35) (= .cse35 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= .cse34 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse34) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse34 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= .cse34 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse36 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse36) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse36 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_prenex_1576 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse36 v_prenex_1576) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse37 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse36 .cse37)))) (= .cse36 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse39 (select v_arrayElimArr_5 .cse5))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse39 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse38 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= .cse39 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse39) 0)) (forall ((v_prenex_1570 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse39 v_prenex_1570) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse39)) (= .cse39 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse11) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_arrayElimCell_436 Int)) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) v_arrayElimCell_436 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select |c_#valid| v_arrayElimCell_436) 0)) (= .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse40)))) .cse0 .cse6) (or (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_prenex_1247 (Array Int Int))) (let ((.cse41 (select v_arrayElimArr_5 .cse5))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse41 v_prenex_1247) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse41 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse41) 0)) (= .cse42 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse41 .cse42) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse41 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse41 |c_ULTIMATE.start_main_~a~0#1.base|))))) (not (= (select v_arrayElimArr_6 .cse5) 0)))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse43 (select v_arrayElimArr_5 .cse5))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse43 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse45 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse43 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse43 .cse44) (not (= (select |c_#valid| .cse43) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse44 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse45 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|))))) .cse6) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_prenex_1247 (Array Int Int))) (let ((.cse46 (select v_arrayElimArr_5 .cse5))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse46 v_prenex_1247) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse46 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse46) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse47 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse46 .cse47) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse46 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|))))) .cse6) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse48 (select v_arrayElimArr_5 .cse5))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse48 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse50 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse48 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse48 .cse49) (not (= (select |c_#valid| .cse48) 0)) (= .cse49 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse50 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse48 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse51 (select v_arrayElimArr_5 .cse5))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse51 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select |c_#valid| .cse51) 0)) (forall ((v_prenex_1246 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse51 v_prenex_1246) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse51)) (= .cse52 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse52 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse51 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse53 (select v_arrayElimArr_5 .cse5))) (or (forall ((v_ArrVal_730 (Array Int Int))) (let ((.cse54 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse53 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse53 .cse54) (= .cse54 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select |c_#valid| .cse53) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse53 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= .cse53 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse11) (or (and (or .cse21 .cse1 .cse55) .cse13 .cse56 .cse57) .cse0) (or .cse58 .cse6 .cse11) (or (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse59 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse59) 0)) (forall ((v_ArrVal_730 (Array Int Int))) (let ((.cse60 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse59 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse59 .cse60) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse60) (= .cse60 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse59 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= .cse59 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse62 (select v_arrayElimArr_5 .cse5))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse61 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse62 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse61 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse61 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select |c_#valid| .cse62) 0)) (= .cse62 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_730 (Array Int Int))) (let ((.cse63 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse62 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse62 .cse63) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse63))))))) (or .cse64 .cse6)) .cse11) (or .cse65 .cse0 .cse6) (or (and (or .cse66 (and .cse6 .cse67)) (or .cse1 (and (or .cse66 .cse55) .cse68)) .cse69) .cse0) (or (and (or .cse65 .cse6) (or .cse70 .cse65 .cse6)) .cse0) (or .cse0 .cse6 .cse2) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse71 (select v_arrayElimArr_5 .cse5))) (let ((.cse72 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse71 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse71 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse71 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select |c_#valid| .cse71) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse72 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse72 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse71 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse11) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse73 (select v_arrayElimArr_5 .cse5))) (let ((.cse74 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse73 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse73 .cse74) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse74) (= .cse73 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse73) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse73 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse73 |c_ULTIMATE.start_main_~a~0#1.base|))))) (or .cse0 (and .cse10 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse75 (select v_arrayElimArr_5 .cse5))) (let ((.cse77 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse75 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select |c_#valid| .cse75) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse76 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse75 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse76 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse76 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse77)) (not (= .cse75 .cse77))))))) .cse6) (or .cse78 .cse0 .cse6) (or (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1277 (Array Int Int))) (let ((.cse79 (select v_arrayElimArr_5 .cse5))) (let ((.cse80 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse79 v_prenex_1277) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select |c_#valid| .cse79) 0)) (= .cse80 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_ArrVal_729 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse79 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_6 .cse5) 0)))) (= .cse80 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse79 |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1277 (Array Int Int))) (let ((.cse81 (select v_arrayElimArr_5 .cse5))) (let ((.cse82 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse81 v_prenex_1277) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select |c_#valid| .cse81) 0)) (= .cse82 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse81 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))))) (= .cse82 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse81 |c_ULTIMATE.start_main_~a~0#1.base|))))) (or (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse83 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse83) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse84 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (= (select (select (store .cse84 .cse83 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_prenex_1275 (Array Int Int))) (let ((.cse85 (select (select (store .cse84 .cse83 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse85) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse85))))))) (not (= .cse83 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse83 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse89 (select v_arrayElimArr_5 .cse5))) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_prenex_1275 (Array Int Int))) (let ((.cse88 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (let ((.cse86 (select (select (store .cse88 .cse89 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse86) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse87 (select (select (store .cse88 .cse89 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse87 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse87 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse87 .cse86)))))))))) (not (= (select |c_#valid| .cse89) 0)) (not (= .cse89 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse89 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse90 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse90) 0)) (not (= .cse90 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse90 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_1275 (Array Int Int))) (let ((.cse91 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse91 .cse90 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse92 (select (select (store .cse91 .cse90 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse92 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse92 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse93 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse93) 0)) (not (= .cse93 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse93 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_1275 (Array Int Int))) (let ((.cse94 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse94 .cse93 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store .cse94 .cse93 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse95 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse95) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse96 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (forall ((v_prenex_1276 (Array Int Int))) (not (= (select (select (store .cse96 .cse95 v_prenex_1276) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))) (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (= (select (select (store .cse96 .cse95 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_prenex_1275 (Array Int Int))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse96 .cse95 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (not (= .cse95 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse95 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse97 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse97) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse100 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (let ((.cse99 (select (select (store .cse100 .cse97 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (forall ((v_prenex_1275 (Array Int Int))) (let ((.cse98 (select (select (store .cse100 .cse97 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse98) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse98) (= .cse99 .cse98)))) (= .cse99 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (not (= .cse97 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse97 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse101 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse101) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse102 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (forall ((v_prenex_1276 (Array Int Int))) (not (= (select (select (store .cse102 .cse101 v_prenex_1276) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))) (forall ((v_prenex_1275 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse104 (select (select (store .cse102 .cse101 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse103 (select (select (store .cse102 .cse101 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse103) (= .cse104 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse104 .cse103)))) (not (= (select v_arrayElimArr_6 .cse5) 0))))) (not (= .cse101 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse101 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse105 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse105) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse107 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (forall ((v_prenex_1275 (Array Int Int))) (let ((.cse106 (select (select (store .cse107 .cse105 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse106 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse106)))) (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store .cse107 .cse105 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)))))) (not (= .cse105 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse105 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse6) (or .cse6 (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse108 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse108) 0)) (not (= .cse108 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse108 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_1276 (Array Int Int))) (let ((.cse109 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (forall ((v_ArrVal_729 (Array Int Int))) (= (select (select (store .cse109 .cse108 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)) (not (= (select (select (store .cse109 .cse108 v_prenex_1276) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_prenex_1275 (Array Int Int))) (= (select (select (store .cse109 .cse108 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse110 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse110) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse112 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (forall ((v_prenex_1275 (Array Int Int))) (let ((.cse111 (select (select (store .cse112 .cse110 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse111 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse111) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse111)))) (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse113 (select (select (store .cse112 .cse110 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse113 0) (= .cse113 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (not (= .cse110 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse110 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse116 (select v_arrayElimArr_5 .cse5))) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse115 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse114 (select (select (store .cse115 .cse116 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse114 0) (= .cse114 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse114 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_prenex_1275 (Array Int Int))) (let ((.cse117 (select (select (store .cse115 .cse116 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse117 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse117)))) (not (= (select v_arrayElimArr_6 .cse5) 0))))) (not (= (select |c_#valid| .cse116) 0)) (not (= .cse116 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse116 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse118 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse118) 0)) (not (= .cse118 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse118 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse119 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (forall ((v_prenex_1276 (Array Int Int))) (not (= (select (select (store .cse119 .cse118 v_prenex_1276) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))) (forall ((v_prenex_1275 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse120 (select (select (store .cse119 .cse118 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse121 (select (select (store .cse119 .cse118 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse120 0) (= .cse121 0) (= .cse120 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse120 .cse121)))) (not (= (select v_arrayElimArr_6 .cse5) 0)))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse122 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse122) 0)) (not (= .cse122 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse122 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_1276 (Array Int Int))) (let ((.cse125 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse123 (select (select (store .cse125 .cse122 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse123 0) (forall ((v_prenex_1275 (Array Int Int))) (let ((.cse124 (select (select (store .cse125 .cse122 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse124 0) (= .cse123 .cse124))))))) (not (= (select (select (store .cse125 .cse122 v_prenex_1276) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse126 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse126) 0)) (not (= .cse126 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse126 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse127 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (forall ((v_ArrVal_729 (Array Int Int))) (= (select (select (store .cse127 .cse126 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)) (forall ((v_prenex_1276 (Array Int Int))) (not (= (select (select (store .cse127 .cse126 v_prenex_1276) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))) (forall ((v_prenex_1275 (Array Int Int))) (let ((.cse128 (select (select (store .cse127 .cse126 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse128 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse128)))) (not (= (select v_arrayElimArr_6 .cse5) 0)))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse129 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse129) 0)) (not (= .cse129 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse129 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse132 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (let ((.cse130 (select (select (store .cse132 .cse129 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse130 0) (forall ((v_prenex_1275 (Array Int Int))) (let ((.cse131 (select (select (store .cse132 .cse129 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse131 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse131) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse131) (= .cse130 .cse131)))))))) (not (= (select v_arrayElimArr_6 .cse5) 0))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse133 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse133) 0)) (not (= .cse133 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse133 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_prenex_1275 (Array Int Int))) (let ((.cse136 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (let ((.cse134 (select (select (store .cse136 .cse133 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse134 0) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse135 (select (select (store .cse136 .cse133 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse135 0) (= .cse135 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse135 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse135 .cse134))))))))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse137 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse137) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse138 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (forall ((v_prenex_1276 (Array Int Int))) (not (= (select (select (store .cse138 .cse137 v_prenex_1276) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))) (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_prenex_1275 (Array Int Int))) (= (select (select (store .cse138 .cse137 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse139 (select (select (store .cse138 .cse137 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse139 0) (= .cse139 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (not (= .cse137 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse137 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse140 (select v_arrayElimArr_5 .cse5))) (let ((.cse141 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse140 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse140 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select |c_#valid| .cse140) 0)) (= .cse141 0) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse141 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse141 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse140 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse6) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse142 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse142) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_1275 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse143 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (= (select (select (store .cse143 .cse142 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store .cse143 .cse142 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_prenex_1277 (Array Int Int))) (let ((.cse144 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse142 v_prenex_1277) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse144 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse144 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= .cse142 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse145 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse145) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse146 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse145 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse146 0) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse146 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse146 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_730 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse145 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (= .cse145 |c_ULTIMATE.start_main_~a~0#1.base|)))) (or .cse6 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_prenex_1275 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse148 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6)) (.cse147 (select v_arrayElimArr_5 .cse5))) (let ((.cse149 (select (select (store .cse148 .cse147 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse147 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select |c_#valid| .cse147) 0)) (= (select (select (store .cse148 .cse147 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse149 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse149 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse147 |c_ULTIMATE.start_main_~a~0#1.base|)))))) (or (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse150 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse150) 0)) (not (= .cse150 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse150 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_prenex_1275 (Array Int Int))) (let ((.cse153 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (let ((.cse151 (select (select (store .cse153 .cse150 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse151 0) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse152 (select (select (store .cse153 .cse150 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse152 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse152 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse152 .cse151))))))))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse156 (select v_arrayElimArr_5 .cse5))) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse155 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (forall ((v_prenex_1275 (Array Int Int))) (let ((.cse154 (select (select (store .cse155 .cse156 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse154 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse154) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse154)))) (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (= (select (select (store .cse155 .cse156 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (= (select |c_#valid| .cse156) 0)) (not (= .cse156 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse156 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse157 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse157) 0)) (not (= .cse157 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse157 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse159 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (forall ((v_prenex_1275 (Array Int Int))) (let ((.cse158 (select (select (store .cse159 .cse157 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse158 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse158)))) (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse160 (select (select (store .cse159 .cse157 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse160 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse160 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse161 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse161) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse162 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (forall ((v_prenex_1276 (Array Int Int))) (not (= (select (select (store .cse162 .cse161 v_prenex_1276) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))) (forall ((v_prenex_1275 (Array Int Int))) (let ((.cse163 (select (select (store .cse162 .cse161 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse163 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse163)))) (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (= (select (select (store .cse162 .cse161 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (= .cse161 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse161 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse164 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse164) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse167 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (let ((.cse166 (select (select (store .cse167 .cse164 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (forall ((v_prenex_1275 (Array Int Int))) (let ((.cse165 (select (select (store .cse167 .cse164 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse165 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse165) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse165) (= .cse166 .cse165)))) (= .cse166 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (= (select v_arrayElimArr_6 .cse5) 0)))) (not (= .cse164 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse164 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse168 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse168) 0)) (not (= .cse168 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse168 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse169 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_prenex_1275 (Array Int Int))) (= (select (select (store .cse169 .cse168 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store .cse169 .cse168 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse170 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse170) 0)) (not (= .cse170 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse170 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_prenex_1275 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse172 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (let ((.cse171 (select (select (store .cse172 .cse170 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse171 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse171) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse171) (= (select (select (store .cse172 .cse170 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse171))))) (not (= (select v_arrayElimArr_6 .cse5) 0))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse173 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse173) 0)) (not (= .cse173 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse173 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse174 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (forall ((v_prenex_1276 (Array Int Int))) (not (= (select (select (store .cse174 .cse173 v_prenex_1276) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))) (forall ((v_prenex_1275 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse176 (select (select (store .cse174 .cse173 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse175 (select (select (store .cse174 .cse173 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse175 0) (= .cse176 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse176 .cse175)))) (not (= (select v_arrayElimArr_6 .cse5) 0))))))))) .cse6) (or (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse177 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse177) 0)) (not (= .cse177 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse177 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse179 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse178 (select (select (store .cse179 .cse177 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse178 0) (= .cse178 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse178 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_prenex_1275 (Array Int Int))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse179 .cse177 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse180 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse180) 0)) (not (= .cse180 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse180 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse183 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (let ((.cse182 (select (select (store .cse183 .cse180 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (forall ((v_prenex_1275 (Array Int Int))) (let ((.cse181 (select (select (store .cse183 .cse180 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse181) (= .cse182 .cse181)))) (= .cse182 0) (= .cse182 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse182 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (= (select v_arrayElimArr_6 .cse5) 0))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse184 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse184) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse187 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (let ((.cse185 (select (select (store .cse187 .cse184 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse185 0) (forall ((v_prenex_1275 (Array Int Int))) (let ((.cse186 (select (select (store .cse187 .cse184 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse186) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse186) (= .cse185 .cse186)))))))))) (not (= .cse184 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse184 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse188 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse188) 0)) (not (= .cse188 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse188 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse189 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (forall ((v_prenex_1276 (Array Int Int))) (not (= (select (select (store .cse189 .cse188 v_prenex_1276) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))) (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_prenex_1275 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse190 (select (select (store .cse189 .cse188 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse191 (select (select (store .cse189 .cse188 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse190 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse191) (= .cse190 .cse191)))))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse192 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse192) 0)) (not (= .cse192 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse192 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse194 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (let ((.cse193 (select (select (store .cse194 .cse192 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (forall ((v_prenex_1275 (Array Int Int))) (= .cse193 (select (select (store .cse194 .cse192 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (= .cse193 0) (= .cse193 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse193 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse195 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse195) 0)) (not (= .cse195 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse195 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse196 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (forall ((v_prenex_1276 (Array Int Int))) (not (= (select (select (store .cse196 .cse195 v_prenex_1276) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))) (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse197 (select (select (store .cse196 .cse195 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse197 0) (= .cse197 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_prenex_1275 (Array Int Int))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse196 .cse195 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1278 (Array Int Int))) (let ((.cse198 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse198) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse200 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse199 (select (select (store .cse200 .cse198 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse199 0) (= .cse199 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_prenex_1275 (Array Int Int))) (let ((.cse201 (select (select (store .cse200 .cse198 v_prenex_1275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse201) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse201))))))) (not (= .cse198 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse198 v_prenex_1278) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse6) (or (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse202 (select v_arrayElimArr_5 .cse5))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse202 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select |c_#valid| .cse202) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse203 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse202 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse203 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse203 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (= .cse202 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse204 (select v_arrayElimArr_5 .cse5))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse204 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select |c_#valid| .cse204) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse204 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))))) (= .cse204 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse6) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse205 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse205) 0)) (forall ((v_prenex_1277 (Array Int Int))) (let ((.cse206 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse205 v_prenex_1277) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse206 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse206 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse207 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse205 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse207 0) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse207 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= .cse205 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse11) (or .cse0 .cse6 (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse208 (select v_arrayElimArr_5 .cse5))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse208 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select |c_#valid| .cse208) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse209 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse208 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse209 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse209 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse210 (select v_arrayElimArr_5 .cse5))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse210 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select |c_#valid| .cse210) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse210 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)))))))))) (or .cse0 (and .cse211 (or .cse70 (and (or .cse66 .cse6) .cse69)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse212 (select v_arrayElimArr_5 .cse5))) (or (= .cse212 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse212) 0)) (not (= .cse212 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse212 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (= .cse212 |c_ULTIMATE.start_main_~a~0#1.base|)))) (or (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1272 (Array Int Int))) (let ((.cse214 (select v_arrayElimArr_5 .cse5))) (let ((.cse213 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse214 v_prenex_1272) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse213 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select |c_#valid| .cse214) 0)) (= .cse214 .cse213) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse214 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse213) (= .cse214 |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse216 (select v_arrayElimArr_5 .cse5))) (or (forall ((v_prenex_1268 (Array Int Int))) (let ((.cse215 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse216 v_prenex_1268) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse215 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse216 .cse215)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse217 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse216 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse217 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse217 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select |c_#valid| .cse216) 0)) (= .cse216 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1270 (Array Int Int))) (let ((.cse219 (select v_arrayElimArr_5 .cse5))) (let ((.cse218 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse219 v_prenex_1270) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse218 .cse219) (not (= (select |c_#valid| .cse219) 0)) (= .cse218 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse219 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= .cse219 |c_ULTIMATE.start_main_~a~0#1.base|))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_prenex_1270 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse221 (select v_arrayElimArr_5 .cse5))) (let ((.cse220 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse221 v_prenex_1270) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse222 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse221 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse220 .cse221) (not (= (select |c_#valid| .cse221) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse220 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse222 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse222 |c_ULTIMATE.start_main_~a~0#1.offset|))))) .cse6) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_prenex_1272 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse224 (select v_arrayElimArr_5 .cse5))) (let ((.cse225 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse224 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse223 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse224 v_prenex_1272) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse223 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select |c_#valid| .cse224) 0)) (= .cse224 .cse223) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse225 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse225 |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse223))))) .cse6) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse227 (select v_arrayElimArr_5 .cse5))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse226 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse227 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse226 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse226 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_730 (Array Int Int))) (= .cse227 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse227 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (not (= (select |c_#valid| .cse227) 0)) (= .cse227 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse11) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse228 (select v_arrayElimArr_5 .cse5))) (let ((.cse229 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse228 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse228 .cse229) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse229) (not (= (select |c_#valid| .cse228) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse228 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse228 |c_ULTIMATE.start_main_~a~0#1.base|))))) (not (= (select v_arrayElimArr_6 .cse5) 0)))) (or (and .cse230 (or .cse6 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse231 (select v_arrayElimArr_5 .cse5))) (let ((.cse232 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse231 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse231 .cse232) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse232) (not (= (select |c_#valid| .cse231) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse231 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse231 |c_ULTIMATE.start_main_~a~0#1.base|)))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse233 (select v_arrayElimArr_5 .cse5))) (let ((.cse234 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse233 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse233 .cse234) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse234) (not (= (select |c_#valid| .cse233) 0)) (= .cse234 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_ArrVal_729 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse233 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_6 .cse5) 0)))) (= .cse233 |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse235 (select v_arrayElimArr_5 .cse5))) (let ((.cse236 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse235 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse235 .cse236) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse236) (not (= (select |c_#valid| .cse235) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse235 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))))) (= .cse236 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse235 |c_ULTIMATE.start_main_~a~0#1.base|))))) (or .cse237 .cse6)) .cse11) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1485 (Array Int Int))) (let ((.cse238 (select v_arrayElimArr_5 .cse5))) (let ((.cse239 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse238 v_prenex_1485) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse238 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse238) 0)) (= .cse238 .cse239) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse239))))) .cse0 .cse6) (or .cse0 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse240 (select v_arrayElimArr_5 .cse5))) (let ((.cse241 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse240 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse240 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse240 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (= .cse240 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse240) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse241 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse241 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (or (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse242 (select v_arrayElimArr_5 .cse5))) (or (= .cse242 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse242) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse242 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse242 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (= .cse242 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select v_arrayElimArr_6 .cse5) 0)))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse243 (select v_arrayElimArr_5 .cse5))) (or (= .cse243 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse243) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse243 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse243 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) .cse6)) .cse11) (or .cse244 .cse0 .cse6) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse245 (select v_arrayElimArr_5 .cse5))) (let ((.cse246 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse245 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse247 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse245 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse245 .cse246) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse246) (= .cse245 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse245) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse247 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse247 |c_ULTIMATE.start_main_~a~0#1.offset|))))) .cse0) (or (and (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse248 (select v_arrayElimArr_5 .cse5))) (let ((.cse249 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse248 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse248 .cse249) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse249) (not (= (select |c_#valid| .cse248) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse248 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)))))) .cse6) .cse230) .cse11) (or (and (or .cse6 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_prenex_1407 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse250 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse250) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse250 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse250 v_prenex_1407) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= .cse250 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse251 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse251) 0)) (forall ((v_ArrVal_730 (Array Int Int))) (let ((.cse252 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse251 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse252) (= .cse252 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= .cse251 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse251 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse253 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse253) 0)) (forall ((v_ArrVal_730 (Array Int Int))) (let ((.cse254 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse253 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse254) (= .cse254 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse253 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)) (not (= .cse253 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (select v_arrayElimArr_6 .cse5) 0)))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse256 (select v_arrayElimArr_5 .cse5))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse255 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse256 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse255 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse255 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select |c_#valid| .cse256) 0)) (forall ((v_prenex_1407 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse256 v_prenex_1407) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (not (= .cse256 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse11) (or .cse257 .cse0) (or .cse258 .cse0 .cse259) (or (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse260 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse260) 0)) (not (= .cse260 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse260 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_ArrVal_730 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse260 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse261 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse261) 0)) (forall ((v_prenex_1410 (Array Int Int))) (let ((.cse262 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse261 v_prenex_1410) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse262 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse262 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= .cse261 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse261 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (or (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse263 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse263 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse263 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 0)))) .cse11) (or (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse265 (select v_arrayElimArr_5 .cse5))) (let ((.cse264 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse265 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse264) (not (= (select |c_#valid| .cse265) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse265 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)) (not (= .cse265 .cse264)) (= .cse265 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse267 (select v_arrayElimArr_5 .cse5))) (let ((.cse266 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse267 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse266) (not (= (select |c_#valid| .cse267) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse267 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (not (= .cse267 .cse266)))))) .cse6) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse269 (select v_arrayElimArr_5 .cse5))) (let ((.cse268 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse269 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse268) (not (= (select |c_#valid| .cse269) 0)) (not (= .cse269 .cse268)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse269 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= .cse269 |c_ULTIMATE.start_main_~a~0#1.base|))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse271 (select v_arrayElimArr_5 .cse5))) (let ((.cse270 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse271 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse272 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse271 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse270) (not (= (select |c_#valid| .cse271) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse272 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= .cse271 .cse270)) (= .cse272 |c_ULTIMATE.start_main_~a~0#1.offset|))))) .cse6)) .cse11) (or (and .cse6 .cse11) .cse273) (or (and (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse274 (select v_arrayElimArr_5 .cse5))) (or (= .cse274 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse274 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse5)) (not (= (select |c_#valid| .cse274) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse274 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) .cse6) .cse275 .cse276) .cse11) (or .cse0 (and .cse7 (or .cse277 .cse6) .cse278 .cse279)) (or .cse0 .cse280 .cse6) (or (and .cse275 .cse276 (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse281 (select v_arrayElimArr_5 .cse5))) (or (= .cse281 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse281) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse281 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse281 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) .cse6 .cse55)) .cse11) (or (and (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse282 (select v_arrayElimArr_5 .cse5))) (or (= .cse282 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse282 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select |c_#valid| .cse282) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse282 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (not (= .cse282 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse6) .cse283) .cse11) (or .cse64 .cse0 .cse6) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse284 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse284) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse284 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse284 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (not (= .cse284 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse11) (or (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse285 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse285) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse285 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)) (not (= .cse285 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse285 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (= .cse285 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select v_arrayElimArr_6 .cse5) 0)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse286 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse286) 0)) (not (= .cse286 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse286 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse286 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= .cse286 |c_ULTIMATE.start_main_~a~0#1.base|)))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse287 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse287) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse287 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (not (= .cse287 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse287 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) .cse6) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse288 (select v_arrayElimArr_5 .cse5))) (let ((.cse289 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse288 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select |c_#valid| .cse288) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse289 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= .cse288 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse288 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (= .cse289 |c_ULTIMATE.start_main_~a~0#1.offset|))))) .cse6)) .cse11) (or .cse0 (and .cse290 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse291 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse291) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse292 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse291 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse292 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse292 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (not (= .cse291 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse291 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (not (= .cse291 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse6) (or .cse0 (let ((.cse294 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse299 (select v_arrayElimArr_5 .cse5))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse299 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (= .cse299 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse299) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse299 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0)))))))))) (and (or .cse70 (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse293 (select v_arrayElimArr_5 .cse5))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse293 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (= .cse293 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse293) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse293 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse5))) (not (= (select v_arrayElimArr_6 .cse5) 0))))))) .cse12 .cse294 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse295 (select v_arrayElimArr_5 .cse5))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse295 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (= .cse295 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse295) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse296 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse295 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse296 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse296 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))))) (or .cse1 (and .cse294 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse297 (select v_arrayElimArr_5 .cse5))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse297 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (= .cse297 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse297) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse298 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse297 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse298 .cse5) (= .cse298 |c_ULTIMATE.start_main_~p~0#1.offset|)))))))))))))) (or (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse300 (select v_arrayElimArr_5 .cse5))) (or (= .cse300 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse300) 0)) (forall ((v_ArrVal_730 (Array Int Int))) (not (= .cse300 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse300 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (= .cse300 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1458 (Array Int Int))) (let ((.cse301 (select v_arrayElimArr_5 .cse5))) (or (forall ((v_prenex_1459 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse301 v_prenex_1459) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse301 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse301) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse301 v_prenex_1458) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse301 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select v_arrayElimArr_6 .cse5) 0)))) (or (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1460 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse303 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6)) (.cse302 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse302) 0)) (forall ((v_prenex_1461 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse302 v_prenex_1461) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= .cse302 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store .cse303 .cse302 v_prenex_1460) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select (store .cse303 .cse302 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_6 .cse5) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1460 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse307 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6)) (.cse306 (select v_arrayElimArr_5 .cse5))) (let ((.cse304 (select (select (store .cse307 .cse306 v_prenex_1460) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse305 (select (select (store .cse307 .cse306 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse304 .cse305) (not (= (select |c_#valid| .cse306) 0)) (forall ((v_prenex_1461 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse306 v_prenex_1461) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse304 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse305 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1460 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse309 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6)) (.cse308 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse308) 0)) (forall ((v_ArrVal_730 (Array Int Int))) (not (= .cse308 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse308 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (not (= .cse308 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store .cse309 .cse308 v_prenex_1460) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select (store .cse309 .cse308 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse310 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse310) 0)) (forall ((v_prenex_1461 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse310 v_prenex_1461) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= .cse310 |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_1460 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse312 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (let ((.cse311 (select (select (store .cse312 .cse310 v_prenex_1460) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse311 (select (select (store .cse312 .cse310 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse311 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1460 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse316 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6)) (.cse315 (select v_arrayElimArr_5 .cse5))) (let ((.cse313 (select (select (store .cse316 .cse315 v_prenex_1460) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse314 (select (select (store .cse316 .cse315 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse313 .cse314) (not (= (select |c_#valid| .cse315) 0)) (forall ((v_ArrVal_730 (Array Int Int))) (not (= .cse315 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse315 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (= .cse313 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse314 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse317 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse317) 0)) (forall ((v_ArrVal_730 (Array Int Int))) (not (= .cse317 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse317 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (not (= .cse317 |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_1460 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse318 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6))) (let ((.cse319 (select (select (store .cse318 .cse317 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= (select (select (store .cse318 .cse317 v_prenex_1460) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse319) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse319 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) .cse6) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse320 (select v_arrayElimArr_5 .cse5))) (or (= .cse320 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse320) 0)) (forall ((v_ArrVal_730 (Array Int Int))) (let ((.cse321 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse320 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse321) (= .cse321 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= .cse320 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_1458 (Array Int Int))) (let ((.cse322 (select v_arrayElimArr_5 .cse5))) (or (= .cse322 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse322) 0)) (forall ((v_ArrVal_730 (Array Int Int))) (not (= .cse322 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse322 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse322 v_prenex_1458) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse322 |c_ULTIMATE.start_main_~a~0#1.base|))))))) .cse11) (or .cse237 .cse0 .cse6) (or .cse0 (and (or .cse6 .cse323) (or .cse70 .cse6 .cse323))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse324 (select v_arrayElimArr_5 .cse5))) (let ((.cse325 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse324 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse326 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse324 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse324 .cse325) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse325) (not (= (select |c_#valid| .cse324) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse326 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse326 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse324 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse11) (or .cse0 (and (or .cse1 .cse277) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse327 (select v_arrayElimArr_5 .cse5))) (let ((.cse328 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse327 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse327 .cse328) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse328) (= .cse327 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse327) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse327 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))) (or .cse258 .cse0 .cse6) (or (and .cse329 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse330 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse330) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_ArrVal_729 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse330 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_6 .cse5) 0)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse330 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (not (= .cse330 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse11) (or .cse0 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_429 Int) (v_ArrVal_729 (Array Int Int))) (let ((.cse331 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) v_arrayElimCell_429 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimCell_429) (not (= (select |c_#valid| v_arrayElimCell_429) 0)) (= .cse331 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse331 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (or .cse0 .cse6 (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse332 (select v_arrayElimArr_5 .cse5))) (or (= .cse332 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse332 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select |c_#valid| .cse332) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse332 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 0))))) (not (= .cse332 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse283)) (or (and (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse333 (select v_arrayElimArr_5 .cse5))) (let ((.cse334 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse333 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse333 .cse334) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse333 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse5)) (not (= (select |c_#valid| .cse333) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse334)))))) .cse6) .cse335 .cse336) .cse11) (or (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse337 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse337) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_ArrVal_729 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse337 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_6 .cse5) 0)))) (not (= .cse337 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse337 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (not (= .cse337 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse290) .cse11) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse338 (select v_arrayElimArr_5 .cse5))) (let ((.cse339 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse338 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse338 .cse339) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse339) (not (= (select |c_#valid| .cse338) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse338 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse338 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse11) (or .cse257 .cse0 .cse6) (or .cse0 (and (or .cse1 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse340 (select v_arrayElimArr_5 .cse5))) (or (= .cse340 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse340) 0)) (not (= .cse340 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse340 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse341 (select v_arrayElimArr_5 .cse5))) (or (= .cse341 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse341) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse341 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= .cse341 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse341 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) .cse14)) (or (and .cse335 .cse336) .cse11) (or .cse0 .cse2 .cse259) (or (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse343 (select v_arrayElimArr_5 .cse5))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse342 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse343 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse342 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse342 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= .cse343 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse343) 0)) (forall ((v_ArrVal_730 (Array Int Int))) (let ((.cse344 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse343 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse343 .cse344) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse344))))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse346 (select v_arrayElimArr_5 .cse5))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse345 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse346 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse345 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse345 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= .cse346 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse346) 0)) (forall ((v_prenex_1526 (Array Int Int))) (= .cse346 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse346 v_prenex_1526) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))) .cse0) (or (and .cse13 .cse56 .cse57 (or .cse1 (and .cse347 (or .cse21 .cse55)))) .cse0) (or (and (or .cse1 (and .cse347 .cse14)) .cse13 (or .cse70 (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse348 (select v_arrayElimArr_5 .cse5))) (or (= .cse348 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse348) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse348 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse5))) (not (= (select v_arrayElimArr_6 .cse5) 0)))) (not (= .cse348 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse348 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) .cse12 .cse14))) .cse0) (or (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse349 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse349) 0)) (forall ((v_prenex_1409 (Array Int Int))) (let ((.cse350 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse349 v_prenex_1409) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse350) (= .cse349 .cse350)))) (not (= .cse349 |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse351 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse351) 0)) (forall ((v_prenex_1408 (Array Int Int))) (= .cse351 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse351 v_prenex_1408) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (not (= .cse351 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse351 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse11) (or .cse0 .cse6 (and .cse329 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse352 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse352) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse353 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse352 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse353 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse353 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse352 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (not (= .cse352 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (or .cse0 .cse277 (and .cse354 .cse1)) (or (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse355 (select v_arrayElimArr_5 .cse5))) (let ((.cse356 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse355 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse355 .cse356) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse356) (not (= (select |c_#valid| .cse355) 0)) (= .cse356 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse355 |c_ULTIMATE.start_main_~a~0#1.base|))))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse357 (select v_arrayElimArr_5 .cse5))) (let ((.cse358 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse357 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse357 .cse358) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse358) (not (= (select |c_#valid| .cse357) 0)) (= .cse358 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse6)) .cse11) (or .cse0 .cse359) (or (and (or .cse58 .cse6) (or (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse360 (select v_arrayElimArr_5 .cse5))) (or (= .cse360 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse360) 0)) (not (= .cse360 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse360 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse361 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse360 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse361 .cse5) (= .cse361 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse361 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) .cse14) .cse6)) .cse0) (or (and .cse336 (or (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse362 (select v_arrayElimArr_5 .cse5))) (let ((.cse363 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse362 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse362 .cse363) (not (= (select |c_#valid| .cse362) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (forall ((v_ArrVal_729 (Array Int Int))) (let ((.cse364 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse362 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse364 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse364 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse363)))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse365 (select v_arrayElimArr_5 .cse5))) (let ((.cse366 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse365 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse365 .cse366) (not (= (select |c_#valid| .cse365) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse365 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse5))) (not (= (select v_arrayElimArr_6 .cse5) 0)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse366))))))) .cse6)) .cse11) (or .cse0 .cse277) (or .cse6 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse367 (select v_arrayElimArr_5 .cse5))) (or (= .cse367 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse367) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (not (= .cse367 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse367 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse367 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse368 (select v_arrayElimArr_5 .cse5))) (let ((.cse369 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse368 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse368 .cse369) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse369) (= .cse368 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse368) 0)) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse368 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) .cse0 .cse6) (or .cse273 .cse11) (or .cse0 .cse6 .cse323) (or (and (or .cse78 .cse6) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_prenex_1437 (Array Int Int))) (let ((.cse370 (select v_arrayElimArr_5 .cse5))) (let ((.cse371 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse370 v_prenex_1437) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse372 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse370 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse370 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse370) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse371) (= .cse370 .cse371) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse372 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse372 |c_ULTIMATE.start_main_~a~0#1.offset|))))) .cse6) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_prenex_1437 (Array Int Int))) (let ((.cse373 (select v_arrayElimArr_5 .cse5))) (let ((.cse374 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse373 v_prenex_1437) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse375 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse373 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select |c_#valid| .cse373) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse374) (= .cse373 .cse374) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse375 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse375 |c_ULTIMATE.start_main_~a~0#1.offset|))))) .cse6)) .cse0) (or (let ((.cse376 (and .cse13 .cse14))) (and (or .cse376 .cse6) (or .cse70 .cse376 .cse6))) .cse0) (or (and .cse211 (or .cse70 (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse377 (select v_arrayElimArr_5 .cse5))) (let ((.cse378 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse377 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse377 .cse378) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse378) (= .cse377 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse377) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_ArrVal_729 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse377 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse5))) (not (= (select v_arrayElimArr_6 .cse5) 0)))))))) .cse379 .cse69))) .cse0) (or (and .cse7 .cse278 .cse279) .cse0) (or (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse380 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse380) 0)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse380 v_ArrVal_730) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse380 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= .cse380 |c_ULTIMATE.start_main_~a~0#1.base|)))) (or .cse280 .cse6)) .cse11) (or (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse382 (select v_arrayElimArr_5 .cse5))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse381 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse382 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse381 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse381 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select |c_#valid| .cse382) 0)) (forall ((v_prenex_1544 (Array Int Int))) (let ((.cse383 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse382 v_prenex_1544) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse383 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse383 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= .cse382 |c_ULTIMATE.start_main_~a~0#1.base|)))) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 0)) .cse6) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_arrayElimCell_433 Int)) (let ((.cse384 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) v_arrayElimCell_433 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select |c_#valid| v_arrayElimCell_433) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse384) (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse384 |c_ULTIMATE.start_main_~a~0#1.offset|) (= v_arrayElimCell_433 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse385 (select v_arrayElimArr_5 .cse5))) (or (not (= (select |c_#valid| .cse385) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse385 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_prenex_1544 (Array Int Int))) (let ((.cse386 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse385 v_prenex_1544) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse386 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse386 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= .cse385 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse387 (select v_arrayElimArr_5 .cse5))) (or (forall ((v_prenex_1546 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse387 v_prenex_1546) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select |c_#valid| .cse387) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse387 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= .cse387 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse389 (select v_arrayElimArr_5 .cse5))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (let ((.cse388 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) .cse389 v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_6 .cse5) 0)) (= .cse388 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse388 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_prenex_1546 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse389 v_prenex_1546) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select |c_#valid| .cse389) 0)) (= .cse389 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse11) (or .cse0 .cse390)))))) is different from true [2025-02-07 20:04:16,802 INFO L378 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 37 treesize of output 25 [2025-02-07 20:04:17,434 INFO L378 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 37 treesize of output 25 [2025-02-07 20:04:21,845 INFO L378 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 18 treesize of output 10 [2025-02-07 20:04:22,986 INFO L378 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 18 treesize of output 10 [2025-02-07 20:04:24,340 INFO L378 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 18 treesize of output 10