/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/array-fpi/sina4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 21:10:04,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 21:10:04,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-21 21:10:04,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 21:10:04,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 21:10:04,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 21:10:04,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 21:10:04,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 21:10:04,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 21:10:04,121 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 21:10:04,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 21:10:04,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 21:10:04,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 21:10:04,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 21:10:04,124 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 21:10:04,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 21:10:04,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 21:10:04,125 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 21:10:04,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 21:10:04,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 21:10:04,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 21:10:04,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 21:10:04,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 21:10:04,126 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 21:10:04,127 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 21:10:04,127 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 21:10:04,127 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 21:10:04,127 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 21:10:04,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 21:10:04,128 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 21:10:04,129 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 21:10:04,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 21:10:04,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 21:10:04,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 21:10:04,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 21:10:04,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 21:10:04,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 21:10:04,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 21:10:04,130 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 21:10:04,130 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 21:10:04,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 21:10:04,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 21:10:04,131 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 21:10:04,131 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 21:10:04,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 21:10:04,132 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 21:10:04,132 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-21 21:10:04,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 21:10:04,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 21:10:04,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 21:10:04,387 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 21:10:04,388 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 21:10:04,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina4.c [2023-12-21 21:10:05,577 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 21:10:05,748 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 21:10:05,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina4.c [2023-12-21 21:10:05,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/043f40bfc/5beee3606c104470981d0469ca15f922/FLAG1026e2dd7 [2023-12-21 21:10:05,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/043f40bfc/5beee3606c104470981d0469ca15f922 [2023-12-21 21:10:05,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 21:10:05,772 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 21:10:05,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 21:10:05,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 21:10:05,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 21:10:05,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 09:10:05" (1/1) ... [2023-12-21 21:10:05,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aeee648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:10:05, skipping insertion in model container [2023-12-21 21:10:05,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 09:10:05" (1/1) ... [2023-12-21 21:10:05,800 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 21:10:05,926 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina4.c[588,601] [2023-12-21 21:10:05,943 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 21:10:05,956 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 21:10:05,982 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina4.c[588,601] [2023-12-21 21:10:05,991 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 21:10:06,011 INFO L206 MainTranslator]: Completed translation [2023-12-21 21:10:06,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:10:06 WrapperNode [2023-12-21 21:10:06,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 21:10:06,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 21:10:06,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 21:10:06,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 21:10:06,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:10:06" (1/1) ... [2023-12-21 21:10:06,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:10:06" (1/1) ... [2023-12-21 21:10:06,046 INFO L138 Inliner]: procedures = 19, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 105 [2023-12-21 21:10:06,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 21:10:06,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 21:10:06,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 21:10:06,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 21:10:06,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:10:06" (1/1) ... [2023-12-21 21:10:06,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:10:06" (1/1) ... [2023-12-21 21:10:06,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:10:06" (1/1) ... [2023-12-21 21:10:06,073 INFO L175 MemorySlicer]: Split 21 memory accesses to 5 slices as follows [2, 2, 8, 5, 4]. 38 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 0, 8, 0, 0]. The 5 writes are split as follows [0, 1, 0, 2, 2]. [2023-12-21 21:10:06,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:10:06" (1/1) ... [2023-12-21 21:10:06,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:10:06" (1/1) ... [2023-12-21 21:10:06,083 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:10:06" (1/1) ... [2023-12-21 21:10:06,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:10:06" (1/1) ... [2023-12-21 21:10:06,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:10:06" (1/1) ... [2023-12-21 21:10:06,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:10:06" (1/1) ... [2023-12-21 21:10:06,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 21:10:06,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 21:10:06,102 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 21:10:06,102 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 21:10:06,103 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:10:06" (1/1) ... [2023-12-21 21:10:06,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 21:10:06,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 21:10:06,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 21:10:06,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 21:10:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 21:10:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 21:10:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 21:10:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-21 21:10:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-21 21:10:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-21 21:10:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 21:10:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2023-12-21 21:10:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2023-12-21 21:10:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2023-12-21 21:10:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#3 [2023-12-21 21:10:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#4 [2023-12-21 21:10:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 21:10:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 21:10:06,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 21:10:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2023-12-21 21:10:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2023-12-21 21:10:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2023-12-21 21:10:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#3 [2023-12-21 21:10:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#4 [2023-12-21 21:10:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 21:10:06,249 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 21:10:06,250 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 21:10:06,472 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 21:10:06,505 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 21:10:06,505 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-21 21:10:06,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:10:06 BoogieIcfgContainer [2023-12-21 21:10:06,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 21:10:06,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 21:10:06,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 21:10:06,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 21:10:06,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 09:10:05" (1/3) ... [2023-12-21 21:10:06,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cc9fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 09:10:06, skipping insertion in model container [2023-12-21 21:10:06,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:10:06" (2/3) ... [2023-12-21 21:10:06,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cc9fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 09:10:06, skipping insertion in model container [2023-12-21 21:10:06,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:10:06" (3/3) ... [2023-12-21 21:10:06,512 INFO L112 eAbstractionObserver]: Analyzing ICFG sina4.c [2023-12-21 21:10:06,528 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 21:10:06,528 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 21:10:06,577 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 21:10:06,582 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@1f7a9bf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 21:10:06,582 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 21:10:06,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:10:06,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 21:10:06,591 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:10:06,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:10:06,593 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:10:06,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:10:06,597 INFO L85 PathProgramCache]: Analyzing trace with hash -270928915, now seen corresponding path program 1 times [2023-12-21 21:10:06,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:10:06,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313521559] [2023-12-21 21:10:06,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:10:06,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:10:06,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:10:06,616 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 21:10:06,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-21 21:10:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:10:06,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 21:10:06,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:10:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:10:06,768 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 21:10:06,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:10:06,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313521559] [2023-12-21 21:10:06,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313521559] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 21:10:06,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 21:10:06,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 21:10:06,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822775609] [2023-12-21 21:10:06,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 21:10:06,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 21:10:06,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:10:06,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 21:10:06,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 21:10:06,809 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:10:06,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:10:06,854 INFO L93 Difference]: Finished difference Result 37 states and 59 transitions. [2023-12-21 21:10:06,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 21:10:06,858 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-21 21:10:06,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:10:06,864 INFO L225 Difference]: With dead ends: 37 [2023-12-21 21:10:06,864 INFO L226 Difference]: Without dead ends: 17 [2023-12-21 21:10:06,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 21:10:06,870 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 21:10:06,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 21:10:06,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-21 21:10:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-21 21:10:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:10:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-21 21:10:06,903 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 15 [2023-12-21 21:10:06,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:10:06,903 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-21 21:10:06,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:10:06,904 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-21 21:10:06,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 21:10:06,904 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:10:06,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:10:06,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-21 21:10:07,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:10:07,105 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:10:07,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:10:07,106 INFO L85 PathProgramCache]: Analyzing trace with hash -863276055, now seen corresponding path program 1 times [2023-12-21 21:10:07,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:10:07,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410222192] [2023-12-21 21:10:07,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:10:07,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:10:07,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:10:07,108 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 21:10:07,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-21 21:10:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:10:07,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 21:10:07,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:10:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:10:07,345 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 21:10:07,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:10:07,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410222192] [2023-12-21 21:10:07,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410222192] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 21:10:07,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 21:10:07,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 21:10:07,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78566600] [2023-12-21 21:10:07,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 21:10:07,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 21:10:07,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:10:07,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 21:10:07,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 21:10:07,355 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:10:07,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:10:07,476 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2023-12-21 21:10:07,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 21:10:07,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-21 21:10:07,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:10:07,478 INFO L225 Difference]: With dead ends: 38 [2023-12-21 21:10:07,478 INFO L226 Difference]: Without dead ends: 26 [2023-12-21 21:10:07,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-21 21:10:07,479 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 21:10:07,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 18 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 21:10:07,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-21 21:10:07,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2023-12-21 21:10:07,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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) [2023-12-21 21:10:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-12-21 21:10:07,485 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2023-12-21 21:10:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:10:07,485 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-12-21 21:10:07,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:10:07,485 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-12-21 21:10:07,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-21 21:10:07,486 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:10:07,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:10:07,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-21 21:10:07,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:10:07,695 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:10:07,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:10:07,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1570117358, now seen corresponding path program 1 times [2023-12-21 21:10:07,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:10:07,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885514315] [2023-12-21 21:10:07,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:10:07,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:10:07,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:10:07,697 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 21:10:07,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-21 21:10:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:10:07,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-21 21:10:07,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:10:07,908 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 21:10:07,917 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 16 treesize of output 17 [2023-12-21 21:10:08,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 21:10:08,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 21:10:08,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:10:08,333 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 53 [2023-12-21 21:10:08,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:10:08,593 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 85 [2023-12-21 21:10:08,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:10:08,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 61 [2023-12-21 21:10:08,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 21:10:08,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2023-12-21 21:10:08,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:10:08,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 93 [2023-12-21 21:10:08,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:10:08,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 167 [2023-12-21 21:10:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:10:08,936 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:10:09,100 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 136 treesize of output 132 [2023-12-21 21:10:09,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:10:09,128 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 3614 treesize of output 3518 [2023-12-21 21:10:15,145 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 710 treesize of output 662 [2023-12-21 21:10:15,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:10:15,187 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 7422 treesize of output 6846 [2023-12-21 21:10:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:10:17,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:10:17,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885514315] [2023-12-21 21:10:17,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885514315] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:10:17,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:10:17,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2023-12-21 21:10:17,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822723398] [2023-12-21 21:10:17,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:10:17,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-21 21:10:17,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:10:17,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-21 21:10:17,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=639, Unknown=1, NotChecked=0, Total=756 [2023-12-21 21:10:17,133 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:10:22,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 21:10:28,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:10:28,405 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2023-12-21 21:10:28,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 21:10:28,405 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-21 21:10:28,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:10:28,406 INFO L225 Difference]: With dead ends: 52 [2023-12-21 21:10:28,406 INFO L226 Difference]: Without dead ends: 50 [2023-12-21 21:10:28,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=286, Invalid=1353, Unknown=1, NotChecked=0, Total=1640 [2023-12-21 21:10:28,408 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 137 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-12-21 21:10:28,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 115 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 362 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2023-12-21 21:10:28,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-21 21:10:28,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2023-12-21 21:10:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:10:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2023-12-21 21:10:28,418 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 19 [2023-12-21 21:10:28,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:10:28,418 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2023-12-21 21:10:28,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:10:28,418 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2023-12-21 21:10:28,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-21 21:10:28,419 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:10:28,419 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:10:28,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-21 21:10:28,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:10:28,623 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:10:28,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:10:28,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1447203495, now seen corresponding path program 2 times [2023-12-21 21:10:28,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:10:28,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500048489] [2023-12-21 21:10:28,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 21:10:28,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:10:28,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:10:28,630 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 21:10:28,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-21 21:10:28,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 21:10:28,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:10:28,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 21:10:28,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:10:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 21:10:28,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:10:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 21:10:28,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:10:28,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500048489] [2023-12-21 21:10:28,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500048489] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:10:28,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:10:28,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-12-21 21:10:28,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313874360] [2023-12-21 21:10:28,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:10:28,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 21:10:28,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:10:28,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 21:10:28,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-21 21:10:28,946 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:10:29,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:10:29,282 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2023-12-21 21:10:29,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 21:10:29,282 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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 20 [2023-12-21 21:10:29,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:10:29,284 INFO L225 Difference]: With dead ends: 80 [2023-12-21 21:10:29,284 INFO L226 Difference]: Without dead ends: 46 [2023-12-21 21:10:29,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2023-12-21 21:10:29,285 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 64 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 21:10:29,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 58 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 21:10:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-21 21:10:29,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2023-12-21 21:10:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 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) [2023-12-21 21:10:29,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2023-12-21 21:10:29,294 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 20 [2023-12-21 21:10:29,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:10:29,294 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2023-12-21 21:10:29,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:10:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2023-12-21 21:10:29,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-21 21:10:29,295 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:10:29,295 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:10:29,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-21 21:10:29,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:10:29,499 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:10:29,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:10:29,499 INFO L85 PathProgramCache]: Analyzing trace with hash 792290998, now seen corresponding path program 3 times [2023-12-21 21:10:29,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:10:29,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162746450] [2023-12-21 21:10:29,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 21:10:29,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:10:29,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:10:29,501 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 21:10:29,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-21 21:10:29,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-21 21:10:29,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:10:29,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 21:10:29,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:10:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 21:10:29,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:10:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 21:10:29,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:10:29,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162746450] [2023-12-21 21:10:29,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162746450] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:10:29,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:10:29,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-12-21 21:10:29,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781443299] [2023-12-21 21:10:29,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:10:29,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 21:10:29,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:10:29,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 21:10:29,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-12-21 21:10:29,902 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:10:30,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:10:30,426 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2023-12-21 21:10:30,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 21:10:30,428 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-21 21:10:30,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:10:30,429 INFO L225 Difference]: With dead ends: 92 [2023-12-21 21:10:30,429 INFO L226 Difference]: Without dead ends: 66 [2023-12-21 21:10:30,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2023-12-21 21:10:30,430 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 153 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 21:10:30,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 70 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 21:10:30,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-21 21:10:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2023-12-21 21:10:30,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:10:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2023-12-21 21:10:30,447 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 20 [2023-12-21 21:10:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:10:30,447 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2023-12-21 21:10:30,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:10:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2023-12-21 21:10:30,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-21 21:10:30,448 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:10:30,448 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:10:30,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-21 21:10:30,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:10:30,653 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:10:30,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:10:30,653 INFO L85 PathProgramCache]: Analyzing trace with hash -35180535, now seen corresponding path program 4 times [2023-12-21 21:10:30,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:10:30,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673469755] [2023-12-21 21:10:30,654 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 21:10:30,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:10:30,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:10:30,655 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 21:10:30,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-21 21:10:30,796 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 21:10:30,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:10:30,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-21 21:10:30,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:10:30,854 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 21:10:30,855 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 16 treesize of output 17 [2023-12-21 21:10:30,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 21:10:30,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 21:10:31,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 21:10:31,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:10:31,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2023-12-21 21:10:31,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:10:31,316 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 53 [2023-12-21 21:10:31,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:10:31,423 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 85 [2023-12-21 21:10:31,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:10:31,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 205 treesize of output 139 [2023-12-21 21:10:31,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:10:31,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 188 treesize of output 159 [2023-12-21 21:10:31,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:10:31,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 117 [2023-12-21 21:10:32,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 21:10:32,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2023-12-21 21:10:32,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:10:32,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 275 treesize of output 247 [2023-12-21 21:10:32,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:10:32,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 331 treesize of output 315 [2023-12-21 21:10:32,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:10:32,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 351 treesize of output 327 [2023-12-21 21:10:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:10:32,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:10:32,846 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 168 treesize of output 164 [2023-12-21 21:10:32,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:10:32,954 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 527982 treesize of output 521838 [2023-12-21 21:10:44,107 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 2630 treesize of output 2518 [2023-12-21 21:10:44,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:10:44,973 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 954959194 treesize of output 930841946 [2023-12-21 21:11:02,825 WARN L876 $PredicateComparison]: unable to prove that (or (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (let ((.cse11 ((_ extract 63 32) (_ bv1 64))) (.cse4 ((_ extract 31 0) (_ bv1 64)))) (let ((.cse27 (let ((.cse510 (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (concat (select .cse510 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (select .cse510 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (.cse19 (concat .cse11 .cse4)) (.cse495 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse13 (concat .cse4 .cse11)) (.cse221 (= (bvadd (_ bv8 32) .cse495) (_ bv0 32))) (.cse18 (let ((.cse509 (bvadd .cse27 .cse19))) (concat ((_ extract 63 32) .cse509) ((_ extract 31 0) .cse509)))) (.cse7 ((_ sign_extend 32) (bvadd c_~N~0 (_ bv2 32)))) (.cse505 (= .cse495 (_ bv0 32)))) (let ((.cse0 (and (= (let ((.cse506 (bvadd (let ((.cse507 (bvadd .cse19 (let ((.cse508 (bvadd .cse19 .cse18))) (concat ((_ extract 63 32) .cse508) ((_ extract 31 0) .cse508)))))) (concat ((_ extract 63 32) .cse507) ((_ extract 31 0) .cse507))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse506) ((_ extract 31 0) .cse506))) .cse7) .cse505)) (.cse29 (not .cse505)) (.cse99 (not .cse221)) (.cse100 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (= (let ((.cse502 (bvadd (_ bv1 64) (let ((.cse503 (bvadd (let ((.cse504 (bvadd (concat v_arrayElimCell_44 v_arrayElimCell_47) .cse18))) (concat ((_ extract 63 32) .cse504) ((_ extract 31 0) .cse504))) .cse19))) (concat ((_ extract 63 32) .cse503) ((_ extract 31 0) .cse503)))))) (concat ((_ extract 63 32) .cse502) ((_ extract 31 0) .cse502))) .cse7))) (.cse12 (let ((.cse501 (bvadd .cse27 .cse13))) (concat ((_ extract 63 32) .cse501) ((_ extract 31 0) .cse501)))) (.cse28 (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= .cse7 (let ((.cse496 (bvadd (_ bv1 64) (let ((.cse497 (let ((.cse500 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (bvadd (let ((.cse498 (bvadd .cse19 (let ((.cse499 (bvadd .cse27 .cse500))) (concat ((_ extract 63 32) .cse499) ((_ extract 31 0) .cse499)))))) (concat ((_ extract 63 32) .cse498) ((_ extract 31 0) .cse498))) .cse500)))) (concat ((_ extract 63 32) .cse497) ((_ extract 31 0) .cse497)))))) (concat ((_ extract 63 32) .cse496) ((_ extract 31 0) .cse496)))))) (.cse494 (= (_ bv8 32) .cse495))) (and (or .cse0 (and (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse6 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse5 (let ((.cse26 (bvadd .cse27 .cse6))) (concat ((_ extract 63 32) .cse26) ((_ extract 31 0) .cse26))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (or (= (let ((.cse1 (bvadd (_ bv1 64) (let ((.cse2 (bvadd (let ((.cse3 (bvadd (concat .cse4 v_arrayElimCell_47) .cse5))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3))) .cse6))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2)))))) (concat ((_ extract 63 32) .cse1) ((_ extract 31 0) .cse1))) .cse7) (forall ((v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse17 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse8 (bvadd (let ((.cse9 (bvadd (let ((.cse10 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse10) ((_ extract 31 0) .cse10))) .cse13))) (concat ((_ extract 63 32) .cse9) ((_ extract 31 0) .cse9))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse8) ((_ extract 31 0) .cse8))) .cse7) (= (let ((.cse14 (bvadd (_ bv1 64) (let ((.cse15 (bvadd (let ((.cse16 (bvadd .cse17 .cse18))) (concat ((_ extract 63 32) .cse16) ((_ extract 31 0) .cse16))) .cse19))) (concat ((_ extract 63 32) .cse15) ((_ extract 31 0) .cse15)))))) (concat ((_ extract 63 32) .cse14) ((_ extract 31 0) .cse14))) .cse7) (= (let ((.cse20 (bvadd (_ bv1 64) (let ((.cse21 (bvadd (let ((.cse22 (bvadd .cse17 .cse5))) (concat ((_ extract 63 32) .cse22) ((_ extract 31 0) .cse22))) .cse6))) (concat ((_ extract 63 32) .cse21) ((_ extract 31 0) .cse21)))))) (concat ((_ extract 63 32) .cse20) ((_ extract 31 0) .cse20))) .cse7)))))) (= .cse7 (let ((.cse23 (bvadd (_ bv1 64) (let ((.cse24 (bvadd (let ((.cse25 (bvadd .cse19 .cse5))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25))) .cse6))) (concat ((_ extract 63 32) .cse24) ((_ extract 31 0) .cse24)))))) (concat ((_ extract 63 32) .cse23) ((_ extract 31 0) .cse23)))))))) (or .cse28 .cse29) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse34 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse33 (let ((.cse53 (bvadd .cse27 .cse34))) (concat ((_ extract 63 32) .cse53) ((_ extract 31 0) .cse53))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (or (= (let ((.cse30 (bvadd (_ bv1 64) (let ((.cse31 (bvadd (let ((.cse32 (bvadd (concat .cse4 v_arrayElimCell_47) .cse33))) (concat ((_ extract 63 32) .cse32) ((_ extract 31 0) .cse32))) .cse34))) (concat ((_ extract 63 32) .cse31) ((_ extract 31 0) .cse31)))))) (concat ((_ extract 63 32) .cse30) ((_ extract 31 0) .cse30))) .cse7) (forall ((v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse41 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse35 (bvadd (let ((.cse36 (bvadd (let ((.cse37 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse37) ((_ extract 31 0) .cse37))) .cse13))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35))) .cse7) (= (let ((.cse38 (bvadd (_ bv1 64) (let ((.cse39 (bvadd (let ((.cse40 (bvadd .cse41 .cse18))) (concat ((_ extract 63 32) .cse40) ((_ extract 31 0) .cse40))) .cse19))) (concat ((_ extract 63 32) .cse39) ((_ extract 31 0) .cse39)))))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38))) .cse7) (= (let ((.cse42 (bvadd (let ((.cse43 (let ((.cse44 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse44 (let ((.cse45 (bvadd .cse41 (let ((.cse46 (bvadd .cse27 .cse44))) (concat ((_ extract 63 32) .cse46) ((_ extract 31 0) .cse46)))))) (concat ((_ extract 63 32) .cse45) ((_ extract 31 0) .cse45))))))) (concat ((_ extract 63 32) .cse43) ((_ extract 31 0) .cse43))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse42) ((_ extract 31 0) .cse42))) .cse7) (= (let ((.cse47 (bvadd (_ bv1 64) (let ((.cse48 (bvadd (let ((.cse49 (bvadd .cse41 .cse33))) (concat ((_ extract 63 32) .cse49) ((_ extract 31 0) .cse49))) .cse34))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48)))))) (concat ((_ extract 63 32) .cse47) ((_ extract 31 0) .cse47))) .cse7)))))) (= .cse7 (let ((.cse50 (bvadd (_ bv1 64) (let ((.cse51 (bvadd (let ((.cse52 (bvadd .cse19 .cse33))) (concat ((_ extract 63 32) .cse52) ((_ extract 31 0) .cse52))) .cse34))) (concat ((_ extract 63 32) .cse51) ((_ extract 31 0) .cse51)))))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse62 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse61 (let ((.cse66 (bvadd .cse27 .cse62))) (concat ((_ extract 63 32) .cse66) ((_ extract 31 0) .cse66))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse57 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse54 (bvadd (_ bv1 64) (let ((.cse55 (bvadd (let ((.cse56 (bvadd .cse57 .cse18))) (concat ((_ extract 63 32) .cse56) ((_ extract 31 0) .cse56))) .cse19))) (concat ((_ extract 63 32) .cse55) ((_ extract 31 0) .cse55)))))) (concat ((_ extract 63 32) .cse54) ((_ extract 31 0) .cse54))) .cse7) (= (let ((.cse58 (bvadd (_ bv1 64) (let ((.cse59 (bvadd (let ((.cse60 (bvadd .cse57 .cse61))) (concat ((_ extract 63 32) .cse60) ((_ extract 31 0) .cse60))) .cse62))) (concat ((_ extract 63 32) .cse59) ((_ extract 31 0) .cse59)))))) (concat ((_ extract 63 32) .cse58) ((_ extract 31 0) .cse58))) .cse7)))) (= .cse7 (let ((.cse63 (bvadd (_ bv1 64) (let ((.cse64 (bvadd (let ((.cse65 (bvadd .cse19 .cse61))) (concat ((_ extract 63 32) .cse65) ((_ extract 31 0) .cse65))) .cse62))) (concat ((_ extract 63 32) .cse64) ((_ extract 31 0) .cse64)))))) (concat ((_ extract 63 32) .cse63) ((_ extract 31 0) .cse63)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse71 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse70 (let ((.cse82 (bvadd .cse27 .cse71))) (concat ((_ extract 63 32) .cse82) ((_ extract 31 0) .cse82))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (or (= (let ((.cse67 (bvadd (_ bv1 64) (let ((.cse68 (bvadd (let ((.cse69 (bvadd (concat .cse4 v_arrayElimCell_47) .cse70))) (concat ((_ extract 63 32) .cse69) ((_ extract 31 0) .cse69))) .cse71))) (concat ((_ extract 63 32) .cse68) ((_ extract 31 0) .cse68)))))) (concat ((_ extract 63 32) .cse67) ((_ extract 31 0) .cse67))) .cse7) (forall ((v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse75 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse72 (bvadd (_ bv1 64) (let ((.cse73 (bvadd (let ((.cse74 (bvadd .cse75 .cse18))) (concat ((_ extract 63 32) .cse74) ((_ extract 31 0) .cse74))) .cse19))) (concat ((_ extract 63 32) .cse73) ((_ extract 31 0) .cse73)))))) (concat ((_ extract 63 32) .cse72) ((_ extract 31 0) .cse72))) .cse7) (= (let ((.cse76 (bvadd (_ bv1 64) (let ((.cse77 (bvadd (let ((.cse78 (bvadd .cse75 .cse70))) (concat ((_ extract 63 32) .cse78) ((_ extract 31 0) .cse78))) .cse71))) (concat ((_ extract 63 32) .cse77) ((_ extract 31 0) .cse77)))))) (concat ((_ extract 63 32) .cse76) ((_ extract 31 0) .cse76))) .cse7)))))) (= .cse7 (let ((.cse79 (bvadd (_ bv1 64) (let ((.cse80 (bvadd (let ((.cse81 (bvadd .cse19 .cse70))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81))) .cse71))) (concat ((_ extract 63 32) .cse80) ((_ extract 31 0) .cse80)))))) (concat ((_ extract 63 32) .cse79) ((_ extract 31 0) .cse79)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse94 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse93 (let ((.cse98 (bvadd .cse27 .cse94))) (concat ((_ extract 63 32) .cse98) ((_ extract 31 0) .cse98))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse89 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse83 (bvadd (let ((.cse84 (bvadd (let ((.cse85 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse85) ((_ extract 31 0) .cse85))) .cse13))) (concat ((_ extract 63 32) .cse84) ((_ extract 31 0) .cse84))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse83) ((_ extract 31 0) .cse83))) .cse7) (= (let ((.cse86 (bvadd (_ bv1 64) (let ((.cse87 (bvadd (let ((.cse88 (bvadd .cse89 .cse18))) (concat ((_ extract 63 32) .cse88) ((_ extract 31 0) .cse88))) .cse19))) (concat ((_ extract 63 32) .cse87) ((_ extract 31 0) .cse87)))))) (concat ((_ extract 63 32) .cse86) ((_ extract 31 0) .cse86))) .cse7) (= (let ((.cse90 (bvadd (_ bv1 64) (let ((.cse91 (bvadd (let ((.cse92 (bvadd .cse89 .cse93))) (concat ((_ extract 63 32) .cse92) ((_ extract 31 0) .cse92))) .cse94))) (concat ((_ extract 63 32) .cse91) ((_ extract 31 0) .cse91)))))) (concat ((_ extract 63 32) .cse90) ((_ extract 31 0) .cse90))) .cse7)))) (= .cse7 (let ((.cse95 (bvadd (_ bv1 64) (let ((.cse96 (bvadd (let ((.cse97 (bvadd .cse19 .cse93))) (concat ((_ extract 63 32) .cse97) ((_ extract 31 0) .cse97))) .cse94))) (concat ((_ extract 63 32) .cse96) ((_ extract 31 0) .cse96)))))) (concat ((_ extract 63 32) .cse95) ((_ extract 31 0) .cse95)))))))) (or .cse28 .cse99 .cse100) (or (and (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse108 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse107 (let ((.cse115 (bvadd .cse27 .cse108))) (concat ((_ extract 63 32) .cse115) ((_ extract 31 0) .cse115))))) (or (forall ((v_arrayElimCell_44 (_ BitVec 32))) (or (= (let ((.cse101 (bvadd (let ((.cse102 (bvadd (let ((.cse103 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse103) ((_ extract 31 0) .cse103))) .cse13))) (concat ((_ extract 63 32) .cse102) ((_ extract 31 0) .cse102))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse101) ((_ extract 31 0) .cse101))) .cse7) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (or (= (let ((.cse104 (bvadd (_ bv1 64) (let ((.cse105 (bvadd (let ((.cse106 (bvadd (concat .cse4 v_arrayElimCell_47) .cse107))) (concat ((_ extract 63 32) .cse106) ((_ extract 31 0) .cse106))) .cse108))) (concat ((_ extract 63 32) .cse105) ((_ extract 31 0) .cse105)))))) (concat ((_ extract 63 32) .cse104) ((_ extract 31 0) .cse104))) .cse7) (= (let ((.cse109 (bvadd (_ bv1 64) (let ((.cse110 (bvadd (let ((.cse111 (bvadd (concat v_arrayElimCell_44 v_arrayElimCell_47) .cse107))) (concat ((_ extract 63 32) .cse111) ((_ extract 31 0) .cse111))) .cse108))) (concat ((_ extract 63 32) .cse110) ((_ extract 31 0) .cse110)))))) (concat ((_ extract 63 32) .cse109) ((_ extract 31 0) .cse109))) .cse7))))) (= .cse7 (let ((.cse112 (bvadd (_ bv1 64) (let ((.cse113 (bvadd (let ((.cse114 (bvadd .cse19 .cse107))) (concat ((_ extract 63 32) .cse114) ((_ extract 31 0) .cse114))) .cse108))) (concat ((_ extract 63 32) .cse113) ((_ extract 31 0) .cse113)))))) (concat ((_ extract 63 32) .cse112) ((_ extract 31 0) .cse112)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse120 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse119 (let ((.cse124 (bvadd .cse27 .cse120))) (concat ((_ extract 63 32) .cse124) ((_ extract 31 0) .cse124))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (= (let ((.cse116 (bvadd (_ bv1 64) (let ((.cse117 (bvadd (let ((.cse118 (bvadd (concat v_arrayElimCell_44 v_arrayElimCell_47) .cse119))) (concat ((_ extract 63 32) .cse118) ((_ extract 31 0) .cse118))) .cse120))) (concat ((_ extract 63 32) .cse117) ((_ extract 31 0) .cse117)))))) (concat ((_ extract 63 32) .cse116) ((_ extract 31 0) .cse116))) .cse7)) (= .cse7 (let ((.cse121 (bvadd (_ bv1 64) (let ((.cse122 (bvadd (let ((.cse123 (bvadd .cse19 .cse119))) (concat ((_ extract 63 32) .cse123) ((_ extract 31 0) .cse123))) .cse120))) (concat ((_ extract 63 32) .cse122) ((_ extract 31 0) .cse122)))))) (concat ((_ extract 63 32) .cse121) ((_ extract 31 0) .cse121)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse135 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse134 (let ((.cse142 (bvadd .cse27 .cse135))) (concat ((_ extract 63 32) .cse142) ((_ extract 31 0) .cse142))))) (or (forall ((v_arrayElimCell_44 (_ BitVec 32))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse129 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse125 (bvadd (let ((.cse126 (let ((.cse127 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse127 (let ((.cse128 (bvadd .cse129 (let ((.cse130 (bvadd .cse27 .cse127))) (concat ((_ extract 63 32) .cse130) ((_ extract 31 0) .cse130)))))) (concat ((_ extract 63 32) .cse128) ((_ extract 31 0) .cse128))))))) (concat ((_ extract 63 32) .cse126) ((_ extract 31 0) .cse126))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse125) ((_ extract 31 0) .cse125))) .cse7) (= (let ((.cse131 (bvadd (_ bv1 64) (let ((.cse132 (bvadd (let ((.cse133 (bvadd .cse129 .cse134))) (concat ((_ extract 63 32) .cse133) ((_ extract 31 0) .cse133))) .cse135))) (concat ((_ extract 63 32) .cse132) ((_ extract 31 0) .cse132)))))) (concat ((_ extract 63 32) .cse131) ((_ extract 31 0) .cse131))) .cse7)))) (= (let ((.cse136 (bvadd (let ((.cse137 (bvadd (let ((.cse138 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse138) ((_ extract 31 0) .cse138))) .cse13))) (concat ((_ extract 63 32) .cse137) ((_ extract 31 0) .cse137))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse136) ((_ extract 31 0) .cse136))) .cse7))) (= .cse7 (let ((.cse139 (bvadd (_ bv1 64) (let ((.cse140 (bvadd (let ((.cse141 (bvadd .cse19 .cse134))) (concat ((_ extract 63 32) .cse141) ((_ extract 31 0) .cse141))) .cse135))) (concat ((_ extract 63 32) .cse140) ((_ extract 31 0) .cse140)))))) (concat ((_ extract 63 32) .cse139) ((_ extract 31 0) .cse139)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse147 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse146 (let ((.cse154 (bvadd .cse27 .cse147))) (concat ((_ extract 63 32) .cse154) ((_ extract 31 0) .cse154))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (or (= (let ((.cse143 (bvadd (_ bv1 64) (let ((.cse144 (bvadd (let ((.cse145 (bvadd (concat .cse4 v_arrayElimCell_47) .cse146))) (concat ((_ extract 63 32) .cse145) ((_ extract 31 0) .cse145))) .cse147))) (concat ((_ extract 63 32) .cse144) ((_ extract 31 0) .cse144)))))) (concat ((_ extract 63 32) .cse143) ((_ extract 31 0) .cse143))) .cse7) (= (let ((.cse148 (bvadd (_ bv1 64) (let ((.cse149 (bvadd (let ((.cse150 (bvadd (concat v_arrayElimCell_44 v_arrayElimCell_47) .cse146))) (concat ((_ extract 63 32) .cse150) ((_ extract 31 0) .cse150))) .cse147))) (concat ((_ extract 63 32) .cse149) ((_ extract 31 0) .cse149)))))) (concat ((_ extract 63 32) .cse148) ((_ extract 31 0) .cse148))) .cse7))) (= .cse7 (let ((.cse151 (bvadd (_ bv1 64) (let ((.cse152 (bvadd (let ((.cse153 (bvadd .cse19 .cse146))) (concat ((_ extract 63 32) .cse153) ((_ extract 31 0) .cse153))) .cse147))) (concat ((_ extract 63 32) .cse152) ((_ extract 31 0) .cse152)))))) (concat ((_ extract 63 32) .cse151) ((_ extract 31 0) .cse151)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse165 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse164 (let ((.cse169 (bvadd .cse27 .cse165))) (concat ((_ extract 63 32) .cse169) ((_ extract 31 0) .cse169))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse159 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse155 (bvadd (let ((.cse156 (let ((.cse157 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse157 (let ((.cse158 (bvadd .cse159 (let ((.cse160 (bvadd .cse27 .cse157))) (concat ((_ extract 63 32) .cse160) ((_ extract 31 0) .cse160)))))) (concat ((_ extract 63 32) .cse158) ((_ extract 31 0) .cse158))))))) (concat ((_ extract 63 32) .cse156) ((_ extract 31 0) .cse156))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse155) ((_ extract 31 0) .cse155))) .cse7) (= (let ((.cse161 (bvadd (_ bv1 64) (let ((.cse162 (bvadd (let ((.cse163 (bvadd .cse159 .cse164))) (concat ((_ extract 63 32) .cse163) ((_ extract 31 0) .cse163))) .cse165))) (concat ((_ extract 63 32) .cse162) ((_ extract 31 0) .cse162)))))) (concat ((_ extract 63 32) .cse161) ((_ extract 31 0) .cse161))) .cse7)))) (= .cse7 (let ((.cse166 (bvadd (_ bv1 64) (let ((.cse167 (bvadd (let ((.cse168 (bvadd .cse19 .cse164))) (concat ((_ extract 63 32) .cse168) ((_ extract 31 0) .cse168))) .cse165))) (concat ((_ extract 63 32) .cse167) ((_ extract 31 0) .cse167)))))) (concat ((_ extract 63 32) .cse166) ((_ extract 31 0) .cse166)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse174 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse173 (let ((.cse190 (bvadd .cse27 .cse174))) (concat ((_ extract 63 32) .cse190) ((_ extract 31 0) .cse190))))) (or (forall ((v_arrayElimCell_44 (_ BitVec 32))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse179 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse170 (bvadd (_ bv1 64) (let ((.cse171 (bvadd (let ((.cse172 (bvadd (concat .cse4 v_arrayElimCell_47) .cse173))) (concat ((_ extract 63 32) .cse172) ((_ extract 31 0) .cse172))) .cse174))) (concat ((_ extract 63 32) .cse171) ((_ extract 31 0) .cse171)))))) (concat ((_ extract 63 32) .cse170) ((_ extract 31 0) .cse170))) .cse7) (= (let ((.cse175 (bvadd (let ((.cse176 (let ((.cse177 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse177 (let ((.cse178 (bvadd .cse179 (let ((.cse180 (bvadd .cse27 .cse177))) (concat ((_ extract 63 32) .cse180) ((_ extract 31 0) .cse180)))))) (concat ((_ extract 63 32) .cse178) ((_ extract 31 0) .cse178))))))) (concat ((_ extract 63 32) .cse176) ((_ extract 31 0) .cse176))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse175) ((_ extract 31 0) .cse175))) .cse7) (= (let ((.cse181 (bvadd (_ bv1 64) (let ((.cse182 (bvadd (let ((.cse183 (bvadd .cse179 .cse173))) (concat ((_ extract 63 32) .cse183) ((_ extract 31 0) .cse183))) .cse174))) (concat ((_ extract 63 32) .cse182) ((_ extract 31 0) .cse182)))))) (concat ((_ extract 63 32) .cse181) ((_ extract 31 0) .cse181))) .cse7)))) (= (let ((.cse184 (bvadd (let ((.cse185 (bvadd (let ((.cse186 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse186) ((_ extract 31 0) .cse186))) .cse13))) (concat ((_ extract 63 32) .cse185) ((_ extract 31 0) .cse185))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse184) ((_ extract 31 0) .cse184))) .cse7))) (= .cse7 (let ((.cse187 (bvadd (_ bv1 64) (let ((.cse188 (bvadd (let ((.cse189 (bvadd .cse19 .cse173))) (concat ((_ extract 63 32) .cse189) ((_ extract 31 0) .cse189))) .cse174))) (concat ((_ extract 63 32) .cse188) ((_ extract 31 0) .cse188)))))) (concat ((_ extract 63 32) .cse187) ((_ extract 31 0) .cse187)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse195 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse194 (let ((.cse208 (bvadd .cse27 .cse195))) (concat ((_ extract 63 32) .cse208) ((_ extract 31 0) .cse208))))) (or (= .cse7 (let ((.cse191 (bvadd (_ bv1 64) (let ((.cse192 (bvadd (let ((.cse193 (bvadd .cse19 .cse194))) (concat ((_ extract 63 32) .cse193) ((_ extract 31 0) .cse193))) .cse195))) (concat ((_ extract 63 32) .cse192) ((_ extract 31 0) .cse192)))))) (concat ((_ extract 63 32) .cse191) ((_ extract 31 0) .cse191)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse203 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse196 (bvadd (_ bv1 64) (let ((.cse197 (bvadd (let ((.cse198 (bvadd (concat .cse4 v_arrayElimCell_47) .cse194))) (concat ((_ extract 63 32) .cse198) ((_ extract 31 0) .cse198))) .cse195))) (concat ((_ extract 63 32) .cse197) ((_ extract 31 0) .cse197)))))) (concat ((_ extract 63 32) .cse196) ((_ extract 31 0) .cse196))) .cse7) (= (let ((.cse199 (bvadd (let ((.cse200 (let ((.cse201 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse201 (let ((.cse202 (bvadd .cse203 (let ((.cse204 (bvadd .cse27 .cse201))) (concat ((_ extract 63 32) .cse204) ((_ extract 31 0) .cse204)))))) (concat ((_ extract 63 32) .cse202) ((_ extract 31 0) .cse202))))))) (concat ((_ extract 63 32) .cse200) ((_ extract 31 0) .cse200))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse199) ((_ extract 31 0) .cse199))) .cse7) (= (let ((.cse205 (bvadd (_ bv1 64) (let ((.cse206 (bvadd (let ((.cse207 (bvadd .cse203 .cse194))) (concat ((_ extract 63 32) .cse207) ((_ extract 31 0) .cse207))) .cse195))) (concat ((_ extract 63 32) .cse206) ((_ extract 31 0) .cse206)))))) (concat ((_ extract 63 32) .cse205) ((_ extract 31 0) .cse205))) .cse7)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse216 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse215 (let ((.cse220 (bvadd .cse27 .cse216))) (concat ((_ extract 63 32) .cse220) ((_ extract 31 0) .cse220))))) (or (forall ((v_arrayElimCell_44 (_ BitVec 32))) (or (= (let ((.cse209 (bvadd (let ((.cse210 (bvadd (let ((.cse211 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse211) ((_ extract 31 0) .cse211))) .cse13))) (concat ((_ extract 63 32) .cse210) ((_ extract 31 0) .cse210))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse209) ((_ extract 31 0) .cse209))) .cse7) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= (let ((.cse212 (bvadd (_ bv1 64) (let ((.cse213 (bvadd (let ((.cse214 (bvadd (concat v_arrayElimCell_44 v_arrayElimCell_47) .cse215))) (concat ((_ extract 63 32) .cse214) ((_ extract 31 0) .cse214))) .cse216))) (concat ((_ extract 63 32) .cse213) ((_ extract 31 0) .cse213)))))) (concat ((_ extract 63 32) .cse212) ((_ extract 31 0) .cse212))) .cse7)))) (= .cse7 (let ((.cse217 (bvadd (_ bv1 64) (let ((.cse218 (bvadd (let ((.cse219 (bvadd .cse19 .cse215))) (concat ((_ extract 63 32) .cse219) ((_ extract 31 0) .cse219))) .cse216))) (concat ((_ extract 63 32) .cse218) ((_ extract 31 0) .cse218)))))) (concat ((_ extract 63 32) .cse217) ((_ extract 31 0) .cse217))))))))) .cse221) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse235 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse234 (let ((.cse239 (bvadd .cse27 .cse235))) (concat ((_ extract 63 32) .cse239) ((_ extract 31 0) .cse239))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse225 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse222 (bvadd (_ bv1 64) (let ((.cse223 (bvadd (let ((.cse224 (bvadd .cse225 .cse18))) (concat ((_ extract 63 32) .cse224) ((_ extract 31 0) .cse224))) .cse19))) (concat ((_ extract 63 32) .cse223) ((_ extract 31 0) .cse223)))))) (concat ((_ extract 63 32) .cse222) ((_ extract 31 0) .cse222))) .cse7) (= (let ((.cse226 (bvadd (let ((.cse227 (let ((.cse228 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse228 (let ((.cse229 (bvadd .cse225 (let ((.cse230 (bvadd .cse27 .cse228))) (concat ((_ extract 63 32) .cse230) ((_ extract 31 0) .cse230)))))) (concat ((_ extract 63 32) .cse229) ((_ extract 31 0) .cse229))))))) (concat ((_ extract 63 32) .cse227) ((_ extract 31 0) .cse227))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse226) ((_ extract 31 0) .cse226))) .cse7) (= (let ((.cse231 (bvadd (_ bv1 64) (let ((.cse232 (bvadd (let ((.cse233 (bvadd .cse225 .cse234))) (concat ((_ extract 63 32) .cse233) ((_ extract 31 0) .cse233))) .cse235))) (concat ((_ extract 63 32) .cse232) ((_ extract 31 0) .cse232)))))) (concat ((_ extract 63 32) .cse231) ((_ extract 31 0) .cse231))) .cse7)))) (= .cse7 (let ((.cse236 (bvadd (_ bv1 64) (let ((.cse237 (bvadd (let ((.cse238 (bvadd .cse19 .cse234))) (concat ((_ extract 63 32) .cse238) ((_ extract 31 0) .cse238))) .cse235))) (concat ((_ extract 63 32) .cse237) ((_ extract 31 0) .cse237)))))) (concat ((_ extract 63 32) .cse236) ((_ extract 31 0) .cse236)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse244 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse243 (let ((.cse260 (bvadd .cse27 .cse244))) (concat ((_ extract 63 32) .cse260) ((_ extract 31 0) .cse260))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (or (= (let ((.cse240 (bvadd (_ bv1 64) (let ((.cse241 (bvadd (let ((.cse242 (bvadd (concat .cse4 v_arrayElimCell_47) .cse243))) (concat ((_ extract 63 32) .cse242) ((_ extract 31 0) .cse242))) .cse244))) (concat ((_ extract 63 32) .cse241) ((_ extract 31 0) .cse241)))))) (concat ((_ extract 63 32) .cse240) ((_ extract 31 0) .cse240))) .cse7) (forall ((v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse248 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse245 (bvadd (_ bv1 64) (let ((.cse246 (bvadd (let ((.cse247 (bvadd .cse248 .cse18))) (concat ((_ extract 63 32) .cse247) ((_ extract 31 0) .cse247))) .cse19))) (concat ((_ extract 63 32) .cse246) ((_ extract 31 0) .cse246)))))) (concat ((_ extract 63 32) .cse245) ((_ extract 31 0) .cse245))) .cse7) (= (let ((.cse249 (bvadd (let ((.cse250 (let ((.cse251 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse251 (let ((.cse252 (bvadd .cse248 (let ((.cse253 (bvadd .cse27 .cse251))) (concat ((_ extract 63 32) .cse253) ((_ extract 31 0) .cse253)))))) (concat ((_ extract 63 32) .cse252) ((_ extract 31 0) .cse252))))))) (concat ((_ extract 63 32) .cse250) ((_ extract 31 0) .cse250))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse249) ((_ extract 31 0) .cse249))) .cse7) (= (let ((.cse254 (bvadd (_ bv1 64) (let ((.cse255 (bvadd (let ((.cse256 (bvadd .cse248 .cse243))) (concat ((_ extract 63 32) .cse256) ((_ extract 31 0) .cse256))) .cse244))) (concat ((_ extract 63 32) .cse255) ((_ extract 31 0) .cse255)))))) (concat ((_ extract 63 32) .cse254) ((_ extract 31 0) .cse254))) .cse7)))))) (= .cse7 (let ((.cse257 (bvadd (_ bv1 64) (let ((.cse258 (bvadd (let ((.cse259 (bvadd .cse19 .cse243))) (concat ((_ extract 63 32) .cse259) ((_ extract 31 0) .cse259))) .cse244))) (concat ((_ extract 63 32) .cse258) ((_ extract 31 0) .cse258)))))) (concat ((_ extract 63 32) .cse257) ((_ extract 31 0) .cse257)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse277 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse276 (let ((.cse281 (bvadd .cse27 .cse277))) (concat ((_ extract 63 32) .cse281) ((_ extract 31 0) .cse281))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse267 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse261 (bvadd (let ((.cse262 (bvadd (let ((.cse263 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse263) ((_ extract 31 0) .cse263))) .cse13))) (concat ((_ extract 63 32) .cse262) ((_ extract 31 0) .cse262))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse261) ((_ extract 31 0) .cse261))) .cse7) (= (let ((.cse264 (bvadd (_ bv1 64) (let ((.cse265 (bvadd (let ((.cse266 (bvadd .cse267 .cse18))) (concat ((_ extract 63 32) .cse266) ((_ extract 31 0) .cse266))) .cse19))) (concat ((_ extract 63 32) .cse265) ((_ extract 31 0) .cse265)))))) (concat ((_ extract 63 32) .cse264) ((_ extract 31 0) .cse264))) .cse7) (= (let ((.cse268 (bvadd (let ((.cse269 (let ((.cse270 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse270 (let ((.cse271 (bvadd .cse267 (let ((.cse272 (bvadd .cse27 .cse270))) (concat ((_ extract 63 32) .cse272) ((_ extract 31 0) .cse272)))))) (concat ((_ extract 63 32) .cse271) ((_ extract 31 0) .cse271))))))) (concat ((_ extract 63 32) .cse269) ((_ extract 31 0) .cse269))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse268) ((_ extract 31 0) .cse268))) .cse7) (= (let ((.cse273 (bvadd (_ bv1 64) (let ((.cse274 (bvadd (let ((.cse275 (bvadd .cse267 .cse276))) (concat ((_ extract 63 32) .cse275) ((_ extract 31 0) .cse275))) .cse277))) (concat ((_ extract 63 32) .cse274) ((_ extract 31 0) .cse274)))))) (concat ((_ extract 63 32) .cse273) ((_ extract 31 0) .cse273))) .cse7)))) (= .cse7 (let ((.cse278 (bvadd (_ bv1 64) (let ((.cse279 (bvadd (let ((.cse280 (bvadd .cse19 .cse276))) (concat ((_ extract 63 32) .cse280) ((_ extract 31 0) .cse280))) .cse277))) (concat ((_ extract 63 32) .cse279) ((_ extract 31 0) .cse279)))))) (concat ((_ extract 63 32) .cse278) ((_ extract 31 0) .cse278)))))))))) (or .cse0 (and (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse285 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse282 (bvadd (_ bv1 64) (let ((.cse283 (bvadd (let ((.cse284 (bvadd .cse285 .cse18))) (concat ((_ extract 63 32) .cse284) ((_ extract 31 0) .cse284))) .cse19))) (concat ((_ extract 63 32) .cse283) ((_ extract 31 0) .cse283)))))) (concat ((_ extract 63 32) .cse282) ((_ extract 31 0) .cse282))) .cse7) (= (let ((.cse286 (bvadd (let ((.cse287 (let ((.cse288 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse288 (let ((.cse289 (bvadd .cse285 (let ((.cse290 (bvadd .cse27 .cse288))) (concat ((_ extract 63 32) .cse290) ((_ extract 31 0) .cse290)))))) (concat ((_ extract 63 32) .cse289) ((_ extract 31 0) .cse289))))))) (concat ((_ extract 63 32) .cse287) ((_ extract 31 0) .cse287))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse286) ((_ extract 31 0) .cse286))) .cse7) (= (let ((.cse291 (bvadd (_ bv1 64) (let ((.cse292 (let ((.cse295 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (bvadd (let ((.cse293 (bvadd .cse285 (let ((.cse294 (bvadd .cse27 .cse295))) (concat ((_ extract 63 32) .cse294) ((_ extract 31 0) .cse294)))))) (concat ((_ extract 63 32) .cse293) ((_ extract 31 0) .cse293))) .cse295)))) (concat ((_ extract 63 32) .cse292) ((_ extract 31 0) .cse292)))))) (concat ((_ extract 63 32) .cse291) ((_ extract 31 0) .cse291))) .cse7)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse302 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse296 (bvadd (let ((.cse297 (bvadd (let ((.cse298 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse298) ((_ extract 31 0) .cse298))) .cse13))) (concat ((_ extract 63 32) .cse297) ((_ extract 31 0) .cse297))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse296) ((_ extract 31 0) .cse296))) .cse7) (= (let ((.cse299 (bvadd (_ bv1 64) (let ((.cse300 (bvadd (let ((.cse301 (bvadd .cse302 .cse18))) (concat ((_ extract 63 32) .cse301) ((_ extract 31 0) .cse301))) .cse19))) (concat ((_ extract 63 32) .cse300) ((_ extract 31 0) .cse300)))))) (concat ((_ extract 63 32) .cse299) ((_ extract 31 0) .cse299))) .cse7) (= (let ((.cse303 (bvadd (let ((.cse304 (let ((.cse305 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse305 (let ((.cse306 (bvadd .cse302 (let ((.cse307 (bvadd .cse27 .cse305))) (concat ((_ extract 63 32) .cse307) ((_ extract 31 0) .cse307)))))) (concat ((_ extract 63 32) .cse306) ((_ extract 31 0) .cse306))))))) (concat ((_ extract 63 32) .cse304) ((_ extract 31 0) .cse304))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse303) ((_ extract 31 0) .cse303))) .cse7) (= (let ((.cse308 (bvadd (_ bv1 64) (let ((.cse309 (let ((.cse312 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (bvadd (let ((.cse310 (bvadd .cse302 (let ((.cse311 (bvadd .cse27 .cse312))) (concat ((_ extract 63 32) .cse311) ((_ extract 31 0) .cse311)))))) (concat ((_ extract 63 32) .cse310) ((_ extract 31 0) .cse310))) .cse312)))) (concat ((_ extract 63 32) .cse309) ((_ extract 31 0) .cse309)))))) (concat ((_ extract 63 32) .cse308) ((_ extract 31 0) .cse308))) .cse7)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse317 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse316 (let ((.cse330 (bvadd .cse27 .cse317))) (concat ((_ extract 63 32) .cse330) ((_ extract 31 0) .cse330))))) (or (= (let ((.cse313 (bvadd (_ bv1 64) (let ((.cse314 (bvadd (let ((.cse315 (bvadd (concat .cse4 v_arrayElimCell_47) .cse316))) (concat ((_ extract 63 32) .cse315) ((_ extract 31 0) .cse315))) .cse317))) (concat ((_ extract 63 32) .cse314) ((_ extract 31 0) .cse314)))))) (concat ((_ extract 63 32) .cse313) ((_ extract 31 0) .cse313))) .cse7) (forall ((v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse321 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse318 (bvadd (_ bv1 64) (let ((.cse319 (bvadd (let ((.cse320 (bvadd .cse321 .cse18))) (concat ((_ extract 63 32) .cse320) ((_ extract 31 0) .cse320))) .cse19))) (concat ((_ extract 63 32) .cse319) ((_ extract 31 0) .cse319)))))) (concat ((_ extract 63 32) .cse318) ((_ extract 31 0) .cse318))) .cse7) (= (let ((.cse322 (bvadd (let ((.cse323 (let ((.cse324 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse324 (let ((.cse325 (bvadd .cse321 (let ((.cse326 (bvadd .cse27 .cse324))) (concat ((_ extract 63 32) .cse326) ((_ extract 31 0) .cse326)))))) (concat ((_ extract 63 32) .cse325) ((_ extract 31 0) .cse325))))))) (concat ((_ extract 63 32) .cse323) ((_ extract 31 0) .cse323))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse322) ((_ extract 31 0) .cse322))) .cse7) (= (let ((.cse327 (bvadd (_ bv1 64) (let ((.cse328 (bvadd (let ((.cse329 (bvadd .cse321 .cse316))) (concat ((_ extract 63 32) .cse329) ((_ extract 31 0) .cse329))) .cse317))) (concat ((_ extract 63 32) .cse328) ((_ extract 31 0) .cse328)))))) (concat ((_ extract 63 32) .cse327) ((_ extract 31 0) .cse327))) .cse7)))))))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse335 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse334 (let ((.cse343 (bvadd .cse27 .cse335))) (concat ((_ extract 63 32) .cse343) ((_ extract 31 0) .cse343))))) (or (= (let ((.cse331 (bvadd (_ bv1 64) (let ((.cse332 (bvadd (let ((.cse333 (bvadd (concat .cse4 v_arrayElimCell_47) .cse334))) (concat ((_ extract 63 32) .cse333) ((_ extract 31 0) .cse333))) .cse335))) (concat ((_ extract 63 32) .cse332) ((_ extract 31 0) .cse332)))))) (concat ((_ extract 63 32) .cse331) ((_ extract 31 0) .cse331))) .cse7) (forall ((v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse339 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse336 (bvadd (_ bv1 64) (let ((.cse337 (bvadd (let ((.cse338 (bvadd .cse339 .cse18))) (concat ((_ extract 63 32) .cse338) ((_ extract 31 0) .cse338))) .cse19))) (concat ((_ extract 63 32) .cse337) ((_ extract 31 0) .cse337)))))) (concat ((_ extract 63 32) .cse336) ((_ extract 31 0) .cse336))) .cse7) (= (let ((.cse340 (bvadd (_ bv1 64) (let ((.cse341 (bvadd (let ((.cse342 (bvadd .cse339 .cse334))) (concat ((_ extract 63 32) .cse342) ((_ extract 31 0) .cse342))) .cse335))) (concat ((_ extract 63 32) .cse341) ((_ extract 31 0) .cse341)))))) (concat ((_ extract 63 32) .cse340) ((_ extract 31 0) .cse340))) .cse7)))))))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse347 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse344 (bvadd (_ bv1 64) (let ((.cse345 (bvadd (let ((.cse346 (bvadd .cse347 .cse18))) (concat ((_ extract 63 32) .cse346) ((_ extract 31 0) .cse346))) .cse19))) (concat ((_ extract 63 32) .cse345) ((_ extract 31 0) .cse345)))))) (concat ((_ extract 63 32) .cse344) ((_ extract 31 0) .cse344))) .cse7) (= (let ((.cse348 (bvadd (_ bv1 64) (let ((.cse349 (let ((.cse352 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (bvadd (let ((.cse350 (bvadd .cse347 (let ((.cse351 (bvadd .cse27 .cse352))) (concat ((_ extract 63 32) .cse351) ((_ extract 31 0) .cse351)))))) (concat ((_ extract 63 32) .cse350) ((_ extract 31 0) .cse350))) .cse352)))) (concat ((_ extract 63 32) .cse349) ((_ extract 31 0) .cse349)))))) (concat ((_ extract 63 32) .cse348) ((_ extract 31 0) .cse348))) .cse7)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse357 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse356 (let ((.cse373 (bvadd .cse27 .cse357))) (concat ((_ extract 63 32) .cse373) ((_ extract 31 0) .cse373))))) (or (= (let ((.cse353 (bvadd (_ bv1 64) (let ((.cse354 (bvadd (let ((.cse355 (bvadd (concat .cse4 v_arrayElimCell_47) .cse356))) (concat ((_ extract 63 32) .cse355) ((_ extract 31 0) .cse355))) .cse357))) (concat ((_ extract 63 32) .cse354) ((_ extract 31 0) .cse354)))))) (concat ((_ extract 63 32) .cse353) ((_ extract 31 0) .cse353))) .cse7) (forall ((v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse364 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse358 (bvadd (let ((.cse359 (bvadd (let ((.cse360 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse360) ((_ extract 31 0) .cse360))) .cse13))) (concat ((_ extract 63 32) .cse359) ((_ extract 31 0) .cse359))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse358) ((_ extract 31 0) .cse358))) .cse7) (= (let ((.cse361 (bvadd (_ bv1 64) (let ((.cse362 (bvadd (let ((.cse363 (bvadd .cse364 .cse18))) (concat ((_ extract 63 32) .cse363) ((_ extract 31 0) .cse363))) .cse19))) (concat ((_ extract 63 32) .cse362) ((_ extract 31 0) .cse362)))))) (concat ((_ extract 63 32) .cse361) ((_ extract 31 0) .cse361))) .cse7) (= (let ((.cse365 (bvadd (let ((.cse366 (let ((.cse367 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse367 (let ((.cse368 (bvadd .cse364 (let ((.cse369 (bvadd .cse27 .cse367))) (concat ((_ extract 63 32) .cse369) ((_ extract 31 0) .cse369)))))) (concat ((_ extract 63 32) .cse368) ((_ extract 31 0) .cse368))))))) (concat ((_ extract 63 32) .cse366) ((_ extract 31 0) .cse366))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse365) ((_ extract 31 0) .cse365))) .cse7) (= (let ((.cse370 (bvadd (_ bv1 64) (let ((.cse371 (bvadd (let ((.cse372 (bvadd .cse364 .cse356))) (concat ((_ extract 63 32) .cse372) ((_ extract 31 0) .cse372))) .cse357))) (concat ((_ extract 63 32) .cse371) ((_ extract 31 0) .cse371)))))) (concat ((_ extract 63 32) .cse370) ((_ extract 31 0) .cse370))) .cse7)))))))) .cse29 (or .cse99 .cse100) (or (and (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (= (let ((.cse374 (bvadd (_ bv1 64) (let ((.cse375 (let ((.cse378 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (bvadd (let ((.cse376 (bvadd (concat v_arrayElimCell_44 v_arrayElimCell_47) (let ((.cse377 (bvadd .cse27 .cse378))) (concat ((_ extract 63 32) .cse377) ((_ extract 31 0) .cse377)))))) (concat ((_ extract 63 32) .cse376) ((_ extract 31 0) .cse376))) .cse378)))) (concat ((_ extract 63 32) .cse375) ((_ extract 31 0) .cse375)))))) (concat ((_ extract 63 32) .cse374) ((_ extract 31 0) .cse374))) .cse7)) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (or (= (let ((.cse379 (bvadd (let ((.cse380 (bvadd (let ((.cse381 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse381) ((_ extract 31 0) .cse381))) .cse13))) (concat ((_ extract 63 32) .cse380) ((_ extract 31 0) .cse380))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse379) ((_ extract 31 0) .cse379))) .cse7) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= (let ((.cse382 (bvadd (_ bv1 64) (let ((.cse383 (let ((.cse386 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (bvadd (let ((.cse384 (bvadd (concat v_arrayElimCell_44 v_arrayElimCell_47) (let ((.cse385 (bvadd .cse27 .cse386))) (concat ((_ extract 63 32) .cse385) ((_ extract 31 0) .cse385)))))) (concat ((_ extract 63 32) .cse384) ((_ extract 31 0) .cse384))) .cse386)))) (concat ((_ extract 63 32) .cse383) ((_ extract 31 0) .cse383)))))) (concat ((_ extract 63 32) .cse382) ((_ extract 31 0) .cse382))) .cse7)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse391 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse396 (concat v_arrayElimCell_44 v_arrayElimCell_47)) (.cse390 (let ((.cse401 (bvadd .cse27 .cse391))) (concat ((_ extract 63 32) .cse401) ((_ extract 31 0) .cse401))))) (or (= (let ((.cse387 (bvadd (_ bv1 64) (let ((.cse388 (bvadd (let ((.cse389 (bvadd (concat .cse4 v_arrayElimCell_47) .cse390))) (concat ((_ extract 63 32) .cse389) ((_ extract 31 0) .cse389))) .cse391))) (concat ((_ extract 63 32) .cse388) ((_ extract 31 0) .cse388)))))) (concat ((_ extract 63 32) .cse387) ((_ extract 31 0) .cse387))) .cse7) (= (let ((.cse392 (bvadd (let ((.cse393 (let ((.cse394 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse394 (let ((.cse395 (bvadd .cse396 (let ((.cse397 (bvadd .cse27 .cse394))) (concat ((_ extract 63 32) .cse397) ((_ extract 31 0) .cse397)))))) (concat ((_ extract 63 32) .cse395) ((_ extract 31 0) .cse395))))))) (concat ((_ extract 63 32) .cse393) ((_ extract 31 0) .cse393))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse392) ((_ extract 31 0) .cse392))) .cse7) (= (let ((.cse398 (bvadd (_ bv1 64) (let ((.cse399 (bvadd (let ((.cse400 (bvadd .cse396 .cse390))) (concat ((_ extract 63 32) .cse400) ((_ extract 31 0) .cse400))) .cse391))) (concat ((_ extract 63 32) .cse399) ((_ extract 31 0) .cse399)))))) (concat ((_ extract 63 32) .cse398) ((_ extract 31 0) .cse398))) .cse7))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse406 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse411 (concat v_arrayElimCell_44 v_arrayElimCell_47)) (.cse405 (let ((.cse416 (bvadd .cse27 .cse406))) (concat ((_ extract 63 32) .cse416) ((_ extract 31 0) .cse416))))) (or (= (let ((.cse402 (bvadd (_ bv1 64) (let ((.cse403 (bvadd (let ((.cse404 (bvadd (concat .cse4 v_arrayElimCell_47) .cse405))) (concat ((_ extract 63 32) .cse404) ((_ extract 31 0) .cse404))) .cse406))) (concat ((_ extract 63 32) .cse403) ((_ extract 31 0) .cse403)))))) (concat ((_ extract 63 32) .cse402) ((_ extract 31 0) .cse402))) .cse7) (= (let ((.cse407 (bvadd (let ((.cse408 (let ((.cse409 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse409 (let ((.cse410 (bvadd .cse411 (let ((.cse412 (bvadd .cse27 .cse409))) (concat ((_ extract 63 32) .cse412) ((_ extract 31 0) .cse412)))))) (concat ((_ extract 63 32) .cse410) ((_ extract 31 0) .cse410))))))) (concat ((_ extract 63 32) .cse408) ((_ extract 31 0) .cse408))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse407) ((_ extract 31 0) .cse407))) .cse7) (= (let ((.cse413 (bvadd (_ bv1 64) (let ((.cse414 (bvadd (let ((.cse415 (bvadd .cse411 .cse405))) (concat ((_ extract 63 32) .cse415) ((_ extract 31 0) .cse415))) .cse406))) (concat ((_ extract 63 32) .cse414) ((_ extract 31 0) .cse414)))))) (concat ((_ extract 63 32) .cse413) ((_ extract 31 0) .cse413))) .cse7))))) (= (let ((.cse417 (bvadd (let ((.cse418 (bvadd (let ((.cse419 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse419) ((_ extract 31 0) .cse419))) .cse13))) (concat ((_ extract 63 32) .cse418) ((_ extract 31 0) .cse418))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse417) ((_ extract 31 0) .cse417))) .cse7))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse424 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse420 (bvadd (let ((.cse421 (let ((.cse422 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse422 (let ((.cse423 (bvadd .cse424 (let ((.cse425 (bvadd .cse27 .cse422))) (concat ((_ extract 63 32) .cse425) ((_ extract 31 0) .cse425)))))) (concat ((_ extract 63 32) .cse423) ((_ extract 31 0) .cse423))))))) (concat ((_ extract 63 32) .cse421) ((_ extract 31 0) .cse421))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse420) ((_ extract 31 0) .cse420))) .cse7) (= (let ((.cse426 (bvadd (_ bv1 64) (let ((.cse427 (let ((.cse430 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (bvadd (let ((.cse428 (bvadd .cse424 (let ((.cse429 (bvadd .cse27 .cse430))) (concat ((_ extract 63 32) .cse429) ((_ extract 31 0) .cse429)))))) (concat ((_ extract 63 32) .cse428) ((_ extract 31 0) .cse428))) .cse430)))) (concat ((_ extract 63 32) .cse427) ((_ extract 31 0) .cse427)))))) (concat ((_ extract 63 32) .cse426) ((_ extract 31 0) .cse426))) .cse7)))) (= (let ((.cse431 (bvadd (let ((.cse432 (bvadd (let ((.cse433 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse433) ((_ extract 31 0) .cse433))) .cse13))) (concat ((_ extract 63 32) .cse432) ((_ extract 31 0) .cse432))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse431) ((_ extract 31 0) .cse431))) .cse7))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse438 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse437 (let ((.cse442 (bvadd .cse27 .cse438))) (concat ((_ extract 63 32) .cse442) ((_ extract 31 0) .cse442))))) (or (= (let ((.cse434 (bvadd (_ bv1 64) (let ((.cse435 (bvadd (let ((.cse436 (bvadd (concat .cse4 v_arrayElimCell_47) .cse437))) (concat ((_ extract 63 32) .cse436) ((_ extract 31 0) .cse436))) .cse438))) (concat ((_ extract 63 32) .cse435) ((_ extract 31 0) .cse435)))))) (concat ((_ extract 63 32) .cse434) ((_ extract 31 0) .cse434))) .cse7) (= (let ((.cse439 (bvadd (_ bv1 64) (let ((.cse440 (bvadd (let ((.cse441 (bvadd (concat v_arrayElimCell_44 v_arrayElimCell_47) .cse437))) (concat ((_ extract 63 32) .cse441) ((_ extract 31 0) .cse441))) .cse438))) (concat ((_ extract 63 32) .cse440) ((_ extract 31 0) .cse440)))))) (concat ((_ extract 63 32) .cse439) ((_ extract 31 0) .cse439))) .cse7))))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse447 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse443 (bvadd (let ((.cse444 (let ((.cse445 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse445 (let ((.cse446 (bvadd .cse447 (let ((.cse448 (bvadd .cse27 .cse445))) (concat ((_ extract 63 32) .cse448) ((_ extract 31 0) .cse448)))))) (concat ((_ extract 63 32) .cse446) ((_ extract 31 0) .cse446))))))) (concat ((_ extract 63 32) .cse444) ((_ extract 31 0) .cse444))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse443) ((_ extract 31 0) .cse443))) .cse7) (= (let ((.cse449 (bvadd (_ bv1 64) (let ((.cse450 (let ((.cse453 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (bvadd (let ((.cse451 (bvadd .cse447 (let ((.cse452 (bvadd .cse27 .cse453))) (concat ((_ extract 63 32) .cse452) ((_ extract 31 0) .cse452)))))) (concat ((_ extract 63 32) .cse451) ((_ extract 31 0) .cse451))) .cse453)))) (concat ((_ extract 63 32) .cse450) ((_ extract 31 0) .cse450)))))) (concat ((_ extract 63 32) .cse449) ((_ extract 31 0) .cse449))) .cse7)))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (or (= (let ((.cse454 (bvadd (let ((.cse455 (bvadd (let ((.cse456 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse456) ((_ extract 31 0) .cse456))) .cse13))) (concat ((_ extract 63 32) .cse455) ((_ extract 31 0) .cse455))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse454) ((_ extract 31 0) .cse454))) .cse7) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse461 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse460 (let ((.cse465 (bvadd .cse27 .cse461))) (concat ((_ extract 63 32) .cse465) ((_ extract 31 0) .cse465))))) (or (= (let ((.cse457 (bvadd (_ bv1 64) (let ((.cse458 (bvadd (let ((.cse459 (bvadd (concat .cse4 v_arrayElimCell_47) .cse460))) (concat ((_ extract 63 32) .cse459) ((_ extract 31 0) .cse459))) .cse461))) (concat ((_ extract 63 32) .cse458) ((_ extract 31 0) .cse458)))))) (concat ((_ extract 63 32) .cse457) ((_ extract 31 0) .cse457))) .cse7) (= (let ((.cse462 (bvadd (_ bv1 64) (let ((.cse463 (bvadd (let ((.cse464 (bvadd (concat v_arrayElimCell_44 v_arrayElimCell_47) .cse460))) (concat ((_ extract 63 32) .cse464) ((_ extract 31 0) .cse464))) .cse461))) (concat ((_ extract 63 32) .cse463) ((_ extract 31 0) .cse463)))))) (concat ((_ extract 63 32) .cse462) ((_ extract 31 0) .cse462))) .cse7)))))))) .cse221) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse472 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse466 (bvadd (let ((.cse467 (bvadd (let ((.cse468 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse468) ((_ extract 31 0) .cse468))) .cse13))) (concat ((_ extract 63 32) .cse467) ((_ extract 31 0) .cse467))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse466) ((_ extract 31 0) .cse466))) .cse7) (= (let ((.cse469 (bvadd (_ bv1 64) (let ((.cse470 (bvadd (let ((.cse471 (bvadd .cse472 .cse18))) (concat ((_ extract 63 32) .cse471) ((_ extract 31 0) .cse471))) .cse19))) (concat ((_ extract 63 32) .cse470) ((_ extract 31 0) .cse470)))))) (concat ((_ extract 63 32) .cse469) ((_ extract 31 0) .cse469))) .cse7) (= (let ((.cse473 (bvadd (_ bv1 64) (let ((.cse474 (let ((.cse477 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (bvadd (let ((.cse475 (bvadd .cse472 (let ((.cse476 (bvadd .cse27 .cse477))) (concat ((_ extract 63 32) .cse476) ((_ extract 31 0) .cse476)))))) (concat ((_ extract 63 32) .cse475) ((_ extract 31 0) .cse475))) .cse477)))) (concat ((_ extract 63 32) .cse474) ((_ extract 31 0) .cse474)))))) (concat ((_ extract 63 32) .cse473) ((_ extract 31 0) .cse473))) .cse7)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse482 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse481 (let ((.cse493 (bvadd .cse27 .cse482))) (concat ((_ extract 63 32) .cse493) ((_ extract 31 0) .cse493))))) (or (= (let ((.cse478 (bvadd (_ bv1 64) (let ((.cse479 (bvadd (let ((.cse480 (bvadd (concat .cse4 v_arrayElimCell_47) .cse481))) (concat ((_ extract 63 32) .cse480) ((_ extract 31 0) .cse480))) .cse482))) (concat ((_ extract 63 32) .cse479) ((_ extract 31 0) .cse479)))))) (concat ((_ extract 63 32) .cse478) ((_ extract 31 0) .cse478))) .cse7) (forall ((v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse489 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse483 (bvadd (let ((.cse484 (bvadd (let ((.cse485 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse485) ((_ extract 31 0) .cse485))) .cse13))) (concat ((_ extract 63 32) .cse484) ((_ extract 31 0) .cse484))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse483) ((_ extract 31 0) .cse483))) .cse7) (= (let ((.cse486 (bvadd (_ bv1 64) (let ((.cse487 (bvadd (let ((.cse488 (bvadd .cse489 .cse18))) (concat ((_ extract 63 32) .cse488) ((_ extract 31 0) .cse488))) .cse19))) (concat ((_ extract 63 32) .cse487) ((_ extract 31 0) .cse487)))))) (concat ((_ extract 63 32) .cse486) ((_ extract 31 0) .cse486))) .cse7) (= (let ((.cse490 (bvadd (_ bv1 64) (let ((.cse491 (bvadd (let ((.cse492 (bvadd .cse489 .cse481))) (concat ((_ extract 63 32) .cse492) ((_ extract 31 0) .cse492))) .cse482))) (concat ((_ extract 63 32) .cse491) ((_ extract 31 0) .cse491)))))) (concat ((_ extract 63 32) .cse490) ((_ extract 31 0) .cse490))) .cse7))))))))) .cse494) (or .cse28 (not .cse494))))))) (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) is different from true [2023-12-21 21:11:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-21 21:11:02,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:11:02,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673469755] [2023-12-21 21:11:02,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673469755] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:11:02,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:11:02,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2023-12-21 21:11:02,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242252806] [2023-12-21 21:11:02,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:11:02,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 21:11:02,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:11:02,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 21:11:02,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=935, Unknown=2, NotChecked=62, Total=1122 [2023-12-21 21:11:02,907 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:11:08,574 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse510 (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#sum~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32)) (not (bvsle c_~N~0 (_ bv0 32))) (or (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (let ((.cse11 ((_ extract 63 32) (_ bv1 64))) (.cse4 ((_ extract 31 0) (_ bv1 64)))) (let ((.cse27 (concat (select .cse510 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (select .cse510 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (.cse19 (concat .cse11 .cse4)) (.cse495 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse13 (concat .cse4 .cse11)) (.cse221 (= (bvadd (_ bv8 32) .cse495) (_ bv0 32))) (.cse18 (let ((.cse509 (bvadd .cse27 .cse19))) (concat ((_ extract 63 32) .cse509) ((_ extract 31 0) .cse509)))) (.cse7 ((_ sign_extend 32) (bvadd c_~N~0 (_ bv2 32)))) (.cse505 (= .cse495 (_ bv0 32)))) (let ((.cse0 (and (= (let ((.cse506 (bvadd (let ((.cse507 (bvadd .cse19 (let ((.cse508 (bvadd .cse19 .cse18))) (concat ((_ extract 63 32) .cse508) ((_ extract 31 0) .cse508)))))) (concat ((_ extract 63 32) .cse507) ((_ extract 31 0) .cse507))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse506) ((_ extract 31 0) .cse506))) .cse7) .cse505)) (.cse29 (not .cse505)) (.cse99 (not .cse221)) (.cse100 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (= (let ((.cse502 (bvadd (_ bv1 64) (let ((.cse503 (bvadd (let ((.cse504 (bvadd (concat v_arrayElimCell_44 v_arrayElimCell_47) .cse18))) (concat ((_ extract 63 32) .cse504) ((_ extract 31 0) .cse504))) .cse19))) (concat ((_ extract 63 32) .cse503) ((_ extract 31 0) .cse503)))))) (concat ((_ extract 63 32) .cse502) ((_ extract 31 0) .cse502))) .cse7))) (.cse12 (let ((.cse501 (bvadd .cse27 .cse13))) (concat ((_ extract 63 32) .cse501) ((_ extract 31 0) .cse501)))) (.cse28 (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (= .cse7 (let ((.cse496 (bvadd (_ bv1 64) (let ((.cse497 (let ((.cse500 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (bvadd (let ((.cse498 (bvadd .cse19 (let ((.cse499 (bvadd .cse27 .cse500))) (concat ((_ extract 63 32) .cse499) ((_ extract 31 0) .cse499)))))) (concat ((_ extract 63 32) .cse498) ((_ extract 31 0) .cse498))) .cse500)))) (concat ((_ extract 63 32) .cse497) ((_ extract 31 0) .cse497)))))) (concat ((_ extract 63 32) .cse496) ((_ extract 31 0) .cse496)))))) (.cse494 (= (_ bv8 32) .cse495))) (and (or .cse0 (and (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse6 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse5 (let ((.cse26 (bvadd .cse27 .cse6))) (concat ((_ extract 63 32) .cse26) ((_ extract 31 0) .cse26))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (or (= (let ((.cse1 (bvadd (_ bv1 64) (let ((.cse2 (bvadd (let ((.cse3 (bvadd (concat .cse4 v_arrayElimCell_47) .cse5))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3))) .cse6))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2)))))) (concat ((_ extract 63 32) .cse1) ((_ extract 31 0) .cse1))) .cse7) (forall ((v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse17 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse8 (bvadd (let ((.cse9 (bvadd (let ((.cse10 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse10) ((_ extract 31 0) .cse10))) .cse13))) (concat ((_ extract 63 32) .cse9) ((_ extract 31 0) .cse9))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse8) ((_ extract 31 0) .cse8))) .cse7) (= (let ((.cse14 (bvadd (_ bv1 64) (let ((.cse15 (bvadd (let ((.cse16 (bvadd .cse17 .cse18))) (concat ((_ extract 63 32) .cse16) ((_ extract 31 0) .cse16))) .cse19))) (concat ((_ extract 63 32) .cse15) ((_ extract 31 0) .cse15)))))) (concat ((_ extract 63 32) .cse14) ((_ extract 31 0) .cse14))) .cse7) (= (let ((.cse20 (bvadd (_ bv1 64) (let ((.cse21 (bvadd (let ((.cse22 (bvadd .cse17 .cse5))) (concat ((_ extract 63 32) .cse22) ((_ extract 31 0) .cse22))) .cse6))) (concat ((_ extract 63 32) .cse21) ((_ extract 31 0) .cse21)))))) (concat ((_ extract 63 32) .cse20) ((_ extract 31 0) .cse20))) .cse7)))))) (= .cse7 (let ((.cse23 (bvadd (_ bv1 64) (let ((.cse24 (bvadd (let ((.cse25 (bvadd .cse19 .cse5))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25))) .cse6))) (concat ((_ extract 63 32) .cse24) ((_ extract 31 0) .cse24)))))) (concat ((_ extract 63 32) .cse23) ((_ extract 31 0) .cse23)))))))) (or .cse28 .cse29) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse34 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse33 (let ((.cse53 (bvadd .cse27 .cse34))) (concat ((_ extract 63 32) .cse53) ((_ extract 31 0) .cse53))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (or (= (let ((.cse30 (bvadd (_ bv1 64) (let ((.cse31 (bvadd (let ((.cse32 (bvadd (concat .cse4 v_arrayElimCell_47) .cse33))) (concat ((_ extract 63 32) .cse32) ((_ extract 31 0) .cse32))) .cse34))) (concat ((_ extract 63 32) .cse31) ((_ extract 31 0) .cse31)))))) (concat ((_ extract 63 32) .cse30) ((_ extract 31 0) .cse30))) .cse7) (forall ((v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse41 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse35 (bvadd (let ((.cse36 (bvadd (let ((.cse37 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse37) ((_ extract 31 0) .cse37))) .cse13))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35))) .cse7) (= (let ((.cse38 (bvadd (_ bv1 64) (let ((.cse39 (bvadd (let ((.cse40 (bvadd .cse41 .cse18))) (concat ((_ extract 63 32) .cse40) ((_ extract 31 0) .cse40))) .cse19))) (concat ((_ extract 63 32) .cse39) ((_ extract 31 0) .cse39)))))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38))) .cse7) (= (let ((.cse42 (bvadd (let ((.cse43 (let ((.cse44 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse44 (let ((.cse45 (bvadd .cse41 (let ((.cse46 (bvadd .cse27 .cse44))) (concat ((_ extract 63 32) .cse46) ((_ extract 31 0) .cse46)))))) (concat ((_ extract 63 32) .cse45) ((_ extract 31 0) .cse45))))))) (concat ((_ extract 63 32) .cse43) ((_ extract 31 0) .cse43))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse42) ((_ extract 31 0) .cse42))) .cse7) (= (let ((.cse47 (bvadd (_ bv1 64) (let ((.cse48 (bvadd (let ((.cse49 (bvadd .cse41 .cse33))) (concat ((_ extract 63 32) .cse49) ((_ extract 31 0) .cse49))) .cse34))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48)))))) (concat ((_ extract 63 32) .cse47) ((_ extract 31 0) .cse47))) .cse7)))))) (= .cse7 (let ((.cse50 (bvadd (_ bv1 64) (let ((.cse51 (bvadd (let ((.cse52 (bvadd .cse19 .cse33))) (concat ((_ extract 63 32) .cse52) ((_ extract 31 0) .cse52))) .cse34))) (concat ((_ extract 63 32) .cse51) ((_ extract 31 0) .cse51)))))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse62 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse61 (let ((.cse66 (bvadd .cse27 .cse62))) (concat ((_ extract 63 32) .cse66) ((_ extract 31 0) .cse66))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse57 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse54 (bvadd (_ bv1 64) (let ((.cse55 (bvadd (let ((.cse56 (bvadd .cse57 .cse18))) (concat ((_ extract 63 32) .cse56) ((_ extract 31 0) .cse56))) .cse19))) (concat ((_ extract 63 32) .cse55) ((_ extract 31 0) .cse55)))))) (concat ((_ extract 63 32) .cse54) ((_ extract 31 0) .cse54))) .cse7) (= (let ((.cse58 (bvadd (_ bv1 64) (let ((.cse59 (bvadd (let ((.cse60 (bvadd .cse57 .cse61))) (concat ((_ extract 63 32) .cse60) ((_ extract 31 0) .cse60))) .cse62))) (concat ((_ extract 63 32) .cse59) ((_ extract 31 0) .cse59)))))) (concat ((_ extract 63 32) .cse58) ((_ extract 31 0) .cse58))) .cse7)))) (= .cse7 (let ((.cse63 (bvadd (_ bv1 64) (let ((.cse64 (bvadd (let ((.cse65 (bvadd .cse19 .cse61))) (concat ((_ extract 63 32) .cse65) ((_ extract 31 0) .cse65))) .cse62))) (concat ((_ extract 63 32) .cse64) ((_ extract 31 0) .cse64)))))) (concat ((_ extract 63 32) .cse63) ((_ extract 31 0) .cse63)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse71 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse70 (let ((.cse82 (bvadd .cse27 .cse71))) (concat ((_ extract 63 32) .cse82) ((_ extract 31 0) .cse82))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (or (= (let ((.cse67 (bvadd (_ bv1 64) (let ((.cse68 (bvadd (let ((.cse69 (bvadd (concat .cse4 v_arrayElimCell_47) .cse70))) (concat ((_ extract 63 32) .cse69) ((_ extract 31 0) .cse69))) .cse71))) (concat ((_ extract 63 32) .cse68) ((_ extract 31 0) .cse68)))))) (concat ((_ extract 63 32) .cse67) ((_ extract 31 0) .cse67))) .cse7) (forall ((v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse75 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse72 (bvadd (_ bv1 64) (let ((.cse73 (bvadd (let ((.cse74 (bvadd .cse75 .cse18))) (concat ((_ extract 63 32) .cse74) ((_ extract 31 0) .cse74))) .cse19))) (concat ((_ extract 63 32) .cse73) ((_ extract 31 0) .cse73)))))) (concat ((_ extract 63 32) .cse72) ((_ extract 31 0) .cse72))) .cse7) (= (let ((.cse76 (bvadd (_ bv1 64) (let ((.cse77 (bvadd (let ((.cse78 (bvadd .cse75 .cse70))) (concat ((_ extract 63 32) .cse78) ((_ extract 31 0) .cse78))) .cse71))) (concat ((_ extract 63 32) .cse77) ((_ extract 31 0) .cse77)))))) (concat ((_ extract 63 32) .cse76) ((_ extract 31 0) .cse76))) .cse7)))))) (= .cse7 (let ((.cse79 (bvadd (_ bv1 64) (let ((.cse80 (bvadd (let ((.cse81 (bvadd .cse19 .cse70))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81))) .cse71))) (concat ((_ extract 63 32) .cse80) ((_ extract 31 0) .cse80)))))) (concat ((_ extract 63 32) .cse79) ((_ extract 31 0) .cse79)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse94 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse93 (let ((.cse98 (bvadd .cse27 .cse94))) (concat ((_ extract 63 32) .cse98) ((_ extract 31 0) .cse98))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse89 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse83 (bvadd (let ((.cse84 (bvadd (let ((.cse85 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse85) ((_ extract 31 0) .cse85))) .cse13))) (concat ((_ extract 63 32) .cse84) ((_ extract 31 0) .cse84))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse83) ((_ extract 31 0) .cse83))) .cse7) (= (let ((.cse86 (bvadd (_ bv1 64) (let ((.cse87 (bvadd (let ((.cse88 (bvadd .cse89 .cse18))) (concat ((_ extract 63 32) .cse88) ((_ extract 31 0) .cse88))) .cse19))) (concat ((_ extract 63 32) .cse87) ((_ extract 31 0) .cse87)))))) (concat ((_ extract 63 32) .cse86) ((_ extract 31 0) .cse86))) .cse7) (= (let ((.cse90 (bvadd (_ bv1 64) (let ((.cse91 (bvadd (let ((.cse92 (bvadd .cse89 .cse93))) (concat ((_ extract 63 32) .cse92) ((_ extract 31 0) .cse92))) .cse94))) (concat ((_ extract 63 32) .cse91) ((_ extract 31 0) .cse91)))))) (concat ((_ extract 63 32) .cse90) ((_ extract 31 0) .cse90))) .cse7)))) (= .cse7 (let ((.cse95 (bvadd (_ bv1 64) (let ((.cse96 (bvadd (let ((.cse97 (bvadd .cse19 .cse93))) (concat ((_ extract 63 32) .cse97) ((_ extract 31 0) .cse97))) .cse94))) (concat ((_ extract 63 32) .cse96) ((_ extract 31 0) .cse96)))))) (concat ((_ extract 63 32) .cse95) ((_ extract 31 0) .cse95)))))))) (or .cse28 .cse99 .cse100) (or (and (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse108 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse107 (let ((.cse115 (bvadd .cse27 .cse108))) (concat ((_ extract 63 32) .cse115) ((_ extract 31 0) .cse115))))) (or (forall ((v_arrayElimCell_44 (_ BitVec 32))) (or (= (let ((.cse101 (bvadd (let ((.cse102 (bvadd (let ((.cse103 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse103) ((_ extract 31 0) .cse103))) .cse13))) (concat ((_ extract 63 32) .cse102) ((_ extract 31 0) .cse102))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse101) ((_ extract 31 0) .cse101))) .cse7) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (or (= (let ((.cse104 (bvadd (_ bv1 64) (let ((.cse105 (bvadd (let ((.cse106 (bvadd (concat .cse4 v_arrayElimCell_47) .cse107))) (concat ((_ extract 63 32) .cse106) ((_ extract 31 0) .cse106))) .cse108))) (concat ((_ extract 63 32) .cse105) ((_ extract 31 0) .cse105)))))) (concat ((_ extract 63 32) .cse104) ((_ extract 31 0) .cse104))) .cse7) (= (let ((.cse109 (bvadd (_ bv1 64) (let ((.cse110 (bvadd (let ((.cse111 (bvadd (concat v_arrayElimCell_44 v_arrayElimCell_47) .cse107))) (concat ((_ extract 63 32) .cse111) ((_ extract 31 0) .cse111))) .cse108))) (concat ((_ extract 63 32) .cse110) ((_ extract 31 0) .cse110)))))) (concat ((_ extract 63 32) .cse109) ((_ extract 31 0) .cse109))) .cse7))))) (= .cse7 (let ((.cse112 (bvadd (_ bv1 64) (let ((.cse113 (bvadd (let ((.cse114 (bvadd .cse19 .cse107))) (concat ((_ extract 63 32) .cse114) ((_ extract 31 0) .cse114))) .cse108))) (concat ((_ extract 63 32) .cse113) ((_ extract 31 0) .cse113)))))) (concat ((_ extract 63 32) .cse112) ((_ extract 31 0) .cse112)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse120 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse119 (let ((.cse124 (bvadd .cse27 .cse120))) (concat ((_ extract 63 32) .cse124) ((_ extract 31 0) .cse124))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (= (let ((.cse116 (bvadd (_ bv1 64) (let ((.cse117 (bvadd (let ((.cse118 (bvadd (concat v_arrayElimCell_44 v_arrayElimCell_47) .cse119))) (concat ((_ extract 63 32) .cse118) ((_ extract 31 0) .cse118))) .cse120))) (concat ((_ extract 63 32) .cse117) ((_ extract 31 0) .cse117)))))) (concat ((_ extract 63 32) .cse116) ((_ extract 31 0) .cse116))) .cse7)) (= .cse7 (let ((.cse121 (bvadd (_ bv1 64) (let ((.cse122 (bvadd (let ((.cse123 (bvadd .cse19 .cse119))) (concat ((_ extract 63 32) .cse123) ((_ extract 31 0) .cse123))) .cse120))) (concat ((_ extract 63 32) .cse122) ((_ extract 31 0) .cse122)))))) (concat ((_ extract 63 32) .cse121) ((_ extract 31 0) .cse121)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse135 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse134 (let ((.cse142 (bvadd .cse27 .cse135))) (concat ((_ extract 63 32) .cse142) ((_ extract 31 0) .cse142))))) (or (forall ((v_arrayElimCell_44 (_ BitVec 32))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse129 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse125 (bvadd (let ((.cse126 (let ((.cse127 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse127 (let ((.cse128 (bvadd .cse129 (let ((.cse130 (bvadd .cse27 .cse127))) (concat ((_ extract 63 32) .cse130) ((_ extract 31 0) .cse130)))))) (concat ((_ extract 63 32) .cse128) ((_ extract 31 0) .cse128))))))) (concat ((_ extract 63 32) .cse126) ((_ extract 31 0) .cse126))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse125) ((_ extract 31 0) .cse125))) .cse7) (= (let ((.cse131 (bvadd (_ bv1 64) (let ((.cse132 (bvadd (let ((.cse133 (bvadd .cse129 .cse134))) (concat ((_ extract 63 32) .cse133) ((_ extract 31 0) .cse133))) .cse135))) (concat ((_ extract 63 32) .cse132) ((_ extract 31 0) .cse132)))))) (concat ((_ extract 63 32) .cse131) ((_ extract 31 0) .cse131))) .cse7)))) (= (let ((.cse136 (bvadd (let ((.cse137 (bvadd (let ((.cse138 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse138) ((_ extract 31 0) .cse138))) .cse13))) (concat ((_ extract 63 32) .cse137) ((_ extract 31 0) .cse137))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse136) ((_ extract 31 0) .cse136))) .cse7))) (= .cse7 (let ((.cse139 (bvadd (_ bv1 64) (let ((.cse140 (bvadd (let ((.cse141 (bvadd .cse19 .cse134))) (concat ((_ extract 63 32) .cse141) ((_ extract 31 0) .cse141))) .cse135))) (concat ((_ extract 63 32) .cse140) ((_ extract 31 0) .cse140)))))) (concat ((_ extract 63 32) .cse139) ((_ extract 31 0) .cse139)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse147 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse146 (let ((.cse154 (bvadd .cse27 .cse147))) (concat ((_ extract 63 32) .cse154) ((_ extract 31 0) .cse154))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (or (= (let ((.cse143 (bvadd (_ bv1 64) (let ((.cse144 (bvadd (let ((.cse145 (bvadd (concat .cse4 v_arrayElimCell_47) .cse146))) (concat ((_ extract 63 32) .cse145) ((_ extract 31 0) .cse145))) .cse147))) (concat ((_ extract 63 32) .cse144) ((_ extract 31 0) .cse144)))))) (concat ((_ extract 63 32) .cse143) ((_ extract 31 0) .cse143))) .cse7) (= (let ((.cse148 (bvadd (_ bv1 64) (let ((.cse149 (bvadd (let ((.cse150 (bvadd (concat v_arrayElimCell_44 v_arrayElimCell_47) .cse146))) (concat ((_ extract 63 32) .cse150) ((_ extract 31 0) .cse150))) .cse147))) (concat ((_ extract 63 32) .cse149) ((_ extract 31 0) .cse149)))))) (concat ((_ extract 63 32) .cse148) ((_ extract 31 0) .cse148))) .cse7))) (= .cse7 (let ((.cse151 (bvadd (_ bv1 64) (let ((.cse152 (bvadd (let ((.cse153 (bvadd .cse19 .cse146))) (concat ((_ extract 63 32) .cse153) ((_ extract 31 0) .cse153))) .cse147))) (concat ((_ extract 63 32) .cse152) ((_ extract 31 0) .cse152)))))) (concat ((_ extract 63 32) .cse151) ((_ extract 31 0) .cse151)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse165 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse164 (let ((.cse169 (bvadd .cse27 .cse165))) (concat ((_ extract 63 32) .cse169) ((_ extract 31 0) .cse169))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse159 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse155 (bvadd (let ((.cse156 (let ((.cse157 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse157 (let ((.cse158 (bvadd .cse159 (let ((.cse160 (bvadd .cse27 .cse157))) (concat ((_ extract 63 32) .cse160) ((_ extract 31 0) .cse160)))))) (concat ((_ extract 63 32) .cse158) ((_ extract 31 0) .cse158))))))) (concat ((_ extract 63 32) .cse156) ((_ extract 31 0) .cse156))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse155) ((_ extract 31 0) .cse155))) .cse7) (= (let ((.cse161 (bvadd (_ bv1 64) (let ((.cse162 (bvadd (let ((.cse163 (bvadd .cse159 .cse164))) (concat ((_ extract 63 32) .cse163) ((_ extract 31 0) .cse163))) .cse165))) (concat ((_ extract 63 32) .cse162) ((_ extract 31 0) .cse162)))))) (concat ((_ extract 63 32) .cse161) ((_ extract 31 0) .cse161))) .cse7)))) (= .cse7 (let ((.cse166 (bvadd (_ bv1 64) (let ((.cse167 (bvadd (let ((.cse168 (bvadd .cse19 .cse164))) (concat ((_ extract 63 32) .cse168) ((_ extract 31 0) .cse168))) .cse165))) (concat ((_ extract 63 32) .cse167) ((_ extract 31 0) .cse167)))))) (concat ((_ extract 63 32) .cse166) ((_ extract 31 0) .cse166)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse174 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse173 (let ((.cse190 (bvadd .cse27 .cse174))) (concat ((_ extract 63 32) .cse190) ((_ extract 31 0) .cse190))))) (or (forall ((v_arrayElimCell_44 (_ BitVec 32))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse179 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse170 (bvadd (_ bv1 64) (let ((.cse171 (bvadd (let ((.cse172 (bvadd (concat .cse4 v_arrayElimCell_47) .cse173))) (concat ((_ extract 63 32) .cse172) ((_ extract 31 0) .cse172))) .cse174))) (concat ((_ extract 63 32) .cse171) ((_ extract 31 0) .cse171)))))) (concat ((_ extract 63 32) .cse170) ((_ extract 31 0) .cse170))) .cse7) (= (let ((.cse175 (bvadd (let ((.cse176 (let ((.cse177 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse177 (let ((.cse178 (bvadd .cse179 (let ((.cse180 (bvadd .cse27 .cse177))) (concat ((_ extract 63 32) .cse180) ((_ extract 31 0) .cse180)))))) (concat ((_ extract 63 32) .cse178) ((_ extract 31 0) .cse178))))))) (concat ((_ extract 63 32) .cse176) ((_ extract 31 0) .cse176))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse175) ((_ extract 31 0) .cse175))) .cse7) (= (let ((.cse181 (bvadd (_ bv1 64) (let ((.cse182 (bvadd (let ((.cse183 (bvadd .cse179 .cse173))) (concat ((_ extract 63 32) .cse183) ((_ extract 31 0) .cse183))) .cse174))) (concat ((_ extract 63 32) .cse182) ((_ extract 31 0) .cse182)))))) (concat ((_ extract 63 32) .cse181) ((_ extract 31 0) .cse181))) .cse7)))) (= (let ((.cse184 (bvadd (let ((.cse185 (bvadd (let ((.cse186 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse186) ((_ extract 31 0) .cse186))) .cse13))) (concat ((_ extract 63 32) .cse185) ((_ extract 31 0) .cse185))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse184) ((_ extract 31 0) .cse184))) .cse7))) (= .cse7 (let ((.cse187 (bvadd (_ bv1 64) (let ((.cse188 (bvadd (let ((.cse189 (bvadd .cse19 .cse173))) (concat ((_ extract 63 32) .cse189) ((_ extract 31 0) .cse189))) .cse174))) (concat ((_ extract 63 32) .cse188) ((_ extract 31 0) .cse188)))))) (concat ((_ extract 63 32) .cse187) ((_ extract 31 0) .cse187)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse195 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse194 (let ((.cse208 (bvadd .cse27 .cse195))) (concat ((_ extract 63 32) .cse208) ((_ extract 31 0) .cse208))))) (or (= .cse7 (let ((.cse191 (bvadd (_ bv1 64) (let ((.cse192 (bvadd (let ((.cse193 (bvadd .cse19 .cse194))) (concat ((_ extract 63 32) .cse193) ((_ extract 31 0) .cse193))) .cse195))) (concat ((_ extract 63 32) .cse192) ((_ extract 31 0) .cse192)))))) (concat ((_ extract 63 32) .cse191) ((_ extract 31 0) .cse191)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse203 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse196 (bvadd (_ bv1 64) (let ((.cse197 (bvadd (let ((.cse198 (bvadd (concat .cse4 v_arrayElimCell_47) .cse194))) (concat ((_ extract 63 32) .cse198) ((_ extract 31 0) .cse198))) .cse195))) (concat ((_ extract 63 32) .cse197) ((_ extract 31 0) .cse197)))))) (concat ((_ extract 63 32) .cse196) ((_ extract 31 0) .cse196))) .cse7) (= (let ((.cse199 (bvadd (let ((.cse200 (let ((.cse201 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse201 (let ((.cse202 (bvadd .cse203 (let ((.cse204 (bvadd .cse27 .cse201))) (concat ((_ extract 63 32) .cse204) ((_ extract 31 0) .cse204)))))) (concat ((_ extract 63 32) .cse202) ((_ extract 31 0) .cse202))))))) (concat ((_ extract 63 32) .cse200) ((_ extract 31 0) .cse200))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse199) ((_ extract 31 0) .cse199))) .cse7) (= (let ((.cse205 (bvadd (_ bv1 64) (let ((.cse206 (bvadd (let ((.cse207 (bvadd .cse203 .cse194))) (concat ((_ extract 63 32) .cse207) ((_ extract 31 0) .cse207))) .cse195))) (concat ((_ extract 63 32) .cse206) ((_ extract 31 0) .cse206)))))) (concat ((_ extract 63 32) .cse205) ((_ extract 31 0) .cse205))) .cse7)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse216 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse215 (let ((.cse220 (bvadd .cse27 .cse216))) (concat ((_ extract 63 32) .cse220) ((_ extract 31 0) .cse220))))) (or (forall ((v_arrayElimCell_44 (_ BitVec 32))) (or (= (let ((.cse209 (bvadd (let ((.cse210 (bvadd (let ((.cse211 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse211) ((_ extract 31 0) .cse211))) .cse13))) (concat ((_ extract 63 32) .cse210) ((_ extract 31 0) .cse210))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse209) ((_ extract 31 0) .cse209))) .cse7) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= (let ((.cse212 (bvadd (_ bv1 64) (let ((.cse213 (bvadd (let ((.cse214 (bvadd (concat v_arrayElimCell_44 v_arrayElimCell_47) .cse215))) (concat ((_ extract 63 32) .cse214) ((_ extract 31 0) .cse214))) .cse216))) (concat ((_ extract 63 32) .cse213) ((_ extract 31 0) .cse213)))))) (concat ((_ extract 63 32) .cse212) ((_ extract 31 0) .cse212))) .cse7)))) (= .cse7 (let ((.cse217 (bvadd (_ bv1 64) (let ((.cse218 (bvadd (let ((.cse219 (bvadd .cse19 .cse215))) (concat ((_ extract 63 32) .cse219) ((_ extract 31 0) .cse219))) .cse216))) (concat ((_ extract 63 32) .cse218) ((_ extract 31 0) .cse218)))))) (concat ((_ extract 63 32) .cse217) ((_ extract 31 0) .cse217))))))))) .cse221) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse235 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse234 (let ((.cse239 (bvadd .cse27 .cse235))) (concat ((_ extract 63 32) .cse239) ((_ extract 31 0) .cse239))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse225 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse222 (bvadd (_ bv1 64) (let ((.cse223 (bvadd (let ((.cse224 (bvadd .cse225 .cse18))) (concat ((_ extract 63 32) .cse224) ((_ extract 31 0) .cse224))) .cse19))) (concat ((_ extract 63 32) .cse223) ((_ extract 31 0) .cse223)))))) (concat ((_ extract 63 32) .cse222) ((_ extract 31 0) .cse222))) .cse7) (= (let ((.cse226 (bvadd (let ((.cse227 (let ((.cse228 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse228 (let ((.cse229 (bvadd .cse225 (let ((.cse230 (bvadd .cse27 .cse228))) (concat ((_ extract 63 32) .cse230) ((_ extract 31 0) .cse230)))))) (concat ((_ extract 63 32) .cse229) ((_ extract 31 0) .cse229))))))) (concat ((_ extract 63 32) .cse227) ((_ extract 31 0) .cse227))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse226) ((_ extract 31 0) .cse226))) .cse7) (= (let ((.cse231 (bvadd (_ bv1 64) (let ((.cse232 (bvadd (let ((.cse233 (bvadd .cse225 .cse234))) (concat ((_ extract 63 32) .cse233) ((_ extract 31 0) .cse233))) .cse235))) (concat ((_ extract 63 32) .cse232) ((_ extract 31 0) .cse232)))))) (concat ((_ extract 63 32) .cse231) ((_ extract 31 0) .cse231))) .cse7)))) (= .cse7 (let ((.cse236 (bvadd (_ bv1 64) (let ((.cse237 (bvadd (let ((.cse238 (bvadd .cse19 .cse234))) (concat ((_ extract 63 32) .cse238) ((_ extract 31 0) .cse238))) .cse235))) (concat ((_ extract 63 32) .cse237) ((_ extract 31 0) .cse237)))))) (concat ((_ extract 63 32) .cse236) ((_ extract 31 0) .cse236)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse244 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse243 (let ((.cse260 (bvadd .cse27 .cse244))) (concat ((_ extract 63 32) .cse260) ((_ extract 31 0) .cse260))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (or (= (let ((.cse240 (bvadd (_ bv1 64) (let ((.cse241 (bvadd (let ((.cse242 (bvadd (concat .cse4 v_arrayElimCell_47) .cse243))) (concat ((_ extract 63 32) .cse242) ((_ extract 31 0) .cse242))) .cse244))) (concat ((_ extract 63 32) .cse241) ((_ extract 31 0) .cse241)))))) (concat ((_ extract 63 32) .cse240) ((_ extract 31 0) .cse240))) .cse7) (forall ((v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse248 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse245 (bvadd (_ bv1 64) (let ((.cse246 (bvadd (let ((.cse247 (bvadd .cse248 .cse18))) (concat ((_ extract 63 32) .cse247) ((_ extract 31 0) .cse247))) .cse19))) (concat ((_ extract 63 32) .cse246) ((_ extract 31 0) .cse246)))))) (concat ((_ extract 63 32) .cse245) ((_ extract 31 0) .cse245))) .cse7) (= (let ((.cse249 (bvadd (let ((.cse250 (let ((.cse251 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse251 (let ((.cse252 (bvadd .cse248 (let ((.cse253 (bvadd .cse27 .cse251))) (concat ((_ extract 63 32) .cse253) ((_ extract 31 0) .cse253)))))) (concat ((_ extract 63 32) .cse252) ((_ extract 31 0) .cse252))))))) (concat ((_ extract 63 32) .cse250) ((_ extract 31 0) .cse250))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse249) ((_ extract 31 0) .cse249))) .cse7) (= (let ((.cse254 (bvadd (_ bv1 64) (let ((.cse255 (bvadd (let ((.cse256 (bvadd .cse248 .cse243))) (concat ((_ extract 63 32) .cse256) ((_ extract 31 0) .cse256))) .cse244))) (concat ((_ extract 63 32) .cse255) ((_ extract 31 0) .cse255)))))) (concat ((_ extract 63 32) .cse254) ((_ extract 31 0) .cse254))) .cse7)))))) (= .cse7 (let ((.cse257 (bvadd (_ bv1 64) (let ((.cse258 (bvadd (let ((.cse259 (bvadd .cse19 .cse243))) (concat ((_ extract 63 32) .cse259) ((_ extract 31 0) .cse259))) .cse244))) (concat ((_ extract 63 32) .cse258) ((_ extract 31 0) .cse258)))))) (concat ((_ extract 63 32) .cse257) ((_ extract 31 0) .cse257)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse277 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse276 (let ((.cse281 (bvadd .cse27 .cse277))) (concat ((_ extract 63 32) .cse281) ((_ extract 31 0) .cse281))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse267 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse261 (bvadd (let ((.cse262 (bvadd (let ((.cse263 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse263) ((_ extract 31 0) .cse263))) .cse13))) (concat ((_ extract 63 32) .cse262) ((_ extract 31 0) .cse262))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse261) ((_ extract 31 0) .cse261))) .cse7) (= (let ((.cse264 (bvadd (_ bv1 64) (let ((.cse265 (bvadd (let ((.cse266 (bvadd .cse267 .cse18))) (concat ((_ extract 63 32) .cse266) ((_ extract 31 0) .cse266))) .cse19))) (concat ((_ extract 63 32) .cse265) ((_ extract 31 0) .cse265)))))) (concat ((_ extract 63 32) .cse264) ((_ extract 31 0) .cse264))) .cse7) (= (let ((.cse268 (bvadd (let ((.cse269 (let ((.cse270 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse270 (let ((.cse271 (bvadd .cse267 (let ((.cse272 (bvadd .cse27 .cse270))) (concat ((_ extract 63 32) .cse272) ((_ extract 31 0) .cse272)))))) (concat ((_ extract 63 32) .cse271) ((_ extract 31 0) .cse271))))))) (concat ((_ extract 63 32) .cse269) ((_ extract 31 0) .cse269))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse268) ((_ extract 31 0) .cse268))) .cse7) (= (let ((.cse273 (bvadd (_ bv1 64) (let ((.cse274 (bvadd (let ((.cse275 (bvadd .cse267 .cse276))) (concat ((_ extract 63 32) .cse275) ((_ extract 31 0) .cse275))) .cse277))) (concat ((_ extract 63 32) .cse274) ((_ extract 31 0) .cse274)))))) (concat ((_ extract 63 32) .cse273) ((_ extract 31 0) .cse273))) .cse7)))) (= .cse7 (let ((.cse278 (bvadd (_ bv1 64) (let ((.cse279 (bvadd (let ((.cse280 (bvadd .cse19 .cse276))) (concat ((_ extract 63 32) .cse280) ((_ extract 31 0) .cse280))) .cse277))) (concat ((_ extract 63 32) .cse279) ((_ extract 31 0) .cse279)))))) (concat ((_ extract 63 32) .cse278) ((_ extract 31 0) .cse278)))))))))) (or .cse0 (and (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse285 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse282 (bvadd (_ bv1 64) (let ((.cse283 (bvadd (let ((.cse284 (bvadd .cse285 .cse18))) (concat ((_ extract 63 32) .cse284) ((_ extract 31 0) .cse284))) .cse19))) (concat ((_ extract 63 32) .cse283) ((_ extract 31 0) .cse283)))))) (concat ((_ extract 63 32) .cse282) ((_ extract 31 0) .cse282))) .cse7) (= (let ((.cse286 (bvadd (let ((.cse287 (let ((.cse288 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse288 (let ((.cse289 (bvadd .cse285 (let ((.cse290 (bvadd .cse27 .cse288))) (concat ((_ extract 63 32) .cse290) ((_ extract 31 0) .cse290)))))) (concat ((_ extract 63 32) .cse289) ((_ extract 31 0) .cse289))))))) (concat ((_ extract 63 32) .cse287) ((_ extract 31 0) .cse287))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse286) ((_ extract 31 0) .cse286))) .cse7) (= (let ((.cse291 (bvadd (_ bv1 64) (let ((.cse292 (let ((.cse295 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (bvadd (let ((.cse293 (bvadd .cse285 (let ((.cse294 (bvadd .cse27 .cse295))) (concat ((_ extract 63 32) .cse294) ((_ extract 31 0) .cse294)))))) (concat ((_ extract 63 32) .cse293) ((_ extract 31 0) .cse293))) .cse295)))) (concat ((_ extract 63 32) .cse292) ((_ extract 31 0) .cse292)))))) (concat ((_ extract 63 32) .cse291) ((_ extract 31 0) .cse291))) .cse7)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse302 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse296 (bvadd (let ((.cse297 (bvadd (let ((.cse298 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse298) ((_ extract 31 0) .cse298))) .cse13))) (concat ((_ extract 63 32) .cse297) ((_ extract 31 0) .cse297))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse296) ((_ extract 31 0) .cse296))) .cse7) (= (let ((.cse299 (bvadd (_ bv1 64) (let ((.cse300 (bvadd (let ((.cse301 (bvadd .cse302 .cse18))) (concat ((_ extract 63 32) .cse301) ((_ extract 31 0) .cse301))) .cse19))) (concat ((_ extract 63 32) .cse300) ((_ extract 31 0) .cse300)))))) (concat ((_ extract 63 32) .cse299) ((_ extract 31 0) .cse299))) .cse7) (= (let ((.cse303 (bvadd (let ((.cse304 (let ((.cse305 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse305 (let ((.cse306 (bvadd .cse302 (let ((.cse307 (bvadd .cse27 .cse305))) (concat ((_ extract 63 32) .cse307) ((_ extract 31 0) .cse307)))))) (concat ((_ extract 63 32) .cse306) ((_ extract 31 0) .cse306))))))) (concat ((_ extract 63 32) .cse304) ((_ extract 31 0) .cse304))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse303) ((_ extract 31 0) .cse303))) .cse7) (= (let ((.cse308 (bvadd (_ bv1 64) (let ((.cse309 (let ((.cse312 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (bvadd (let ((.cse310 (bvadd .cse302 (let ((.cse311 (bvadd .cse27 .cse312))) (concat ((_ extract 63 32) .cse311) ((_ extract 31 0) .cse311)))))) (concat ((_ extract 63 32) .cse310) ((_ extract 31 0) .cse310))) .cse312)))) (concat ((_ extract 63 32) .cse309) ((_ extract 31 0) .cse309)))))) (concat ((_ extract 63 32) .cse308) ((_ extract 31 0) .cse308))) .cse7)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse317 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse316 (let ((.cse330 (bvadd .cse27 .cse317))) (concat ((_ extract 63 32) .cse330) ((_ extract 31 0) .cse330))))) (or (= (let ((.cse313 (bvadd (_ bv1 64) (let ((.cse314 (bvadd (let ((.cse315 (bvadd (concat .cse4 v_arrayElimCell_47) .cse316))) (concat ((_ extract 63 32) .cse315) ((_ extract 31 0) .cse315))) .cse317))) (concat ((_ extract 63 32) .cse314) ((_ extract 31 0) .cse314)))))) (concat ((_ extract 63 32) .cse313) ((_ extract 31 0) .cse313))) .cse7) (forall ((v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse321 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse318 (bvadd (_ bv1 64) (let ((.cse319 (bvadd (let ((.cse320 (bvadd .cse321 .cse18))) (concat ((_ extract 63 32) .cse320) ((_ extract 31 0) .cse320))) .cse19))) (concat ((_ extract 63 32) .cse319) ((_ extract 31 0) .cse319)))))) (concat ((_ extract 63 32) .cse318) ((_ extract 31 0) .cse318))) .cse7) (= (let ((.cse322 (bvadd (let ((.cse323 (let ((.cse324 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse324 (let ((.cse325 (bvadd .cse321 (let ((.cse326 (bvadd .cse27 .cse324))) (concat ((_ extract 63 32) .cse326) ((_ extract 31 0) .cse326)))))) (concat ((_ extract 63 32) .cse325) ((_ extract 31 0) .cse325))))))) (concat ((_ extract 63 32) .cse323) ((_ extract 31 0) .cse323))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse322) ((_ extract 31 0) .cse322))) .cse7) (= (let ((.cse327 (bvadd (_ bv1 64) (let ((.cse328 (bvadd (let ((.cse329 (bvadd .cse321 .cse316))) (concat ((_ extract 63 32) .cse329) ((_ extract 31 0) .cse329))) .cse317))) (concat ((_ extract 63 32) .cse328) ((_ extract 31 0) .cse328)))))) (concat ((_ extract 63 32) .cse327) ((_ extract 31 0) .cse327))) .cse7)))))))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse335 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse334 (let ((.cse343 (bvadd .cse27 .cse335))) (concat ((_ extract 63 32) .cse343) ((_ extract 31 0) .cse343))))) (or (= (let ((.cse331 (bvadd (_ bv1 64) (let ((.cse332 (bvadd (let ((.cse333 (bvadd (concat .cse4 v_arrayElimCell_47) .cse334))) (concat ((_ extract 63 32) .cse333) ((_ extract 31 0) .cse333))) .cse335))) (concat ((_ extract 63 32) .cse332) ((_ extract 31 0) .cse332)))))) (concat ((_ extract 63 32) .cse331) ((_ extract 31 0) .cse331))) .cse7) (forall ((v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse339 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse336 (bvadd (_ bv1 64) (let ((.cse337 (bvadd (let ((.cse338 (bvadd .cse339 .cse18))) (concat ((_ extract 63 32) .cse338) ((_ extract 31 0) .cse338))) .cse19))) (concat ((_ extract 63 32) .cse337) ((_ extract 31 0) .cse337)))))) (concat ((_ extract 63 32) .cse336) ((_ extract 31 0) .cse336))) .cse7) (= (let ((.cse340 (bvadd (_ bv1 64) (let ((.cse341 (bvadd (let ((.cse342 (bvadd .cse339 .cse334))) (concat ((_ extract 63 32) .cse342) ((_ extract 31 0) .cse342))) .cse335))) (concat ((_ extract 63 32) .cse341) ((_ extract 31 0) .cse341)))))) (concat ((_ extract 63 32) .cse340) ((_ extract 31 0) .cse340))) .cse7)))))))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse347 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse344 (bvadd (_ bv1 64) (let ((.cse345 (bvadd (let ((.cse346 (bvadd .cse347 .cse18))) (concat ((_ extract 63 32) .cse346) ((_ extract 31 0) .cse346))) .cse19))) (concat ((_ extract 63 32) .cse345) ((_ extract 31 0) .cse345)))))) (concat ((_ extract 63 32) .cse344) ((_ extract 31 0) .cse344))) .cse7) (= (let ((.cse348 (bvadd (_ bv1 64) (let ((.cse349 (let ((.cse352 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (bvadd (let ((.cse350 (bvadd .cse347 (let ((.cse351 (bvadd .cse27 .cse352))) (concat ((_ extract 63 32) .cse351) ((_ extract 31 0) .cse351)))))) (concat ((_ extract 63 32) .cse350) ((_ extract 31 0) .cse350))) .cse352)))) (concat ((_ extract 63 32) .cse349) ((_ extract 31 0) .cse349)))))) (concat ((_ extract 63 32) .cse348) ((_ extract 31 0) .cse348))) .cse7)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse357 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse356 (let ((.cse373 (bvadd .cse27 .cse357))) (concat ((_ extract 63 32) .cse373) ((_ extract 31 0) .cse373))))) (or (= (let ((.cse353 (bvadd (_ bv1 64) (let ((.cse354 (bvadd (let ((.cse355 (bvadd (concat .cse4 v_arrayElimCell_47) .cse356))) (concat ((_ extract 63 32) .cse355) ((_ extract 31 0) .cse355))) .cse357))) (concat ((_ extract 63 32) .cse354) ((_ extract 31 0) .cse354)))))) (concat ((_ extract 63 32) .cse353) ((_ extract 31 0) .cse353))) .cse7) (forall ((v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse364 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse358 (bvadd (let ((.cse359 (bvadd (let ((.cse360 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse360) ((_ extract 31 0) .cse360))) .cse13))) (concat ((_ extract 63 32) .cse359) ((_ extract 31 0) .cse359))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse358) ((_ extract 31 0) .cse358))) .cse7) (= (let ((.cse361 (bvadd (_ bv1 64) (let ((.cse362 (bvadd (let ((.cse363 (bvadd .cse364 .cse18))) (concat ((_ extract 63 32) .cse363) ((_ extract 31 0) .cse363))) .cse19))) (concat ((_ extract 63 32) .cse362) ((_ extract 31 0) .cse362)))))) (concat ((_ extract 63 32) .cse361) ((_ extract 31 0) .cse361))) .cse7) (= (let ((.cse365 (bvadd (let ((.cse366 (let ((.cse367 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse367 (let ((.cse368 (bvadd .cse364 (let ((.cse369 (bvadd .cse27 .cse367))) (concat ((_ extract 63 32) .cse369) ((_ extract 31 0) .cse369)))))) (concat ((_ extract 63 32) .cse368) ((_ extract 31 0) .cse368))))))) (concat ((_ extract 63 32) .cse366) ((_ extract 31 0) .cse366))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse365) ((_ extract 31 0) .cse365))) .cse7) (= (let ((.cse370 (bvadd (_ bv1 64) (let ((.cse371 (bvadd (let ((.cse372 (bvadd .cse364 .cse356))) (concat ((_ extract 63 32) .cse372) ((_ extract 31 0) .cse372))) .cse357))) (concat ((_ extract 63 32) .cse371) ((_ extract 31 0) .cse371)))))) (concat ((_ extract 63 32) .cse370) ((_ extract 31 0) .cse370))) .cse7)))))))) .cse29 (or .cse99 .cse100) (or (and (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (= (let ((.cse374 (bvadd (_ bv1 64) (let ((.cse375 (let ((.cse378 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (bvadd (let ((.cse376 (bvadd (concat v_arrayElimCell_44 v_arrayElimCell_47) (let ((.cse377 (bvadd .cse27 .cse378))) (concat ((_ extract 63 32) .cse377) ((_ extract 31 0) .cse377)))))) (concat ((_ extract 63 32) .cse376) ((_ extract 31 0) .cse376))) .cse378)))) (concat ((_ extract 63 32) .cse375) ((_ extract 31 0) .cse375)))))) (concat ((_ extract 63 32) .cse374) ((_ extract 31 0) .cse374))) .cse7)) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (or (= (let ((.cse379 (bvadd (let ((.cse380 (bvadd (let ((.cse381 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse381) ((_ extract 31 0) .cse381))) .cse13))) (concat ((_ extract 63 32) .cse380) ((_ extract 31 0) .cse380))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse379) ((_ extract 31 0) .cse379))) .cse7) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= (let ((.cse382 (bvadd (_ bv1 64) (let ((.cse383 (let ((.cse386 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (bvadd (let ((.cse384 (bvadd (concat v_arrayElimCell_44 v_arrayElimCell_47) (let ((.cse385 (bvadd .cse27 .cse386))) (concat ((_ extract 63 32) .cse385) ((_ extract 31 0) .cse385)))))) (concat ((_ extract 63 32) .cse384) ((_ extract 31 0) .cse384))) .cse386)))) (concat ((_ extract 63 32) .cse383) ((_ extract 31 0) .cse383)))))) (concat ((_ extract 63 32) .cse382) ((_ extract 31 0) .cse382))) .cse7)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse391 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse396 (concat v_arrayElimCell_44 v_arrayElimCell_47)) (.cse390 (let ((.cse401 (bvadd .cse27 .cse391))) (concat ((_ extract 63 32) .cse401) ((_ extract 31 0) .cse401))))) (or (= (let ((.cse387 (bvadd (_ bv1 64) (let ((.cse388 (bvadd (let ((.cse389 (bvadd (concat .cse4 v_arrayElimCell_47) .cse390))) (concat ((_ extract 63 32) .cse389) ((_ extract 31 0) .cse389))) .cse391))) (concat ((_ extract 63 32) .cse388) ((_ extract 31 0) .cse388)))))) (concat ((_ extract 63 32) .cse387) ((_ extract 31 0) .cse387))) .cse7) (= (let ((.cse392 (bvadd (let ((.cse393 (let ((.cse394 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse394 (let ((.cse395 (bvadd .cse396 (let ((.cse397 (bvadd .cse27 .cse394))) (concat ((_ extract 63 32) .cse397) ((_ extract 31 0) .cse397)))))) (concat ((_ extract 63 32) .cse395) ((_ extract 31 0) .cse395))))))) (concat ((_ extract 63 32) .cse393) ((_ extract 31 0) .cse393))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse392) ((_ extract 31 0) .cse392))) .cse7) (= (let ((.cse398 (bvadd (_ bv1 64) (let ((.cse399 (bvadd (let ((.cse400 (bvadd .cse396 .cse390))) (concat ((_ extract 63 32) .cse400) ((_ extract 31 0) .cse400))) .cse391))) (concat ((_ extract 63 32) .cse399) ((_ extract 31 0) .cse399)))))) (concat ((_ extract 63 32) .cse398) ((_ extract 31 0) .cse398))) .cse7))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse406 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse411 (concat v_arrayElimCell_44 v_arrayElimCell_47)) (.cse405 (let ((.cse416 (bvadd .cse27 .cse406))) (concat ((_ extract 63 32) .cse416) ((_ extract 31 0) .cse416))))) (or (= (let ((.cse402 (bvadd (_ bv1 64) (let ((.cse403 (bvadd (let ((.cse404 (bvadd (concat .cse4 v_arrayElimCell_47) .cse405))) (concat ((_ extract 63 32) .cse404) ((_ extract 31 0) .cse404))) .cse406))) (concat ((_ extract 63 32) .cse403) ((_ extract 31 0) .cse403)))))) (concat ((_ extract 63 32) .cse402) ((_ extract 31 0) .cse402))) .cse7) (= (let ((.cse407 (bvadd (let ((.cse408 (let ((.cse409 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse409 (let ((.cse410 (bvadd .cse411 (let ((.cse412 (bvadd .cse27 .cse409))) (concat ((_ extract 63 32) .cse412) ((_ extract 31 0) .cse412)))))) (concat ((_ extract 63 32) .cse410) ((_ extract 31 0) .cse410))))))) (concat ((_ extract 63 32) .cse408) ((_ extract 31 0) .cse408))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse407) ((_ extract 31 0) .cse407))) .cse7) (= (let ((.cse413 (bvadd (_ bv1 64) (let ((.cse414 (bvadd (let ((.cse415 (bvadd .cse411 .cse405))) (concat ((_ extract 63 32) .cse415) ((_ extract 31 0) .cse415))) .cse406))) (concat ((_ extract 63 32) .cse414) ((_ extract 31 0) .cse414)))))) (concat ((_ extract 63 32) .cse413) ((_ extract 31 0) .cse413))) .cse7))))) (= (let ((.cse417 (bvadd (let ((.cse418 (bvadd (let ((.cse419 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse419) ((_ extract 31 0) .cse419))) .cse13))) (concat ((_ extract 63 32) .cse418) ((_ extract 31 0) .cse418))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse417) ((_ extract 31 0) .cse417))) .cse7))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse424 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse420 (bvadd (let ((.cse421 (let ((.cse422 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse422 (let ((.cse423 (bvadd .cse424 (let ((.cse425 (bvadd .cse27 .cse422))) (concat ((_ extract 63 32) .cse425) ((_ extract 31 0) .cse425)))))) (concat ((_ extract 63 32) .cse423) ((_ extract 31 0) .cse423))))))) (concat ((_ extract 63 32) .cse421) ((_ extract 31 0) .cse421))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse420) ((_ extract 31 0) .cse420))) .cse7) (= (let ((.cse426 (bvadd (_ bv1 64) (let ((.cse427 (let ((.cse430 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (bvadd (let ((.cse428 (bvadd .cse424 (let ((.cse429 (bvadd .cse27 .cse430))) (concat ((_ extract 63 32) .cse429) ((_ extract 31 0) .cse429)))))) (concat ((_ extract 63 32) .cse428) ((_ extract 31 0) .cse428))) .cse430)))) (concat ((_ extract 63 32) .cse427) ((_ extract 31 0) .cse427)))))) (concat ((_ extract 63 32) .cse426) ((_ extract 31 0) .cse426))) .cse7)))) (= (let ((.cse431 (bvadd (let ((.cse432 (bvadd (let ((.cse433 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse433) ((_ extract 31 0) .cse433))) .cse13))) (concat ((_ extract 63 32) .cse432) ((_ extract 31 0) .cse432))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse431) ((_ extract 31 0) .cse431))) .cse7))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse438 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse437 (let ((.cse442 (bvadd .cse27 .cse438))) (concat ((_ extract 63 32) .cse442) ((_ extract 31 0) .cse442))))) (or (= (let ((.cse434 (bvadd (_ bv1 64) (let ((.cse435 (bvadd (let ((.cse436 (bvadd (concat .cse4 v_arrayElimCell_47) .cse437))) (concat ((_ extract 63 32) .cse436) ((_ extract 31 0) .cse436))) .cse438))) (concat ((_ extract 63 32) .cse435) ((_ extract 31 0) .cse435)))))) (concat ((_ extract 63 32) .cse434) ((_ extract 31 0) .cse434))) .cse7) (= (let ((.cse439 (bvadd (_ bv1 64) (let ((.cse440 (bvadd (let ((.cse441 (bvadd (concat v_arrayElimCell_44 v_arrayElimCell_47) .cse437))) (concat ((_ extract 63 32) .cse441) ((_ extract 31 0) .cse441))) .cse438))) (concat ((_ extract 63 32) .cse440) ((_ extract 31 0) .cse440)))))) (concat ((_ extract 63 32) .cse439) ((_ extract 31 0) .cse439))) .cse7))))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse447 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse443 (bvadd (let ((.cse444 (let ((.cse445 (concat v_arrayElimCell_46 .cse11))) (bvadd .cse445 (let ((.cse446 (bvadd .cse447 (let ((.cse448 (bvadd .cse27 .cse445))) (concat ((_ extract 63 32) .cse448) ((_ extract 31 0) .cse448)))))) (concat ((_ extract 63 32) .cse446) ((_ extract 31 0) .cse446))))))) (concat ((_ extract 63 32) .cse444) ((_ extract 31 0) .cse444))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse443) ((_ extract 31 0) .cse443))) .cse7) (= (let ((.cse449 (bvadd (_ bv1 64) (let ((.cse450 (let ((.cse453 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (bvadd (let ((.cse451 (bvadd .cse447 (let ((.cse452 (bvadd .cse27 .cse453))) (concat ((_ extract 63 32) .cse452) ((_ extract 31 0) .cse452)))))) (concat ((_ extract 63 32) .cse451) ((_ extract 31 0) .cse451))) .cse453)))) (concat ((_ extract 63 32) .cse450) ((_ extract 31 0) .cse450)))))) (concat ((_ extract 63 32) .cse449) ((_ extract 31 0) .cse449))) .cse7)))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (or (= (let ((.cse454 (bvadd (let ((.cse455 (bvadd (let ((.cse456 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse456) ((_ extract 31 0) .cse456))) .cse13))) (concat ((_ extract 63 32) .cse455) ((_ extract 31 0) .cse455))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse454) ((_ extract 31 0) .cse454))) .cse7) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse461 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse460 (let ((.cse465 (bvadd .cse27 .cse461))) (concat ((_ extract 63 32) .cse465) ((_ extract 31 0) .cse465))))) (or (= (let ((.cse457 (bvadd (_ bv1 64) (let ((.cse458 (bvadd (let ((.cse459 (bvadd (concat .cse4 v_arrayElimCell_47) .cse460))) (concat ((_ extract 63 32) .cse459) ((_ extract 31 0) .cse459))) .cse461))) (concat ((_ extract 63 32) .cse458) ((_ extract 31 0) .cse458)))))) (concat ((_ extract 63 32) .cse457) ((_ extract 31 0) .cse457))) .cse7) (= (let ((.cse462 (bvadd (_ bv1 64) (let ((.cse463 (bvadd (let ((.cse464 (bvadd (concat v_arrayElimCell_44 v_arrayElimCell_47) .cse460))) (concat ((_ extract 63 32) .cse464) ((_ extract 31 0) .cse464))) .cse461))) (concat ((_ extract 63 32) .cse463) ((_ extract 31 0) .cse463)))))) (concat ((_ extract 63 32) .cse462) ((_ extract 31 0) .cse462))) .cse7)))))))) .cse221) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32)) (v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse472 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse466 (bvadd (let ((.cse467 (bvadd (let ((.cse468 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse468) ((_ extract 31 0) .cse468))) .cse13))) (concat ((_ extract 63 32) .cse467) ((_ extract 31 0) .cse467))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse466) ((_ extract 31 0) .cse466))) .cse7) (= (let ((.cse469 (bvadd (_ bv1 64) (let ((.cse470 (bvadd (let ((.cse471 (bvadd .cse472 .cse18))) (concat ((_ extract 63 32) .cse471) ((_ extract 31 0) .cse471))) .cse19))) (concat ((_ extract 63 32) .cse470) ((_ extract 31 0) .cse470)))))) (concat ((_ extract 63 32) .cse469) ((_ extract 31 0) .cse469))) .cse7) (= (let ((.cse473 (bvadd (_ bv1 64) (let ((.cse474 (let ((.cse477 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (bvadd (let ((.cse475 (bvadd .cse472 (let ((.cse476 (bvadd .cse27 .cse477))) (concat ((_ extract 63 32) .cse476) ((_ extract 31 0) .cse476)))))) (concat ((_ extract 63 32) .cse475) ((_ extract 31 0) .cse475))) .cse477)))) (concat ((_ extract 63 32) .cse474) ((_ extract 31 0) .cse474)))))) (concat ((_ extract 63 32) .cse473) ((_ extract 31 0) .cse473))) .cse7)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_45 (_ BitVec 32))) (let ((.cse482 (concat v_arrayElimCell_46 v_arrayElimCell_45))) (let ((.cse481 (let ((.cse493 (bvadd .cse27 .cse482))) (concat ((_ extract 63 32) .cse493) ((_ extract 31 0) .cse493))))) (or (= (let ((.cse478 (bvadd (_ bv1 64) (let ((.cse479 (bvadd (let ((.cse480 (bvadd (concat .cse4 v_arrayElimCell_47) .cse481))) (concat ((_ extract 63 32) .cse480) ((_ extract 31 0) .cse480))) .cse482))) (concat ((_ extract 63 32) .cse479) ((_ extract 31 0) .cse479)))))) (concat ((_ extract 63 32) .cse478) ((_ extract 31 0) .cse478))) .cse7) (forall ((v_arrayElimCell_44 (_ BitVec 32))) (let ((.cse489 (concat v_arrayElimCell_44 v_arrayElimCell_47))) (or (= (let ((.cse483 (bvadd (let ((.cse484 (bvadd (let ((.cse485 (bvadd (concat v_arrayElimCell_44 .cse11) .cse12))) (concat ((_ extract 63 32) .cse485) ((_ extract 31 0) .cse485))) .cse13))) (concat ((_ extract 63 32) .cse484) ((_ extract 31 0) .cse484))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse483) ((_ extract 31 0) .cse483))) .cse7) (= (let ((.cse486 (bvadd (_ bv1 64) (let ((.cse487 (bvadd (let ((.cse488 (bvadd .cse489 .cse18))) (concat ((_ extract 63 32) .cse488) ((_ extract 31 0) .cse488))) .cse19))) (concat ((_ extract 63 32) .cse487) ((_ extract 31 0) .cse487)))))) (concat ((_ extract 63 32) .cse486) ((_ extract 31 0) .cse486))) .cse7) (= (let ((.cse490 (bvadd (_ bv1 64) (let ((.cse491 (bvadd (let ((.cse492 (bvadd .cse489 .cse481))) (concat ((_ extract 63 32) .cse492) ((_ extract 31 0) .cse492))) .cse482))) (concat ((_ extract 63 32) .cse491) ((_ extract 31 0) .cse491)))))) (concat ((_ extract 63 32) .cse490) ((_ extract 31 0) .cse490))) .cse7))))))))) .cse494) (or .cse28 (not .cse494))))))) (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (= (select .cse510 (_ bv0 32)) ((_ extract 31 0) (_ bv0 64))) (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) (bvule c_~N~0 (_ bv536870911 32)) (= (select .cse510 (_ bv4 32)) ((_ extract 63 32) (_ bv0 64))))) is different from true [2023-12-21 21:11:23,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:11:23,781 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2023-12-21 21:11:23,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-21 21:11:23,782 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 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 23 [2023-12-21 21:11:23,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:11:23,782 INFO L225 Difference]: With dead ends: 66 [2023-12-21 21:11:23,782 INFO L226 Difference]: Without dead ends: 64 [2023-12-21 21:11:23,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 29.5s TimeCoverageRelationStatistics Valid=246, Invalid=1651, Unknown=3, NotChecked=170, Total=2070 [2023-12-21 21:11:23,784 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 64 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-12-21 21:11:23,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 128 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 507 Invalid, 0 Unknown, 77 Unchecked, 6.7s Time] [2023-12-21 21:11:23,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-21 21:11:23,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2023-12-21 21:11:23,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 57 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:11:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2023-12-21 21:11:23,811 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 23 [2023-12-21 21:11:23,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:11:23,811 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2023-12-21 21:11:23,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:11:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2023-12-21 21:11:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-21 21:11:23,812 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:11:23,812 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:11:23,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-21 21:11:24,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:11:24,019 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:11:24,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:11:24,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1437770799, now seen corresponding path program 5 times [2023-12-21 21:11:24,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:11:24,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217169550] [2023-12-21 21:11:24,019 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 21:11:24,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:11:24,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:11:24,021 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 21:11:24,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-21 21:11:24,190 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-12-21 21:11:24,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:11:24,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-21 21:11:24,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:11:25,161 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 21:11:25,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:11:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 21:11:26,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:11:26,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217169550] [2023-12-21 21:11:26,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217169550] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:11:26,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:11:26,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2023-12-21 21:11:26,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919303044] [2023-12-21 21:11:26,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:11:26,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-21 21:11:26,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:11:26,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-21 21:11:26,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2023-12-21 21:11:26,325 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:11:29,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:11:29,592 INFO L93 Difference]: Finished difference Result 136 states and 159 transitions. [2023-12-21 21:11:29,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 21:11:29,593 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-21 21:11:29,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:11:29,593 INFO L225 Difference]: With dead ends: 136 [2023-12-21 21:11:29,593 INFO L226 Difference]: Without dead ends: 103 [2023-12-21 21:11:29,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=214, Invalid=656, Unknown=0, NotChecked=0, Total=870 [2023-12-21 21:11:29,595 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 269 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-21 21:11:29,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 149 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-21 21:11:29,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-21 21:11:29,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 72. [2023-12-21 21:11:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 71 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) [2023-12-21 21:11:29,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2023-12-21 21:11:29,624 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 24 [2023-12-21 21:11:29,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:11:29,624 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2023-12-21 21:11:29,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:11:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2023-12-21 21:11:29,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-21 21:11:29,625 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:11:29,625 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:11:29,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-21 21:11:29,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:11:29,831 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:11:29,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:11:29,832 INFO L85 PathProgramCache]: Analyzing trace with hash -86066566, now seen corresponding path program 1 times [2023-12-21 21:11:29,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:11:29,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503431073] [2023-12-21 21:11:29,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:11:29,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:11:29,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:11:29,834 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 21:11:29,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-21 21:11:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:11:29,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-21 21:11:29,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:11:30,159 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 21:11:30,160 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 16 treesize of output 17 [2023-12-21 21:11:30,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 21:11:30,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 21:11:30,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 21:11:30,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:11:30,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2023-12-21 21:11:31,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:11:31,470 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 53 [2023-12-21 21:11:31,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:11:31,788 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 85 [2023-12-21 21:11:32,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:11:32,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 205 treesize of output 139 [2023-12-21 21:11:32,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:11:32,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 151 [2023-12-21 21:11:32,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:11:32,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 315 [2023-12-21 21:11:33,596 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 31 treesize of output 20 [2023-12-21 21:11:33,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 21:11:33,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 64 [2023-12-21 21:11:33,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:11:33,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 373 treesize of output 333 [2023-12-21 21:11:35,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:11:35,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 521 treesize of output 485 [2023-12-21 21:11:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:11:35,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:11:37,583 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 436 treesize of output 428 [2023-12-21 21:11:37,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:11:37,759 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 1085916 treesize of output 1079260 [2023-12-21 21:11:48,084 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 3959 treesize of output 3791 [2023-12-21 21:11:49,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:11:49,009 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 2896572116 treesize of output 2822123220 [2023-12-21 21:11:59,779 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse19 ((_ extract 63 32) (_ bv1 64))) (.cse36 ((_ extract 31 0) (_ bv1 64)))) (let ((.cse18 (let ((.cse157 (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (concat (select .cse157 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (select .cse157 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (.cse6 (concat .cse19 .cse36))) (let ((.cse12 (let ((.cse156 (bvadd .cse18 .cse6))) (concat ((_ extract 63 32) .cse156) ((_ extract 31 0) .cse156))))) (let ((.cse0 (bvadd (let ((.cse154 (bvadd .cse6 (let ((.cse155 (bvadd .cse6 .cse12))) (concat ((_ extract 63 32) .cse155) ((_ extract 31 0) .cse155)))))) (concat ((_ extract 63 32) .cse154) ((_ extract 31 0) .cse154))) (_ bv1 64))) (.cse153 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse3 (= .cse153 (_ bv0 32))) (.cse1 ((_ extract 31 0) .cse0)) (.cse2 ((_ sign_extend 32) (bvadd c_~N~0 (_ bv2 32))))) (or (and (= (concat ((_ extract 63 32) .cse0) .cse1) .cse2) .cse3) (and (or (let ((.cse77 (= (_ bv8 32) .cse153)) (.cse79 (= (bvadd (_ bv8 32) .cse153) (_ bv0 32)))) (let ((.cse4 (not .cse79)) (.cse39 (concat .cse36 .cse19)) (.cse78 (or (forall ((v_ArrVal_238 (_ BitVec 32)) (v_arrayElimCell_81 (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (let ((.cse148 (concat v_arrayElimCell_81 v_arrayElimCell_80))) (let ((.cse147 (let ((.cse151 (bvadd (let ((.cse152 (bvadd .cse18 .cse148))) (concat ((_ extract 63 32) .cse152) ((_ extract 31 0) .cse152))) .cse6))) (concat ((_ extract 63 32) .cse151) ((_ extract 31 0) .cse151))))) (or (not (= (concat v_ArrVal_238 ((_ extract 31 0) (bvadd (_ bv1 64) (let ((.cse146 (bvadd .cse147 .cse148))) (concat ((_ extract 63 32) .cse146) ((_ extract 31 0) .cse146)))))) .cse2)) (= (let ((.cse149 (bvadd (let ((.cse150 (bvadd .cse147 .cse6))) (concat ((_ extract 63 32) .cse150) ((_ extract 31 0) .cse150))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse149) ((_ extract 31 0) .cse149))) .cse2))))) (not .cse77)))) (and (or .cse4 (forall ((v_arrayElimCell_79 (_ BitVec 32)) (v_ArrVal_238 (_ BitVec 32)) (v_arrayElimCell_82 (_ BitVec 32))) (let ((.cse10 (concat v_arrayElimCell_79 v_arrayElimCell_82))) (let ((.cse7 (let ((.cse11 (bvadd .cse10 .cse12))) (concat ((_ extract 63 32) .cse11) ((_ extract 31 0) .cse11))))) (or (not (= .cse2 (concat v_ArrVal_238 ((_ extract 31 0) (bvadd (_ bv1 64) (let ((.cse5 (bvadd .cse6 .cse7))) (concat ((_ extract 63 32) .cse5) ((_ extract 31 0) .cse5)))))))) (= (let ((.cse8 (bvadd (_ bv1 64) (let ((.cse9 (bvadd .cse10 .cse7))) (concat ((_ extract 63 32) .cse9) ((_ extract 31 0) .cse9)))))) (concat ((_ extract 63 32) .cse8) ((_ extract 31 0) .cse8))) .cse2)))))) (or (forall ((v_arrayElimCell_79 (_ BitVec 32)) (v_ArrVal_238 (_ BitVec 32)) (v_arrayElimCell_82 (_ BitVec 32)) (v_arrayElimCell_81 (_ BitVec 32))) (let ((.cse15 (concat v_arrayElimCell_79 v_arrayElimCell_82))) (let ((.cse21 (let ((.cse24 (bvadd .cse15 .cse12))) (concat ((_ extract 63 32) .cse24) ((_ extract 31 0) .cse24))))) (or (= (let ((.cse13 (bvadd (let ((.cse14 (bvadd .cse15 (let ((.cse16 (bvadd .cse15 (let ((.cse17 (bvadd .cse18 (concat v_arrayElimCell_81 .cse19)))) (concat ((_ extract 63 32) .cse17) ((_ extract 31 0) .cse17)))))) (concat ((_ extract 63 32) .cse16) ((_ extract 31 0) .cse16)))))) (concat ((_ extract 63 32) .cse14) ((_ extract 31 0) .cse14))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse13) ((_ extract 31 0) .cse13))) .cse2) (not (= .cse2 (concat v_ArrVal_238 ((_ extract 31 0) (bvadd (_ bv1 64) (let ((.cse20 (bvadd .cse6 .cse21))) (concat ((_ extract 63 32) .cse20) ((_ extract 31 0) .cse20)))))))) (= (let ((.cse22 (bvadd (_ bv1 64) (let ((.cse23 (bvadd .cse15 .cse21))) (concat ((_ extract 63 32) .cse23) ((_ extract 31 0) .cse23)))))) (concat ((_ extract 63 32) .cse22) ((_ extract 31 0) .cse22))) .cse2))))) .cse4) (or (and (or (and (forall ((v_arrayElimCell_79 (_ BitVec 32)) (v_ArrVal_238 (_ BitVec 32)) (v_arrayElimCell_82 (_ BitVec 32)) (v_arrayElimCell_81 (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (let ((.cse30 (concat v_arrayElimCell_81 v_arrayElimCell_80))) (let ((.cse34 (let ((.cse43 (bvadd .cse18 .cse30))) (concat ((_ extract 63 32) .cse43) ((_ extract 31 0) .cse43)))) (.cse28 (concat v_arrayElimCell_79 v_arrayElimCell_82))) (let ((.cse27 (let ((.cse42 (bvadd .cse34 .cse28))) (concat ((_ extract 63 32) .cse42) ((_ extract 31 0) .cse42))))) (or (= (let ((.cse25 (bvadd (_ bv1 64) (let ((.cse26 (bvadd .cse27 .cse28))) (concat ((_ extract 63 32) .cse26) ((_ extract 31 0) .cse26)))))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25))) .cse2) (not (= (concat v_ArrVal_238 ((_ extract 31 0) (bvadd (_ bv1 64) (let ((.cse29 (bvadd .cse27 .cse30))) (concat ((_ extract 63 32) .cse29) ((_ extract 31 0) .cse29)))))) .cse2)) (= (let ((.cse31 (bvadd (_ bv1 64) (let ((.cse32 (let ((.cse35 (concat .cse36 v_arrayElimCell_82))) (bvadd (let ((.cse33 (bvadd .cse34 .cse35))) (concat ((_ extract 63 32) .cse33) ((_ extract 31 0) .cse33))) .cse35)))) (concat ((_ extract 63 32) .cse32) ((_ extract 31 0) .cse32)))))) (concat ((_ extract 63 32) .cse31) ((_ extract 31 0) .cse31))) .cse2) (= (let ((.cse37 (bvadd (_ bv1 64) (let ((.cse38 (bvadd .cse39 (let ((.cse40 (bvadd .cse39 (let ((.cse41 (bvadd .cse18 (concat .cse36 v_arrayElimCell_80)))) (concat ((_ extract 63 32) .cse41) ((_ extract 31 0) .cse41)))))) (concat ((_ extract 63 32) .cse40) ((_ extract 31 0) .cse40)))))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38)))))) (concat ((_ extract 63 32) .cse37) ((_ extract 31 0) .cse37))) .cse2)))))) (forall ((v_arrayElimCell_79 (_ BitVec 32)) (v_ArrVal_238 (_ BitVec 32)) (v_arrayElimCell_82 (_ BitVec 32)) (v_arrayElimCell_81 (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (let ((.cse49 (concat v_arrayElimCell_81 v_arrayElimCell_80)) (.cse47 (concat v_arrayElimCell_79 v_arrayElimCell_82))) (let ((.cse46 (let ((.cse50 (bvadd (let ((.cse51 (bvadd .cse18 .cse49))) (concat ((_ extract 63 32) .cse51) ((_ extract 31 0) .cse51))) .cse47))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50))))) (or (= (let ((.cse44 (bvadd (_ bv1 64) (let ((.cse45 (bvadd .cse46 .cse47))) (concat ((_ extract 63 32) .cse45) ((_ extract 31 0) .cse45)))))) (concat ((_ extract 63 32) .cse44) ((_ extract 31 0) .cse44))) .cse2) (not (= (concat v_ArrVal_238 ((_ extract 31 0) (bvadd (_ bv1 64) (let ((.cse48 (bvadd .cse46 .cse49))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48)))))) .cse2)))))) (forall ((v_arrayElimCell_79 (_ BitVec 32)) (v_ArrVal_238 (_ BitVec 32)) (v_arrayElimCell_82 (_ BitVec 32)) (v_arrayElimCell_81 (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (let ((.cse57 (concat v_arrayElimCell_81 v_arrayElimCell_80)) (.cse55 (concat v_arrayElimCell_79 v_arrayElimCell_82))) (let ((.cse54 (let ((.cse62 (bvadd (let ((.cse63 (bvadd .cse18 .cse57))) (concat ((_ extract 63 32) .cse63) ((_ extract 31 0) .cse63))) .cse55))) (concat ((_ extract 63 32) .cse62) ((_ extract 31 0) .cse62))))) (or (= (let ((.cse52 (bvadd (_ bv1 64) (let ((.cse53 (bvadd .cse54 .cse55))) (concat ((_ extract 63 32) .cse53) ((_ extract 31 0) .cse53)))))) (concat ((_ extract 63 32) .cse52) ((_ extract 31 0) .cse52))) .cse2) (not (= (concat v_ArrVal_238 ((_ extract 31 0) (bvadd (_ bv1 64) (let ((.cse56 (bvadd .cse54 .cse57))) (concat ((_ extract 63 32) .cse56) ((_ extract 31 0) .cse56)))))) .cse2)) (= (let ((.cse58 (bvadd (_ bv1 64) (let ((.cse59 (bvadd .cse39 (let ((.cse60 (bvadd .cse39 (let ((.cse61 (bvadd .cse18 (concat .cse36 v_arrayElimCell_80)))) (concat ((_ extract 63 32) .cse61) ((_ extract 31 0) .cse61)))))) (concat ((_ extract 63 32) .cse60) ((_ extract 31 0) .cse60)))))) (concat ((_ extract 63 32) .cse59) ((_ extract 31 0) .cse59)))))) (concat ((_ extract 63 32) .cse58) ((_ extract 31 0) .cse58))) .cse2))))) (forall ((v_arrayElimCell_79 (_ BitVec 32)) (v_ArrVal_238 (_ BitVec 32)) (v_arrayElimCell_82 (_ BitVec 32)) (v_arrayElimCell_81 (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (let ((.cse69 (concat v_arrayElimCell_81 v_arrayElimCell_80))) (let ((.cse73 (let ((.cse76 (bvadd .cse18 .cse69))) (concat ((_ extract 63 32) .cse76) ((_ extract 31 0) .cse76)))) (.cse67 (concat v_arrayElimCell_79 v_arrayElimCell_82))) (let ((.cse66 (let ((.cse75 (bvadd .cse73 .cse67))) (concat ((_ extract 63 32) .cse75) ((_ extract 31 0) .cse75))))) (or (= (let ((.cse64 (bvadd (_ bv1 64) (let ((.cse65 (bvadd .cse66 .cse67))) (concat ((_ extract 63 32) .cse65) ((_ extract 31 0) .cse65)))))) (concat ((_ extract 63 32) .cse64) ((_ extract 31 0) .cse64))) .cse2) (not (= (concat v_ArrVal_238 ((_ extract 31 0) (bvadd (_ bv1 64) (let ((.cse68 (bvadd .cse66 .cse69))) (concat ((_ extract 63 32) .cse68) ((_ extract 31 0) .cse68)))))) .cse2)) (= (let ((.cse70 (bvadd (_ bv1 64) (let ((.cse71 (let ((.cse74 (concat .cse36 v_arrayElimCell_82))) (bvadd (let ((.cse72 (bvadd .cse73 .cse74))) (concat ((_ extract 63 32) .cse72) ((_ extract 31 0) .cse72))) .cse74)))) (concat ((_ extract 63 32) .cse71) ((_ extract 31 0) .cse71)))))) (concat ((_ extract 63 32) .cse70) ((_ extract 31 0) .cse70))) .cse2))))))) .cse77) .cse78) .cse79) (or (and (or .cse77 (and (forall ((v_arrayElimCell_79 (_ BitVec 32)) (v_arrayElimCell_82 (_ BitVec 32)) (v_arrayElimCell_81 (_ BitVec 32))) (let ((.cse83 (concat v_arrayElimCell_79 v_arrayElimCell_82))) (or (forall ((v_ArrVal_238 (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (let ((.cse85 (concat v_arrayElimCell_81 v_arrayElimCell_80))) (let ((.cse82 (let ((.cse86 (bvadd (let ((.cse87 (bvadd .cse18 .cse85))) (concat ((_ extract 63 32) .cse87) ((_ extract 31 0) .cse87))) .cse83))) (concat ((_ extract 63 32) .cse86) ((_ extract 31 0) .cse86))))) (or (= (let ((.cse80 (bvadd (_ bv1 64) (let ((.cse81 (bvadd .cse82 .cse83))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81)))))) (concat ((_ extract 63 32) .cse80) ((_ extract 31 0) .cse80))) .cse2) (not (= (concat v_ArrVal_238 ((_ extract 31 0) (bvadd (_ bv1 64) (let ((.cse84 (bvadd .cse82 .cse85))) (concat ((_ extract 63 32) .cse84) ((_ extract 31 0) .cse84)))))) .cse2)))))) (= (let ((.cse88 (bvadd (let ((.cse89 (bvadd .cse83 (let ((.cse90 (bvadd .cse83 (let ((.cse91 (bvadd .cse18 (concat v_arrayElimCell_81 .cse19)))) (concat ((_ extract 63 32) .cse91) ((_ extract 31 0) .cse91)))))) (concat ((_ extract 63 32) .cse90) ((_ extract 31 0) .cse90)))))) (concat ((_ extract 63 32) .cse89) ((_ extract 31 0) .cse89))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse88) ((_ extract 31 0) .cse88))) .cse2)))) (forall ((v_arrayElimCell_79 (_ BitVec 32)) (v_arrayElimCell_82 (_ BitVec 32)) (v_arrayElimCell_81 (_ BitVec 32))) (let ((.cse94 (concat v_arrayElimCell_79 v_arrayElimCell_82))) (or (= (let ((.cse92 (bvadd (let ((.cse93 (bvadd .cse94 (let ((.cse95 (bvadd .cse94 (let ((.cse96 (bvadd .cse18 (concat v_arrayElimCell_81 .cse19)))) (concat ((_ extract 63 32) .cse96) ((_ extract 31 0) .cse96)))))) (concat ((_ extract 63 32) .cse95) ((_ extract 31 0) .cse95)))))) (concat ((_ extract 63 32) .cse93) ((_ extract 31 0) .cse93))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse92) ((_ extract 31 0) .cse92))) .cse2) (forall ((v_ArrVal_238 (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (let ((.cse101 (concat v_arrayElimCell_81 v_arrayElimCell_80))) (let ((.cse105 (let ((.cse108 (bvadd .cse18 .cse101))) (concat ((_ extract 63 32) .cse108) ((_ extract 31 0) .cse108))))) (let ((.cse99 (let ((.cse107 (bvadd .cse105 .cse94))) (concat ((_ extract 63 32) .cse107) ((_ extract 31 0) .cse107))))) (or (= (let ((.cse97 (bvadd (_ bv1 64) (let ((.cse98 (bvadd .cse99 .cse94))) (concat ((_ extract 63 32) .cse98) ((_ extract 31 0) .cse98)))))) (concat ((_ extract 63 32) .cse97) ((_ extract 31 0) .cse97))) .cse2) (not (= (concat v_ArrVal_238 ((_ extract 31 0) (bvadd (_ bv1 64) (let ((.cse100 (bvadd .cse99 .cse101))) (concat ((_ extract 63 32) .cse100) ((_ extract 31 0) .cse100)))))) .cse2)) (= (let ((.cse102 (bvadd (_ bv1 64) (let ((.cse103 (let ((.cse106 (concat .cse36 v_arrayElimCell_82))) (bvadd (let ((.cse104 (bvadd .cse105 .cse106))) (concat ((_ extract 63 32) .cse104) ((_ extract 31 0) .cse104))) .cse106)))) (concat ((_ extract 63 32) .cse103) ((_ extract 31 0) .cse103)))))) (concat ((_ extract 63 32) .cse102) ((_ extract 31 0) .cse102))) .cse2))))))))) (forall ((v_arrayElimCell_79 (_ BitVec 32)) (v_arrayElimCell_82 (_ BitVec 32)) (v_arrayElimCell_81 (_ BitVec 32))) (let ((.cse111 (concat v_arrayElimCell_79 v_arrayElimCell_82))) (or (= (let ((.cse109 (bvadd (let ((.cse110 (bvadd .cse111 (let ((.cse112 (bvadd .cse111 (let ((.cse113 (bvadd .cse18 (concat v_arrayElimCell_81 .cse19)))) (concat ((_ extract 63 32) .cse113) ((_ extract 31 0) .cse113)))))) (concat ((_ extract 63 32) .cse112) ((_ extract 31 0) .cse112)))))) (concat ((_ extract 63 32) .cse110) ((_ extract 31 0) .cse110))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse109) ((_ extract 31 0) .cse109))) .cse2) (forall ((v_ArrVal_238 (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (let ((.cse118 (concat v_arrayElimCell_81 v_arrayElimCell_80))) (let ((.cse116 (let ((.cse123 (bvadd (let ((.cse124 (bvadd .cse18 .cse118))) (concat ((_ extract 63 32) .cse124) ((_ extract 31 0) .cse124))) .cse111))) (concat ((_ extract 63 32) .cse123) ((_ extract 31 0) .cse123))))) (or (= (let ((.cse114 (bvadd (_ bv1 64) (let ((.cse115 (bvadd .cse116 .cse111))) (concat ((_ extract 63 32) .cse115) ((_ extract 31 0) .cse115)))))) (concat ((_ extract 63 32) .cse114) ((_ extract 31 0) .cse114))) .cse2) (not (= (concat v_ArrVal_238 ((_ extract 31 0) (bvadd (_ bv1 64) (let ((.cse117 (bvadd .cse116 .cse118))) (concat ((_ extract 63 32) .cse117) ((_ extract 31 0) .cse117)))))) .cse2)) (= (let ((.cse119 (bvadd (_ bv1 64) (let ((.cse120 (bvadd .cse39 (let ((.cse121 (bvadd .cse39 (let ((.cse122 (bvadd .cse18 (concat .cse36 v_arrayElimCell_80)))) (concat ((_ extract 63 32) .cse122) ((_ extract 31 0) .cse122)))))) (concat ((_ extract 63 32) .cse121) ((_ extract 31 0) .cse121)))))) (concat ((_ extract 63 32) .cse120) ((_ extract 31 0) .cse120)))))) (concat ((_ extract 63 32) .cse119) ((_ extract 31 0) .cse119))) .cse2)))))))) (forall ((v_arrayElimCell_79 (_ BitVec 32)) (v_arrayElimCell_82 (_ BitVec 32)) (v_arrayElimCell_81 (_ BitVec 32))) (let ((.cse127 (concat v_arrayElimCell_79 v_arrayElimCell_82))) (or (= (let ((.cse125 (bvadd (let ((.cse126 (bvadd .cse127 (let ((.cse128 (bvadd .cse127 (let ((.cse129 (bvadd .cse18 (concat v_arrayElimCell_81 .cse19)))) (concat ((_ extract 63 32) .cse129) ((_ extract 31 0) .cse129)))))) (concat ((_ extract 63 32) .cse128) ((_ extract 31 0) .cse128)))))) (concat ((_ extract 63 32) .cse126) ((_ extract 31 0) .cse126))) (_ bv1 64)))) (concat ((_ extract 63 32) .cse125) ((_ extract 31 0) .cse125))) .cse2) (forall ((v_ArrVal_238 (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (let ((.cse134 (concat v_arrayElimCell_81 v_arrayElimCell_80))) (let ((.cse138 (let ((.cse145 (bvadd .cse18 .cse134))) (concat ((_ extract 63 32) .cse145) ((_ extract 31 0) .cse145))))) (let ((.cse132 (let ((.cse144 (bvadd .cse138 .cse127))) (concat ((_ extract 63 32) .cse144) ((_ extract 31 0) .cse144))))) (or (= (let ((.cse130 (bvadd (_ bv1 64) (let ((.cse131 (bvadd .cse132 .cse127))) (concat ((_ extract 63 32) .cse131) ((_ extract 31 0) .cse131)))))) (concat ((_ extract 63 32) .cse130) ((_ extract 31 0) .cse130))) .cse2) (not (= (concat v_ArrVal_238 ((_ extract 31 0) (bvadd (_ bv1 64) (let ((.cse133 (bvadd .cse132 .cse134))) (concat ((_ extract 63 32) .cse133) ((_ extract 31 0) .cse133)))))) .cse2)) (= (let ((.cse135 (bvadd (_ bv1 64) (let ((.cse136 (let ((.cse139 (concat .cse36 v_arrayElimCell_82))) (bvadd (let ((.cse137 (bvadd .cse138 .cse139))) (concat ((_ extract 63 32) .cse137) ((_ extract 31 0) .cse137))) .cse139)))) (concat ((_ extract 63 32) .cse136) ((_ extract 31 0) .cse136)))))) (concat ((_ extract 63 32) .cse135) ((_ extract 31 0) .cse135))) .cse2) (= (let ((.cse140 (bvadd (_ bv1 64) (let ((.cse141 (bvadd .cse39 (let ((.cse142 (bvadd .cse39 (let ((.cse143 (bvadd .cse18 (concat .cse36 v_arrayElimCell_80)))) (concat ((_ extract 63 32) .cse143) ((_ extract 31 0) .cse143)))))) (concat ((_ extract 63 32) .cse142) ((_ extract 31 0) .cse142)))))) (concat ((_ extract 63 32) .cse141) ((_ extract 31 0) .cse141)))))) (concat ((_ extract 63 32) .cse140) ((_ extract 31 0) .cse140))) .cse2))))))))))) .cse78) .cse79)))) .cse3) (or (not .cse3) (forall ((v_ArrVal_238 (_ BitVec 32))) (not (= (concat v_ArrVal_238 .cse1) .cse2))))))))))) is different from false [2023-12-21 21:12:02,057 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-21 21:12:02,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:12:02,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503431073] [2023-12-21 21:12:02,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503431073] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:12:02,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:12:02,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 38 [2023-12-21 21:12:02,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511547153] [2023-12-21 21:12:02,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:12:02,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-21 21:12:02,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:12:02,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-21 21:12:02,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1170, Unknown=1, NotChecked=70, Total=1406 [2023-12-21 21:12:02,060 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:12:49,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:12:49,706 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2023-12-21 21:12:49,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-21 21:12:49,708 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-21 21:12:49,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:12:49,709 INFO L225 Difference]: With dead ends: 77 [2023-12-21 21:12:49,709 INFO L226 Difference]: Without dead ends: 57 [2023-12-21 21:12:49,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 54.7s TimeCoverageRelationStatistics Valid=367, Invalid=2287, Unknown=2, NotChecked=100, Total=2756 [2023-12-21 21:12:49,711 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 71 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2023-12-21 21:12:49,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 90 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 575 Invalid, 0 Unknown, 40 Unchecked, 13.0s Time] [2023-12-21 21:12:49,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-21 21:12:49,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-12-21 21:12:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:12:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2023-12-21 21:12:49,742 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 26 [2023-12-21 21:12:49,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:12:49,742 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2023-12-21 21:12:49,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:12:49,743 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2023-12-21 21:12:49,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-21 21:12:49,743 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:12:49,743 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:12:49,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-21 21:12:49,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:12:49,949 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:12:49,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:12:49,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1608315314, now seen corresponding path program 6 times [2023-12-21 21:12:49,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:12:49,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788214471] [2023-12-21 21:12:49,950 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 21:12:49,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:12:49,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:12:49,951 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 21:12:49,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-21 21:12:50,173 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-12-21 21:12:50,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:12:50,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-21 21:12:50,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:12:50,456 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 21:12:50,457 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 18 treesize of output 19 [2023-12-21 21:12:50,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 21:12:50,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 21:12:51,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 21:12:51,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:12:51,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2023-12-21 21:12:51,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 21:12:51,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:12:51,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 61 [2023-12-21 21:12:53,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:12:53,188 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 55 [2023-12-21 21:12:53,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:12:53,634 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 87 [2023-12-21 21:12:54,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:12:54,229 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 151 [2023-12-21 21:12:55,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:12:55,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 355 treesize of output 231 [2023-12-21 21:12:56,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:12:56,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 316 treesize of output 261 [2023-12-21 21:12:56,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:12:56,975 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 280 treesize of output 230 [2023-12-21 21:12:56,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:12:56,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 666 treesize of output 648 [2023-12-21 21:12:58,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 21:12:58,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2023-12-21 21:12:58,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:12:58,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 673 treesize of output 641 [2023-12-21 21:12:58,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:12:58,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 651 treesize of output 635 [2023-12-21 21:12:59,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:12:59,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 651 treesize of output 635 [2023-12-21 21:12:59,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:12:59,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 671 treesize of output 647 [2023-12-21 21:13:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:13:00,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:13:01,821 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 200 treesize of output 196 [2023-12-21 21:13:02,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:13:02,557 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 1925076484078 treesize of output 1918634033134 [2023-12-21 21:13:36,336 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 7766 treesize of output 7526 [2023-12-21 21:13:44,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:13:44,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788214471] [2023-12-21 21:13:44,987 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-21 21:13:44,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-21 21:13:45,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:13:45,188 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 197243 column 7: canceled at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyEliminationToAtom(QuantifierPusher.java:291) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 197243 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1511) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:230) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 54 more [2023-12-21 21:13:45,191 INFO L158 Benchmark]: Toolchain (without parser) took 219419.89ms. Allocated memory was 284.2MB in the beginning and 971.0MB in the end (delta: 686.8MB). Free memory was 230.8MB in the beginning and 595.4MB in the end (delta: -364.6MB). Peak memory consumption was 650.0MB. Max. memory is 8.0GB. [2023-12-21 21:13:45,192 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 208.7MB. Free memory was 156.8MB in the beginning and 156.6MB in the end (delta: 122.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 21:13:45,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.25ms. Allocated memory is still 284.2MB. Free memory was 230.8MB in the beginning and 218.8MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 21:13:45,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.76ms. Allocated memory is still 284.2MB. Free memory was 218.8MB in the beginning and 216.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 21:13:45,192 INFO L158 Benchmark]: Boogie Preprocessor took 43.66ms. Allocated memory is still 284.2MB. Free memory was 216.7MB in the beginning and 214.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 21:13:45,192 INFO L158 Benchmark]: RCFGBuilder took 414.29ms. Allocated memory is still 284.2MB. Free memory was 214.6MB in the beginning and 196.2MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-21 21:13:45,192 INFO L158 Benchmark]: TraceAbstraction took 218683.53ms. Allocated memory was 284.2MB in the beginning and 971.0MB in the end (delta: 686.8MB). Free memory was 195.7MB in the beginning and 595.4MB in the end (delta: -399.7MB). Peak memory consumption was 615.3MB. Max. memory is 8.0GB. [2023-12-21 21:13:45,194 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 208.7MB. Free memory was 156.8MB in the beginning and 156.6MB in the end (delta: 122.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.25ms. Allocated memory is still 284.2MB. Free memory was 230.8MB in the beginning and 218.8MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.76ms. Allocated memory is still 284.2MB. Free memory was 218.8MB in the beginning and 216.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.66ms. Allocated memory is still 284.2MB. Free memory was 216.7MB in the beginning and 214.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 414.29ms. Allocated memory is still 284.2MB. Free memory was 214.6MB in the beginning and 196.2MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 218683.53ms. Allocated memory was 284.2MB in the beginning and 971.0MB in the end (delta: 686.8MB). Free memory was 195.7MB in the beginning and 595.4MB in the end (delta: -399.7MB). Peak memory consumption was 615.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 197243 column 7: canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 197243 column 7: canceled: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-12-21 21:13:45,401 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-21 21:13:45,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...