/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/s3lif.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 21:00:10,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 21:00:10,726 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:00:10,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 21:00:10,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 21:00:10,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 21:00:10,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 21:00:10,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 21:00:10,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 21:00:10,745 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 21:00:10,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 21:00:10,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 21:00:10,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 21:00:10,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 21:00:10,746 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 21:00:10,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 21:00:10,746 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 21:00:10,747 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 21:00:10,747 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 21:00:10,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 21:00:10,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 21:00:10,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 21:00:10,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 21:00:10,748 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 21:00:10,748 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 21:00:10,749 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 21:00:10,749 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 21:00:10,749 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 21:00:10,749 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 21:00:10,749 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 21:00:10,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 21:00:10,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 21:00:10,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 21:00:10,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 21:00:10,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 21:00:10,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 21:00:10,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 21:00:10,751 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 21:00:10,751 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 21:00:10,751 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 21:00:10,751 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 21:00:10,762 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 21:00:10,762 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 21:00:10,762 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 21:00:10,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 21:00:10,762 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 21:00:10,762 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:00:10,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 21:00:10,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 21:00:10,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 21:00:10,959 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 21:00:10,960 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 21:00:10,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s3lif.c [2023-12-21 21:00:11,917 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 21:00:12,081 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 21:00:12,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s3lif.c [2023-12-21 21:00:12,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67088b576/f0c1ca39d09b4b2e819d00a772ef2067/FLAG25aefea6d [2023-12-21 21:00:12,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67088b576/f0c1ca39d09b4b2e819d00a772ef2067 [2023-12-21 21:00:12,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 21:00:12,103 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 21:00:12,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 21:00:12,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 21:00:12,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 21:00:12,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 09:00:12" (1/1) ... [2023-12-21 21:00:12,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67d7c38c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:00:12, skipping insertion in model container [2023-12-21 21:00:12,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 09:00:12" (1/1) ... [2023-12-21 21:00:12,125 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 21:00:12,254 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/s3lif.c[588,601] [2023-12-21 21:00:12,269 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 21:00:12,282 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 21:00:12,292 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/s3lif.c[588,601] [2023-12-21 21:00:12,298 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 21:00:12,309 INFO L206 MainTranslator]: Completed translation [2023-12-21 21:00:12,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:00:12 WrapperNode [2023-12-21 21:00:12,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 21:00:12,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 21:00:12,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 21:00:12,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 21:00:12,319 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:00:12" (1/1) ... [2023-12-21 21:00:12,334 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:00:12" (1/1) ... [2023-12-21 21:00:12,347 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2023-12-21 21:00:12,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 21:00:12,348 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 21:00:12,348 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 21:00:12,348 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 21:00:12,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:00:12" (1/1) ... [2023-12-21 21:00:12,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:00:12" (1/1) ... [2023-12-21 21:00:12,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:00:12" (1/1) ... [2023-12-21 21:00:12,379 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 8, 7, 4]. 38 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0]. The 5 writes are split as follows [0, 0, 3, 2]. [2023-12-21 21:00:12,379 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:00:12" (1/1) ... [2023-12-21 21:00:12,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:00:12" (1/1) ... [2023-12-21 21:00:12,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:00:12" (1/1) ... [2023-12-21 21:00:12,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:00:12" (1/1) ... [2023-12-21 21:00:12,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:00:12" (1/1) ... [2023-12-21 21:00:12,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:00:12" (1/1) ... [2023-12-21 21:00:12,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 21:00:12,391 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 21:00:12,391 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 21:00:12,391 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 21:00:12,392 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:00:12" (1/1) ... [2023-12-21 21:00:12,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 21:00:12,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 21:00:12,425 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:00:12,431 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:00:12,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 21:00:12,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 21:00:12,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 21:00:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-21 21:00:12,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-21 21:00:12,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 21:00:12,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2023-12-21 21:00:12,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2023-12-21 21:00:12,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2023-12-21 21:00:12,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#3 [2023-12-21 21:00:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 21:00:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-21 21:00:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-21 21:00:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-21 21:00:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-21 21:00:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 21:00:12,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 21:00:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2023-12-21 21:00:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2023-12-21 21:00:12,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2023-12-21 21:00:12,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#3 [2023-12-21 21:00:12,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 21:00:12,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-21 21:00:12,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-21 21:00:12,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-21 21:00:12,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-21 21:00:12,535 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 21:00:12,537 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 21:00:12,651 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 21:00:12,696 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 21:00:12,697 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 21:00:12,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:00:12 BoogieIcfgContainer [2023-12-21 21:00:12,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 21:00:12,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 21:00:12,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 21:00:12,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 21:00:12,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 09:00:12" (1/3) ... [2023-12-21 21:00:12,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4ce21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 09:00:12, skipping insertion in model container [2023-12-21 21:00:12,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:00:12" (2/3) ... [2023-12-21 21:00:12,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4ce21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 09:00:12, skipping insertion in model container [2023-12-21 21:00:12,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:00:12" (3/3) ... [2023-12-21 21:00:12,702 INFO L112 eAbstractionObserver]: Analyzing ICFG s3lif.c [2023-12-21 21:00:12,720 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 21:00:12,720 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 21:00:12,758 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 21:00:12,762 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;@ec7ff83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 21:00:12,762 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 21:00:12,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:00:12,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-21 21:00:12,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:00:12,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:00:12,770 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:00:12,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:00:12,773 INFO L85 PathProgramCache]: Analyzing trace with hash 199618784, now seen corresponding path program 1 times [2023-12-21 21:00:12,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:00:12,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58308844] [2023-12-21 21:00:12,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:00:12,781 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:00:12,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:00:12,784 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:00:12,787 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:00:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:00:12,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 21:00:12,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:00:12,882 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:00:12,882 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 21:00:12,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:00:12,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58308844] [2023-12-21 21:00:12,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58308844] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 21:00:12,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 21:00:12,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 21:00:12,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677329511] [2023-12-21 21:00:12,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 21:00:12,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 21:00:12,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:00:12,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 21:00:12,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 21:00:12,906 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:00:12,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:00:12,933 INFO L93 Difference]: Finished difference Result 33 states and 49 transitions. [2023-12-21 21:00:12,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 21:00:12,936 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2023-12-21 21:00:12,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:00:12,941 INFO L225 Difference]: With dead ends: 33 [2023-12-21 21:00:12,941 INFO L226 Difference]: Without dead ends: 15 [2023-12-21 21:00:12,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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:00:12,947 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 21:00:12,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 21:00:12,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-21 21:00:12,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-21 21:00:12,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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:00:12,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-12-21 21:00:12,969 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 12 [2023-12-21 21:00:12,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:00:12,970 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-12-21 21:00:12,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:00:12,970 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-12-21 21:00:12,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-21 21:00:12,971 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:00:12,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:00:12,976 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 (2)] Forceful destruction successful, exit code 0 [2023-12-21 21:00:13,173 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:00:13,174 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:00:13,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:00:13,175 INFO L85 PathProgramCache]: Analyzing trace with hash -193408226, now seen corresponding path program 1 times [2023-12-21 21:00:13,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:00:13,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475888608] [2023-12-21 21:00:13,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:00:13,176 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:00:13,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:00:13,177 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:00:13,180 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:00:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:00:13,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 21:00:13,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:00:13,346 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:00:13,346 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 21:00:13,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:00:13,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475888608] [2023-12-21 21:00:13,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475888608] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 21:00:13,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 21:00:13,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 21:00:13,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326476823] [2023-12-21 21:00:13,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 21:00:13,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 21:00:13,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:00:13,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 21:00:13,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 21:00:13,356 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:00:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:00:13,445 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2023-12-21 21:00:13,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 21:00:13,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2023-12-21 21:00:13,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:00:13,446 INFO L225 Difference]: With dead ends: 30 [2023-12-21 21:00:13,446 INFO L226 Difference]: Without dead ends: 20 [2023-12-21 21:00:13,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-21 21:00:13,448 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 19 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 21:00:13,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 11 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 21:00:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-21 21:00:13,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2023-12-21 21:00:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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:00:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-12-21 21:00:13,457 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2023-12-21 21:00:13,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:00:13,457 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-12-21 21:00:13,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:00:13,458 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-12-21 21:00:13,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 21:00:13,459 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:00:13,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:00:13,462 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:00:13,662 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:00:13,662 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:00:13,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:00:13,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1840868648, now seen corresponding path program 1 times [2023-12-21 21:00:13,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:00:13,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897331651] [2023-12-21 21:00:13,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:00:13,663 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:00:13,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:00:13,664 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:00:13,676 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:00:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:00:13,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-21 21:00:13,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:00:13,815 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 21:00:13,822 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:00:13,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 21:00:14,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-21 21:00:14,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:00:14,262 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 67 treesize of output 37 [2023-12-21 21:00:14,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:00:14,334 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 79 treesize of output 49 [2023-12-21 21:00:14,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:00:14,360 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:00:14,857 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 66 treesize of output 62 [2023-12-21 21:00:14,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 98 [2023-12-21 21:00:15,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:00:15,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:00:15,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897331651] [2023-12-21 21:00:15,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897331651] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:00:15,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:00:15,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2023-12-21 21:00:15,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067243804] [2023-12-21 21:00:15,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:00:15,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-21 21:00:15,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:00:15,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-21 21:00:15,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2023-12-21 21:00:15,197 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 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:00:19,595 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:00:20,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:00:20,762 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2023-12-21 21:00:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 21:00:20,764 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 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) Word has length 17 [2023-12-21 21:00:20,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:00:20,765 INFO L225 Difference]: With dead ends: 42 [2023-12-21 21:00:20,765 INFO L226 Difference]: Without dead ends: 33 [2023-12-21 21:00:20,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870 [2023-12-21 21:00:20,766 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 59 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-21 21:00:20,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 47 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 291 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2023-12-21 21:00:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-21 21:00:20,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2023-12-21 21:00:20,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:00:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2023-12-21 21:00:20,771 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 17 [2023-12-21 21:00:20,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:00:20,771 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-12-21 21:00:20,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 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:00:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2023-12-21 21:00:20,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 21:00:20,772 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:00:20,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:00:20,774 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:00:20,975 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:00:20,975 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:00:20,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:00:20,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1160810278, now seen corresponding path program 1 times [2023-12-21 21:00:20,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:00:20,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469917069] [2023-12-21 21:00:20,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:00:20,976 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:00:20,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:00:20,978 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:00:20,981 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:00:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:00:21,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 21:00:21,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:00:21,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 21:00:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 21:00:21,059 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:00:21,088 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 14 treesize of output 12 [2023-12-21 21:00:21,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-12-21 21:00:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 21:00:21,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:00:21,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469917069] [2023-12-21 21:00:21,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469917069] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:00:21,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:00:21,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-12-21 21:00:21,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141999312] [2023-12-21 21:00:21,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:00:21,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 21:00:21,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:00:21,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 21:00:21,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-21 21:00:21,109 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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:00:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:00:21,342 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2023-12-21 21:00:21,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 21:00:21,342 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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) Word has length 17 [2023-12-21 21:00:21,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:00:21,343 INFO L225 Difference]: With dead ends: 42 [2023-12-21 21:00:21,343 INFO L226 Difference]: Without dead ends: 32 [2023-12-21 21:00:21,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-21 21:00:21,344 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 21:00:21,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 41 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 21:00:21,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-21 21:00:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-12-21 21:00:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 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:00:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-12-21 21:00:21,349 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 17 [2023-12-21 21:00:21,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:00:21,349 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-12-21 21:00:21,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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:00:21,350 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-12-21 21:00:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-21 21:00:21,350 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:00:21,350 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:00:21,356 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:00:21,553 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:00:21,553 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:00:21,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:00:21,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1209506422, now seen corresponding path program 2 times [2023-12-21 21:00:21,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:00:21,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743340940] [2023-12-21 21:00:21,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 21:00:21,554 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:00:21,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:00:21,555 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:00:21,559 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:00:21,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 21:00:21,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:00:21,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 21:00:21,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:00:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 21:00:21,771 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:00:21,855 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 21:00:21,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:00:21,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743340940] [2023-12-21 21:00:21,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743340940] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:00:21,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:00:21,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-12-21 21:00:21,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596078951] [2023-12-21 21:00:21,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:00:21,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 21:00:21,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:00:21,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 21:00:21,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-21 21:00:21,857 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:00:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:00:22,079 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2023-12-21 21:00:22,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 21:00:22,080 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-21 21:00:22,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:00:22,080 INFO L225 Difference]: With dead ends: 53 [2023-12-21 21:00:22,080 INFO L226 Difference]: Without dead ends: 32 [2023-12-21 21:00:22,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 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:00:22,082 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 56 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 21:00:22,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 21 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 21:00:22,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-21 21:00:22,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2023-12-21 21:00:22,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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:00:22,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-12-21 21:00:22,094 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2023-12-21 21:00:22,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:00:22,094 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-12-21 21:00:22,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:00:22,094 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-12-21 21:00:22,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-21 21:00:22,096 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:00:22,096 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:00:22,106 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:00:22,299 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:00:22,299 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:00:22,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:00:22,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1807460438, now seen corresponding path program 3 times [2023-12-21 21:00:22,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:00:22,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944405808] [2023-12-21 21:00:22,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 21:00:22,300 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:00:22,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:00:22,301 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:00:22,305 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:00:22,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-21 21:00:22,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:00:22,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 21:00:22,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:00:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 21:00:22,473 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:00:22,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 21:00:22,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:00:22,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944405808] [2023-12-21 21:00:22,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944405808] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:00:22,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:00:22,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-12-21 21:00:22,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214216807] [2023-12-21 21:00:22,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:00:22,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 21:00:22,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:00:22,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 21:00:22,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-12-21 21:00:22,593 INFO L87 Difference]: Start difference. First operand 25 states and 29 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:00:22,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:00:22,895 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2023-12-21 21:00:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 21:00:22,895 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 18 [2023-12-21 21:00:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:00:22,896 INFO L225 Difference]: With dead ends: 59 [2023-12-21 21:00:22,896 INFO L226 Difference]: Without dead ends: 46 [2023-12-21 21:00:22,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2023-12-21 21:00:22,897 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 127 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 21:00:22,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 27 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 21:00:22,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-21 21:00:22,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2023-12-21 21:00:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:00:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2023-12-21 21:00:22,905 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 18 [2023-12-21 21:00:22,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:00:22,905 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2023-12-21 21:00:22,905 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:00:22,905 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2023-12-21 21:00:22,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 21:00:22,906 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:00:22,906 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:00:22,914 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 (7)] Ended with exit code 0 [2023-12-21 21:00:23,109 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:00:23,110 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:00:23,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:00:23,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1712818014, now seen corresponding path program 4 times [2023-12-21 21:00:23,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:00:23,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680404737] [2023-12-21 21:00:23,110 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 21:00:23,110 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:00:23,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:00:23,111 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:00:23,112 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:00:23,181 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 21:00:23,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:00:23,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-21 21:00:23,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:00:23,226 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 21:00:23,227 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:00:23,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-21 21:00:23,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:00:23,599 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 30 treesize of output 23 [2023-12-21 21:00:23,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:00:23,778 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 67 treesize of output 37 [2023-12-21 21:00:23,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:00:23,844 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 81 treesize of output 51 [2023-12-21 21:00:23,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:00:23,900 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 107 treesize of output 77 [2023-12-21 21:00:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:00:23,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:00:25,283 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 228 treesize of output 212 [2023-12-21 21:00:25,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:00:25,355 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 1647 treesize of output 1612 [2023-12-21 21:00:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:00:28,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:00:28,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680404737] [2023-12-21 21:00:28,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680404737] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:00:28,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:00:28,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2023-12-21 21:00:28,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184183770] [2023-12-21 21:00:28,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:00:28,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-21 21:00:28,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:00:28,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-21 21:00:28,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2023-12-21 21:00:28,352 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:00:30,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:00:30,978 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2023-12-21 21:00:30,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-21 21:00:30,979 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-21 21:00:30,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:00:30,979 INFO L225 Difference]: With dead ends: 52 [2023-12-21 21:00:30,979 INFO L226 Difference]: Without dead ends: 42 [2023-12-21 21:00:30,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=276, Invalid=1364, Unknown=0, NotChecked=0, Total=1640 [2023-12-21 21:00:30,980 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 50 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-21 21:00:30,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 47 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-21 21:00:30,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-21 21:00:30,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2023-12-21 21:00:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 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:00:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2023-12-21 21:00:30,986 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2023-12-21 21:00:30,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:00:30,986 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2023-12-21 21:00:30,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:00:30,986 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2023-12-21 21:00:30,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 21:00:30,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:00:30,986 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:00:30,989 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:00:31,189 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:00:31,189 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:00:31,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:00:31,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1319791004, now seen corresponding path program 1 times [2023-12-21 21:00:31,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:00:31,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860415630] [2023-12-21 21:00:31,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:00:31,190 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:00:31,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:00:31,191 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:00:31,192 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:00:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:00:31,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 21:00:31,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:00:31,274 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 13 treesize of output 9 [2023-12-21 21:00:31,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-21 21:00:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 21:00:31,339 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:00:31,397 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 16 treesize of output 14 [2023-12-21 21:00:31,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-12-21 21:00:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 21:00:31,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:00:31,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860415630] [2023-12-21 21:00:31,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860415630] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:00:31,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:00:31,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-12-21 21:00:31,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045989971] [2023-12-21 21:00:31,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:00:31,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 21:00:31,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:00:31,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 21:00:31,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-21 21:00:31,424 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 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:00:31,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:00:31,574 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2023-12-21 21:00:31,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 21:00:31,575 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 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 22 [2023-12-21 21:00:31,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:00:31,575 INFO L225 Difference]: With dead ends: 56 [2023-12-21 21:00:31,575 INFO L226 Difference]: Without dead ends: 31 [2023-12-21 21:00:31,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-12-21 21:00:31,576 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 21:00:31,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 61 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 21:00:31,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-21 21:00:31,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-21 21:00:31,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:00:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-12-21 21:00:31,580 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2023-12-21 21:00:31,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:00:31,580 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-12-21 21:00:31,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 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:00:31,580 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-12-21 21:00:31,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-21 21:00:31,580 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:00:31,580 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:00:31,586 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 (9)] Ended with exit code 0 [2023-12-21 21:00:31,783 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:00:31,783 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:00:31,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:00:31,784 INFO L85 PathProgramCache]: Analyzing trace with hash -160565812, now seen corresponding path program 5 times [2023-12-21 21:00:31,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:00:31,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706890274] [2023-12-21 21:00:31,784 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 21:00:31,784 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:00:31,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:00:31,785 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:00:31,786 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:00:31,862 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-12-21 21:00:31,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:00:31,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 21:00:31,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:00:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 21:00:32,016 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:00:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 21:00:32,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:00:32,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706890274] [2023-12-21 21:00:32,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [706890274] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:00:32,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:00:32,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2023-12-21 21:00:32,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401002034] [2023-12-21 21:00:32,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:00:32,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-21 21:00:32,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:00:32,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-21 21:00:32,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2023-12-21 21:00:32,204 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 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:00:32,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:00:32,442 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-12-21 21:00:32,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 21:00:32,442 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 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 23 [2023-12-21 21:00:32,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:00:32,443 INFO L225 Difference]: With dead ends: 38 [2023-12-21 21:00:32,443 INFO L226 Difference]: Without dead ends: 30 [2023-12-21 21:00:32,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2023-12-21 21:00:32,444 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 47 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 21:00:32,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 17 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 21:00:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-21 21:00:32,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-12-21 21:00:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:00:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-12-21 21:00:32,447 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2023-12-21 21:00:32,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:00:32,447 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-12-21 21:00:32,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 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:00:32,447 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-12-21 21:00:32,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-21 21:00:32,448 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:00:32,448 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:00:32,457 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 (10)] Forceful destruction successful, exit code 0 [2023-12-21 21:00:32,651 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:00:32,652 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:00:32,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:00:32,652 INFO L85 PathProgramCache]: Analyzing trace with hash 851391128, now seen corresponding path program 6 times [2023-12-21 21:00:32,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:00:32,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853239332] [2023-12-21 21:00:32,653 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 21:00:32,653 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:00:32,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:00:32,654 INFO L229 MonitoredProcess]: Starting monitored process 11 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:00:32,655 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 (11)] Waiting until timeout for monitored process [2023-12-21 21:00:32,771 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-12-21 21:00:32,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:00:32,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-21 21:00:32,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:00:32,811 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 21:00:32,812 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:00:33,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-21 21:00:33,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:00:33,253 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 30 treesize of output 23 [2023-12-21 21:00:33,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:00:33,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 35 [2023-12-21 21:00:33,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:00:33,863 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 67 treesize of output 37 [2023-12-21 21:00:33,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:00:33,944 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 81 treesize of output 51 [2023-12-21 21:00:34,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:00:34,043 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 109 treesize of output 79 [2023-12-21 21:00:34,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:00:34,130 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 163 treesize of output 133 [2023-12-21 21:00:34,162 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:00:34,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:00:49,508 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 601 treesize of output 567 [2023-12-21 21:00:49,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:00:49,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 99378 treesize of output 96894 [2023-12-21 21:02:14,932 WARN L293 SmtUtils]: Spent 32.12s on a formula simplification that was a NOOP. DAG size: 384 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 21:02:36,981 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:02:36,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:02:36,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853239332] [2023-12-21 21:02:36,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853239332] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:02:36,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:02:36,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 46 [2023-12-21 21:02:36,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401328659] [2023-12-21 21:02:36,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:02:36,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-12-21 21:02:36,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:02:36,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-12-21 21:02:36,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1710, Unknown=6, NotChecked=0, Total=2070 [2023-12-21 21:02:36,983 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 46 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 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:02:49,478 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse341 (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse228 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse333 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse228)) (.cse336 (select .cse341 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (.cse335 (select .cse341 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse228)) (.cse7 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse228))) (let ((.cse11 (bvslt (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse12 (not (= (select .cse7 .cse8) (_ bv1 32)))) (.cse13 (not (= (select .cse7 .cse9) (_ bv1 32)))) (.cse10 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv4 32)))) (.cse5 (concat .cse336 .cse335)) (.cse6 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse334 (select .cse7 .cse333)) (.cse14 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)))) (and (not (bvslt (_ bv3 32) c_~N~0)) (or (= (let ((.cse0 (let ((.cse1 (store (store .cse7 .cse8 (_ bv4 32)) .cse9 (_ bv4 32)))) (bvadd ((_ sign_extend 32) (select .cse1 .cse2)) (let ((.cse3 (bvadd (let ((.cse4 (bvadd ((_ sign_extend 32) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse5))) (concat ((_ extract 63 32) .cse4) ((_ extract 31 0) .cse4))) ((_ sign_extend 32) (select .cse1 .cse6))))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3))))))) (concat ((_ extract 63 32) .cse0) ((_ extract 31 0) .cse0))) .cse10) .cse11 .cse12 .cse13 .cse14) (or .cse11 (let ((.cse19 ((_ sign_extend 32) (_ bv4 32))) (.cse22 ((_ sign_extend 32) (_ bv1 32)))) (let ((.cse55 (let ((.cse328 (bvadd .cse22 .cse5))) (concat ((_ extract 63 32) .cse328) ((_ extract 31 0) .cse328)))) (.cse67 (let ((.cse327 (bvadd .cse19 .cse5))) (concat ((_ extract 63 32) .cse327) ((_ extract 31 0) .cse327))))) (let ((.cse45 (let ((.cse326 (bvadd .cse67 .cse19))) (concat ((_ extract 63 32) .cse326) ((_ extract 31 0) .cse326)))) (.cse15 (= (bvadd (_ bv8 32) .cse228) (_ bv0 32))) (.cse51 (let ((.cse325 (bvadd .cse22 .cse55))) (concat ((_ extract 63 32) .cse325) ((_ extract 31 0) .cse325))))) (let ((.cse307 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= .cse10 (let ((.cse324 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse51))) (concat ((_ extract 63 32) .cse324) ((_ extract 31 0) .cse324)))))) (.cse49 (not .cse15)) (.cse48 (let ((.cse323 (bvadd .cse67 .cse22))) (concat ((_ extract 63 32) .cse323) ((_ extract 31 0) .cse323)))) (.cse43 (= (bvadd (_ bv4 32) .cse228) (_ bv0 32))) (.cse306 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse321 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse320 (bvadd .cse321 .cse45))) (concat ((_ extract 63 32) .cse320) ((_ extract 31 0) .cse320)))) (= .cse10 (let ((.cse322 (bvadd .cse321 .cse51))) (concat ((_ extract 63 32) .cse322) ((_ extract 31 0) .cse322)))))))) (.cse39 (= (_ bv8 32) .cse228))) (let ((.cse56 (not .cse39)) (.cse229 (or .cse15 .cse306)) (.cse52 (not .cse43)) (.cse230 (or .cse49 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse318 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse317 (bvadd .cse318 .cse48))) (concat ((_ extract 63 32) .cse317) ((_ extract 31 0) .cse317)))) (= .cse10 (let ((.cse319 (bvadd .cse318 .cse45))) (concat ((_ extract 63 32) .cse319) ((_ extract 31 0) .cse319))))))))) (.cse233 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse314 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse313 (bvadd .cse314 .cse48))) (concat ((_ extract 63 32) .cse313) ((_ extract 31 0) .cse313)))) (= .cse10 (let ((.cse315 (bvadd .cse314 .cse45))) (concat ((_ extract 63 32) .cse315) ((_ extract 31 0) .cse315)))) (= .cse10 (let ((.cse316 (bvadd .cse314 .cse51))) (concat ((_ extract 63 32) .cse316) ((_ extract 31 0) .cse316)))))))) (.cse231 (or .cse15 .cse307)) (.cse232 (or .cse49 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= .cse10 (let ((.cse312 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse48))) (concat ((_ extract 63 32) .cse312) ((_ extract 31 0) .cse312))))))) (.cse234 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse310 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse309 (bvadd .cse310 .cse48))) (concat ((_ extract 63 32) .cse309) ((_ extract 31 0) .cse309)))) (= .cse10 (let ((.cse311 (bvadd .cse310 .cse51))) (concat ((_ extract 63 32) .cse311) ((_ extract 31 0) .cse311)))))))) (.cse32 (= (_ bv4 32) .cse228))) (let ((.cse26 (not .cse32)) (.cse57 (and .cse229 (or .cse52 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= .cse10 (let ((.cse308 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse45))) (concat ((_ extract 63 32) .cse308) ((_ extract 31 0) .cse308)))))) .cse230 .cse233 (or (and .cse231 .cse232 .cse234) .cse43))) (.cse41 (and .cse306 .cse307 .cse233 .cse234)) (.cse16 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse303 (let ((.cse305 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse305) ((_ extract 31 0) .cse305))))) (let ((.cse299 (let ((.cse304 (bvadd .cse303 .cse22))) (concat ((_ extract 63 32) .cse304) ((_ extract 31 0) .cse304))))) (or (= (let ((.cse298 (bvadd .cse22 .cse299))) (concat ((_ extract 63 32) .cse298) ((_ extract 31 0) .cse298))) .cse10) (= .cse10 (let ((.cse300 (bvadd .cse19 .cse299))) (concat ((_ extract 63 32) .cse300) ((_ extract 31 0) .cse300)))) (= (let ((.cse301 (bvadd .cse19 (let ((.cse302 (bvadd .cse303 .cse19))) (concat ((_ extract 63 32) .cse302) ((_ extract 31 0) .cse302)))))) (concat ((_ extract 63 32) .cse301) ((_ extract 31 0) .cse301))) .cse10)))))) (.cse33 (or .cse39 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse295 (bvadd .cse22 (let ((.cse296 (bvadd (let ((.cse297 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse297) ((_ extract 31 0) .cse297))) .cse22))) (concat ((_ extract 63 32) .cse296) ((_ extract 31 0) .cse296)))))) (concat ((_ extract 63 32) .cse295) ((_ extract 31 0) .cse295))) .cse10)))) (.cse17 (or .cse56 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= .cse10 (let ((.cse292 (bvadd .cse19 (let ((.cse293 (bvadd (let ((.cse294 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse294) ((_ extract 31 0) .cse294))) .cse22))) (concat ((_ extract 63 32) .cse293) ((_ extract 31 0) .cse293)))))) (concat ((_ extract 63 32) .cse292) ((_ extract 31 0) .cse292))))))) (.cse27 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse285 (let ((.cse290 (bvadd (let ((.cse291 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse291) ((_ extract 31 0) .cse291))) .cse22))) (concat ((_ extract 63 32) .cse290) ((_ extract 31 0) .cse290))))) (or (= .cse10 (let ((.cse284 (bvadd .cse19 .cse285))) (concat ((_ extract 63 32) .cse284) ((_ extract 31 0) .cse284)))) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse287 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse286 (bvadd .cse287 .cse285))) (concat ((_ extract 63 32) .cse286) ((_ extract 31 0) .cse286))) .cse10) (= .cse10 (let ((.cse288 (bvadd .cse287 .cse48))) (concat ((_ extract 63 32) .cse288) ((_ extract 31 0) .cse288)))) (= .cse10 (let ((.cse289 (bvadd .cse287 .cse45))) (concat ((_ extract 63 32) .cse289) ((_ extract 31 0) .cse289))))))))))) (.cse28 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse278 (let ((.cse282 (bvadd (let ((.cse283 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse283) ((_ extract 31 0) .cse283))) .cse22))) (concat ((_ extract 63 32) .cse282) ((_ extract 31 0) .cse282))))) (or (= .cse10 (let ((.cse277 (bvadd .cse19 .cse278))) (concat ((_ extract 63 32) .cse277) ((_ extract 31 0) .cse277)))) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse280 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse279 (bvadd .cse280 .cse278))) (concat ((_ extract 63 32) .cse279) ((_ extract 31 0) .cse279))) .cse10) (= .cse10 (let ((.cse281 (bvadd .cse280 .cse48))) (concat ((_ extract 63 32) .cse281) ((_ extract 31 0) .cse281))))))))))) (.cse29 (or .cse39 (and (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse258 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) (let ((.cse259 (bvadd (let ((.cse260 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse260) ((_ extract 31 0) .cse260))) .cse22))) (concat ((_ extract 63 32) .cse259) ((_ extract 31 0) .cse259)))))) (concat ((_ extract 63 32) .cse258) ((_ extract 31 0) .cse258))) .cse10)) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse262 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse261 (bvadd .cse262 (let ((.cse263 (bvadd (let ((.cse264 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse264) ((_ extract 31 0) .cse264))) .cse22))) (concat ((_ extract 63 32) .cse263) ((_ extract 31 0) .cse263)))))) (concat ((_ extract 63 32) .cse261) ((_ extract 31 0) .cse261))) .cse10) (= .cse10 (let ((.cse265 (bvadd .cse262 .cse45))) (concat ((_ extract 63 32) .cse265) ((_ extract 31 0) .cse265))))))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse267 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse266 (bvadd .cse267 (let ((.cse268 (bvadd (let ((.cse269 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse269) ((_ extract 31 0) .cse269))) .cse22))) (concat ((_ extract 63 32) .cse268) ((_ extract 31 0) .cse268)))))) (concat ((_ extract 63 32) .cse266) ((_ extract 31 0) .cse266))) .cse10) (= .cse10 (let ((.cse270 (bvadd .cse267 .cse48))) (concat ((_ extract 63 32) .cse270) ((_ extract 31 0) .cse270)))) (= .cse10 (let ((.cse271 (bvadd .cse267 .cse45))) (concat ((_ extract 63 32) .cse271) ((_ extract 31 0) .cse271))))))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse273 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse272 (bvadd .cse273 (let ((.cse274 (bvadd (let ((.cse275 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse275) ((_ extract 31 0) .cse275))) .cse22))) (concat ((_ extract 63 32) .cse274) ((_ extract 31 0) .cse274)))))) (concat ((_ extract 63 32) .cse272) ((_ extract 31 0) .cse272))) .cse10) (= .cse10 (let ((.cse276 (bvadd .cse273 .cse48))) (concat ((_ extract 63 32) .cse276) ((_ extract 31 0) .cse276)))))))))) (.cse30 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse253 (let ((.cse256 (bvadd (let ((.cse257 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse257) ((_ extract 31 0) .cse257))) .cse22))) (concat ((_ extract 63 32) .cse256) ((_ extract 31 0) .cse256))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse252 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse251 (bvadd .cse252 .cse253))) (concat ((_ extract 63 32) .cse251) ((_ extract 31 0) .cse251))) .cse10) (= .cse10 (let ((.cse254 (bvadd .cse252 .cse45))) (concat ((_ extract 63 32) .cse254) ((_ extract 31 0) .cse254))))))) (= .cse10 (let ((.cse255 (bvadd .cse19 .cse253))) (concat ((_ extract 63 32) .cse255) ((_ extract 31 0) .cse255)))))))) (.cse31 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse247 (let ((.cse249 (bvadd (let ((.cse250 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse250) ((_ extract 31 0) .cse250))) .cse22))) (concat ((_ extract 63 32) .cse249) ((_ extract 31 0) .cse249))))) (or (= .cse10 (let ((.cse246 (bvadd .cse19 .cse247))) (concat ((_ extract 63 32) .cse246) ((_ extract 31 0) .cse246)))) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= (let ((.cse248 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse247))) (concat ((_ extract 63 32) .cse248) ((_ extract 31 0) .cse248))) .cse10)))))) (.cse35 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse242 (let ((.cse245 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse245) ((_ extract 31 0) .cse245))))) (or (= (let ((.cse240 (bvadd .cse22 (let ((.cse241 (bvadd .cse242 .cse22))) (concat ((_ extract 63 32) .cse241) ((_ extract 31 0) .cse241)))))) (concat ((_ extract 63 32) .cse240) ((_ extract 31 0) .cse240))) .cse10) (= (let ((.cse243 (bvadd .cse19 (let ((.cse244 (bvadd .cse242 .cse19))) (concat ((_ extract 63 32) .cse244) ((_ extract 31 0) .cse244)))))) (concat ((_ extract 63 32) .cse243) ((_ extract 31 0) .cse243))) .cse10))))) (.cse34 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse236 (let ((.cse238 (bvadd (let ((.cse239 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse239) ((_ extract 31 0) .cse239))) .cse22))) (concat ((_ extract 63 32) .cse238) ((_ extract 31 0) .cse238))))) (or (= (let ((.cse235 (bvadd .cse22 .cse236))) (concat ((_ extract 63 32) .cse235) ((_ extract 31 0) .cse235))) .cse10) (= .cse10 (let ((.cse237 (bvadd .cse19 .cse236))) (concat ((_ extract 63 32) .cse237) ((_ extract 31 0) .cse237)))))))) (.cse42 (and .cse229 .cse230 .cse231 .cse232 .cse233 .cse234)) (.cse40 (= (_ bv0 32) .cse228))) (and (or (and (or .cse15 (and (or (and .cse16 .cse17 (or (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse21 (let ((.cse25 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25))))) (or (= .cse10 (let ((.cse18 (bvadd .cse19 (let ((.cse20 (bvadd .cse21 .cse22))) (concat ((_ extract 63 32) .cse20) ((_ extract 31 0) .cse20)))))) (concat ((_ extract 63 32) .cse18) ((_ extract 31 0) .cse18)))) (= (let ((.cse23 (bvadd .cse19 (let ((.cse24 (bvadd .cse21 .cse19))) (concat ((_ extract 63 32) .cse24) ((_ extract 31 0) .cse24)))))) (concat ((_ extract 63 32) .cse23) ((_ extract 31 0) .cse23))) .cse10)))) .cse26) (or (and .cse27 .cse28 .cse29 .cse30 .cse31) .cse32) (or (and .cse33 .cse34) .cse32) (or (and .cse35 (or .cse26 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse36 (bvadd .cse19 (let ((.cse37 (bvadd (let ((.cse38 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38))) .cse19))) (concat ((_ extract 63 32) .cse37) ((_ extract 31 0) .cse37)))))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36))) .cse10)))) .cse39)) .cse40) (or .cse41 .cse40 .cse39 .cse32))) (or .cse42 .cse40 .cse39 .cse32)) .cse43) (or (and (or (and .cse40 (= (let ((.cse44 (bvadd .cse19 .cse45))) (concat ((_ extract 63 32) .cse44) ((_ extract 31 0) .cse44))) .cse10)) (and (not .cse40) (or (and .cse26 (or (and (= .cse10 (let ((.cse46 (bvadd .cse22 .cse45))) (concat ((_ extract 63 32) .cse46) ((_ extract 31 0) .cse46)))) .cse43) (and (or (and .cse15 (= (let ((.cse47 (bvadd .cse22 .cse48))) (concat ((_ extract 63 32) .cse47) ((_ extract 31 0) .cse47))) .cse10)) (and .cse49 (= (let ((.cse50 (bvadd .cse22 .cse51))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50))) .cse10))) .cse52))) (and (= (let ((.cse53 (bvadd .cse19 (let ((.cse54 (bvadd .cse19 .cse55))) (concat ((_ extract 63 32) .cse54) ((_ extract 31 0) .cse54)))))) (concat ((_ extract 63 32) .cse53) ((_ extract 31 0) .cse53))) .cse10) .cse32)))) .cse56 (or .cse57 .cse40 .cse32)) (and .cse39 (= .cse10 (let ((.cse58 (bvadd .cse19 .cse51))) (concat ((_ extract 63 32) .cse58) ((_ extract 31 0) .cse58)))))) (or (let ((.cse59 (or .cse42 .cse40 .cse39)) (.cse60 (or .cse15 (and (or .cse41 .cse40 .cse39) (or (and .cse16 .cse33 .cse17 .cse27 .cse28 .cse29 .cse30 .cse31 (or .cse35 .cse39) .cse34) .cse40))))) (and (or (and .cse59 .cse60) .cse43) (or .cse57 .cse40 .cse39) (or (and (or (let ((.cse73 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (= (let ((.cse226 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) (let ((.cse227 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse55))) (concat ((_ extract 63 32) .cse227) ((_ extract 31 0) .cse227)))))) (concat ((_ extract 63 32) .cse226) ((_ extract 31 0) .cse226))) .cse10))) (.cse72 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse223 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse222 (bvadd .cse223 (let ((.cse224 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse55))) (concat ((_ extract 63 32) .cse224) ((_ extract 31 0) .cse224)))))) (concat ((_ extract 63 32) .cse222) ((_ extract 31 0) .cse222))) .cse10) (= .cse10 (let ((.cse225 (bvadd .cse223 .cse45))) (concat ((_ extract 63 32) .cse225) ((_ extract 31 0) .cse225))))))))) (let ((.cse157 (or .cse49 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (= (let ((.cse220 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) (let ((.cse221 (bvadd .cse67 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse221) ((_ extract 31 0) .cse221)))))) (concat ((_ extract 63 32) .cse220) ((_ extract 31 0) .cse220))) .cse10)))) (.cse158 (or .cse15 .cse72)) (.cse71 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse215 ((_ sign_extend 32) v_arrayElimCell_47)) (.cse217 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= (let ((.cse214 (bvadd .cse215 (let ((.cse216 (bvadd .cse217 .cse55))) (concat ((_ extract 63 32) .cse216) ((_ extract 31 0) .cse216)))))) (concat ((_ extract 63 32) .cse214) ((_ extract 31 0) .cse214))) .cse10) (= (let ((.cse218 (bvadd .cse215 (let ((.cse219 (bvadd .cse67 .cse217))) (concat ((_ extract 63 32) .cse219) ((_ extract 31 0) .cse219)))))) (concat ((_ extract 63 32) .cse218) ((_ extract 31 0) .cse218))) .cse10))))) (.cse159 (or .cse49 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse211 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse210 (bvadd .cse211 .cse45))) (concat ((_ extract 63 32) .cse210) ((_ extract 31 0) .cse210)))) (= (let ((.cse212 (bvadd .cse211 (let ((.cse213 (bvadd .cse67 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse213) ((_ extract 31 0) .cse213)))))) (concat ((_ extract 63 32) .cse212) ((_ extract 31 0) .cse212))) .cse10)))))) (.cse74 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse204 ((_ sign_extend 32) v_arrayElimCell_47)) (.cse206 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= (let ((.cse203 (bvadd .cse204 (let ((.cse205 (bvadd .cse206 .cse55))) (concat ((_ extract 63 32) .cse205) ((_ extract 31 0) .cse205)))))) (concat ((_ extract 63 32) .cse203) ((_ extract 31 0) .cse203))) .cse10) (= .cse10 (let ((.cse207 (bvadd .cse204 .cse45))) (concat ((_ extract 63 32) .cse207) ((_ extract 31 0) .cse207)))) (= (let ((.cse208 (bvadd .cse204 (let ((.cse209 (bvadd .cse67 .cse206))) (concat ((_ extract 63 32) .cse209) ((_ extract 31 0) .cse209)))))) (concat ((_ extract 63 32) .cse208) ((_ extract 31 0) .cse208))) .cse10))))) (.cse160 (or .cse15 .cse73))) (and (or .cse15 (and (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse68 ((_ sign_extend 32) v_arrayElimCell_46))) (let ((.cse62 (let ((.cse69 (bvadd (let ((.cse70 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse70) ((_ extract 31 0) .cse70))) .cse68))) (concat ((_ extract 63 32) .cse69) ((_ extract 31 0) .cse69))))) (or (= (let ((.cse61 (bvadd .cse62 .cse19))) (concat ((_ extract 63 32) .cse61) ((_ extract 31 0) .cse61))) .cse10) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse64 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse63 (bvadd .cse62 .cse64))) (concat ((_ extract 63 32) .cse63) ((_ extract 31 0) .cse63)))) (= (let ((.cse65 (bvadd .cse64 (let ((.cse66 (bvadd .cse67 .cse68))) (concat ((_ extract 63 32) .cse66) ((_ extract 31 0) .cse66)))))) (concat ((_ extract 63 32) .cse65) ((_ extract 31 0) .cse65))) .cse10)))))))) (or (and .cse71 .cse72 .cse73 .cse74) .cse39) (or (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse77 (let ((.cse80 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse80) ((_ extract 31 0) .cse80))))) (or (= (let ((.cse75 (bvadd (let ((.cse76 (bvadd .cse77 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse76) ((_ extract 31 0) .cse76))) .cse22))) (concat ((_ extract 63 32) .cse75) ((_ extract 31 0) .cse75))) .cse10) (= (let ((.cse78 (bvadd .cse19 (let ((.cse79 (bvadd .cse77 .cse19))) (concat ((_ extract 63 32) .cse79) ((_ extract 31 0) .cse79)))))) (concat ((_ extract 63 32) .cse78) ((_ extract 31 0) .cse78))) .cse10)))) .cse39) (or (and (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse85 ((_ sign_extend 32) v_arrayElimCell_47)) (.cse84 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= .cse10 (let ((.cse81 (bvadd (let ((.cse82 (bvadd (let ((.cse83 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse83) ((_ extract 31 0) .cse83))) .cse84))) (concat ((_ extract 63 32) .cse82) ((_ extract 31 0) .cse82))) .cse85))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81)))) (= (let ((.cse86 (bvadd .cse85 (let ((.cse87 (bvadd .cse67 .cse84))) (concat ((_ extract 63 32) .cse87) ((_ extract 31 0) .cse87)))))) (concat ((_ extract 63 32) .cse86) ((_ extract 31 0) .cse86))) .cse10)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse89 ((_ sign_extend 32) v_arrayElimCell_47)) (.cse93 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= .cse10 (let ((.cse88 (bvadd .cse89 .cse45))) (concat ((_ extract 63 32) .cse88) ((_ extract 31 0) .cse88)))) (= .cse10 (let ((.cse90 (bvadd (let ((.cse91 (bvadd (let ((.cse92 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse92) ((_ extract 31 0) .cse92))) .cse93))) (concat ((_ extract 63 32) .cse91) ((_ extract 31 0) .cse91))) .cse89))) (concat ((_ extract 63 32) .cse90) ((_ extract 31 0) .cse90)))) (= (let ((.cse94 (bvadd .cse89 (let ((.cse95 (bvadd .cse67 .cse93))) (concat ((_ extract 63 32) .cse95) ((_ extract 31 0) .cse95)))))) (concat ((_ extract 63 32) .cse94) ((_ extract 31 0) .cse94))) .cse10)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse97 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse96 (bvadd .cse97 .cse45))) (concat ((_ extract 63 32) .cse96) ((_ extract 31 0) .cse96)))) (= .cse10 (let ((.cse98 (bvadd (let ((.cse99 (bvadd (let ((.cse100 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse100) ((_ extract 31 0) .cse100))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse99) ((_ extract 31 0) .cse99))) .cse97))) (concat ((_ extract 63 32) .cse98) ((_ extract 31 0) .cse98))))))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (= .cse10 (let ((.cse101 (bvadd (let ((.cse102 (bvadd (let ((.cse103 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse103) ((_ extract 31 0) .cse103))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse102) ((_ extract 31 0) .cse102))) ((_ sign_extend 32) v_arrayElimCell_47)))) (concat ((_ extract 63 32) .cse101) ((_ extract 31 0) .cse101)))))) .cse39) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse105 (let ((.cse107 (bvadd (let ((.cse108 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse108) ((_ extract 31 0) .cse108))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse107) ((_ extract 31 0) .cse107))))) (or (= (let ((.cse104 (bvadd .cse105 .cse19))) (concat ((_ extract 63 32) .cse104) ((_ extract 31 0) .cse104))) .cse10) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= .cse10 (let ((.cse106 (bvadd .cse105 ((_ sign_extend 32) v_arrayElimCell_47)))) (concat ((_ extract 63 32) .cse106) ((_ extract 31 0) .cse106)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse114 (let ((.cse116 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse116) ((_ extract 31 0) .cse116))))) (let ((.cse110 (let ((.cse115 (bvadd .cse114 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse115) ((_ extract 31 0) .cse115))))) (or (= (let ((.cse109 (bvadd .cse110 .cse19))) (concat ((_ extract 63 32) .cse109) ((_ extract 31 0) .cse109))) .cse10) (= (let ((.cse111 (bvadd .cse110 .cse22))) (concat ((_ extract 63 32) .cse111) ((_ extract 31 0) .cse111))) .cse10) (= (let ((.cse112 (bvadd .cse19 (let ((.cse113 (bvadd .cse114 .cse19))) (concat ((_ extract 63 32) .cse113) ((_ extract 31 0) .cse113)))))) (concat ((_ extract 63 32) .cse112) ((_ extract 31 0) .cse112))) .cse10))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse124 ((_ sign_extend 32) v_arrayElimCell_46))) (let ((.cse118 (let ((.cse125 (bvadd (let ((.cse126 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse126) ((_ extract 31 0) .cse126))) .cse124))) (concat ((_ extract 63 32) .cse125) ((_ extract 31 0) .cse125))))) (or (= (let ((.cse117 (bvadd .cse118 .cse19))) (concat ((_ extract 63 32) .cse117) ((_ extract 31 0) .cse117))) .cse10) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse120 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse119 (bvadd .cse120 .cse45))) (concat ((_ extract 63 32) .cse119) ((_ extract 31 0) .cse119)))) (= .cse10 (let ((.cse121 (bvadd .cse118 .cse120))) (concat ((_ extract 63 32) .cse121) ((_ extract 31 0) .cse121)))) (= (let ((.cse122 (bvadd .cse120 (let ((.cse123 (bvadd .cse67 .cse124))) (concat ((_ extract 63 32) .cse123) ((_ extract 31 0) .cse123)))))) (concat ((_ extract 63 32) .cse122) ((_ extract 31 0) .cse122))) .cse10)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse128 (let ((.cse130 (bvadd (let ((.cse131 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse131) ((_ extract 31 0) .cse131))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse130) ((_ extract 31 0) .cse130))))) (or (= (let ((.cse127 (bvadd .cse128 .cse19))) (concat ((_ extract 63 32) .cse127) ((_ extract 31 0) .cse127))) .cse10) (= (let ((.cse129 (bvadd .cse128 .cse22))) (concat ((_ extract 63 32) .cse129) ((_ extract 31 0) .cse129))) .cse10)))) (or (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse132 (bvadd (let ((.cse133 (bvadd (let ((.cse134 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse134) ((_ extract 31 0) .cse134))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse133) ((_ extract 31 0) .cse133))) .cse22))) (concat ((_ extract 63 32) .cse132) ((_ extract 31 0) .cse132))) .cse10)) .cse39) (or .cse56 (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse135 (bvadd (let ((.cse136 (bvadd (let ((.cse137 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse137) ((_ extract 31 0) .cse137))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse136) ((_ extract 31 0) .cse136))) .cse19))) (concat ((_ extract 63 32) .cse135) ((_ extract 31 0) .cse135))) .cse10))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse139 (let ((.cse143 (bvadd (let ((.cse144 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse144) ((_ extract 31 0) .cse144))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse143) ((_ extract 31 0) .cse143))))) (or (= (let ((.cse138 (bvadd .cse139 .cse19))) (concat ((_ extract 63 32) .cse138) ((_ extract 31 0) .cse138))) .cse10) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse141 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse140 (bvadd .cse141 .cse45))) (concat ((_ extract 63 32) .cse140) ((_ extract 31 0) .cse140)))) (= .cse10 (let ((.cse142 (bvadd .cse139 .cse141))) (concat ((_ extract 63 32) .cse142) ((_ extract 31 0) .cse142)))))))))))) (or .cse15 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse146 (let ((.cse148 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse55))) (concat ((_ extract 63 32) .cse148) ((_ extract 31 0) .cse148))))) (or (= .cse10 (let ((.cse145 (bvadd .cse19 .cse146))) (concat ((_ extract 63 32) .cse145) ((_ extract 31 0) .cse145)))) (= .cse10 (let ((.cse147 (bvadd .cse22 .cse146))) (concat ((_ extract 63 32) .cse147) ((_ extract 31 0) .cse147)))))))) (or .cse15 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse151 (let ((.cse154 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse55))) (concat ((_ extract 63 32) .cse154) ((_ extract 31 0) .cse154)))) (.cse150 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse149 (bvadd .cse150 .cse151))) (concat ((_ extract 63 32) .cse149) ((_ extract 31 0) .cse149))) .cse10) (= .cse10 (let ((.cse152 (bvadd .cse19 .cse151))) (concat ((_ extract 63 32) .cse152) ((_ extract 31 0) .cse152)))) (= .cse10 (let ((.cse153 (bvadd .cse150 .cse45))) (concat ((_ extract 63 32) .cse153) ((_ extract 31 0) .cse153)))))))) (or (forall ((v_arrayElimCell_46 (_ BitVec 32))) (= .cse10 (let ((.cse155 (bvadd .cse19 (let ((.cse156 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse55))) (concat ((_ extract 63 32) .cse156) ((_ extract 31 0) .cse156)))))) (concat ((_ extract 63 32) .cse155) ((_ extract 31 0) .cse155))))) .cse56) (or (and .cse157 .cse158 .cse71 .cse159 .cse74 .cse160) .cse39) (or .cse49 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse163 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= .cse10 (let ((.cse161 (bvadd .cse19 (let ((.cse162 (bvadd .cse163 .cse55))) (concat ((_ extract 63 32) .cse162) ((_ extract 31 0) .cse162)))))) (concat ((_ extract 63 32) .cse161) ((_ extract 31 0) .cse161)))) (= (let ((.cse164 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) (let ((.cse165 (bvadd .cse67 .cse163))) (concat ((_ extract 63 32) .cse165) ((_ extract 31 0) .cse165)))))) (concat ((_ extract 63 32) .cse164) ((_ extract 31 0) .cse164))) .cse10))))) (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse168 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= (let ((.cse166 (bvadd .cse22 (let ((.cse167 (bvadd .cse67 .cse168))) (concat ((_ extract 63 32) .cse167) ((_ extract 31 0) .cse167)))))) (concat ((_ extract 63 32) .cse166) ((_ extract 31 0) .cse166))) .cse10) (= .cse10 (let ((.cse169 (bvadd .cse22 (let ((.cse170 (bvadd .cse168 .cse55))) (concat ((_ extract 63 32) .cse170) ((_ extract 31 0) .cse170)))))) (concat ((_ extract 63 32) .cse169) ((_ extract 31 0) .cse169))))))) (or (and .cse157 .cse158 .cse71 .cse159 (or .cse15 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (= .cse10 (let ((.cse171 (bvadd .cse22 (let ((.cse172 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse55))) (concat ((_ extract 63 32) .cse172) ((_ extract 31 0) .cse172)))))) (concat ((_ extract 63 32) .cse171) ((_ extract 31 0) .cse171)))))) .cse74 .cse160) .cse39) (or .cse15 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse174 (let ((.cse176 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse55))) (concat ((_ extract 63 32) .cse176) ((_ extract 31 0) .cse176))))) (or (= (let ((.cse173 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse174))) (concat ((_ extract 63 32) .cse173) ((_ extract 31 0) .cse173))) .cse10) (= .cse10 (let ((.cse175 (bvadd .cse19 .cse174))) (concat ((_ extract 63 32) .cse175) ((_ extract 31 0) .cse175)))))))) (or .cse49 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse181 ((_ sign_extend 32) v_arrayElimCell_47)) (.cse179 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= .cse10 (let ((.cse177 (bvadd .cse19 (let ((.cse178 (bvadd .cse179 .cse55))) (concat ((_ extract 63 32) .cse178) ((_ extract 31 0) .cse178)))))) (concat ((_ extract 63 32) .cse177) ((_ extract 31 0) .cse177)))) (= .cse10 (let ((.cse180 (bvadd .cse181 .cse45))) (concat ((_ extract 63 32) .cse180) ((_ extract 31 0) .cse180)))) (= (let ((.cse182 (bvadd .cse181 (let ((.cse183 (bvadd .cse67 .cse179))) (concat ((_ extract 63 32) .cse183) ((_ extract 31 0) .cse183)))))) (concat ((_ extract 63 32) .cse182) ((_ extract 31 0) .cse182))) .cse10))))) (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse191 ((_ sign_extend 32) v_arrayElimCell_46))) (let ((.cse185 (let ((.cse192 (bvadd .cse191 .cse55))) (concat ((_ extract 63 32) .cse192) ((_ extract 31 0) .cse192))))) (or (= .cse10 (let ((.cse184 (bvadd .cse19 .cse185))) (concat ((_ extract 63 32) .cse184) ((_ extract 31 0) .cse184)))) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse187 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse186 (bvadd .cse187 .cse185))) (concat ((_ extract 63 32) .cse186) ((_ extract 31 0) .cse186))) .cse10) (= .cse10 (let ((.cse188 (bvadd .cse187 .cse45))) (concat ((_ extract 63 32) .cse188) ((_ extract 31 0) .cse188)))) (= (let ((.cse189 (bvadd .cse187 (let ((.cse190 (bvadd .cse67 .cse191))) (concat ((_ extract 63 32) .cse190) ((_ extract 31 0) .cse190)))))) (concat ((_ extract 63 32) .cse189) ((_ extract 31 0) .cse189))) .cse10)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse198 ((_ sign_extend 32) v_arrayElimCell_46))) (let ((.cse195 (let ((.cse200 (bvadd .cse198 .cse55))) (concat ((_ extract 63 32) .cse200) ((_ extract 31 0) .cse200))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse194 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse193 (bvadd .cse194 .cse195))) (concat ((_ extract 63 32) .cse193) ((_ extract 31 0) .cse193))) .cse10) (= (let ((.cse196 (bvadd .cse194 (let ((.cse197 (bvadd .cse67 .cse198))) (concat ((_ extract 63 32) .cse197) ((_ extract 31 0) .cse197)))))) (concat ((_ extract 63 32) .cse196) ((_ extract 31 0) .cse196))) .cse10)))) (= .cse10 (let ((.cse199 (bvadd .cse19 .cse195))) (concat ((_ extract 63 32) .cse199) ((_ extract 31 0) .cse199)))))))) (or .cse49 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (= (let ((.cse201 (bvadd .cse22 (let ((.cse202 (bvadd .cse67 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse202) ((_ extract 31 0) .cse202)))))) (concat ((_ extract 63 32) .cse201) ((_ extract 31 0) .cse201))) .cse10)))))) .cse40) .cse59 .cse60) .cse43))) .cse32)))))))) .cse14) (or (= (let ((.cse329 (let ((.cse331 (store (store .cse7 .cse333 (_ bv4 32)) .cse8 (_ bv4 32)))) (bvadd (let ((.cse330 (bvadd ((_ sign_extend 32) (select .cse331 .cse6)) (let ((.cse332 (bvadd .cse5 ((_ sign_extend 32) (select .cse331 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (concat ((_ extract 63 32) .cse332) ((_ extract 31 0) .cse332)))))) (concat ((_ extract 63 32) .cse330) ((_ extract 31 0) .cse330))) ((_ sign_extend 32) (select .cse331 .cse2)))))) (concat ((_ extract 63 32) .cse329) ((_ extract 31 0) .cse329))) .cse10) .cse12 (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (not (= (_ bv1 32) .cse334)) (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (= .cse335 ((_ extract 31 0) (_ bv0 64))) (bvslt (_ bv2 32) c_~N~0) (= (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) (bvule c_~N~0 (_ bv536870911 32)) (= .cse336 ((_ extract 63 32) (_ bv0 64))) (or .cse11 .cse12 .cse13 (= .cse10 (let ((.cse337 (let ((.cse340 (store (store (store .cse7 .cse333 (bvadd (_ bv3 32) .cse334)) .cse8 (_ bv4 32)) .cse9 (_ bv4 32)))) (bvadd (let ((.cse338 (bvadd (let ((.cse339 (bvadd .cse5 ((_ sign_extend 32) (select .cse340 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (concat ((_ extract 63 32) .cse339) ((_ extract 31 0) .cse339))) ((_ sign_extend 32) (select .cse340 .cse6))))) (concat ((_ extract 63 32) .cse338) ((_ extract 31 0) .cse338))) ((_ sign_extend 32) (select .cse340 .cse2)))))) (concat ((_ extract 63 32) .cse337) ((_ extract 31 0) .cse337)))) (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|)) .cse14))))) is different from true [2023-12-21 21:02:59,685 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse19 ((_ sign_extend 32) (_ bv4 32))) (.cse5 (let ((.cse340 (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (concat (select .cse340 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (select .cse340 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse67 (let ((.cse339 (bvadd .cse19 .cse5))) (concat ((_ extract 63 32) .cse339) ((_ extract 31 0) .cse339)))) (.cse228 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse331 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse228)) (.cse9 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse228)) (.cse7 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse228)) (.cse46 (let ((.cse338 (bvadd .cse67 .cse19))) (concat ((_ extract 63 32) .cse338) ((_ extract 31 0) .cse338)))) (.cse10 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv4 32))))) (let ((.cse44 (= (let ((.cse337 (bvadd .cse19 .cse46))) (concat ((_ extract 63 32) .cse337) ((_ extract 31 0) .cse337))) .cse10)) (.cse11 (bvslt (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse12 (not (= (select .cse7 .cse8) (_ bv1 32)))) (.cse13 (not (= (select .cse7 .cse9) (_ bv1 32)))) (.cse6 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse332 (select .cse7 .cse331)) (.cse14 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)))) (and (or (= (let ((.cse0 (let ((.cse1 (store (store .cse7 .cse8 (_ bv4 32)) .cse9 (_ bv4 32)))) (bvadd ((_ sign_extend 32) (select .cse1 .cse2)) (let ((.cse3 (bvadd (let ((.cse4 (bvadd ((_ sign_extend 32) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse5))) (concat ((_ extract 63 32) .cse4) ((_ extract 31 0) .cse4))) ((_ sign_extend 32) (select .cse1 .cse6))))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3))))))) (concat ((_ extract 63 32) .cse0) ((_ extract 31 0) .cse0))) .cse10) .cse11 .cse12 .cse13 .cse14) (or .cse11 (let ((.cse22 ((_ sign_extend 32) (_ bv1 32)))) (let ((.cse55 (let ((.cse326 (bvadd .cse22 .cse5))) (concat ((_ extract 63 32) .cse326) ((_ extract 31 0) .cse326))))) (let ((.cse15 (= (bvadd (_ bv8 32) .cse228) (_ bv0 32))) (.cse51 (let ((.cse325 (bvadd .cse22 .cse55))) (concat ((_ extract 63 32) .cse325) ((_ extract 31 0) .cse325))))) (let ((.cse307 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= .cse10 (let ((.cse324 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse51))) (concat ((_ extract 63 32) .cse324) ((_ extract 31 0) .cse324)))))) (.cse49 (not .cse15)) (.cse48 (let ((.cse323 (bvadd .cse67 .cse22))) (concat ((_ extract 63 32) .cse323) ((_ extract 31 0) .cse323)))) (.cse43 (= (bvadd (_ bv4 32) .cse228) (_ bv0 32))) (.cse306 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse321 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse320 (bvadd .cse321 .cse46))) (concat ((_ extract 63 32) .cse320) ((_ extract 31 0) .cse320)))) (= .cse10 (let ((.cse322 (bvadd .cse321 .cse51))) (concat ((_ extract 63 32) .cse322) ((_ extract 31 0) .cse322)))))))) (.cse39 (= (_ bv8 32) .cse228))) (let ((.cse56 (not .cse39)) (.cse229 (or .cse15 .cse306)) (.cse52 (not .cse43)) (.cse230 (or .cse49 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse318 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse317 (bvadd .cse318 .cse48))) (concat ((_ extract 63 32) .cse317) ((_ extract 31 0) .cse317)))) (= .cse10 (let ((.cse319 (bvadd .cse318 .cse46))) (concat ((_ extract 63 32) .cse319) ((_ extract 31 0) .cse319))))))))) (.cse233 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse314 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse313 (bvadd .cse314 .cse48))) (concat ((_ extract 63 32) .cse313) ((_ extract 31 0) .cse313)))) (= .cse10 (let ((.cse315 (bvadd .cse314 .cse46))) (concat ((_ extract 63 32) .cse315) ((_ extract 31 0) .cse315)))) (= .cse10 (let ((.cse316 (bvadd .cse314 .cse51))) (concat ((_ extract 63 32) .cse316) ((_ extract 31 0) .cse316)))))))) (.cse231 (or .cse15 .cse307)) (.cse232 (or .cse49 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= .cse10 (let ((.cse312 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse48))) (concat ((_ extract 63 32) .cse312) ((_ extract 31 0) .cse312))))))) (.cse234 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse310 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse309 (bvadd .cse310 .cse48))) (concat ((_ extract 63 32) .cse309) ((_ extract 31 0) .cse309)))) (= .cse10 (let ((.cse311 (bvadd .cse310 .cse51))) (concat ((_ extract 63 32) .cse311) ((_ extract 31 0) .cse311)))))))) (.cse32 (= (_ bv4 32) .cse228))) (let ((.cse26 (not .cse32)) (.cse57 (and .cse229 (or .cse52 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= .cse10 (let ((.cse308 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse46))) (concat ((_ extract 63 32) .cse308) ((_ extract 31 0) .cse308)))))) .cse230 .cse233 (or (and .cse231 .cse232 .cse234) .cse43))) (.cse41 (and .cse306 .cse307 .cse233 .cse234)) (.cse16 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse303 (let ((.cse305 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse305) ((_ extract 31 0) .cse305))))) (let ((.cse299 (let ((.cse304 (bvadd .cse303 .cse22))) (concat ((_ extract 63 32) .cse304) ((_ extract 31 0) .cse304))))) (or (= (let ((.cse298 (bvadd .cse22 .cse299))) (concat ((_ extract 63 32) .cse298) ((_ extract 31 0) .cse298))) .cse10) (= .cse10 (let ((.cse300 (bvadd .cse19 .cse299))) (concat ((_ extract 63 32) .cse300) ((_ extract 31 0) .cse300)))) (= (let ((.cse301 (bvadd .cse19 (let ((.cse302 (bvadd .cse303 .cse19))) (concat ((_ extract 63 32) .cse302) ((_ extract 31 0) .cse302)))))) (concat ((_ extract 63 32) .cse301) ((_ extract 31 0) .cse301))) .cse10)))))) (.cse33 (or .cse39 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse295 (bvadd .cse22 (let ((.cse296 (bvadd (let ((.cse297 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse297) ((_ extract 31 0) .cse297))) .cse22))) (concat ((_ extract 63 32) .cse296) ((_ extract 31 0) .cse296)))))) (concat ((_ extract 63 32) .cse295) ((_ extract 31 0) .cse295))) .cse10)))) (.cse17 (or .cse56 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= .cse10 (let ((.cse292 (bvadd .cse19 (let ((.cse293 (bvadd (let ((.cse294 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse294) ((_ extract 31 0) .cse294))) .cse22))) (concat ((_ extract 63 32) .cse293) ((_ extract 31 0) .cse293)))))) (concat ((_ extract 63 32) .cse292) ((_ extract 31 0) .cse292))))))) (.cse27 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse285 (let ((.cse290 (bvadd (let ((.cse291 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse291) ((_ extract 31 0) .cse291))) .cse22))) (concat ((_ extract 63 32) .cse290) ((_ extract 31 0) .cse290))))) (or (= .cse10 (let ((.cse284 (bvadd .cse19 .cse285))) (concat ((_ extract 63 32) .cse284) ((_ extract 31 0) .cse284)))) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse287 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse286 (bvadd .cse287 .cse285))) (concat ((_ extract 63 32) .cse286) ((_ extract 31 0) .cse286))) .cse10) (= .cse10 (let ((.cse288 (bvadd .cse287 .cse48))) (concat ((_ extract 63 32) .cse288) ((_ extract 31 0) .cse288)))) (= .cse10 (let ((.cse289 (bvadd .cse287 .cse46))) (concat ((_ extract 63 32) .cse289) ((_ extract 31 0) .cse289))))))))))) (.cse28 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse278 (let ((.cse282 (bvadd (let ((.cse283 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse283) ((_ extract 31 0) .cse283))) .cse22))) (concat ((_ extract 63 32) .cse282) ((_ extract 31 0) .cse282))))) (or (= .cse10 (let ((.cse277 (bvadd .cse19 .cse278))) (concat ((_ extract 63 32) .cse277) ((_ extract 31 0) .cse277)))) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse280 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse279 (bvadd .cse280 .cse278))) (concat ((_ extract 63 32) .cse279) ((_ extract 31 0) .cse279))) .cse10) (= .cse10 (let ((.cse281 (bvadd .cse280 .cse48))) (concat ((_ extract 63 32) .cse281) ((_ extract 31 0) .cse281))))))))))) (.cse29 (or .cse39 (and (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse258 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) (let ((.cse259 (bvadd (let ((.cse260 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse260) ((_ extract 31 0) .cse260))) .cse22))) (concat ((_ extract 63 32) .cse259) ((_ extract 31 0) .cse259)))))) (concat ((_ extract 63 32) .cse258) ((_ extract 31 0) .cse258))) .cse10)) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse262 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse261 (bvadd .cse262 (let ((.cse263 (bvadd (let ((.cse264 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse264) ((_ extract 31 0) .cse264))) .cse22))) (concat ((_ extract 63 32) .cse263) ((_ extract 31 0) .cse263)))))) (concat ((_ extract 63 32) .cse261) ((_ extract 31 0) .cse261))) .cse10) (= .cse10 (let ((.cse265 (bvadd .cse262 .cse46))) (concat ((_ extract 63 32) .cse265) ((_ extract 31 0) .cse265))))))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse267 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse266 (bvadd .cse267 (let ((.cse268 (bvadd (let ((.cse269 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse269) ((_ extract 31 0) .cse269))) .cse22))) (concat ((_ extract 63 32) .cse268) ((_ extract 31 0) .cse268)))))) (concat ((_ extract 63 32) .cse266) ((_ extract 31 0) .cse266))) .cse10) (= .cse10 (let ((.cse270 (bvadd .cse267 .cse48))) (concat ((_ extract 63 32) .cse270) ((_ extract 31 0) .cse270)))) (= .cse10 (let ((.cse271 (bvadd .cse267 .cse46))) (concat ((_ extract 63 32) .cse271) ((_ extract 31 0) .cse271))))))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse273 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse272 (bvadd .cse273 (let ((.cse274 (bvadd (let ((.cse275 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse275) ((_ extract 31 0) .cse275))) .cse22))) (concat ((_ extract 63 32) .cse274) ((_ extract 31 0) .cse274)))))) (concat ((_ extract 63 32) .cse272) ((_ extract 31 0) .cse272))) .cse10) (= .cse10 (let ((.cse276 (bvadd .cse273 .cse48))) (concat ((_ extract 63 32) .cse276) ((_ extract 31 0) .cse276)))))))))) (.cse30 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse253 (let ((.cse256 (bvadd (let ((.cse257 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse257) ((_ extract 31 0) .cse257))) .cse22))) (concat ((_ extract 63 32) .cse256) ((_ extract 31 0) .cse256))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse252 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse251 (bvadd .cse252 .cse253))) (concat ((_ extract 63 32) .cse251) ((_ extract 31 0) .cse251))) .cse10) (= .cse10 (let ((.cse254 (bvadd .cse252 .cse46))) (concat ((_ extract 63 32) .cse254) ((_ extract 31 0) .cse254))))))) (= .cse10 (let ((.cse255 (bvadd .cse19 .cse253))) (concat ((_ extract 63 32) .cse255) ((_ extract 31 0) .cse255)))))))) (.cse31 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse247 (let ((.cse249 (bvadd (let ((.cse250 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse250) ((_ extract 31 0) .cse250))) .cse22))) (concat ((_ extract 63 32) .cse249) ((_ extract 31 0) .cse249))))) (or (= .cse10 (let ((.cse246 (bvadd .cse19 .cse247))) (concat ((_ extract 63 32) .cse246) ((_ extract 31 0) .cse246)))) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= (let ((.cse248 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse247))) (concat ((_ extract 63 32) .cse248) ((_ extract 31 0) .cse248))) .cse10)))))) (.cse35 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse242 (let ((.cse245 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse245) ((_ extract 31 0) .cse245))))) (or (= (let ((.cse240 (bvadd .cse22 (let ((.cse241 (bvadd .cse242 .cse22))) (concat ((_ extract 63 32) .cse241) ((_ extract 31 0) .cse241)))))) (concat ((_ extract 63 32) .cse240) ((_ extract 31 0) .cse240))) .cse10) (= (let ((.cse243 (bvadd .cse19 (let ((.cse244 (bvadd .cse242 .cse19))) (concat ((_ extract 63 32) .cse244) ((_ extract 31 0) .cse244)))))) (concat ((_ extract 63 32) .cse243) ((_ extract 31 0) .cse243))) .cse10))))) (.cse34 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse236 (let ((.cse238 (bvadd (let ((.cse239 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse239) ((_ extract 31 0) .cse239))) .cse22))) (concat ((_ extract 63 32) .cse238) ((_ extract 31 0) .cse238))))) (or (= (let ((.cse235 (bvadd .cse22 .cse236))) (concat ((_ extract 63 32) .cse235) ((_ extract 31 0) .cse235))) .cse10) (= .cse10 (let ((.cse237 (bvadd .cse19 .cse236))) (concat ((_ extract 63 32) .cse237) ((_ extract 31 0) .cse237)))))))) (.cse42 (and .cse229 .cse230 .cse231 .cse232 .cse233 .cse234)) (.cse40 (= (_ bv0 32) .cse228))) (and (or (and (or .cse15 (and (or (and .cse16 .cse17 (or (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse21 (let ((.cse25 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25))))) (or (= .cse10 (let ((.cse18 (bvadd .cse19 (let ((.cse20 (bvadd .cse21 .cse22))) (concat ((_ extract 63 32) .cse20) ((_ extract 31 0) .cse20)))))) (concat ((_ extract 63 32) .cse18) ((_ extract 31 0) .cse18)))) (= (let ((.cse23 (bvadd .cse19 (let ((.cse24 (bvadd .cse21 .cse19))) (concat ((_ extract 63 32) .cse24) ((_ extract 31 0) .cse24)))))) (concat ((_ extract 63 32) .cse23) ((_ extract 31 0) .cse23))) .cse10)))) .cse26) (or (and .cse27 .cse28 .cse29 .cse30 .cse31) .cse32) (or (and .cse33 .cse34) .cse32) (or (and .cse35 (or .cse26 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse36 (bvadd .cse19 (let ((.cse37 (bvadd (let ((.cse38 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38))) .cse19))) (concat ((_ extract 63 32) .cse37) ((_ extract 31 0) .cse37)))))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36))) .cse10)))) .cse39)) .cse40) (or .cse41 .cse40 .cse39 .cse32))) (or .cse42 .cse40 .cse39 .cse32)) .cse43) (or (and (or (and .cse40 .cse44) (and (not .cse40) (or (and .cse26 (or (and (= .cse10 (let ((.cse45 (bvadd .cse22 .cse46))) (concat ((_ extract 63 32) .cse45) ((_ extract 31 0) .cse45)))) .cse43) (and (or (and .cse15 (= (let ((.cse47 (bvadd .cse22 .cse48))) (concat ((_ extract 63 32) .cse47) ((_ extract 31 0) .cse47))) .cse10)) (and .cse49 (= (let ((.cse50 (bvadd .cse22 .cse51))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50))) .cse10))) .cse52))) (and (= (let ((.cse53 (bvadd .cse19 (let ((.cse54 (bvadd .cse19 .cse55))) (concat ((_ extract 63 32) .cse54) ((_ extract 31 0) .cse54)))))) (concat ((_ extract 63 32) .cse53) ((_ extract 31 0) .cse53))) .cse10) .cse32)))) .cse56 (or .cse57 .cse40 .cse32)) (and .cse39 (= .cse10 (let ((.cse58 (bvadd .cse19 .cse51))) (concat ((_ extract 63 32) .cse58) ((_ extract 31 0) .cse58)))))) (or (let ((.cse59 (or .cse42 .cse40 .cse39)) (.cse60 (or .cse15 (and (or .cse41 .cse40 .cse39) (or (and .cse16 .cse33 .cse17 .cse27 .cse28 .cse29 .cse30 .cse31 (or .cse35 .cse39) .cse34) .cse40))))) (and (or (and .cse59 .cse60) .cse43) (or .cse57 .cse40 .cse39) (or (and (or (let ((.cse73 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (= (let ((.cse226 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) (let ((.cse227 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse55))) (concat ((_ extract 63 32) .cse227) ((_ extract 31 0) .cse227)))))) (concat ((_ extract 63 32) .cse226) ((_ extract 31 0) .cse226))) .cse10))) (.cse72 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse223 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse222 (bvadd .cse223 (let ((.cse224 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse55))) (concat ((_ extract 63 32) .cse224) ((_ extract 31 0) .cse224)))))) (concat ((_ extract 63 32) .cse222) ((_ extract 31 0) .cse222))) .cse10) (= .cse10 (let ((.cse225 (bvadd .cse223 .cse46))) (concat ((_ extract 63 32) .cse225) ((_ extract 31 0) .cse225))))))))) (let ((.cse157 (or .cse49 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (= (let ((.cse220 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) (let ((.cse221 (bvadd .cse67 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse221) ((_ extract 31 0) .cse221)))))) (concat ((_ extract 63 32) .cse220) ((_ extract 31 0) .cse220))) .cse10)))) (.cse158 (or .cse15 .cse72)) (.cse71 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse215 ((_ sign_extend 32) v_arrayElimCell_47)) (.cse217 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= (let ((.cse214 (bvadd .cse215 (let ((.cse216 (bvadd .cse217 .cse55))) (concat ((_ extract 63 32) .cse216) ((_ extract 31 0) .cse216)))))) (concat ((_ extract 63 32) .cse214) ((_ extract 31 0) .cse214))) .cse10) (= (let ((.cse218 (bvadd .cse215 (let ((.cse219 (bvadd .cse67 .cse217))) (concat ((_ extract 63 32) .cse219) ((_ extract 31 0) .cse219)))))) (concat ((_ extract 63 32) .cse218) ((_ extract 31 0) .cse218))) .cse10))))) (.cse159 (or .cse49 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse211 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse210 (bvadd .cse211 .cse46))) (concat ((_ extract 63 32) .cse210) ((_ extract 31 0) .cse210)))) (= (let ((.cse212 (bvadd .cse211 (let ((.cse213 (bvadd .cse67 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse213) ((_ extract 31 0) .cse213)))))) (concat ((_ extract 63 32) .cse212) ((_ extract 31 0) .cse212))) .cse10)))))) (.cse74 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse204 ((_ sign_extend 32) v_arrayElimCell_47)) (.cse206 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= (let ((.cse203 (bvadd .cse204 (let ((.cse205 (bvadd .cse206 .cse55))) (concat ((_ extract 63 32) .cse205) ((_ extract 31 0) .cse205)))))) (concat ((_ extract 63 32) .cse203) ((_ extract 31 0) .cse203))) .cse10) (= .cse10 (let ((.cse207 (bvadd .cse204 .cse46))) (concat ((_ extract 63 32) .cse207) ((_ extract 31 0) .cse207)))) (= (let ((.cse208 (bvadd .cse204 (let ((.cse209 (bvadd .cse67 .cse206))) (concat ((_ extract 63 32) .cse209) ((_ extract 31 0) .cse209)))))) (concat ((_ extract 63 32) .cse208) ((_ extract 31 0) .cse208))) .cse10))))) (.cse160 (or .cse15 .cse73))) (and (or .cse15 (and (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse68 ((_ sign_extend 32) v_arrayElimCell_46))) (let ((.cse62 (let ((.cse69 (bvadd (let ((.cse70 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse70) ((_ extract 31 0) .cse70))) .cse68))) (concat ((_ extract 63 32) .cse69) ((_ extract 31 0) .cse69))))) (or (= (let ((.cse61 (bvadd .cse62 .cse19))) (concat ((_ extract 63 32) .cse61) ((_ extract 31 0) .cse61))) .cse10) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse64 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse63 (bvadd .cse62 .cse64))) (concat ((_ extract 63 32) .cse63) ((_ extract 31 0) .cse63)))) (= (let ((.cse65 (bvadd .cse64 (let ((.cse66 (bvadd .cse67 .cse68))) (concat ((_ extract 63 32) .cse66) ((_ extract 31 0) .cse66)))))) (concat ((_ extract 63 32) .cse65) ((_ extract 31 0) .cse65))) .cse10)))))))) (or (and .cse71 .cse72 .cse73 .cse74) .cse39) (or (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse77 (let ((.cse80 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse80) ((_ extract 31 0) .cse80))))) (or (= (let ((.cse75 (bvadd (let ((.cse76 (bvadd .cse77 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse76) ((_ extract 31 0) .cse76))) .cse22))) (concat ((_ extract 63 32) .cse75) ((_ extract 31 0) .cse75))) .cse10) (= (let ((.cse78 (bvadd .cse19 (let ((.cse79 (bvadd .cse77 .cse19))) (concat ((_ extract 63 32) .cse79) ((_ extract 31 0) .cse79)))))) (concat ((_ extract 63 32) .cse78) ((_ extract 31 0) .cse78))) .cse10)))) .cse39) (or (and (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse85 ((_ sign_extend 32) v_arrayElimCell_47)) (.cse84 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= .cse10 (let ((.cse81 (bvadd (let ((.cse82 (bvadd (let ((.cse83 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse83) ((_ extract 31 0) .cse83))) .cse84))) (concat ((_ extract 63 32) .cse82) ((_ extract 31 0) .cse82))) .cse85))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81)))) (= (let ((.cse86 (bvadd .cse85 (let ((.cse87 (bvadd .cse67 .cse84))) (concat ((_ extract 63 32) .cse87) ((_ extract 31 0) .cse87)))))) (concat ((_ extract 63 32) .cse86) ((_ extract 31 0) .cse86))) .cse10)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse89 ((_ sign_extend 32) v_arrayElimCell_47)) (.cse93 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= .cse10 (let ((.cse88 (bvadd .cse89 .cse46))) (concat ((_ extract 63 32) .cse88) ((_ extract 31 0) .cse88)))) (= .cse10 (let ((.cse90 (bvadd (let ((.cse91 (bvadd (let ((.cse92 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse92) ((_ extract 31 0) .cse92))) .cse93))) (concat ((_ extract 63 32) .cse91) ((_ extract 31 0) .cse91))) .cse89))) (concat ((_ extract 63 32) .cse90) ((_ extract 31 0) .cse90)))) (= (let ((.cse94 (bvadd .cse89 (let ((.cse95 (bvadd .cse67 .cse93))) (concat ((_ extract 63 32) .cse95) ((_ extract 31 0) .cse95)))))) (concat ((_ extract 63 32) .cse94) ((_ extract 31 0) .cse94))) .cse10)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse97 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse96 (bvadd .cse97 .cse46))) (concat ((_ extract 63 32) .cse96) ((_ extract 31 0) .cse96)))) (= .cse10 (let ((.cse98 (bvadd (let ((.cse99 (bvadd (let ((.cse100 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse100) ((_ extract 31 0) .cse100))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse99) ((_ extract 31 0) .cse99))) .cse97))) (concat ((_ extract 63 32) .cse98) ((_ extract 31 0) .cse98))))))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (= .cse10 (let ((.cse101 (bvadd (let ((.cse102 (bvadd (let ((.cse103 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse103) ((_ extract 31 0) .cse103))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse102) ((_ extract 31 0) .cse102))) ((_ sign_extend 32) v_arrayElimCell_47)))) (concat ((_ extract 63 32) .cse101) ((_ extract 31 0) .cse101)))))) .cse39) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse105 (let ((.cse107 (bvadd (let ((.cse108 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse108) ((_ extract 31 0) .cse108))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse107) ((_ extract 31 0) .cse107))))) (or (= (let ((.cse104 (bvadd .cse105 .cse19))) (concat ((_ extract 63 32) .cse104) ((_ extract 31 0) .cse104))) .cse10) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= .cse10 (let ((.cse106 (bvadd .cse105 ((_ sign_extend 32) v_arrayElimCell_47)))) (concat ((_ extract 63 32) .cse106) ((_ extract 31 0) .cse106)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse114 (let ((.cse116 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse116) ((_ extract 31 0) .cse116))))) (let ((.cse110 (let ((.cse115 (bvadd .cse114 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse115) ((_ extract 31 0) .cse115))))) (or (= (let ((.cse109 (bvadd .cse110 .cse19))) (concat ((_ extract 63 32) .cse109) ((_ extract 31 0) .cse109))) .cse10) (= (let ((.cse111 (bvadd .cse110 .cse22))) (concat ((_ extract 63 32) .cse111) ((_ extract 31 0) .cse111))) .cse10) (= (let ((.cse112 (bvadd .cse19 (let ((.cse113 (bvadd .cse114 .cse19))) (concat ((_ extract 63 32) .cse113) ((_ extract 31 0) .cse113)))))) (concat ((_ extract 63 32) .cse112) ((_ extract 31 0) .cse112))) .cse10))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse124 ((_ sign_extend 32) v_arrayElimCell_46))) (let ((.cse118 (let ((.cse125 (bvadd (let ((.cse126 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse126) ((_ extract 31 0) .cse126))) .cse124))) (concat ((_ extract 63 32) .cse125) ((_ extract 31 0) .cse125))))) (or (= (let ((.cse117 (bvadd .cse118 .cse19))) (concat ((_ extract 63 32) .cse117) ((_ extract 31 0) .cse117))) .cse10) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse120 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse119 (bvadd .cse120 .cse46))) (concat ((_ extract 63 32) .cse119) ((_ extract 31 0) .cse119)))) (= .cse10 (let ((.cse121 (bvadd .cse118 .cse120))) (concat ((_ extract 63 32) .cse121) ((_ extract 31 0) .cse121)))) (= (let ((.cse122 (bvadd .cse120 (let ((.cse123 (bvadd .cse67 .cse124))) (concat ((_ extract 63 32) .cse123) ((_ extract 31 0) .cse123)))))) (concat ((_ extract 63 32) .cse122) ((_ extract 31 0) .cse122))) .cse10)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse128 (let ((.cse130 (bvadd (let ((.cse131 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse131) ((_ extract 31 0) .cse131))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse130) ((_ extract 31 0) .cse130))))) (or (= (let ((.cse127 (bvadd .cse128 .cse19))) (concat ((_ extract 63 32) .cse127) ((_ extract 31 0) .cse127))) .cse10) (= (let ((.cse129 (bvadd .cse128 .cse22))) (concat ((_ extract 63 32) .cse129) ((_ extract 31 0) .cse129))) .cse10)))) (or (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse132 (bvadd (let ((.cse133 (bvadd (let ((.cse134 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse134) ((_ extract 31 0) .cse134))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse133) ((_ extract 31 0) .cse133))) .cse22))) (concat ((_ extract 63 32) .cse132) ((_ extract 31 0) .cse132))) .cse10)) .cse39) (or .cse56 (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse135 (bvadd (let ((.cse136 (bvadd (let ((.cse137 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse137) ((_ extract 31 0) .cse137))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse136) ((_ extract 31 0) .cse136))) .cse19))) (concat ((_ extract 63 32) .cse135) ((_ extract 31 0) .cse135))) .cse10))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse139 (let ((.cse143 (bvadd (let ((.cse144 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse5))) (concat ((_ extract 63 32) .cse144) ((_ extract 31 0) .cse144))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse143) ((_ extract 31 0) .cse143))))) (or (= (let ((.cse138 (bvadd .cse139 .cse19))) (concat ((_ extract 63 32) .cse138) ((_ extract 31 0) .cse138))) .cse10) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse141 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse10 (let ((.cse140 (bvadd .cse141 .cse46))) (concat ((_ extract 63 32) .cse140) ((_ extract 31 0) .cse140)))) (= .cse10 (let ((.cse142 (bvadd .cse139 .cse141))) (concat ((_ extract 63 32) .cse142) ((_ extract 31 0) .cse142)))))))))))) (or .cse15 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse146 (let ((.cse148 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse55))) (concat ((_ extract 63 32) .cse148) ((_ extract 31 0) .cse148))))) (or (= .cse10 (let ((.cse145 (bvadd .cse19 .cse146))) (concat ((_ extract 63 32) .cse145) ((_ extract 31 0) .cse145)))) (= .cse10 (let ((.cse147 (bvadd .cse22 .cse146))) (concat ((_ extract 63 32) .cse147) ((_ extract 31 0) .cse147)))))))) (or .cse15 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse151 (let ((.cse154 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse55))) (concat ((_ extract 63 32) .cse154) ((_ extract 31 0) .cse154)))) (.cse150 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse149 (bvadd .cse150 .cse151))) (concat ((_ extract 63 32) .cse149) ((_ extract 31 0) .cse149))) .cse10) (= .cse10 (let ((.cse152 (bvadd .cse19 .cse151))) (concat ((_ extract 63 32) .cse152) ((_ extract 31 0) .cse152)))) (= .cse10 (let ((.cse153 (bvadd .cse150 .cse46))) (concat ((_ extract 63 32) .cse153) ((_ extract 31 0) .cse153)))))))) (or (forall ((v_arrayElimCell_46 (_ BitVec 32))) (= .cse10 (let ((.cse155 (bvadd .cse19 (let ((.cse156 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse55))) (concat ((_ extract 63 32) .cse156) ((_ extract 31 0) .cse156)))))) (concat ((_ extract 63 32) .cse155) ((_ extract 31 0) .cse155))))) .cse56) (or (and .cse157 .cse158 .cse71 .cse159 .cse74 .cse160) .cse39) (or .cse49 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse163 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= .cse10 (let ((.cse161 (bvadd .cse19 (let ((.cse162 (bvadd .cse163 .cse55))) (concat ((_ extract 63 32) .cse162) ((_ extract 31 0) .cse162)))))) (concat ((_ extract 63 32) .cse161) ((_ extract 31 0) .cse161)))) (= (let ((.cse164 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) (let ((.cse165 (bvadd .cse67 .cse163))) (concat ((_ extract 63 32) .cse165) ((_ extract 31 0) .cse165)))))) (concat ((_ extract 63 32) .cse164) ((_ extract 31 0) .cse164))) .cse10))))) (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse168 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= (let ((.cse166 (bvadd .cse22 (let ((.cse167 (bvadd .cse67 .cse168))) (concat ((_ extract 63 32) .cse167) ((_ extract 31 0) .cse167)))))) (concat ((_ extract 63 32) .cse166) ((_ extract 31 0) .cse166))) .cse10) (= .cse10 (let ((.cse169 (bvadd .cse22 (let ((.cse170 (bvadd .cse168 .cse55))) (concat ((_ extract 63 32) .cse170) ((_ extract 31 0) .cse170)))))) (concat ((_ extract 63 32) .cse169) ((_ extract 31 0) .cse169))))))) (or (and .cse157 .cse158 .cse71 .cse159 (or .cse15 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (= .cse10 (let ((.cse171 (bvadd .cse22 (let ((.cse172 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse55))) (concat ((_ extract 63 32) .cse172) ((_ extract 31 0) .cse172)))))) (concat ((_ extract 63 32) .cse171) ((_ extract 31 0) .cse171)))))) .cse74 .cse160) .cse39) (or .cse15 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse174 (let ((.cse176 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse55))) (concat ((_ extract 63 32) .cse176) ((_ extract 31 0) .cse176))))) (or (= (let ((.cse173 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse174))) (concat ((_ extract 63 32) .cse173) ((_ extract 31 0) .cse173))) .cse10) (= .cse10 (let ((.cse175 (bvadd .cse19 .cse174))) (concat ((_ extract 63 32) .cse175) ((_ extract 31 0) .cse175)))))))) (or .cse49 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse181 ((_ sign_extend 32) v_arrayElimCell_47)) (.cse179 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= .cse10 (let ((.cse177 (bvadd .cse19 (let ((.cse178 (bvadd .cse179 .cse55))) (concat ((_ extract 63 32) .cse178) ((_ extract 31 0) .cse178)))))) (concat ((_ extract 63 32) .cse177) ((_ extract 31 0) .cse177)))) (= .cse10 (let ((.cse180 (bvadd .cse181 .cse46))) (concat ((_ extract 63 32) .cse180) ((_ extract 31 0) .cse180)))) (= (let ((.cse182 (bvadd .cse181 (let ((.cse183 (bvadd .cse67 .cse179))) (concat ((_ extract 63 32) .cse183) ((_ extract 31 0) .cse183)))))) (concat ((_ extract 63 32) .cse182) ((_ extract 31 0) .cse182))) .cse10))))) (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse191 ((_ sign_extend 32) v_arrayElimCell_46))) (let ((.cse185 (let ((.cse192 (bvadd .cse191 .cse55))) (concat ((_ extract 63 32) .cse192) ((_ extract 31 0) .cse192))))) (or (= .cse10 (let ((.cse184 (bvadd .cse19 .cse185))) (concat ((_ extract 63 32) .cse184) ((_ extract 31 0) .cse184)))) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse187 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse186 (bvadd .cse187 .cse185))) (concat ((_ extract 63 32) .cse186) ((_ extract 31 0) .cse186))) .cse10) (= .cse10 (let ((.cse188 (bvadd .cse187 .cse46))) (concat ((_ extract 63 32) .cse188) ((_ extract 31 0) .cse188)))) (= (let ((.cse189 (bvadd .cse187 (let ((.cse190 (bvadd .cse67 .cse191))) (concat ((_ extract 63 32) .cse190) ((_ extract 31 0) .cse190)))))) (concat ((_ extract 63 32) .cse189) ((_ extract 31 0) .cse189))) .cse10)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse198 ((_ sign_extend 32) v_arrayElimCell_46))) (let ((.cse195 (let ((.cse200 (bvadd .cse198 .cse55))) (concat ((_ extract 63 32) .cse200) ((_ extract 31 0) .cse200))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse194 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse193 (bvadd .cse194 .cse195))) (concat ((_ extract 63 32) .cse193) ((_ extract 31 0) .cse193))) .cse10) (= (let ((.cse196 (bvadd .cse194 (let ((.cse197 (bvadd .cse67 .cse198))) (concat ((_ extract 63 32) .cse197) ((_ extract 31 0) .cse197)))))) (concat ((_ extract 63 32) .cse196) ((_ extract 31 0) .cse196))) .cse10)))) (= .cse10 (let ((.cse199 (bvadd .cse19 .cse195))) (concat ((_ extract 63 32) .cse199) ((_ extract 31 0) .cse199)))))))) (or .cse49 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (= (let ((.cse201 (bvadd .cse22 (let ((.cse202 (bvadd .cse67 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse202) ((_ extract 31 0) .cse202)))))) (concat ((_ extract 63 32) .cse201) ((_ extract 31 0) .cse201))) .cse10)))))) .cse40) .cse59 .cse60) .cse43))) .cse32)))))))) .cse14) (or (= (let ((.cse327 (let ((.cse329 (store (store .cse7 .cse331 (_ bv4 32)) .cse8 (_ bv4 32)))) (bvadd (let ((.cse328 (bvadd ((_ sign_extend 32) (select .cse329 .cse6)) (let ((.cse330 (bvadd .cse5 ((_ sign_extend 32) (select .cse329 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (concat ((_ extract 63 32) .cse330) ((_ extract 31 0) .cse330)))))) (concat ((_ extract 63 32) .cse328) ((_ extract 31 0) .cse328))) ((_ sign_extend 32) (select .cse329 .cse2)))))) (concat ((_ extract 63 32) .cse327) ((_ extract 31 0) .cse327))) .cse10) .cse12 (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (not (= (_ bv1 32) .cse332)) (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (not (bvsle c_~N~0 (_ bv0 32))) (bvule c_~N~0 (_ bv536870911 32)) (or (bvslt (_ bv3 32) c_~N~0) .cse44 (not (bvslt (_ bv1 32) c_~N~0))) (or .cse11 .cse12 .cse13 (= .cse10 (let ((.cse333 (let ((.cse336 (store (store (store .cse7 .cse331 (bvadd (_ bv3 32) .cse332)) .cse8 (_ bv4 32)) .cse9 (_ bv4 32)))) (bvadd (let ((.cse334 (bvadd (let ((.cse335 (bvadd .cse5 ((_ sign_extend 32) (select .cse336 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (concat ((_ extract 63 32) .cse335) ((_ extract 31 0) .cse335))) ((_ sign_extend 32) (select .cse336 .cse6))))) (concat ((_ extract 63 32) .cse334) ((_ extract 31 0) .cse334))) ((_ sign_extend 32) (select .cse336 .cse2)))))) (concat ((_ extract 63 32) .cse333) ((_ extract 31 0) .cse333)))) (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|)) .cse14)))))) is different from true [2023-12-21 21:03:04,393 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ sign_extend 32) (_ bv4 32))) (.cse13 (let ((.cse333 (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (concat (select .cse333 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (select .cse333 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse55 (let ((.cse332 (bvadd .cse6 .cse13))) (concat ((_ extract 63 32) .cse332) ((_ extract 31 0) .cse332))))) (let ((.cse34 (let ((.cse331 (bvadd .cse55 .cse6))) (concat ((_ extract 63 32) .cse331) ((_ extract 31 0) .cse331)))) (.cse4 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv4 32))))) (let ((.cse32 (= (let ((.cse330 (bvadd .cse6 .cse34))) (concat ((_ extract 63 32) .cse330) ((_ extract 31 0) .cse330))) .cse4)) (.cse316 (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (.cse0 (bvslt (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse322 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse319 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse318 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse315 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse216 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (and (or .cse0 (let ((.cse9 ((_ sign_extend 32) (_ bv1 32)))) (let ((.cse43 (let ((.cse314 (bvadd .cse9 .cse13))) (concat ((_ extract 63 32) .cse314) ((_ extract 31 0) .cse314))))) (let ((.cse1 (= (bvadd (_ bv8 32) .cse216) (_ bv0 32))) (.cse39 (let ((.cse313 (bvadd .cse9 .cse43))) (concat ((_ extract 63 32) .cse313) ((_ extract 31 0) .cse313))))) (let ((.cse295 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= .cse4 (let ((.cse312 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse39))) (concat ((_ extract 63 32) .cse312) ((_ extract 31 0) .cse312)))))) (.cse37 (not .cse1)) (.cse36 (let ((.cse311 (bvadd .cse55 .cse9))) (concat ((_ extract 63 32) .cse311) ((_ extract 31 0) .cse311)))) (.cse31 (= (bvadd (_ bv4 32) .cse216) (_ bv0 32))) (.cse294 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse309 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse4 (let ((.cse308 (bvadd .cse309 .cse34))) (concat ((_ extract 63 32) .cse308) ((_ extract 31 0) .cse308)))) (= .cse4 (let ((.cse310 (bvadd .cse309 .cse39))) (concat ((_ extract 63 32) .cse310) ((_ extract 31 0) .cse310)))))))) (.cse27 (= (_ bv8 32) .cse216))) (let ((.cse44 (not .cse27)) (.cse217 (or .cse1 .cse294)) (.cse40 (not .cse31)) (.cse218 (or .cse37 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse306 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse4 (let ((.cse305 (bvadd .cse306 .cse36))) (concat ((_ extract 63 32) .cse305) ((_ extract 31 0) .cse305)))) (= .cse4 (let ((.cse307 (bvadd .cse306 .cse34))) (concat ((_ extract 63 32) .cse307) ((_ extract 31 0) .cse307))))))))) (.cse221 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse302 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse4 (let ((.cse301 (bvadd .cse302 .cse36))) (concat ((_ extract 63 32) .cse301) ((_ extract 31 0) .cse301)))) (= .cse4 (let ((.cse303 (bvadd .cse302 .cse34))) (concat ((_ extract 63 32) .cse303) ((_ extract 31 0) .cse303)))) (= .cse4 (let ((.cse304 (bvadd .cse302 .cse39))) (concat ((_ extract 63 32) .cse304) ((_ extract 31 0) .cse304)))))))) (.cse219 (or .cse1 .cse295)) (.cse220 (or .cse37 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= .cse4 (let ((.cse300 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse36))) (concat ((_ extract 63 32) .cse300) ((_ extract 31 0) .cse300))))))) (.cse222 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse298 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse4 (let ((.cse297 (bvadd .cse298 .cse36))) (concat ((_ extract 63 32) .cse297) ((_ extract 31 0) .cse297)))) (= .cse4 (let ((.cse299 (bvadd .cse298 .cse39))) (concat ((_ extract 63 32) .cse299) ((_ extract 31 0) .cse299)))))))) (.cse20 (= (_ bv4 32) .cse216))) (let ((.cse14 (not .cse20)) (.cse45 (and .cse217 (or .cse40 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= .cse4 (let ((.cse296 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse34))) (concat ((_ extract 63 32) .cse296) ((_ extract 31 0) .cse296)))))) .cse218 .cse221 (or (and .cse219 .cse220 .cse222) .cse31))) (.cse29 (and .cse294 .cse295 .cse221 .cse222)) (.cse2 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse291 (let ((.cse293 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse293) ((_ extract 31 0) .cse293))))) (let ((.cse287 (let ((.cse292 (bvadd .cse291 .cse9))) (concat ((_ extract 63 32) .cse292) ((_ extract 31 0) .cse292))))) (or (= (let ((.cse286 (bvadd .cse9 .cse287))) (concat ((_ extract 63 32) .cse286) ((_ extract 31 0) .cse286))) .cse4) (= .cse4 (let ((.cse288 (bvadd .cse6 .cse287))) (concat ((_ extract 63 32) .cse288) ((_ extract 31 0) .cse288)))) (= (let ((.cse289 (bvadd .cse6 (let ((.cse290 (bvadd .cse291 .cse6))) (concat ((_ extract 63 32) .cse290) ((_ extract 31 0) .cse290)))))) (concat ((_ extract 63 32) .cse289) ((_ extract 31 0) .cse289))) .cse4)))))) (.cse21 (or .cse27 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse283 (bvadd .cse9 (let ((.cse284 (bvadd (let ((.cse285 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse285) ((_ extract 31 0) .cse285))) .cse9))) (concat ((_ extract 63 32) .cse284) ((_ extract 31 0) .cse284)))))) (concat ((_ extract 63 32) .cse283) ((_ extract 31 0) .cse283))) .cse4)))) (.cse3 (or .cse44 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= .cse4 (let ((.cse280 (bvadd .cse6 (let ((.cse281 (bvadd (let ((.cse282 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse282) ((_ extract 31 0) .cse282))) .cse9))) (concat ((_ extract 63 32) .cse281) ((_ extract 31 0) .cse281)))))) (concat ((_ extract 63 32) .cse280) ((_ extract 31 0) .cse280))))))) (.cse15 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse273 (let ((.cse278 (bvadd (let ((.cse279 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse279) ((_ extract 31 0) .cse279))) .cse9))) (concat ((_ extract 63 32) .cse278) ((_ extract 31 0) .cse278))))) (or (= .cse4 (let ((.cse272 (bvadd .cse6 .cse273))) (concat ((_ extract 63 32) .cse272) ((_ extract 31 0) .cse272)))) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse275 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse274 (bvadd .cse275 .cse273))) (concat ((_ extract 63 32) .cse274) ((_ extract 31 0) .cse274))) .cse4) (= .cse4 (let ((.cse276 (bvadd .cse275 .cse36))) (concat ((_ extract 63 32) .cse276) ((_ extract 31 0) .cse276)))) (= .cse4 (let ((.cse277 (bvadd .cse275 .cse34))) (concat ((_ extract 63 32) .cse277) ((_ extract 31 0) .cse277))))))))))) (.cse16 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse266 (let ((.cse270 (bvadd (let ((.cse271 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse271) ((_ extract 31 0) .cse271))) .cse9))) (concat ((_ extract 63 32) .cse270) ((_ extract 31 0) .cse270))))) (or (= .cse4 (let ((.cse265 (bvadd .cse6 .cse266))) (concat ((_ extract 63 32) .cse265) ((_ extract 31 0) .cse265)))) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse268 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse267 (bvadd .cse268 .cse266))) (concat ((_ extract 63 32) .cse267) ((_ extract 31 0) .cse267))) .cse4) (= .cse4 (let ((.cse269 (bvadd .cse268 .cse36))) (concat ((_ extract 63 32) .cse269) ((_ extract 31 0) .cse269))))))))))) (.cse17 (or .cse27 (and (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse246 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) (let ((.cse247 (bvadd (let ((.cse248 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse248) ((_ extract 31 0) .cse248))) .cse9))) (concat ((_ extract 63 32) .cse247) ((_ extract 31 0) .cse247)))))) (concat ((_ extract 63 32) .cse246) ((_ extract 31 0) .cse246))) .cse4)) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse250 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse249 (bvadd .cse250 (let ((.cse251 (bvadd (let ((.cse252 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse252) ((_ extract 31 0) .cse252))) .cse9))) (concat ((_ extract 63 32) .cse251) ((_ extract 31 0) .cse251)))))) (concat ((_ extract 63 32) .cse249) ((_ extract 31 0) .cse249))) .cse4) (= .cse4 (let ((.cse253 (bvadd .cse250 .cse34))) (concat ((_ extract 63 32) .cse253) ((_ extract 31 0) .cse253))))))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse255 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse254 (bvadd .cse255 (let ((.cse256 (bvadd (let ((.cse257 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse257) ((_ extract 31 0) .cse257))) .cse9))) (concat ((_ extract 63 32) .cse256) ((_ extract 31 0) .cse256)))))) (concat ((_ extract 63 32) .cse254) ((_ extract 31 0) .cse254))) .cse4) (= .cse4 (let ((.cse258 (bvadd .cse255 .cse36))) (concat ((_ extract 63 32) .cse258) ((_ extract 31 0) .cse258)))) (= .cse4 (let ((.cse259 (bvadd .cse255 .cse34))) (concat ((_ extract 63 32) .cse259) ((_ extract 31 0) .cse259))))))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse261 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse260 (bvadd .cse261 (let ((.cse262 (bvadd (let ((.cse263 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse263) ((_ extract 31 0) .cse263))) .cse9))) (concat ((_ extract 63 32) .cse262) ((_ extract 31 0) .cse262)))))) (concat ((_ extract 63 32) .cse260) ((_ extract 31 0) .cse260))) .cse4) (= .cse4 (let ((.cse264 (bvadd .cse261 .cse36))) (concat ((_ extract 63 32) .cse264) ((_ extract 31 0) .cse264)))))))))) (.cse18 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse241 (let ((.cse244 (bvadd (let ((.cse245 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse245) ((_ extract 31 0) .cse245))) .cse9))) (concat ((_ extract 63 32) .cse244) ((_ extract 31 0) .cse244))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse240 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse239 (bvadd .cse240 .cse241))) (concat ((_ extract 63 32) .cse239) ((_ extract 31 0) .cse239))) .cse4) (= .cse4 (let ((.cse242 (bvadd .cse240 .cse34))) (concat ((_ extract 63 32) .cse242) ((_ extract 31 0) .cse242))))))) (= .cse4 (let ((.cse243 (bvadd .cse6 .cse241))) (concat ((_ extract 63 32) .cse243) ((_ extract 31 0) .cse243)))))))) (.cse19 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse235 (let ((.cse237 (bvadd (let ((.cse238 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse238) ((_ extract 31 0) .cse238))) .cse9))) (concat ((_ extract 63 32) .cse237) ((_ extract 31 0) .cse237))))) (or (= .cse4 (let ((.cse234 (bvadd .cse6 .cse235))) (concat ((_ extract 63 32) .cse234) ((_ extract 31 0) .cse234)))) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= (let ((.cse236 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse235))) (concat ((_ extract 63 32) .cse236) ((_ extract 31 0) .cse236))) .cse4)))))) (.cse23 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse230 (let ((.cse233 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse233) ((_ extract 31 0) .cse233))))) (or (= (let ((.cse228 (bvadd .cse9 (let ((.cse229 (bvadd .cse230 .cse9))) (concat ((_ extract 63 32) .cse229) ((_ extract 31 0) .cse229)))))) (concat ((_ extract 63 32) .cse228) ((_ extract 31 0) .cse228))) .cse4) (= (let ((.cse231 (bvadd .cse6 (let ((.cse232 (bvadd .cse230 .cse6))) (concat ((_ extract 63 32) .cse232) ((_ extract 31 0) .cse232)))))) (concat ((_ extract 63 32) .cse231) ((_ extract 31 0) .cse231))) .cse4))))) (.cse22 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse224 (let ((.cse226 (bvadd (let ((.cse227 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse227) ((_ extract 31 0) .cse227))) .cse9))) (concat ((_ extract 63 32) .cse226) ((_ extract 31 0) .cse226))))) (or (= (let ((.cse223 (bvadd .cse9 .cse224))) (concat ((_ extract 63 32) .cse223) ((_ extract 31 0) .cse223))) .cse4) (= .cse4 (let ((.cse225 (bvadd .cse6 .cse224))) (concat ((_ extract 63 32) .cse225) ((_ extract 31 0) .cse225)))))))) (.cse30 (and .cse217 .cse218 .cse219 .cse220 .cse221 .cse222)) (.cse28 (= (_ bv0 32) .cse216))) (and (or (and (or .cse1 (and (or (and .cse2 .cse3 (or (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse8 (let ((.cse12 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse12) ((_ extract 31 0) .cse12))))) (or (= .cse4 (let ((.cse5 (bvadd .cse6 (let ((.cse7 (bvadd .cse8 .cse9))) (concat ((_ extract 63 32) .cse7) ((_ extract 31 0) .cse7)))))) (concat ((_ extract 63 32) .cse5) ((_ extract 31 0) .cse5)))) (= (let ((.cse10 (bvadd .cse6 (let ((.cse11 (bvadd .cse8 .cse6))) (concat ((_ extract 63 32) .cse11) ((_ extract 31 0) .cse11)))))) (concat ((_ extract 63 32) .cse10) ((_ extract 31 0) .cse10))) .cse4)))) .cse14) (or (and .cse15 .cse16 .cse17 .cse18 .cse19) .cse20) (or (and .cse21 .cse22) .cse20) (or (and .cse23 (or .cse14 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse24 (bvadd .cse6 (let ((.cse25 (bvadd (let ((.cse26 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse26) ((_ extract 31 0) .cse26))) .cse6))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25)))))) (concat ((_ extract 63 32) .cse24) ((_ extract 31 0) .cse24))) .cse4)))) .cse27)) .cse28) (or .cse29 .cse28 .cse27 .cse20))) (or .cse30 .cse28 .cse27 .cse20)) .cse31) (or (and (or (and .cse28 .cse32) (and (not .cse28) (or (and .cse14 (or (and (= .cse4 (let ((.cse33 (bvadd .cse9 .cse34))) (concat ((_ extract 63 32) .cse33) ((_ extract 31 0) .cse33)))) .cse31) (and (or (and .cse1 (= (let ((.cse35 (bvadd .cse9 .cse36))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35))) .cse4)) (and .cse37 (= (let ((.cse38 (bvadd .cse9 .cse39))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38))) .cse4))) .cse40))) (and (= (let ((.cse41 (bvadd .cse6 (let ((.cse42 (bvadd .cse6 .cse43))) (concat ((_ extract 63 32) .cse42) ((_ extract 31 0) .cse42)))))) (concat ((_ extract 63 32) .cse41) ((_ extract 31 0) .cse41))) .cse4) .cse20)))) .cse44 (or .cse45 .cse28 .cse20)) (and .cse27 (= .cse4 (let ((.cse46 (bvadd .cse6 .cse39))) (concat ((_ extract 63 32) .cse46) ((_ extract 31 0) .cse46)))))) (or (let ((.cse47 (or .cse30 .cse28 .cse27)) (.cse48 (or .cse1 (and (or .cse29 .cse28 .cse27) (or (and .cse2 .cse21 .cse3 .cse15 .cse16 .cse17 .cse18 .cse19 (or .cse23 .cse27) .cse22) .cse28))))) (and (or (and .cse47 .cse48) .cse31) (or .cse45 .cse28 .cse27) (or (and (or (let ((.cse61 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (= (let ((.cse214 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) (let ((.cse215 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse43))) (concat ((_ extract 63 32) .cse215) ((_ extract 31 0) .cse215)))))) (concat ((_ extract 63 32) .cse214) ((_ extract 31 0) .cse214))) .cse4))) (.cse60 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse211 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse210 (bvadd .cse211 (let ((.cse212 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse43))) (concat ((_ extract 63 32) .cse212) ((_ extract 31 0) .cse212)))))) (concat ((_ extract 63 32) .cse210) ((_ extract 31 0) .cse210))) .cse4) (= .cse4 (let ((.cse213 (bvadd .cse211 .cse34))) (concat ((_ extract 63 32) .cse213) ((_ extract 31 0) .cse213))))))))) (let ((.cse145 (or .cse37 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (= (let ((.cse208 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) (let ((.cse209 (bvadd .cse55 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse209) ((_ extract 31 0) .cse209)))))) (concat ((_ extract 63 32) .cse208) ((_ extract 31 0) .cse208))) .cse4)))) (.cse146 (or .cse1 .cse60)) (.cse59 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse203 ((_ sign_extend 32) v_arrayElimCell_47)) (.cse205 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= (let ((.cse202 (bvadd .cse203 (let ((.cse204 (bvadd .cse205 .cse43))) (concat ((_ extract 63 32) .cse204) ((_ extract 31 0) .cse204)))))) (concat ((_ extract 63 32) .cse202) ((_ extract 31 0) .cse202))) .cse4) (= (let ((.cse206 (bvadd .cse203 (let ((.cse207 (bvadd .cse55 .cse205))) (concat ((_ extract 63 32) .cse207) ((_ extract 31 0) .cse207)))))) (concat ((_ extract 63 32) .cse206) ((_ extract 31 0) .cse206))) .cse4))))) (.cse147 (or .cse37 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse199 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse4 (let ((.cse198 (bvadd .cse199 .cse34))) (concat ((_ extract 63 32) .cse198) ((_ extract 31 0) .cse198)))) (= (let ((.cse200 (bvadd .cse199 (let ((.cse201 (bvadd .cse55 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse201) ((_ extract 31 0) .cse201)))))) (concat ((_ extract 63 32) .cse200) ((_ extract 31 0) .cse200))) .cse4)))))) (.cse62 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse192 ((_ sign_extend 32) v_arrayElimCell_47)) (.cse194 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= (let ((.cse191 (bvadd .cse192 (let ((.cse193 (bvadd .cse194 .cse43))) (concat ((_ extract 63 32) .cse193) ((_ extract 31 0) .cse193)))))) (concat ((_ extract 63 32) .cse191) ((_ extract 31 0) .cse191))) .cse4) (= .cse4 (let ((.cse195 (bvadd .cse192 .cse34))) (concat ((_ extract 63 32) .cse195) ((_ extract 31 0) .cse195)))) (= (let ((.cse196 (bvadd .cse192 (let ((.cse197 (bvadd .cse55 .cse194))) (concat ((_ extract 63 32) .cse197) ((_ extract 31 0) .cse197)))))) (concat ((_ extract 63 32) .cse196) ((_ extract 31 0) .cse196))) .cse4))))) (.cse148 (or .cse1 .cse61))) (and (or .cse1 (and (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse56 ((_ sign_extend 32) v_arrayElimCell_46))) (let ((.cse50 (let ((.cse57 (bvadd (let ((.cse58 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse58) ((_ extract 31 0) .cse58))) .cse56))) (concat ((_ extract 63 32) .cse57) ((_ extract 31 0) .cse57))))) (or (= (let ((.cse49 (bvadd .cse50 .cse6))) (concat ((_ extract 63 32) .cse49) ((_ extract 31 0) .cse49))) .cse4) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse52 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse4 (let ((.cse51 (bvadd .cse50 .cse52))) (concat ((_ extract 63 32) .cse51) ((_ extract 31 0) .cse51)))) (= (let ((.cse53 (bvadd .cse52 (let ((.cse54 (bvadd .cse55 .cse56))) (concat ((_ extract 63 32) .cse54) ((_ extract 31 0) .cse54)))))) (concat ((_ extract 63 32) .cse53) ((_ extract 31 0) .cse53))) .cse4)))))))) (or (and .cse59 .cse60 .cse61 .cse62) .cse27) (or (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse65 (let ((.cse68 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse68) ((_ extract 31 0) .cse68))))) (or (= (let ((.cse63 (bvadd (let ((.cse64 (bvadd .cse65 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse64) ((_ extract 31 0) .cse64))) .cse9))) (concat ((_ extract 63 32) .cse63) ((_ extract 31 0) .cse63))) .cse4) (= (let ((.cse66 (bvadd .cse6 (let ((.cse67 (bvadd .cse65 .cse6))) (concat ((_ extract 63 32) .cse67) ((_ extract 31 0) .cse67)))))) (concat ((_ extract 63 32) .cse66) ((_ extract 31 0) .cse66))) .cse4)))) .cse27) (or (and (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse73 ((_ sign_extend 32) v_arrayElimCell_47)) (.cse72 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= .cse4 (let ((.cse69 (bvadd (let ((.cse70 (bvadd (let ((.cse71 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse71) ((_ extract 31 0) .cse71))) .cse72))) (concat ((_ extract 63 32) .cse70) ((_ extract 31 0) .cse70))) .cse73))) (concat ((_ extract 63 32) .cse69) ((_ extract 31 0) .cse69)))) (= (let ((.cse74 (bvadd .cse73 (let ((.cse75 (bvadd .cse55 .cse72))) (concat ((_ extract 63 32) .cse75) ((_ extract 31 0) .cse75)))))) (concat ((_ extract 63 32) .cse74) ((_ extract 31 0) .cse74))) .cse4)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse77 ((_ sign_extend 32) v_arrayElimCell_47)) (.cse81 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= .cse4 (let ((.cse76 (bvadd .cse77 .cse34))) (concat ((_ extract 63 32) .cse76) ((_ extract 31 0) .cse76)))) (= .cse4 (let ((.cse78 (bvadd (let ((.cse79 (bvadd (let ((.cse80 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse80) ((_ extract 31 0) .cse80))) .cse81))) (concat ((_ extract 63 32) .cse79) ((_ extract 31 0) .cse79))) .cse77))) (concat ((_ extract 63 32) .cse78) ((_ extract 31 0) .cse78)))) (= (let ((.cse82 (bvadd .cse77 (let ((.cse83 (bvadd .cse55 .cse81))) (concat ((_ extract 63 32) .cse83) ((_ extract 31 0) .cse83)))))) (concat ((_ extract 63 32) .cse82) ((_ extract 31 0) .cse82))) .cse4)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse85 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse4 (let ((.cse84 (bvadd .cse85 .cse34))) (concat ((_ extract 63 32) .cse84) ((_ extract 31 0) .cse84)))) (= .cse4 (let ((.cse86 (bvadd (let ((.cse87 (bvadd (let ((.cse88 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse88) ((_ extract 31 0) .cse88))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse87) ((_ extract 31 0) .cse87))) .cse85))) (concat ((_ extract 63 32) .cse86) ((_ extract 31 0) .cse86))))))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (= .cse4 (let ((.cse89 (bvadd (let ((.cse90 (bvadd (let ((.cse91 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse91) ((_ extract 31 0) .cse91))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse90) ((_ extract 31 0) .cse90))) ((_ sign_extend 32) v_arrayElimCell_47)))) (concat ((_ extract 63 32) .cse89) ((_ extract 31 0) .cse89)))))) .cse27) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse93 (let ((.cse95 (bvadd (let ((.cse96 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse96) ((_ extract 31 0) .cse96))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse95) ((_ extract 31 0) .cse95))))) (or (= (let ((.cse92 (bvadd .cse93 .cse6))) (concat ((_ extract 63 32) .cse92) ((_ extract 31 0) .cse92))) .cse4) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= .cse4 (let ((.cse94 (bvadd .cse93 ((_ sign_extend 32) v_arrayElimCell_47)))) (concat ((_ extract 63 32) .cse94) ((_ extract 31 0) .cse94)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse102 (let ((.cse104 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse104) ((_ extract 31 0) .cse104))))) (let ((.cse98 (let ((.cse103 (bvadd .cse102 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse103) ((_ extract 31 0) .cse103))))) (or (= (let ((.cse97 (bvadd .cse98 .cse6))) (concat ((_ extract 63 32) .cse97) ((_ extract 31 0) .cse97))) .cse4) (= (let ((.cse99 (bvadd .cse98 .cse9))) (concat ((_ extract 63 32) .cse99) ((_ extract 31 0) .cse99))) .cse4) (= (let ((.cse100 (bvadd .cse6 (let ((.cse101 (bvadd .cse102 .cse6))) (concat ((_ extract 63 32) .cse101) ((_ extract 31 0) .cse101)))))) (concat ((_ extract 63 32) .cse100) ((_ extract 31 0) .cse100))) .cse4))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse112 ((_ sign_extend 32) v_arrayElimCell_46))) (let ((.cse106 (let ((.cse113 (bvadd (let ((.cse114 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse114) ((_ extract 31 0) .cse114))) .cse112))) (concat ((_ extract 63 32) .cse113) ((_ extract 31 0) .cse113))))) (or (= (let ((.cse105 (bvadd .cse106 .cse6))) (concat ((_ extract 63 32) .cse105) ((_ extract 31 0) .cse105))) .cse4) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse108 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse4 (let ((.cse107 (bvadd .cse108 .cse34))) (concat ((_ extract 63 32) .cse107) ((_ extract 31 0) .cse107)))) (= .cse4 (let ((.cse109 (bvadd .cse106 .cse108))) (concat ((_ extract 63 32) .cse109) ((_ extract 31 0) .cse109)))) (= (let ((.cse110 (bvadd .cse108 (let ((.cse111 (bvadd .cse55 .cse112))) (concat ((_ extract 63 32) .cse111) ((_ extract 31 0) .cse111)))))) (concat ((_ extract 63 32) .cse110) ((_ extract 31 0) .cse110))) .cse4)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse116 (let ((.cse118 (bvadd (let ((.cse119 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse119) ((_ extract 31 0) .cse119))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse118) ((_ extract 31 0) .cse118))))) (or (= (let ((.cse115 (bvadd .cse116 .cse6))) (concat ((_ extract 63 32) .cse115) ((_ extract 31 0) .cse115))) .cse4) (= (let ((.cse117 (bvadd .cse116 .cse9))) (concat ((_ extract 63 32) .cse117) ((_ extract 31 0) .cse117))) .cse4)))) (or (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse120 (bvadd (let ((.cse121 (bvadd (let ((.cse122 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse122) ((_ extract 31 0) .cse122))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse121) ((_ extract 31 0) .cse121))) .cse9))) (concat ((_ extract 63 32) .cse120) ((_ extract 31 0) .cse120))) .cse4)) .cse27) (or .cse44 (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse123 (bvadd (let ((.cse124 (bvadd (let ((.cse125 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse125) ((_ extract 31 0) .cse125))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse124) ((_ extract 31 0) .cse124))) .cse6))) (concat ((_ extract 63 32) .cse123) ((_ extract 31 0) .cse123))) .cse4))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse127 (let ((.cse131 (bvadd (let ((.cse132 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse13))) (concat ((_ extract 63 32) .cse132) ((_ extract 31 0) .cse132))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse131) ((_ extract 31 0) .cse131))))) (or (= (let ((.cse126 (bvadd .cse127 .cse6))) (concat ((_ extract 63 32) .cse126) ((_ extract 31 0) .cse126))) .cse4) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse129 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse4 (let ((.cse128 (bvadd .cse129 .cse34))) (concat ((_ extract 63 32) .cse128) ((_ extract 31 0) .cse128)))) (= .cse4 (let ((.cse130 (bvadd .cse127 .cse129))) (concat ((_ extract 63 32) .cse130) ((_ extract 31 0) .cse130)))))))))))) (or .cse1 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse134 (let ((.cse136 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse43))) (concat ((_ extract 63 32) .cse136) ((_ extract 31 0) .cse136))))) (or (= .cse4 (let ((.cse133 (bvadd .cse6 .cse134))) (concat ((_ extract 63 32) .cse133) ((_ extract 31 0) .cse133)))) (= .cse4 (let ((.cse135 (bvadd .cse9 .cse134))) (concat ((_ extract 63 32) .cse135) ((_ extract 31 0) .cse135)))))))) (or .cse1 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse139 (let ((.cse142 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse43))) (concat ((_ extract 63 32) .cse142) ((_ extract 31 0) .cse142)))) (.cse138 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse137 (bvadd .cse138 .cse139))) (concat ((_ extract 63 32) .cse137) ((_ extract 31 0) .cse137))) .cse4) (= .cse4 (let ((.cse140 (bvadd .cse6 .cse139))) (concat ((_ extract 63 32) .cse140) ((_ extract 31 0) .cse140)))) (= .cse4 (let ((.cse141 (bvadd .cse138 .cse34))) (concat ((_ extract 63 32) .cse141) ((_ extract 31 0) .cse141)))))))) (or (forall ((v_arrayElimCell_46 (_ BitVec 32))) (= .cse4 (let ((.cse143 (bvadd .cse6 (let ((.cse144 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse43))) (concat ((_ extract 63 32) .cse144) ((_ extract 31 0) .cse144)))))) (concat ((_ extract 63 32) .cse143) ((_ extract 31 0) .cse143))))) .cse44) (or (and .cse145 .cse146 .cse59 .cse147 .cse62 .cse148) .cse27) (or .cse37 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse151 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= .cse4 (let ((.cse149 (bvadd .cse6 (let ((.cse150 (bvadd .cse151 .cse43))) (concat ((_ extract 63 32) .cse150) ((_ extract 31 0) .cse150)))))) (concat ((_ extract 63 32) .cse149) ((_ extract 31 0) .cse149)))) (= (let ((.cse152 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) (let ((.cse153 (bvadd .cse55 .cse151))) (concat ((_ extract 63 32) .cse153) ((_ extract 31 0) .cse153)))))) (concat ((_ extract 63 32) .cse152) ((_ extract 31 0) .cse152))) .cse4))))) (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse156 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= (let ((.cse154 (bvadd .cse9 (let ((.cse155 (bvadd .cse55 .cse156))) (concat ((_ extract 63 32) .cse155) ((_ extract 31 0) .cse155)))))) (concat ((_ extract 63 32) .cse154) ((_ extract 31 0) .cse154))) .cse4) (= .cse4 (let ((.cse157 (bvadd .cse9 (let ((.cse158 (bvadd .cse156 .cse43))) (concat ((_ extract 63 32) .cse158) ((_ extract 31 0) .cse158)))))) (concat ((_ extract 63 32) .cse157) ((_ extract 31 0) .cse157))))))) (or (and .cse145 .cse146 .cse59 .cse147 (or .cse1 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (= .cse4 (let ((.cse159 (bvadd .cse9 (let ((.cse160 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse43))) (concat ((_ extract 63 32) .cse160) ((_ extract 31 0) .cse160)))))) (concat ((_ extract 63 32) .cse159) ((_ extract 31 0) .cse159)))))) .cse62 .cse148) .cse27) (or .cse1 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse162 (let ((.cse164 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse43))) (concat ((_ extract 63 32) .cse164) ((_ extract 31 0) .cse164))))) (or (= (let ((.cse161 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse162))) (concat ((_ extract 63 32) .cse161) ((_ extract 31 0) .cse161))) .cse4) (= .cse4 (let ((.cse163 (bvadd .cse6 .cse162))) (concat ((_ extract 63 32) .cse163) ((_ extract 31 0) .cse163)))))))) (or .cse37 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse169 ((_ sign_extend 32) v_arrayElimCell_47)) (.cse167 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= .cse4 (let ((.cse165 (bvadd .cse6 (let ((.cse166 (bvadd .cse167 .cse43))) (concat ((_ extract 63 32) .cse166) ((_ extract 31 0) .cse166)))))) (concat ((_ extract 63 32) .cse165) ((_ extract 31 0) .cse165)))) (= .cse4 (let ((.cse168 (bvadd .cse169 .cse34))) (concat ((_ extract 63 32) .cse168) ((_ extract 31 0) .cse168)))) (= (let ((.cse170 (bvadd .cse169 (let ((.cse171 (bvadd .cse55 .cse167))) (concat ((_ extract 63 32) .cse171) ((_ extract 31 0) .cse171)))))) (concat ((_ extract 63 32) .cse170) ((_ extract 31 0) .cse170))) .cse4))))) (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse179 ((_ sign_extend 32) v_arrayElimCell_46))) (let ((.cse173 (let ((.cse180 (bvadd .cse179 .cse43))) (concat ((_ extract 63 32) .cse180) ((_ extract 31 0) .cse180))))) (or (= .cse4 (let ((.cse172 (bvadd .cse6 .cse173))) (concat ((_ extract 63 32) .cse172) ((_ extract 31 0) .cse172)))) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse175 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse174 (bvadd .cse175 .cse173))) (concat ((_ extract 63 32) .cse174) ((_ extract 31 0) .cse174))) .cse4) (= .cse4 (let ((.cse176 (bvadd .cse175 .cse34))) (concat ((_ extract 63 32) .cse176) ((_ extract 31 0) .cse176)))) (= (let ((.cse177 (bvadd .cse175 (let ((.cse178 (bvadd .cse55 .cse179))) (concat ((_ extract 63 32) .cse178) ((_ extract 31 0) .cse178)))))) (concat ((_ extract 63 32) .cse177) ((_ extract 31 0) .cse177))) .cse4)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse186 ((_ sign_extend 32) v_arrayElimCell_46))) (let ((.cse183 (let ((.cse188 (bvadd .cse186 .cse43))) (concat ((_ extract 63 32) .cse188) ((_ extract 31 0) .cse188))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse182 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse181 (bvadd .cse182 .cse183))) (concat ((_ extract 63 32) .cse181) ((_ extract 31 0) .cse181))) .cse4) (= (let ((.cse184 (bvadd .cse182 (let ((.cse185 (bvadd .cse55 .cse186))) (concat ((_ extract 63 32) .cse185) ((_ extract 31 0) .cse185)))))) (concat ((_ extract 63 32) .cse184) ((_ extract 31 0) .cse184))) .cse4)))) (= .cse4 (let ((.cse187 (bvadd .cse6 .cse183))) (concat ((_ extract 63 32) .cse187) ((_ extract 31 0) .cse187)))))))) (or .cse37 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (= (let ((.cse189 (bvadd .cse9 (let ((.cse190 (bvadd .cse55 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse190) ((_ extract 31 0) .cse190)))))) (concat ((_ extract 63 32) .cse189) ((_ extract 31 0) .cse189))) .cse4)))))) .cse28) .cse47 .cse48) .cse31))) .cse20)))))))) .cse315) (or (bvslt (_ bv3 32) c_~N~0) .cse316 .cse32 (not (bvslt (_ bv1 32) c_~N~0))) (or (= (let ((.cse317 (bvadd ((_ sign_extend 32) (select .cse318 .cse319)) (let ((.cse320 (bvadd (let ((.cse321 (bvadd ((_ sign_extend 32) (select .cse318 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse13))) (concat ((_ extract 63 32) .cse321) ((_ extract 31 0) .cse321))) ((_ sign_extend 32) (select .cse318 .cse322))))) (concat ((_ extract 63 32) .cse320) ((_ extract 31 0) .cse320)))))) (concat ((_ extract 63 32) .cse317) ((_ extract 31 0) .cse317))) .cse4) .cse316) (let ((.cse323 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse216)) (.cse324 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse216))) (or .cse0 (not (= (select .cse318 .cse323) (_ bv1 32))) (not (= (select .cse318 .cse324) (_ bv1 32))) (= .cse4 (let ((.cse325 (let ((.cse328 (store (store (let ((.cse329 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse216))) (store .cse318 .cse329 (bvadd (_ bv3 32) (select .cse318 .cse329)))) .cse323 (_ bv4 32)) .cse324 (_ bv4 32)))) (bvadd (let ((.cse326 (bvadd (let ((.cse327 (bvadd .cse13 ((_ sign_extend 32) (select .cse328 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (concat ((_ extract 63 32) .cse327) ((_ extract 31 0) .cse327))) ((_ sign_extend 32) (select .cse328 .cse322))))) (concat ((_ extract 63 32) .cse326) ((_ extract 31 0) .cse326))) ((_ sign_extend 32) (select .cse328 .cse319)))))) (concat ((_ extract 63 32) .cse325) ((_ extract 31 0) .cse325)))) (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|)) .cse315))))))) is different from true [2023-12-21 21:03:29,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 21:03:33,049 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:03:52,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 21:04:04,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 21:04:26,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 21:04:52,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 21:05:18,813 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse348 (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse348 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (.cse342 (select .cse348 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse25 ((_ sign_extend 32) (_ bv4 32))) (.cse8 (concat .cse1 .cse342))) (let ((.cse72 (let ((.cse347 (bvadd .cse25 .cse8))) (concat ((_ extract 63 32) .cse347) ((_ extract 31 0) .cse347)))) (.cse233 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse19 (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse336 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse233)) (.cse12 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse233)) (.cse10 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse11 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse233)) (.cse51 (let ((.cse346 (bvadd .cse72 .cse25))) (concat ((_ extract 63 32) .cse346) ((_ extract 31 0) .cse346)))) (.cse13 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv4 32))))) (let ((.cse2 (bvslt (_ bv3 32) c_~N~0)) (.cse20 (= (let ((.cse345 (bvadd .cse25 .cse51))) (concat ((_ extract 63 32) .cse345) ((_ extract 31 0) .cse345))) .cse13)) (.cse18 (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse14 (bvslt (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse15 (not (= (select .cse10 .cse11) (_ bv1 32)))) (.cse16 (not (= (select .cse10 .cse12) (_ bv1 32)))) (.cse9 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse5 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse337 (select .cse10 .cse336)) (.cse17 (not .cse19)) (.cse0 (bvadd .cse25 (let ((.cse343 (bvadd (let ((.cse344 (bvadd .cse25 (concat ((_ extract 63 32) (_ bv0 64)) ((_ extract 31 0) (_ bv0 64)))))) (concat ((_ extract 63 32) .cse344) ((_ extract 31 0) .cse344))) .cse25))) (concat ((_ extract 63 32) .cse343) ((_ extract 31 0) .cse343)))))) (and (= ((_ extract 63 32) .cse0) .cse1) (not .cse2) (or (= (let ((.cse3 (let ((.cse4 (store (store .cse10 .cse11 (_ bv4 32)) .cse12 (_ bv4 32)))) (bvadd ((_ sign_extend 32) (select .cse4 .cse5)) (let ((.cse6 (bvadd (let ((.cse7 (bvadd ((_ sign_extend 32) (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse8))) (concat ((_ extract 63 32) .cse7) ((_ extract 31 0) .cse7))) ((_ sign_extend 32) (select .cse4 .cse9))))) (concat ((_ extract 63 32) .cse6) ((_ extract 31 0) .cse6))))))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3))) .cse13) .cse14 .cse15 .cse16 .cse17) (or .cse2 .cse18 .cse19 .cse20 (not (bvslt (_ bv1 32) c_~N~0))) (or .cse14 (let ((.cse28 ((_ sign_extend 32) (_ bv1 32)))) (let ((.cse60 (let ((.cse331 (bvadd .cse28 .cse8))) (concat ((_ extract 63 32) .cse331) ((_ extract 31 0) .cse331))))) (let ((.cse21 (= (bvadd (_ bv8 32) .cse233) (_ bv0 32))) (.cse56 (let ((.cse330 (bvadd .cse28 .cse60))) (concat ((_ extract 63 32) .cse330) ((_ extract 31 0) .cse330))))) (let ((.cse312 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= .cse13 (let ((.cse329 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse56))) (concat ((_ extract 63 32) .cse329) ((_ extract 31 0) .cse329)))))) (.cse54 (not .cse21)) (.cse53 (let ((.cse328 (bvadd .cse72 .cse28))) (concat ((_ extract 63 32) .cse328) ((_ extract 31 0) .cse328)))) (.cse49 (= (bvadd (_ bv4 32) .cse233) (_ bv0 32))) (.cse311 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse326 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse13 (let ((.cse325 (bvadd .cse326 .cse51))) (concat ((_ extract 63 32) .cse325) ((_ extract 31 0) .cse325)))) (= .cse13 (let ((.cse327 (bvadd .cse326 .cse56))) (concat ((_ extract 63 32) .cse327) ((_ extract 31 0) .cse327)))))))) (.cse45 (= (_ bv8 32) .cse233))) (let ((.cse61 (not .cse45)) (.cse234 (or .cse21 .cse311)) (.cse57 (not .cse49)) (.cse235 (or .cse54 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse323 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse13 (let ((.cse322 (bvadd .cse323 .cse53))) (concat ((_ extract 63 32) .cse322) ((_ extract 31 0) .cse322)))) (= .cse13 (let ((.cse324 (bvadd .cse323 .cse51))) (concat ((_ extract 63 32) .cse324) ((_ extract 31 0) .cse324))))))))) (.cse238 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse319 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse13 (let ((.cse318 (bvadd .cse319 .cse53))) (concat ((_ extract 63 32) .cse318) ((_ extract 31 0) .cse318)))) (= .cse13 (let ((.cse320 (bvadd .cse319 .cse51))) (concat ((_ extract 63 32) .cse320) ((_ extract 31 0) .cse320)))) (= .cse13 (let ((.cse321 (bvadd .cse319 .cse56))) (concat ((_ extract 63 32) .cse321) ((_ extract 31 0) .cse321)))))))) (.cse236 (or .cse21 .cse312)) (.cse237 (or .cse54 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= .cse13 (let ((.cse317 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse53))) (concat ((_ extract 63 32) .cse317) ((_ extract 31 0) .cse317))))))) (.cse239 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse315 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse13 (let ((.cse314 (bvadd .cse315 .cse53))) (concat ((_ extract 63 32) .cse314) ((_ extract 31 0) .cse314)))) (= .cse13 (let ((.cse316 (bvadd .cse315 .cse56))) (concat ((_ extract 63 32) .cse316) ((_ extract 31 0) .cse316)))))))) (.cse38 (= (_ bv4 32) .cse233))) (let ((.cse32 (not .cse38)) (.cse62 (and .cse234 (or .cse57 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= .cse13 (let ((.cse313 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse51))) (concat ((_ extract 63 32) .cse313) ((_ extract 31 0) .cse313)))))) .cse235 .cse238 (or (and .cse236 .cse237 .cse239) .cse49))) (.cse47 (and .cse311 .cse312 .cse238 .cse239)) (.cse22 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse308 (let ((.cse310 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse310) ((_ extract 31 0) .cse310))))) (let ((.cse304 (let ((.cse309 (bvadd .cse308 .cse28))) (concat ((_ extract 63 32) .cse309) ((_ extract 31 0) .cse309))))) (or (= (let ((.cse303 (bvadd .cse28 .cse304))) (concat ((_ extract 63 32) .cse303) ((_ extract 31 0) .cse303))) .cse13) (= .cse13 (let ((.cse305 (bvadd .cse25 .cse304))) (concat ((_ extract 63 32) .cse305) ((_ extract 31 0) .cse305)))) (= (let ((.cse306 (bvadd .cse25 (let ((.cse307 (bvadd .cse308 .cse25))) (concat ((_ extract 63 32) .cse307) ((_ extract 31 0) .cse307)))))) (concat ((_ extract 63 32) .cse306) ((_ extract 31 0) .cse306))) .cse13)))))) (.cse39 (or .cse45 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse300 (bvadd .cse28 (let ((.cse301 (bvadd (let ((.cse302 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse302) ((_ extract 31 0) .cse302))) .cse28))) (concat ((_ extract 63 32) .cse301) ((_ extract 31 0) .cse301)))))) (concat ((_ extract 63 32) .cse300) ((_ extract 31 0) .cse300))) .cse13)))) (.cse23 (or .cse61 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= .cse13 (let ((.cse297 (bvadd .cse25 (let ((.cse298 (bvadd (let ((.cse299 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse299) ((_ extract 31 0) .cse299))) .cse28))) (concat ((_ extract 63 32) .cse298) ((_ extract 31 0) .cse298)))))) (concat ((_ extract 63 32) .cse297) ((_ extract 31 0) .cse297))))))) (.cse33 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse290 (let ((.cse295 (bvadd (let ((.cse296 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse296) ((_ extract 31 0) .cse296))) .cse28))) (concat ((_ extract 63 32) .cse295) ((_ extract 31 0) .cse295))))) (or (= .cse13 (let ((.cse289 (bvadd .cse25 .cse290))) (concat ((_ extract 63 32) .cse289) ((_ extract 31 0) .cse289)))) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse292 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse291 (bvadd .cse292 .cse290))) (concat ((_ extract 63 32) .cse291) ((_ extract 31 0) .cse291))) .cse13) (= .cse13 (let ((.cse293 (bvadd .cse292 .cse53))) (concat ((_ extract 63 32) .cse293) ((_ extract 31 0) .cse293)))) (= .cse13 (let ((.cse294 (bvadd .cse292 .cse51))) (concat ((_ extract 63 32) .cse294) ((_ extract 31 0) .cse294))))))))))) (.cse34 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse283 (let ((.cse287 (bvadd (let ((.cse288 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse288) ((_ extract 31 0) .cse288))) .cse28))) (concat ((_ extract 63 32) .cse287) ((_ extract 31 0) .cse287))))) (or (= .cse13 (let ((.cse282 (bvadd .cse25 .cse283))) (concat ((_ extract 63 32) .cse282) ((_ extract 31 0) .cse282)))) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse285 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse284 (bvadd .cse285 .cse283))) (concat ((_ extract 63 32) .cse284) ((_ extract 31 0) .cse284))) .cse13) (= .cse13 (let ((.cse286 (bvadd .cse285 .cse53))) (concat ((_ extract 63 32) .cse286) ((_ extract 31 0) .cse286))))))))))) (.cse35 (or .cse45 (and (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse263 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) (let ((.cse264 (bvadd (let ((.cse265 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse265) ((_ extract 31 0) .cse265))) .cse28))) (concat ((_ extract 63 32) .cse264) ((_ extract 31 0) .cse264)))))) (concat ((_ extract 63 32) .cse263) ((_ extract 31 0) .cse263))) .cse13)) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse267 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse266 (bvadd .cse267 (let ((.cse268 (bvadd (let ((.cse269 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse269) ((_ extract 31 0) .cse269))) .cse28))) (concat ((_ extract 63 32) .cse268) ((_ extract 31 0) .cse268)))))) (concat ((_ extract 63 32) .cse266) ((_ extract 31 0) .cse266))) .cse13) (= .cse13 (let ((.cse270 (bvadd .cse267 .cse51))) (concat ((_ extract 63 32) .cse270) ((_ extract 31 0) .cse270))))))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse272 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse271 (bvadd .cse272 (let ((.cse273 (bvadd (let ((.cse274 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse274) ((_ extract 31 0) .cse274))) .cse28))) (concat ((_ extract 63 32) .cse273) ((_ extract 31 0) .cse273)))))) (concat ((_ extract 63 32) .cse271) ((_ extract 31 0) .cse271))) .cse13) (= .cse13 (let ((.cse275 (bvadd .cse272 .cse53))) (concat ((_ extract 63 32) .cse275) ((_ extract 31 0) .cse275)))) (= .cse13 (let ((.cse276 (bvadd .cse272 .cse51))) (concat ((_ extract 63 32) .cse276) ((_ extract 31 0) .cse276))))))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse278 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse277 (bvadd .cse278 (let ((.cse279 (bvadd (let ((.cse280 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse280) ((_ extract 31 0) .cse280))) .cse28))) (concat ((_ extract 63 32) .cse279) ((_ extract 31 0) .cse279)))))) (concat ((_ extract 63 32) .cse277) ((_ extract 31 0) .cse277))) .cse13) (= .cse13 (let ((.cse281 (bvadd .cse278 .cse53))) (concat ((_ extract 63 32) .cse281) ((_ extract 31 0) .cse281)))))))))) (.cse36 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse258 (let ((.cse261 (bvadd (let ((.cse262 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse262) ((_ extract 31 0) .cse262))) .cse28))) (concat ((_ extract 63 32) .cse261) ((_ extract 31 0) .cse261))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse257 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse256 (bvadd .cse257 .cse258))) (concat ((_ extract 63 32) .cse256) ((_ extract 31 0) .cse256))) .cse13) (= .cse13 (let ((.cse259 (bvadd .cse257 .cse51))) (concat ((_ extract 63 32) .cse259) ((_ extract 31 0) .cse259))))))) (= .cse13 (let ((.cse260 (bvadd .cse25 .cse258))) (concat ((_ extract 63 32) .cse260) ((_ extract 31 0) .cse260)))))))) (.cse37 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse252 (let ((.cse254 (bvadd (let ((.cse255 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse255) ((_ extract 31 0) .cse255))) .cse28))) (concat ((_ extract 63 32) .cse254) ((_ extract 31 0) .cse254))))) (or (= .cse13 (let ((.cse251 (bvadd .cse25 .cse252))) (concat ((_ extract 63 32) .cse251) ((_ extract 31 0) .cse251)))) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= (let ((.cse253 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse252))) (concat ((_ extract 63 32) .cse253) ((_ extract 31 0) .cse253))) .cse13)))))) (.cse41 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse247 (let ((.cse250 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse250) ((_ extract 31 0) .cse250))))) (or (= (let ((.cse245 (bvadd .cse28 (let ((.cse246 (bvadd .cse247 .cse28))) (concat ((_ extract 63 32) .cse246) ((_ extract 31 0) .cse246)))))) (concat ((_ extract 63 32) .cse245) ((_ extract 31 0) .cse245))) .cse13) (= (let ((.cse248 (bvadd .cse25 (let ((.cse249 (bvadd .cse247 .cse25))) (concat ((_ extract 63 32) .cse249) ((_ extract 31 0) .cse249)))))) (concat ((_ extract 63 32) .cse248) ((_ extract 31 0) .cse248))) .cse13))))) (.cse40 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse241 (let ((.cse243 (bvadd (let ((.cse244 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse244) ((_ extract 31 0) .cse244))) .cse28))) (concat ((_ extract 63 32) .cse243) ((_ extract 31 0) .cse243))))) (or (= (let ((.cse240 (bvadd .cse28 .cse241))) (concat ((_ extract 63 32) .cse240) ((_ extract 31 0) .cse240))) .cse13) (= .cse13 (let ((.cse242 (bvadd .cse25 .cse241))) (concat ((_ extract 63 32) .cse242) ((_ extract 31 0) .cse242)))))))) (.cse48 (and .cse234 .cse235 .cse236 .cse237 .cse238 .cse239)) (.cse46 (= (_ bv0 32) .cse233))) (and (or (and (or .cse21 (and (or (and .cse22 .cse23 (or (forall ((v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse27 (let ((.cse31 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse31) ((_ extract 31 0) .cse31))))) (or (= .cse13 (let ((.cse24 (bvadd .cse25 (let ((.cse26 (bvadd .cse27 .cse28))) (concat ((_ extract 63 32) .cse26) ((_ extract 31 0) .cse26)))))) (concat ((_ extract 63 32) .cse24) ((_ extract 31 0) .cse24)))) (= (let ((.cse29 (bvadd .cse25 (let ((.cse30 (bvadd .cse27 .cse25))) (concat ((_ extract 63 32) .cse30) ((_ extract 31 0) .cse30)))))) (concat ((_ extract 63 32) .cse29) ((_ extract 31 0) .cse29))) .cse13)))) .cse32) (or (and .cse33 .cse34 .cse35 .cse36 .cse37) .cse38) (or (and .cse39 .cse40) .cse38) (or (and .cse41 (or .cse32 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse42 (bvadd .cse25 (let ((.cse43 (bvadd (let ((.cse44 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse44) ((_ extract 31 0) .cse44))) .cse25))) (concat ((_ extract 63 32) .cse43) ((_ extract 31 0) .cse43)))))) (concat ((_ extract 63 32) .cse42) ((_ extract 31 0) .cse42))) .cse13)))) .cse45)) .cse46) (or .cse47 .cse46 .cse45 .cse38))) (or .cse48 .cse46 .cse45 .cse38)) .cse49) (or (and (or (and .cse46 .cse20) (and (not .cse46) (or (and .cse32 (or (and (= .cse13 (let ((.cse50 (bvadd .cse28 .cse51))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50)))) .cse49) (and (or (and .cse21 (= (let ((.cse52 (bvadd .cse28 .cse53))) (concat ((_ extract 63 32) .cse52) ((_ extract 31 0) .cse52))) .cse13)) (and .cse54 (= (let ((.cse55 (bvadd .cse28 .cse56))) (concat ((_ extract 63 32) .cse55) ((_ extract 31 0) .cse55))) .cse13))) .cse57))) (and (= (let ((.cse58 (bvadd .cse25 (let ((.cse59 (bvadd .cse25 .cse60))) (concat ((_ extract 63 32) .cse59) ((_ extract 31 0) .cse59)))))) (concat ((_ extract 63 32) .cse58) ((_ extract 31 0) .cse58))) .cse13) .cse38)))) .cse61 (or .cse62 .cse46 .cse38)) (and .cse45 (= .cse13 (let ((.cse63 (bvadd .cse25 .cse56))) (concat ((_ extract 63 32) .cse63) ((_ extract 31 0) .cse63)))))) (or (let ((.cse64 (or .cse48 .cse46 .cse45)) (.cse65 (or .cse21 (and (or .cse47 .cse46 .cse45) (or (and .cse22 .cse39 .cse23 .cse33 .cse34 .cse35 .cse36 .cse37 (or .cse41 .cse45) .cse40) .cse46))))) (and (or (and .cse64 .cse65) .cse49) (or .cse62 .cse46 .cse45) (or (and (or (let ((.cse78 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (= (let ((.cse231 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) (let ((.cse232 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse60))) (concat ((_ extract 63 32) .cse232) ((_ extract 31 0) .cse232)))))) (concat ((_ extract 63 32) .cse231) ((_ extract 31 0) .cse231))) .cse13))) (.cse77 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse228 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse227 (bvadd .cse228 (let ((.cse229 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse60))) (concat ((_ extract 63 32) .cse229) ((_ extract 31 0) .cse229)))))) (concat ((_ extract 63 32) .cse227) ((_ extract 31 0) .cse227))) .cse13) (= .cse13 (let ((.cse230 (bvadd .cse228 .cse51))) (concat ((_ extract 63 32) .cse230) ((_ extract 31 0) .cse230))))))))) (let ((.cse162 (or .cse54 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (= (let ((.cse225 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) (let ((.cse226 (bvadd .cse72 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse226) ((_ extract 31 0) .cse226)))))) (concat ((_ extract 63 32) .cse225) ((_ extract 31 0) .cse225))) .cse13)))) (.cse163 (or .cse21 .cse77)) (.cse76 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse220 ((_ sign_extend 32) v_arrayElimCell_47)) (.cse222 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= (let ((.cse219 (bvadd .cse220 (let ((.cse221 (bvadd .cse222 .cse60))) (concat ((_ extract 63 32) .cse221) ((_ extract 31 0) .cse221)))))) (concat ((_ extract 63 32) .cse219) ((_ extract 31 0) .cse219))) .cse13) (= (let ((.cse223 (bvadd .cse220 (let ((.cse224 (bvadd .cse72 .cse222))) (concat ((_ extract 63 32) .cse224) ((_ extract 31 0) .cse224)))))) (concat ((_ extract 63 32) .cse223) ((_ extract 31 0) .cse223))) .cse13))))) (.cse164 (or .cse54 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse216 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse13 (let ((.cse215 (bvadd .cse216 .cse51))) (concat ((_ extract 63 32) .cse215) ((_ extract 31 0) .cse215)))) (= (let ((.cse217 (bvadd .cse216 (let ((.cse218 (bvadd .cse72 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse218) ((_ extract 31 0) .cse218)))))) (concat ((_ extract 63 32) .cse217) ((_ extract 31 0) .cse217))) .cse13)))))) (.cse79 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse209 ((_ sign_extend 32) v_arrayElimCell_47)) (.cse211 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= (let ((.cse208 (bvadd .cse209 (let ((.cse210 (bvadd .cse211 .cse60))) (concat ((_ extract 63 32) .cse210) ((_ extract 31 0) .cse210)))))) (concat ((_ extract 63 32) .cse208) ((_ extract 31 0) .cse208))) .cse13) (= .cse13 (let ((.cse212 (bvadd .cse209 .cse51))) (concat ((_ extract 63 32) .cse212) ((_ extract 31 0) .cse212)))) (= (let ((.cse213 (bvadd .cse209 (let ((.cse214 (bvadd .cse72 .cse211))) (concat ((_ extract 63 32) .cse214) ((_ extract 31 0) .cse214)))))) (concat ((_ extract 63 32) .cse213) ((_ extract 31 0) .cse213))) .cse13))))) (.cse165 (or .cse21 .cse78))) (and (or .cse21 (and (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse73 ((_ sign_extend 32) v_arrayElimCell_46))) (let ((.cse67 (let ((.cse74 (bvadd (let ((.cse75 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse75) ((_ extract 31 0) .cse75))) .cse73))) (concat ((_ extract 63 32) .cse74) ((_ extract 31 0) .cse74))))) (or (= (let ((.cse66 (bvadd .cse67 .cse25))) (concat ((_ extract 63 32) .cse66) ((_ extract 31 0) .cse66))) .cse13) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse69 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse13 (let ((.cse68 (bvadd .cse67 .cse69))) (concat ((_ extract 63 32) .cse68) ((_ extract 31 0) .cse68)))) (= (let ((.cse70 (bvadd .cse69 (let ((.cse71 (bvadd .cse72 .cse73))) (concat ((_ extract 63 32) .cse71) ((_ extract 31 0) .cse71)))))) (concat ((_ extract 63 32) .cse70) ((_ extract 31 0) .cse70))) .cse13)))))))) (or (and .cse76 .cse77 .cse78 .cse79) .cse45) (or (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse82 (let ((.cse85 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse85) ((_ extract 31 0) .cse85))))) (or (= (let ((.cse80 (bvadd (let ((.cse81 (bvadd .cse82 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81))) .cse28))) (concat ((_ extract 63 32) .cse80) ((_ extract 31 0) .cse80))) .cse13) (= (let ((.cse83 (bvadd .cse25 (let ((.cse84 (bvadd .cse82 .cse25))) (concat ((_ extract 63 32) .cse84) ((_ extract 31 0) .cse84)))))) (concat ((_ extract 63 32) .cse83) ((_ extract 31 0) .cse83))) .cse13)))) .cse45) (or (and (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse90 ((_ sign_extend 32) v_arrayElimCell_47)) (.cse89 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= .cse13 (let ((.cse86 (bvadd (let ((.cse87 (bvadd (let ((.cse88 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse88) ((_ extract 31 0) .cse88))) .cse89))) (concat ((_ extract 63 32) .cse87) ((_ extract 31 0) .cse87))) .cse90))) (concat ((_ extract 63 32) .cse86) ((_ extract 31 0) .cse86)))) (= (let ((.cse91 (bvadd .cse90 (let ((.cse92 (bvadd .cse72 .cse89))) (concat ((_ extract 63 32) .cse92) ((_ extract 31 0) .cse92)))))) (concat ((_ extract 63 32) .cse91) ((_ extract 31 0) .cse91))) .cse13)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse94 ((_ sign_extend 32) v_arrayElimCell_47)) (.cse98 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= .cse13 (let ((.cse93 (bvadd .cse94 .cse51))) (concat ((_ extract 63 32) .cse93) ((_ extract 31 0) .cse93)))) (= .cse13 (let ((.cse95 (bvadd (let ((.cse96 (bvadd (let ((.cse97 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse97) ((_ extract 31 0) .cse97))) .cse98))) (concat ((_ extract 63 32) .cse96) ((_ extract 31 0) .cse96))) .cse94))) (concat ((_ extract 63 32) .cse95) ((_ extract 31 0) .cse95)))) (= (let ((.cse99 (bvadd .cse94 (let ((.cse100 (bvadd .cse72 .cse98))) (concat ((_ extract 63 32) .cse100) ((_ extract 31 0) .cse100)))))) (concat ((_ extract 63 32) .cse99) ((_ extract 31 0) .cse99))) .cse13)))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse102 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse13 (let ((.cse101 (bvadd .cse102 .cse51))) (concat ((_ extract 63 32) .cse101) ((_ extract 31 0) .cse101)))) (= .cse13 (let ((.cse103 (bvadd (let ((.cse104 (bvadd (let ((.cse105 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse105) ((_ extract 31 0) .cse105))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse104) ((_ extract 31 0) .cse104))) .cse102))) (concat ((_ extract 63 32) .cse103) ((_ extract 31 0) .cse103))))))) (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (= .cse13 (let ((.cse106 (bvadd (let ((.cse107 (bvadd (let ((.cse108 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse108) ((_ extract 31 0) .cse108))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse107) ((_ extract 31 0) .cse107))) ((_ sign_extend 32) v_arrayElimCell_47)))) (concat ((_ extract 63 32) .cse106) ((_ extract 31 0) .cse106)))))) .cse45) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse110 (let ((.cse112 (bvadd (let ((.cse113 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse113) ((_ extract 31 0) .cse113))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse112) ((_ extract 31 0) .cse112))))) (or (= (let ((.cse109 (bvadd .cse110 .cse25))) (concat ((_ extract 63 32) .cse109) ((_ extract 31 0) .cse109))) .cse13) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= .cse13 (let ((.cse111 (bvadd .cse110 ((_ sign_extend 32) v_arrayElimCell_47)))) (concat ((_ extract 63 32) .cse111) ((_ extract 31 0) .cse111)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse119 (let ((.cse121 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse121) ((_ extract 31 0) .cse121))))) (let ((.cse115 (let ((.cse120 (bvadd .cse119 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse120) ((_ extract 31 0) .cse120))))) (or (= (let ((.cse114 (bvadd .cse115 .cse25))) (concat ((_ extract 63 32) .cse114) ((_ extract 31 0) .cse114))) .cse13) (= (let ((.cse116 (bvadd .cse115 .cse28))) (concat ((_ extract 63 32) .cse116) ((_ extract 31 0) .cse116))) .cse13) (= (let ((.cse117 (bvadd .cse25 (let ((.cse118 (bvadd .cse119 .cse25))) (concat ((_ extract 63 32) .cse118) ((_ extract 31 0) .cse118)))))) (concat ((_ extract 63 32) .cse117) ((_ extract 31 0) .cse117))) .cse13))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse129 ((_ sign_extend 32) v_arrayElimCell_46))) (let ((.cse123 (let ((.cse130 (bvadd (let ((.cse131 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse131) ((_ extract 31 0) .cse131))) .cse129))) (concat ((_ extract 63 32) .cse130) ((_ extract 31 0) .cse130))))) (or (= (let ((.cse122 (bvadd .cse123 .cse25))) (concat ((_ extract 63 32) .cse122) ((_ extract 31 0) .cse122))) .cse13) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse125 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse13 (let ((.cse124 (bvadd .cse125 .cse51))) (concat ((_ extract 63 32) .cse124) ((_ extract 31 0) .cse124)))) (= .cse13 (let ((.cse126 (bvadd .cse123 .cse125))) (concat ((_ extract 63 32) .cse126) ((_ extract 31 0) .cse126)))) (= (let ((.cse127 (bvadd .cse125 (let ((.cse128 (bvadd .cse72 .cse129))) (concat ((_ extract 63 32) .cse128) ((_ extract 31 0) .cse128)))))) (concat ((_ extract 63 32) .cse127) ((_ extract 31 0) .cse127))) .cse13)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse133 (let ((.cse135 (bvadd (let ((.cse136 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse136) ((_ extract 31 0) .cse136))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse135) ((_ extract 31 0) .cse135))))) (or (= (let ((.cse132 (bvadd .cse133 .cse25))) (concat ((_ extract 63 32) .cse132) ((_ extract 31 0) .cse132))) .cse13) (= (let ((.cse134 (bvadd .cse133 .cse28))) (concat ((_ extract 63 32) .cse134) ((_ extract 31 0) .cse134))) .cse13)))) (or (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse137 (bvadd (let ((.cse138 (bvadd (let ((.cse139 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse139) ((_ extract 31 0) .cse139))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse138) ((_ extract 31 0) .cse138))) .cse28))) (concat ((_ extract 63 32) .cse137) ((_ extract 31 0) .cse137))) .cse13)) .cse45) (or .cse61 (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (= (let ((.cse140 (bvadd (let ((.cse141 (bvadd (let ((.cse142 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse142) ((_ extract 31 0) .cse142))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse141) ((_ extract 31 0) .cse141))) .cse25))) (concat ((_ extract 63 32) .cse140) ((_ extract 31 0) .cse140))) .cse13))) (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32))) (let ((.cse144 (let ((.cse148 (bvadd (let ((.cse149 (bvadd ((_ sign_extend 32) v_arrayElimCell_43) .cse8))) (concat ((_ extract 63 32) .cse149) ((_ extract 31 0) .cse149))) ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse148) ((_ extract 31 0) .cse148))))) (or (= (let ((.cse143 (bvadd .cse144 .cse25))) (concat ((_ extract 63 32) .cse143) ((_ extract 31 0) .cse143))) .cse13) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse146 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= .cse13 (let ((.cse145 (bvadd .cse146 .cse51))) (concat ((_ extract 63 32) .cse145) ((_ extract 31 0) .cse145)))) (= .cse13 (let ((.cse147 (bvadd .cse144 .cse146))) (concat ((_ extract 63 32) .cse147) ((_ extract 31 0) .cse147)))))))))))) (or .cse21 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse151 (let ((.cse153 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse60))) (concat ((_ extract 63 32) .cse153) ((_ extract 31 0) .cse153))))) (or (= .cse13 (let ((.cse150 (bvadd .cse25 .cse151))) (concat ((_ extract 63 32) .cse150) ((_ extract 31 0) .cse150)))) (= .cse13 (let ((.cse152 (bvadd .cse28 .cse151))) (concat ((_ extract 63 32) .cse152) ((_ extract 31 0) .cse152)))))))) (or .cse21 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse156 (let ((.cse159 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse60))) (concat ((_ extract 63 32) .cse159) ((_ extract 31 0) .cse159)))) (.cse155 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse154 (bvadd .cse155 .cse156))) (concat ((_ extract 63 32) .cse154) ((_ extract 31 0) .cse154))) .cse13) (= .cse13 (let ((.cse157 (bvadd .cse25 .cse156))) (concat ((_ extract 63 32) .cse157) ((_ extract 31 0) .cse157)))) (= .cse13 (let ((.cse158 (bvadd .cse155 .cse51))) (concat ((_ extract 63 32) .cse158) ((_ extract 31 0) .cse158)))))))) (or (forall ((v_arrayElimCell_46 (_ BitVec 32))) (= .cse13 (let ((.cse160 (bvadd .cse25 (let ((.cse161 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse60))) (concat ((_ extract 63 32) .cse161) ((_ extract 31 0) .cse161)))))) (concat ((_ extract 63 32) .cse160) ((_ extract 31 0) .cse160))))) .cse61) (or (and .cse162 .cse163 .cse76 .cse164 .cse79 .cse165) .cse45) (or .cse54 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse168 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= .cse13 (let ((.cse166 (bvadd .cse25 (let ((.cse167 (bvadd .cse168 .cse60))) (concat ((_ extract 63 32) .cse167) ((_ extract 31 0) .cse167)))))) (concat ((_ extract 63 32) .cse166) ((_ extract 31 0) .cse166)))) (= (let ((.cse169 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) (let ((.cse170 (bvadd .cse72 .cse168))) (concat ((_ extract 63 32) .cse170) ((_ extract 31 0) .cse170)))))) (concat ((_ extract 63 32) .cse169) ((_ extract 31 0) .cse169))) .cse13))))) (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse173 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= (let ((.cse171 (bvadd .cse28 (let ((.cse172 (bvadd .cse72 .cse173))) (concat ((_ extract 63 32) .cse172) ((_ extract 31 0) .cse172)))))) (concat ((_ extract 63 32) .cse171) ((_ extract 31 0) .cse171))) .cse13) (= .cse13 (let ((.cse174 (bvadd .cse28 (let ((.cse175 (bvadd .cse173 .cse60))) (concat ((_ extract 63 32) .cse175) ((_ extract 31 0) .cse175)))))) (concat ((_ extract 63 32) .cse174) ((_ extract 31 0) .cse174))))))) (or (and .cse162 .cse163 .cse76 .cse164 (or .cse21 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (= .cse13 (let ((.cse176 (bvadd .cse28 (let ((.cse177 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse60))) (concat ((_ extract 63 32) .cse177) ((_ extract 31 0) .cse177)))))) (concat ((_ extract 63 32) .cse176) ((_ extract 31 0) .cse176)))))) .cse79 .cse165) .cse45) (or .cse21 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse179 (let ((.cse181 (bvadd ((_ sign_extend 32) v_arrayElimCell_46) .cse60))) (concat ((_ extract 63 32) .cse181) ((_ extract 31 0) .cse181))))) (or (= (let ((.cse178 (bvadd ((_ sign_extend 32) v_arrayElimCell_47) .cse179))) (concat ((_ extract 63 32) .cse178) ((_ extract 31 0) .cse178))) .cse13) (= .cse13 (let ((.cse180 (bvadd .cse25 .cse179))) (concat ((_ extract 63 32) .cse180) ((_ extract 31 0) .cse180)))))))) (or .cse54 (forall ((v_arrayElimCell_47 (_ BitVec 32)) (v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse186 ((_ sign_extend 32) v_arrayElimCell_47)) (.cse184 ((_ sign_extend 32) v_arrayElimCell_46))) (or (= .cse13 (let ((.cse182 (bvadd .cse25 (let ((.cse183 (bvadd .cse184 .cse60))) (concat ((_ extract 63 32) .cse183) ((_ extract 31 0) .cse183)))))) (concat ((_ extract 63 32) .cse182) ((_ extract 31 0) .cse182)))) (= .cse13 (let ((.cse185 (bvadd .cse186 .cse51))) (concat ((_ extract 63 32) .cse185) ((_ extract 31 0) .cse185)))) (= (let ((.cse187 (bvadd .cse186 (let ((.cse188 (bvadd .cse72 .cse184))) (concat ((_ extract 63 32) .cse188) ((_ extract 31 0) .cse188)))))) (concat ((_ extract 63 32) .cse187) ((_ extract 31 0) .cse187))) .cse13))))) (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse196 ((_ sign_extend 32) v_arrayElimCell_46))) (let ((.cse190 (let ((.cse197 (bvadd .cse196 .cse60))) (concat ((_ extract 63 32) .cse197) ((_ extract 31 0) .cse197))))) (or (= .cse13 (let ((.cse189 (bvadd .cse25 .cse190))) (concat ((_ extract 63 32) .cse189) ((_ extract 31 0) .cse189)))) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse192 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse191 (bvadd .cse192 .cse190))) (concat ((_ extract 63 32) .cse191) ((_ extract 31 0) .cse191))) .cse13) (= .cse13 (let ((.cse193 (bvadd .cse192 .cse51))) (concat ((_ extract 63 32) .cse193) ((_ extract 31 0) .cse193)))) (= (let ((.cse194 (bvadd .cse192 (let ((.cse195 (bvadd .cse72 .cse196))) (concat ((_ extract 63 32) .cse195) ((_ extract 31 0) .cse195)))))) (concat ((_ extract 63 32) .cse194) ((_ extract 31 0) .cse194))) .cse13)))))))) (forall ((v_arrayElimCell_46 (_ BitVec 32))) (let ((.cse203 ((_ sign_extend 32) v_arrayElimCell_46))) (let ((.cse200 (let ((.cse205 (bvadd .cse203 .cse60))) (concat ((_ extract 63 32) .cse205) ((_ extract 31 0) .cse205))))) (or (forall ((v_arrayElimCell_47 (_ BitVec 32))) (let ((.cse199 ((_ sign_extend 32) v_arrayElimCell_47))) (or (= (let ((.cse198 (bvadd .cse199 .cse200))) (concat ((_ extract 63 32) .cse198) ((_ extract 31 0) .cse198))) .cse13) (= (let ((.cse201 (bvadd .cse199 (let ((.cse202 (bvadd .cse72 .cse203))) (concat ((_ extract 63 32) .cse202) ((_ extract 31 0) .cse202)))))) (concat ((_ extract 63 32) .cse201) ((_ extract 31 0) .cse201))) .cse13)))) (= .cse13 (let ((.cse204 (bvadd .cse25 .cse200))) (concat ((_ extract 63 32) .cse204) ((_ extract 31 0) .cse204)))))))) (or .cse54 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (= (let ((.cse206 (bvadd .cse28 (let ((.cse207 (bvadd .cse72 ((_ sign_extend 32) v_arrayElimCell_46)))) (concat ((_ extract 63 32) .cse207) ((_ extract 31 0) .cse207)))))) (concat ((_ extract 63 32) .cse206) ((_ extract 31 0) .cse206))) .cse13)))))) .cse46) .cse64 .cse65) .cse49))) .cse38)))))))) .cse17) (or (= (let ((.cse332 (let ((.cse334 (store (store .cse10 .cse336 (_ bv4 32)) .cse11 (_ bv4 32)))) (bvadd (let ((.cse333 (bvadd ((_ sign_extend 32) (select .cse334 .cse9)) (let ((.cse335 (bvadd .cse8 ((_ sign_extend 32) (select .cse334 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (concat ((_ extract 63 32) .cse335) ((_ extract 31 0) .cse335)))))) (concat ((_ extract 63 32) .cse333) ((_ extract 31 0) .cse333))) ((_ sign_extend 32) (select .cse334 .cse5)))))) (concat ((_ extract 63 32) .cse332) ((_ extract 31 0) .cse332))) .cse13) .cse15 (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (not (= (_ bv1 32) .cse337)) .cse18) (bvslt (_ bv2 32) c_~N~0) (or .cse14 .cse15 .cse16 (= .cse13 (let ((.cse338 (let ((.cse341 (store (store (store .cse10 .cse336 (bvadd (_ bv3 32) .cse337)) .cse11 (_ bv4 32)) .cse12 (_ bv4 32)))) (bvadd (let ((.cse339 (bvadd (let ((.cse340 (bvadd .cse8 ((_ sign_extend 32) (select .cse341 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (concat ((_ extract 63 32) .cse340) ((_ extract 31 0) .cse340))) ((_ sign_extend 32) (select .cse341 .cse9))))) (concat ((_ extract 63 32) .cse339) ((_ extract 31 0) .cse339))) ((_ sign_extend 32) (select .cse341 .cse5)))))) (concat ((_ extract 63 32) .cse338) ((_ extract 31 0) .cse338)))) (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|)) .cse17) (= .cse342 ((_ extract 31 0) .cse0))))))))) is different from true [2023-12-21 21:05:20,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 21:05:24,967 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:05:37,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 21:05:49,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 21:05:52,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 21:06:16,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 21:06:17,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 21:06:24,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 21:06:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:06:24,351 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2023-12-21 21:06:24,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-12-21 21:06:24,429 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-21 21:06:24,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:06:24,431 INFO L225 Difference]: With dead ends: 81 [2023-12-21 21:06:24,431 INFO L226 Difference]: Without dead ends: 65 [2023-12-21 21:06:24,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 266.0s TimeCoverageRelationStatistics Valid=689, Invalid=3867, Unknown=16, NotChecked=540, Total=5112 [2023-12-21 21:06:24,432 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 44 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 46 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 66.5s IncrementalHoareTripleChecker+Time [2023-12-21 21:06:24,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 65 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 885 Invalid, 7 Unknown, 305 Unchecked, 66.5s Time] [2023-12-21 21:06:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-21 21:06:24,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2023-12-21 21:06:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 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:06:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2023-12-21 21:06:24,458 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 27 [2023-12-21 21:06:24,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:06:24,459 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2023-12-21 21:06:24,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 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:06:24,459 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2023-12-21 21:06:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-21 21:06:24,459 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:06:24,459 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:06:24,468 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 (11)] Forceful destruction successful, exit code 0 [2023-12-21 21:06:24,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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:06:24,660 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:06:24,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:06:24,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1552455706, now seen corresponding path program 2 times [2023-12-21 21:06:24,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:06:24,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199696427] [2023-12-21 21:06:24,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 21:06:24,661 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:06:24,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:06:24,662 INFO L229 MonitoredProcess]: Starting monitored process 12 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:06:24,663 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 (12)] Waiting until timeout for monitored process [2023-12-21 21:06:24,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 21:06:24,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:06:24,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 21:06:24,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:06:24,846 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 13 treesize of output 9 [2023-12-21 21:06:25,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-21 21:06:25,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-21 21:06:25,293 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 21:06:25,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:06:25,643 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 16 treesize of output 14 [2023-12-21 21:06:25,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-12-21 21:06:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 21:06:25,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:06:25,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199696427] [2023-12-21 21:06:25,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199696427] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:06:25,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:06:25,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-12-21 21:06:25,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368478381] [2023-12-21 21:06:25,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:06:25,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 21:06:25,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:06:25,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 21:06:25,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-12-21 21:06:25,914 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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:06:26,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:06:26,947 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2023-12-21 21:06:26,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 21:06:26,948 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-21 21:06:26,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:06:26,948 INFO L225 Difference]: With dead ends: 73 [2023-12-21 21:06:26,948 INFO L226 Difference]: Without dead ends: 48 [2023-12-21 21:06:26,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-12-21 21:06:26,949 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-21 21:06:26,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 71 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-21 21:06:26,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-21 21:06:26,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2023-12-21 21:06:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 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:06:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2023-12-21 21:06:26,972 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 27 [2023-12-21 21:06:26,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:06:26,973 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2023-12-21 21:06:26,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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:06:26,973 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2023-12-21 21:06:26,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 21:06:26,973 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:06:26,973 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:06:26,977 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 (12)] Ended with exit code 0 [2023-12-21 21:06:27,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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:06:27,177 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:06:27,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:06:27,178 INFO L85 PathProgramCache]: Analyzing trace with hash 646168010, now seen corresponding path program 7 times [2023-12-21 21:06:27,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:06:27,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547783714] [2023-12-21 21:06:27,178 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-21 21:06:27,178 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:06:27,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:06:27,179 INFO L229 MonitoredProcess]: Starting monitored process 13 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:06:27,192 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 (13)] Waiting until timeout for monitored process [2023-12-21 21:06:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:06:27,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-21 21:06:27,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:06:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 21:06:28,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:06:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 21:06:29,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:06:29,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547783714] [2023-12-21 21:06:29,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547783714] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:06:29,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:06:29,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2023-12-21 21:06:29,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234700943] [2023-12-21 21:06:29,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:06:29,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-21 21:06:29,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:06:29,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-21 21:06:29,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2023-12-21 21:06:29,531 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:06:31,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:06:31,506 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2023-12-21 21:06:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 21:06:31,507 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-21 21:06:31,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:06:31,508 INFO L225 Difference]: With dead ends: 62 [2023-12-21 21:06:31,508 INFO L226 Difference]: Without dead ends: 37 [2023-12-21 21:06:31,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2023-12-21 21:06:31,509 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 99 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-21 21:06:31,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 31 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-21 21:06:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-21 21:06:31,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2023-12-21 21:06:31,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:06:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-12-21 21:06:31,524 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 28 [2023-12-21 21:06:31,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:06:31,524 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-12-21 21:06:31,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:06:31,524 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-12-21 21:06:31,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-21 21:06:31,525 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:06:31,525 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:06:31,530 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 (13)] Forceful destruction successful, exit code 0 [2023-12-21 21:06:31,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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:06:31,729 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:06:31,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:06:31,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1447364028, now seen corresponding path program 8 times [2023-12-21 21:06:31,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:06:31,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888521799] [2023-12-21 21:06:31,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 21:06:31,729 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:06:31,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:06:31,730 INFO L229 MonitoredProcess]: Starting monitored process 14 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:06:31,731 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 (14)] Waiting until timeout for monitored process [2023-12-21 21:06:31,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 21:06:31,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:06:31,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-21 21:06:31,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:06:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:06:33,478 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:06:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:06:35,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:06:35,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888521799] [2023-12-21 21:06:35,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888521799] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:06:35,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:06:35,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2023-12-21 21:06:35,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941305430] [2023-12-21 21:06:35,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:06:35,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-21 21:06:35,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:06:35,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-21 21:06:35,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=794, Unknown=0, NotChecked=0, Total=1056 [2023-12-21 21:06:35,562 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:06:37,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:06:37,685 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2023-12-21 21:06:37,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 21:06:37,686 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-21 21:06:37,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:06:37,686 INFO L225 Difference]: With dead ends: 76 [2023-12-21 21:06:37,686 INFO L226 Difference]: Without dead ends: 64 [2023-12-21 21:06:37,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=322, Invalid=1010, Unknown=0, NotChecked=0, Total=1332 [2023-12-21 21:06:37,687 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 165 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-21 21:06:37,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 33 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-21 21:06:37,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-21 21:06:37,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2023-12-21 21:06:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:06:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2023-12-21 21:06:37,715 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 31 [2023-12-21 21:06:37,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:06:37,715 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2023-12-21 21:06:37,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:06:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2023-12-21 21:06:37,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-21 21:06:37,716 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:06:37,716 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:06:37,720 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 (14)] Forceful destruction successful, exit code 0 [2023-12-21 21:06:37,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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:06:37,919 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:06:37,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:06:37,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1895765090, now seen corresponding path program 9 times [2023-12-21 21:06:37,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:06:37,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672004469] [2023-12-21 21:06:37,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 21:06:37,920 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:06:37,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:06:37,921 INFO L229 MonitoredProcess]: Starting monitored process 15 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:06:37,922 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 (15)] Waiting until timeout for monitored process [2023-12-21 21:06:38,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-21 21:06:38,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:06:38,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-21 21:06:38,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:06:38,223 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 21:06:38,224 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:06:39,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-21 21:06:40,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:06:40,101 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 26 treesize of output 21 [2023-12-21 21:06:40,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:06:40,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2023-12-21 21:06:41,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:06:41,692 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 40 treesize of output 41 [2023-12-21 21:06:42,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:06:42,434 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 67 treesize of output 37 [2023-12-21 21:06:42,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:06:42,759 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 81 treesize of output 51 [2023-12-21 21:06:43,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:06:43,095 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 109 treesize of output 79 [2023-12-21 21:06:43,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:06:43,429 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 165 treesize of output 135 [2023-12-21 21:06:43,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:06:43,705 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 275 treesize of output 245 [2023-12-21 21:06:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:06:43,847 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:07:17,221 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 1478 treesize of output 1410 [2023-12-21 21:07:18,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:07:18,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 24164429 treesize of output 23804126 Received shutdown request... [2023-12-21 21:14:53,906 WARN L340 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 (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 21:14:53,907 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 21:14:53,986 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 21:14:53,993 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 (15)] Forceful destruction successful, exit code 0 [2023-12-21 21:14:54,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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:14:54,187 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 33 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-8-2-3-3-3-3-2-1 context. [2023-12-21 21:14:54,191 INFO L445 BasicCegarLoop]: Path program histogram: [9, 2, 1, 1, 1] [2023-12-21 21:14:54,192 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 21:14:54,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 09:14:54 BoogieIcfgContainer [2023-12-21 21:14:54,194 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 21:14:54,194 INFO L158 Benchmark]: Toolchain (without parser) took 882091.24ms. Allocated memory was 184.5MB in the beginning and 316.7MB in the end (delta: 132.1MB). Free memory was 126.8MB in the beginning and 146.2MB in the end (delta: -19.4MB). Peak memory consumption was 171.7MB. Max. memory is 8.0GB. [2023-12-21 21:14:54,194 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 184.5MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 21:14:54,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.73ms. Allocated memory is still 184.5MB. Free memory was 126.5MB in the beginning and 114.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 21:14:54,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.67ms. Allocated memory is still 184.5MB. Free memory was 114.3MB in the beginning and 112.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 21:14:54,195 INFO L158 Benchmark]: Boogie Preprocessor took 42.55ms. Allocated memory is still 184.5MB. Free memory was 112.5MB in the beginning and 110.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 21:14:54,195 INFO L158 Benchmark]: RCFGBuilder took 306.14ms. Allocated memory was 184.5MB in the beginning and 263.2MB in the end (delta: 78.6MB). Free memory was 110.1MB in the beginning and 229.9MB in the end (delta: -119.8MB). Peak memory consumption was 18.5MB. Max. memory is 8.0GB. [2023-12-21 21:14:54,195 INFO L158 Benchmark]: TraceAbstraction took 881495.72ms. Allocated memory was 263.2MB in the beginning and 316.7MB in the end (delta: 53.5MB). Free memory was 228.9MB in the beginning and 146.2MB in the end (delta: 82.7MB). Peak memory consumption was 194.1MB. Max. memory is 8.0GB. [2023-12-21 21:14:54,196 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.63ms. Allocated memory is still 184.5MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 206.73ms. Allocated memory is still 184.5MB. Free memory was 126.5MB in the beginning and 114.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.67ms. Allocated memory is still 184.5MB. Free memory was 114.3MB in the beginning and 112.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.55ms. Allocated memory is still 184.5MB. Free memory was 112.5MB in the beginning and 110.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 306.14ms. Allocated memory was 184.5MB in the beginning and 263.2MB in the end (delta: 78.6MB). Free memory was 110.1MB in the beginning and 229.9MB in the end (delta: -119.8MB). Peak memory consumption was 18.5MB. Max. memory is 8.0GB. * TraceAbstraction took 881495.72ms. Allocated memory was 263.2MB in the beginning and 316.7MB in the end (delta: 53.5MB). Free memory was 228.9MB in the beginning and 146.2MB in the end (delta: 82.7MB). Peak memory consumption was 194.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 15). Cancelled while NwaCegarLoop was analyzing trace of length 33 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-8-2-3-3-3-3-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 881.4s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 242.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 679 SdHoareTripleChecker+Valid, 77.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 679 mSDsluCounter, 490 SdHoareTripleChecker+Invalid, 74.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 305 IncrementalHoareTripleChecker+Unchecked, 389 mSDsCounter, 278 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3178 IncrementalHoareTripleChecker+Invalid, 3769 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 278 mSolverCounterUnsat, 101 mSDtfsCounter, 3178 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 572 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 292 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2985 ImplicationChecksByTransitivity, 280.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=13, InterpolantAutomatonStates: 208, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 55 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 139.2s InterpolantComputationTime, 274 NumberOfCodeBlocks, 274 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 500 ConstructedInterpolants, 3 QuantifiedInterpolants, 59678 SizeOfPredicates, 88 NumberOfNonLiveVariables, 1119 ConjunctsInSsa, 213 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 99/332 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown