/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-e2ee32c-m [2023-09-07 07:08:51,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-07 07:08:51,549 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2023-09-07 07:08:51,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-07 07:08:51,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-07 07:08:51,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-07 07:08:51,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-07 07:08:51,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-07 07:08:51,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-07 07:08:51,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-07 07:08:51,594 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-07 07:08:51,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-07 07:08:51,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-07 07:08:51,595 INFO L153 SettingsManager]: * Use SBE=true [2023-09-07 07:08:51,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-07 07:08:51,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-07 07:08:51,596 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-07 07:08:51,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-07 07:08:51,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-07 07:08:51,596 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-07 07:08:51,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-07 07:08:51,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-07 07:08:51,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-07 07:08:51,597 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-07 07:08:51,597 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-07 07:08:51,598 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-07 07:08:51,598 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-07 07:08:51,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-07 07:08:51,599 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-07 07:08:51,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-07 07:08:51,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-07 07:08:51,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-07 07:08:51,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-07 07:08:51,600 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2023-09-07 07:08:51,600 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-07 07:08:51,600 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-07 07:08:51,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-07 07:08:51,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-07 07:08:51,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-07 07:08:51,601 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-07 07:08:51,601 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2023-09-07 07:08:51,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2023-09-07 07:08:51,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-07 07:08:51,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-07 07:08:51,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-07 07:08:51,855 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-07 07:08:51,855 INFO L274 PluginConnector]: CDTParser initialized [2023-09-07 07:08:51,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2023-09-07 07:08:52,963 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-07 07:08:53,155 INFO L384 CDTParser]: Found 1 translation units. [2023-09-07 07:08:53,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2023-09-07 07:08:53,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df3978f5c/a733c4a1da084c6f833e70459b0374b5/FLAG576684eed [2023-09-07 07:08:53,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df3978f5c/a733c4a1da084c6f833e70459b0374b5 [2023-09-07 07:08:53,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-07 07:08:53,181 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-07 07:08:53,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-07 07:08:53,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-07 07:08:53,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-07 07:08:53,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:08:53" (1/1) ... [2023-09-07 07:08:53,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4354adf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:53, skipping insertion in model container [2023-09-07 07:08:53,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:08:53" (1/1) ... [2023-09-07 07:08:53,217 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-07 07:08:53,371 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2023-09-07 07:08:53,379 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-07 07:08:53,387 INFO L202 MainTranslator]: Completed pre-run [2023-09-07 07:08:53,414 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2023-09-07 07:08:53,417 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-07 07:08:53,427 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-07 07:08:53,427 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-07 07:08:53,434 INFO L206 MainTranslator]: Completed translation [2023-09-07 07:08:53,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:53 WrapperNode [2023-09-07 07:08:53,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-07 07:08:53,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-07 07:08:53,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-07 07:08:53,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-07 07:08:53,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:53" (1/1) ... [2023-09-07 07:08:53,449 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:53" (1/1) ... [2023-09-07 07:08:53,469 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 106 [2023-09-07 07:08:53,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-07 07:08:53,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-07 07:08:53,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-07 07:08:53,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-07 07:08:53,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:53" (1/1) ... [2023-09-07 07:08:53,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:53" (1/1) ... [2023-09-07 07:08:53,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:53" (1/1) ... [2023-09-07 07:08:53,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:53" (1/1) ... [2023-09-07 07:08:53,500 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:53" (1/1) ... [2023-09-07 07:08:53,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:53" (1/1) ... [2023-09-07 07:08:53,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:53" (1/1) ... [2023-09-07 07:08:53,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:53" (1/1) ... [2023-09-07 07:08:53,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-07 07:08:53,521 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-07 07:08:53,521 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-07 07:08:53,521 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-07 07:08:53,522 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:53" (1/1) ... [2023-09-07 07:08:53,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-07 07:08:53,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 07:08:53,562 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-07 07:08:53,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-07 07:08:53,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-07 07:08:53,600 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-07 07:08:53,600 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-07 07:08:53,600 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-07 07:08:53,600 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-07 07:08:53,601 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-07 07:08:53,601 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-07 07:08:53,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-07 07:08:53,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-07 07:08:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-07 07:08:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-07 07:08:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-07 07:08:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-07 07:08:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-07 07:08:53,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-07 07:08:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-07 07:08:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-07 07:08:53,605 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-07 07:08:53,720 INFO L236 CfgBuilder]: Building ICFG [2023-09-07 07:08:53,722 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-07 07:08:53,973 INFO L277 CfgBuilder]: Performing block encoding [2023-09-07 07:08:54,023 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-07 07:08:54,023 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-09-07 07:08:54,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:08:54 BoogieIcfgContainer [2023-09-07 07:08:54,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-07 07:08:54,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-07 07:08:54,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-07 07:08:54,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-07 07:08:54,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:08:53" (1/3) ... [2023-09-07 07:08:54,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56984109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:08:54, skipping insertion in model container [2023-09-07 07:08:54,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:53" (2/3) ... [2023-09-07 07:08:54,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56984109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:08:54, skipping insertion in model container [2023-09-07 07:08:54,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:08:54" (3/3) ... [2023-09-07 07:08:54,034 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2023-09-07 07:08:54,040 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-07 07:08:54,048 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-07 07:08:54,048 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-07 07:08:54,048 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-07 07:08:54,108 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-09-07 07:08:54,148 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 07:08:54,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-07 07:08:54,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 07:08:54,151 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-07 07:08:54,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-09-07 07:08:54,188 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-07 07:08:54,204 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-09-07 07:08:54,209 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@21b0ab59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 07:08:54,209 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2023-09-07 07:08:54,654 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 07:08:54,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 07:08:54,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1366094475, now seen corresponding path program 1 times [2023-09-07 07:08:54,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 07:08:54,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266164702] [2023-09-07 07:08:54,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:08:54,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 07:08:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:08:54,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 07:08:54,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 07:08:54,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266164702] [2023-09-07 07:08:54,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266164702] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 07:08:54,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 07:08:54,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-07 07:08:54,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447896030] [2023-09-07 07:08:54,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 07:08:54,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-07 07:08:54,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 07:08:54,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-07 07:08:54,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-07 07:08:54,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:08:54,955 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 07:08:54,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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-09-07 07:08:54,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-07 07:08:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:08:55,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-07 07:08:55,205 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 07:08:55,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 07:08:55,206 INFO L85 PathProgramCache]: Analyzing trace with hash -158364597, now seen corresponding path program 1 times [2023-09-07 07:08:55,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 07:08:55,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596999326] [2023-09-07 07:08:55,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:08:55,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 07:08:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:08:55,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 07:08:55,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 07:08:55,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596999326] [2023-09-07 07:08:55,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596999326] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 07:08:55,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770022617] [2023-09-07 07:08:55,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:08:55,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:08:55,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 07:08:55,671 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 07:08:55,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-07 07:08:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:08:55,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-07 07:08:55,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 07:08:56,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 07:08:56,014 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 07:08:56,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 07:08:56,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770022617] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-07 07:08:56,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-07 07:08:56,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-09-07 07:08:56,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981006215] [2023-09-07 07:08:56,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 07:08:56,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-07 07:08:56,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 07:08:56,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-07 07:08:56,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-09-07 07:08:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:08:56,214 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 07:08:56,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 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-09-07 07:08:56,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:08:56,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-07 07:08:56,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:08:56,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-07 07:08:56,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-09-07 07:08:56,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-09-07 07:08:56,549 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 07:08:56,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 07:08:56,549 INFO L85 PathProgramCache]: Analyzing trace with hash -569930784, now seen corresponding path program 1 times [2023-09-07 07:08:56,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 07:08:56,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989457304] [2023-09-07 07:08:56,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:08:56,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 07:08:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:08:56,876 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-07 07:08:56,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 07:08:56,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989457304] [2023-09-07 07:08:56,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989457304] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 07:08:56,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805846962] [2023-09-07 07:08:56,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:08:56,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:08:56,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 07:08:56,879 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 07:08:56,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-07 07:08:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:08:56,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 10 conjunts are in the unsatisfiable core [2023-09-07 07:08:56,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 07:08:57,218 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 07:08:57,218 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 07:08:57,482 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 07:08:57,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805846962] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 07:08:57,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 07:08:57,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2023-09-07 07:08:57,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430717512] [2023-09-07 07:08:57,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 07:08:57,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-09-07 07:08:57,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 07:08:57,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-09-07 07:08:57,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2023-09-07 07:08:57,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:08:57,491 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 07:08:57,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.88) internal successors, (222), 25 states have internal predecessors, (222), 0 states have call successors, (0), 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-09-07 07:08:57,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:08:57,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-07 07:08:57,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-07 07:08:58,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:08:58,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-07 07:08:58,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-09-07 07:08:58,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-07 07:08:59,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:08:59,024 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 07:08:59,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 07:08:59,024 INFO L85 PathProgramCache]: Analyzing trace with hash 791159270, now seen corresponding path program 1 times [2023-09-07 07:08:59,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 07:08:59,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398423515] [2023-09-07 07:08:59,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:08:59,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 07:08:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:08:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-09-07 07:08:59,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 07:08:59,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398423515] [2023-09-07 07:08:59,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398423515] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 07:08:59,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094687369] [2023-09-07 07:08:59,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:08:59,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:08:59,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 07:08:59,381 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 07:08:59,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-07 07:08:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:08:59,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 14 conjunts are in the unsatisfiable core [2023-09-07 07:08:59,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 07:08:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-07 07:08:59,809 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 07:09:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-07 07:09:00,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094687369] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 07:09:00,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 07:09:00,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 36 [2023-09-07 07:09:00,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191392582] [2023-09-07 07:09:00,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 07:09:00,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-09-07 07:09:00,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 07:09:00,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-09-07 07:09:00,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2023-09-07 07:09:00,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:09:00,201 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 07:09:00,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.25) internal successors, (261), 36 states have internal predecessors, (261), 0 states have call successors, (0), 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-09-07 07:09:00,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:09:00,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-07 07:09:00,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-09-07 07:09:00,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-07 07:09:02,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:09:02,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-07 07:09:02,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-09-07 07:09:02,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-09-07 07:09:02,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-07 07:09:03,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:09:03,017 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 07:09:03,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 07:09:03,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1385195742, now seen corresponding path program 2 times [2023-09-07 07:09:03,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 07:09:03,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143525048] [2023-09-07 07:09:03,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:09:03,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 07:09:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:09:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 49 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-09-07 07:09:03,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 07:09:03,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143525048] [2023-09-07 07:09:03,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143525048] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 07:09:03,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228854861] [2023-09-07 07:09:03,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-07 07:09:03,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:09:03,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 07:09:03,491 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 07:09:03,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-07 07:09:03,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-09-07 07:09:03,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 07:09:03,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-07 07:09:03,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 07:09:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-09-07 07:09:03,880 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-07 07:09:03,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228854861] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 07:09:03,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-07 07:09:03,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2023-09-07 07:09:03,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986564207] [2023-09-07 07:09:03,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 07:09:03,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-07 07:09:03,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 07:09:03,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-07 07:09:03,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2023-09-07 07:09:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:09:03,886 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 07:09:03,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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-09-07 07:09:03,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:09:03,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-07 07:09:03,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-09-07 07:09:03,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2023-09-07 07:09:03,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-07 07:09:04,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:09:04,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-07 07:09:04,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-09-07 07:09:04,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-09-07 07:09:04,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-07 07:09:04,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-09-07 07:09:04,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:09:04,839 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 07:09:04,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 07:09:04,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1514751982, now seen corresponding path program 1 times [2023-09-07 07:09:04,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 07:09:04,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565165078] [2023-09-07 07:09:04,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:09:04,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 07:09:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:09:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 58 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-09-07 07:09:05,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 07:09:05,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565165078] [2023-09-07 07:09:05,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565165078] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 07:09:05,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669956043] [2023-09-07 07:09:05,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:09:05,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:09:05,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 07:09:05,321 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 07:09:05,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-07 07:09:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:09:05,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 18 conjunts are in the unsatisfiable core [2023-09-07 07:09:05,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 07:09:05,884 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 27 proven. 43 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-09-07 07:09:05,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 07:09:06,332 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 52 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-09-07 07:09:06,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669956043] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 07:09:06,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 07:09:06,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 44 [2023-09-07 07:09:06,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20793566] [2023-09-07 07:09:06,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 07:09:06,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-09-07 07:09:06,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 07:09:06,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-09-07 07:09:06,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1575, Unknown=0, NotChecked=0, Total=1892 [2023-09-07 07:09:06,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:09:06,341 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 07:09:06,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 5.636363636363637) internal successors, (248), 44 states have internal predecessors, (248), 0 states have call successors, (0), 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-09-07 07:09:06,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:09:06,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-07 07:09:06,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-09-07 07:09:06,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2023-09-07 07:09:06,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-07 07:09:06,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-07 07:09:07,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:09:07,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-07 07:09:07,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-09-07 07:09:07,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-09-07 07:09:07,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-07 07:09:07,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-09-07 07:09:07,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-09-07 07:09:07,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:09:07,879 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 07:09:07,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 07:09:07,880 INFO L85 PathProgramCache]: Analyzing trace with hash 314392109, now seen corresponding path program 2 times [2023-09-07 07:09:07,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 07:09:07,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585266710] [2023-09-07 07:09:07,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:09:07,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 07:09:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:09:08,437 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 12 proven. 73 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-09-07 07:09:08,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 07:09:08,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585266710] [2023-09-07 07:09:08,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585266710] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 07:09:08,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486459565] [2023-09-07 07:09:08,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-07 07:09:08,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:09:08,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 07:09:08,439 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 07:09:08,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-09-07 07:09:08,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-07 07:09:08,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 07:09:08,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 20 conjunts are in the unsatisfiable core [2023-09-07 07:09:08,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 07:09:09,123 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 58 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-09-07 07:09:09,123 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 07:09:09,676 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 77 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-09-07 07:09:09,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486459565] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 07:09:09,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 07:09:09,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 48 [2023-09-07 07:09:09,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514791002] [2023-09-07 07:09:09,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 07:09:09,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-09-07 07:09:09,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 07:09:09,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-09-07 07:09:09,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2023-09-07 07:09:09,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:09:09,680 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 07:09:09,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 5.25) internal successors, (252), 48 states have internal predecessors, (252), 0 states have call successors, (0), 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-09-07 07:09:09,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:09:09,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-07 07:09:09,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-09-07 07:09:09,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2023-09-07 07:09:09,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-07 07:09:09,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-09-07 07:09:09,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-07 07:09:13,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:09:13,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-07 07:09:13,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-09-07 07:09:13,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-09-07 07:09:13,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-07 07:09:13,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-09-07 07:09:13,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-09-07 07:09:13,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-09-07 07:09:13,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:09:13,289 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 07:09:13,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 07:09:13,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1471454452, now seen corresponding path program 3 times [2023-09-07 07:09:13,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 07:09:13,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195850286] [2023-09-07 07:09:13,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:09:13,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 07:09:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:09:13,800 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 30 proven. 89 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-09-07 07:09:13,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 07:09:13,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195850286] [2023-09-07 07:09:13,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195850286] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 07:09:13,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717363384] [2023-09-07 07:09:13,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-07 07:09:13,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:09:13,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 07:09:13,802 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 07:09:13,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-09-07 07:09:14,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-09-07 07:09:14,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 07:09:14,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 88 conjunts are in the unsatisfiable core [2023-09-07 07:09:14,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 07:09:15,388 INFO L351 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-09-07 07:09:15,927 INFO L351 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 6 treesize of output 5 [2023-09-07 07:09:16,046 INFO L351 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 6 treesize of output 5 [2023-09-07 07:09:16,142 INFO L351 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 6 treesize of output 5 [2023-09-07 07:09:35,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-07 07:09:35,551 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 07:09:35,551 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1089 treesize of output 481 [2023-09-07 07:09:56,881 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 33 proven. 53 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-09-07 07:09:56,882 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 07:11:10,622 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse211 (* c_~N~0 4))) (let ((.cse98 (= c_~max1~0 c_~max2~0)) (.cse23 (+ c_~max3~0 1)) (.cse46 (= c_~max1~0 c_~max3~0)) (.cse15 (+ c_~max2~0 1)) (.cse2 (+ c_~max1~0 1)) (.cse5 (+ c_~A~0.offset .cse211 (- 4))) (.cse7 (+ c_~A~0.offset 4)) (.cse6 (+ c_~A~0.offset .cse211 (- 8)))) (and (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse3 (select .cse4 .cse7)) (.cse1 (select .cse4 c_~A~0.offset)) (.cse0 (select .cse4 .cse6))) (or (< c_~max3~0 (+ .cse0 1)) (< .cse1 .cse2) (< .cse0 (+ .cse3 1)) (< .cse3 (+ .cse1 1)) (< .cse0 (select .cse4 .cse5)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse7)) (.cse8 (select .cse11 .cse5)) (.cse9 (select .cse11 .cse6))) (or (< c_~max3~0 .cse8) (< .cse9 (+ .cse10 1)) (= .cse8 c_~max3~0) (< .cse10 .cse2) (< .cse8 (+ .cse9 1)) (< c_~max1~0 (select .cse11 c_~A~0.offset)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse7)) (.cse14 (select .cse13 c_~A~0.offset))) (or (< c_~max1~0 .cse12) (< .cse12 c_~max3~0) (= c_~max1~0 .cse12) (< c_~max3~0 (select .cse13 .cse5)) (< .cse12 (+ .cse14 1)) (< .cse12 (select .cse13 .cse6)) (< .cse14 .cse15))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse7)) (.cse16 (select .cse18 .cse6))) (or (< c_~max3~0 (+ .cse16 1)) (< .cse16 (+ .cse17 1)) (< .cse17 .cse2) (< .cse16 (select .cse18 .cse5)) (< c_~max1~0 (select .cse18 c_~A~0.offset)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse19 (select .cse20 c_~A~0.offset))) (or (< .cse19 (select .cse20 .cse5)) (< .cse19 .cse2) (< c_~max3~0 (+ .cse19 1)) (< .cse19 (select .cse20 .cse6)) (< .cse19 (select .cse20 .cse7)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse24 (select .cse25 c_~A~0.offset)) (.cse21 (select .cse25 .cse7)) (.cse22 (select .cse25 .cse5))) (or (< c_~max1~0 .cse21) (< .cse22 .cse23) (= c_~max1~0 .cse21) (< .cse21 (+ .cse24 1)) (< .cse21 (select .cse25 .cse6)) (< .cse24 .cse15) (< .cse21 .cse22))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse29 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse28 (select .cse29 .cse5)) (.cse26 (select .cse29 .cse6)) (.cse27 (select .cse29 c_~A~0.offset))) (or (< .cse26 (+ .cse27 1)) (< .cse28 .cse23) (< c_~max1~0 .cse28) (= c_~max1~0 .cse28) (< .cse27 .cse15) (< .cse28 (+ .cse26 1)) (< .cse27 (select .cse29 .cse7)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse32 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse30 (select .cse32 .cse5)) (.cse31 (select .cse32 .cse7))) (or (< .cse30 (+ .cse31 1)) (< c_~max2~0 .cse30) (< .cse31 .cse2) (= .cse30 c_~max2~0) (< .cse31 (select .cse32 .cse6)) (< c_~max1~0 (select .cse32 c_~A~0.offset)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse33 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse34 (select .cse33 .cse6))) (or (< c_~max1~0 (select .cse33 .cse7)) (< .cse34 .cse2) (< .cse34 (select .cse33 .cse5)) (< c_~max2~0 .cse34) (= .cse34 c_~max2~0) (< c_~max1~0 (select .cse33 c_~A~0.offset)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse38 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse35 (select .cse38 .cse7)) (.cse37 (select .cse38 .cse5)) (.cse36 (select .cse38 .cse6))) (or (< .cse35 .cse15) (= .cse36 c_~max1~0) (< .cse37 .cse23) (< .cse36 (+ .cse35 1)) (< .cse36 .cse37) (< c_~max1~0 .cse36) (< c_~max2~0 (select .cse38 c_~A~0.offset)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse41 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse39 (select .cse41 .cse7)) (.cse40 (select .cse41 .cse6))) (or (< .cse39 .cse15) (= .cse40 c_~max1~0) (< c_~max3~0 (select .cse41 .cse5)) (< .cse40 (+ .cse39 1)) (< .cse40 c_~max3~0) (< c_~max1~0 .cse40) (< c_~max2~0 (select .cse41 c_~A~0.offset)))))) (or (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse45 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse43 (select .cse45 .cse5)) (.cse42 (select .cse45 .cse7)) (.cse44 (select .cse45 c_~A~0.offset))) (or (< c_~max1~0 .cse42) (< c_~max1~0 .cse43) (< c_~max3~0 (+ .cse42 1)) (< c_~max3~0 .cse43) (< .cse42 (+ .cse44 1)) (< .cse42 (select .cse45 .cse6)) (< .cse44 .cse15))))) .cse46) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse48 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse47 (select .cse48 .cse7))) (or (= .cse47 c_~max2~0) (< .cse47 .cse2) (< .cse47 (select .cse48 .cse6)) (< .cse47 (select .cse48 .cse5)) (< c_~max1~0 (select .cse48 c_~A~0.offset)) (< c_~max2~0 .cse47))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse50 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse49 (select .cse50 .cse7))) (or (< .cse49 .cse15) (< c_~max1~0 .cse49) (< .cse49 c_~max3~0) (= c_~max1~0 .cse49) (< c_~max3~0 (select .cse50 .cse5)) (< .cse49 (select .cse50 .cse6)) (< c_~max2~0 (select .cse50 c_~A~0.offset)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse52 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse51 (select .cse52 .cse6))) (or (= .cse51 c_~max1~0) (< c_~max3~0 (select .cse52 .cse5)) (< .cse51 c_~max3~0) (< c_~max1~0 .cse51) (< .cse51 .cse15) (< c_~max2~0 (select .cse52 c_~A~0.offset)) (< c_~max2~0 (select .cse52 .cse7)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse54 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse53 (select .cse54 .cse6))) (or (< c_~max3~0 (+ .cse53 1)) (< c_~max1~0 (select .cse54 .cse7)) (< .cse53 .cse2) (< .cse53 (select .cse54 .cse5)) (< c_~max1~0 (select .cse54 c_~A~0.offset)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse59 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse57 (select .cse59 .cse7)) (.cse58 (select .cse59 c_~A~0.offset)) (.cse55 (select .cse59 .cse5)) (.cse56 (select .cse59 .cse6))) (or (< .cse55 .cse23) (< c_~max1~0 .cse55) (< .cse56 (+ .cse57 1)) (= c_~max1~0 .cse55) (< .cse57 (+ .cse58 1)) (< .cse58 .cse15) (< .cse55 (+ .cse56 1)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse64 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse62 (select .cse64 .cse7)) (.cse60 (select .cse64 c_~A~0.offset)) (.cse63 (select .cse64 .cse5)) (.cse61 (select .cse64 .cse6))) (or (< .cse60 .cse2) (< .cse61 (+ .cse62 1)) (< .cse62 (+ .cse60 1)) (< c_~max2~0 .cse63) (= .cse63 c_~max2~0) (< .cse63 (+ .cse61 1)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse67 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse66 (select .cse67 c_~A~0.offset)) (.cse65 (select .cse67 .cse7))) (or (= .cse65 c_~max2~0) (< .cse66 .cse2) (< .cse65 (+ .cse66 1)) (< .cse65 (select .cse67 .cse6)) (< .cse65 (select .cse67 .cse5)) (< c_~max2~0 .cse65))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse70 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse69 (select .cse70 c_~A~0.offset)) (.cse68 (select .cse70 .cse7))) (or (< c_~max3~0 (+ .cse68 1)) (< .cse69 .cse2) (< .cse68 (+ .cse69 1)) (< .cse68 (select .cse70 .cse6)) (< .cse68 (select .cse70 .cse5)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse73 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse71 (select .cse73 .cse7)) (.cse72 (select .cse73 .cse5))) (or (< .cse71 .cse15) (< c_~max1~0 .cse71) (< .cse72 .cse23) (= c_~max1~0 .cse71) (< .cse71 (select .cse73 .cse6)) (< .cse71 .cse72) (< c_~max2~0 (select .cse73 c_~A~0.offset)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse78 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse77 (select .cse78 .cse7)) (.cse74 (select .cse78 c_~A~0.offset)) (.cse75 (select .cse78 .cse5)) (.cse76 (select .cse78 .cse6))) (or (< .cse74 .cse2) (< c_~max3~0 .cse75) (< .cse76 (+ .cse77 1)) (= .cse75 c_~max3~0) (< .cse77 (+ .cse74 1)) (< .cse75 (+ .cse76 1)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse81 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse80 (select .cse81 .cse5)) (.cse79 (select .cse81 .cse6))) (or (= .cse79 c_~max1~0) (< .cse80 .cse23) (< .cse79 .cse80) (< c_~max1~0 .cse79) (< .cse79 .cse15) (< c_~max2~0 (select .cse81 c_~A~0.offset)) (< c_~max2~0 (select .cse81 .cse7)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse85 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse82 (select .cse85 .cse5)) (.cse84 (select .cse85 c_~A~0.offset)) (.cse83 (select .cse85 .cse7))) (or (< .cse82 (+ .cse83 1)) (< .cse84 .cse2) (< c_~max3~0 .cse82) (= .cse82 c_~max3~0) (< .cse83 (+ .cse84 1)) (< .cse83 (select .cse85 .cse6)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse89 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse88 (select .cse89 .cse7)) (.cse86 (select .cse89 c_~A~0.offset)) (.cse87 (select .cse89 .cse6))) (or (< .cse86 .cse2) (< .cse87 (+ .cse88 1)) (< .cse88 (+ .cse86 1)) (< .cse87 (select .cse89 .cse5)) (< c_~max2~0 .cse87) (= .cse87 c_~max2~0))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse93 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse91 (select .cse93 .cse7)) (.cse92 (select .cse93 .cse5)) (.cse90 (select .cse93 .cse6))) (or (< .cse90 (+ .cse91 1)) (< c_~max2~0 .cse92) (< .cse91 .cse2) (= .cse92 c_~max2~0) (< .cse92 (+ .cse90 1)) (< c_~max1~0 (select .cse93 c_~A~0.offset)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse97 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse96 (select .cse97 .cse5)) (.cse94 (select .cse97 .cse6)) (.cse95 (select .cse97 c_~A~0.offset))) (or (< .cse94 (+ .cse95 1)) (< .cse95 .cse2) (< c_~max2~0 .cse96) (= .cse96 c_~max2~0) (< .cse96 (+ .cse94 1)) (< .cse95 (select .cse97 .cse7)))))) (or .cse98 (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse103 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse100 (select .cse103 .cse5)) (.cse101 (select .cse103 .cse6)) (.cse102 (select .cse103 c_~A~0.offset)) (.cse99 (select .cse103 .cse7))) (or (< c_~max1~0 .cse99) (< .cse100 .cse23) (< c_~max1~0 .cse100) (< c_~max2~0 .cse100) (< c_~max2~0 .cse101) (< c_~max1~0 .cse102) (< c_~max1~0 .cse101) (< c_~max2~0 .cse102) (< c_~max2~0 .cse99)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse104 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse106 (select .cse104 .cse5)) (.cse105 (select .cse104 .cse6))) (or (< c_~max1~0 (select .cse104 .cse7)) (< .cse105 .cse2) (< c_~max3~0 .cse106) (= .cse106 c_~max3~0) (< .cse106 (+ .cse105 1)) (< c_~max1~0 (select .cse104 c_~A~0.offset)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse108 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse109 (select .cse108 .cse7)) (.cse110 (select .cse108 c_~A~0.offset)) (.cse107 (select .cse108 .cse6))) (or (= .cse107 c_~max1~0) (< c_~max3~0 (select .cse108 .cse5)) (< .cse107 (+ .cse109 1)) (< .cse109 (+ .cse110 1)) (< .cse107 c_~max3~0) (< .cse110 .cse15) (< c_~max1~0 .cse107))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse113 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse111 (select .cse113 .cse6)) (.cse112 (select .cse113 c_~A~0.offset))) (or (< .cse111 (+ .cse112 1)) (= .cse111 c_~max1~0) (< c_~max3~0 (select .cse113 .cse5)) (< .cse111 c_~max3~0) (< .cse112 .cse15) (< c_~max1~0 .cse111) (< .cse112 (select .cse113 .cse7)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse117 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse116 (select .cse117 .cse5)) (.cse114 (select .cse117 .cse6)) (.cse115 (select .cse117 c_~A~0.offset))) (or (< .cse114 (+ .cse115 1)) (= .cse114 c_~max1~0) (< .cse116 .cse23) (< .cse114 .cse116) (< .cse115 .cse15) (< c_~max1~0 .cse114) (< .cse115 (select .cse117 .cse7)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse118 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse119 (select .cse118 c_~A~0.offset))) (or (< c_~max3~0 (select .cse118 .cse5)) (< .cse119 (select .cse118 .cse6)) (< .cse119 c_~max3~0) (< .cse119 .cse15) (< c_~max1~0 .cse119) (= c_~max1~0 .cse119) (< .cse119 (select .cse118 .cse7)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse122 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse121 (select .cse122 .cse5)) (.cse120 (select .cse122 c_~A~0.offset))) (or (< .cse120 .cse2) (< c_~max3~0 .cse121) (< .cse121 (+ .cse120 1)) (= .cse121 c_~max3~0) (< .cse120 (select .cse122 .cse6)) (< .cse120 (select .cse122 .cse7)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse125 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse124 (select .cse125 .cse5)) (.cse123 (select .cse125 c_~A~0.offset))) (or (< .cse123 .cse124) (< .cse124 .cse23) (< .cse123 (select .cse125 .cse6)) (< .cse123 .cse15) (< c_~max1~0 .cse123) (= c_~max1~0 .cse123) (< .cse123 (select .cse125 .cse7)))))) (or .cse46 (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse128 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse126 (select .cse128 .cse5)) (.cse127 (select .cse128 c_~A~0.offset))) (or (< c_~max1~0 .cse126) (< c_~max3~0 .cse126) (< c_~max3~0 (+ .cse127 1)) (< .cse127 (select .cse128 .cse6)) (< .cse127 .cse15) (< c_~max1~0 .cse127) (< .cse127 (select .cse128 .cse7))))))) (or .cse46 (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse133 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse130 (select .cse133 .cse5)) (.cse131 (select .cse133 .cse7)) (.cse132 (select .cse133 c_~A~0.offset)) (.cse129 (select .cse133 .cse6))) (or (< c_~max3~0 (+ .cse129 1)) (< c_~max1~0 .cse130) (< c_~max3~0 .cse130) (< .cse129 (+ .cse131 1)) (< .cse131 (+ .cse132 1)) (< .cse132 .cse15) (< c_~max1~0 .cse129)))))) (or (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse138 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse135 (select .cse138 .cse5)) (.cse136 (select .cse138 .cse6)) (.cse137 (select .cse138 c_~A~0.offset)) (.cse134 (select .cse138 .cse7))) (or (< c_~max1~0 .cse134) (< c_~max1~0 .cse135) (< c_~max3~0 .cse135) (< c_~max2~0 .cse136) (< c_~max1~0 .cse137) (< c_~max1~0 .cse136) (< c_~max2~0 .cse137) (< c_~max2~0 .cse134))))) (and (or .cse98 (< c_~max2~0 c_~max3~0)) (or .cse46 (< c_~max3~0 .cse15)))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse140 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse139 (select .cse140 .cse5))) (or (< .cse139 .cse23) (< c_~max1~0 .cse139) (= c_~max1~0 .cse139) (< c_~max2~0 (select .cse140 .cse6)) (< .cse139 .cse15) (< c_~max2~0 (select .cse140 c_~A~0.offset)) (< c_~max2~0 (select .cse140 .cse7)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse143 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse141 (select .cse143 .cse5)) (.cse142 (select .cse143 .cse7))) (or (< .cse141 (+ .cse142 1)) (< c_~max3~0 .cse141) (= .cse141 c_~max3~0) (< .cse142 .cse2) (< .cse142 (select .cse143 .cse6)) (< c_~max1~0 (select .cse143 c_~A~0.offset)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse146 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse144 (select .cse146 .cse5)) (.cse145 (select .cse146 .cse6))) (or (< .cse144 .cse23) (< c_~max1~0 .cse144) (= c_~max1~0 .cse144) (< .cse144 (+ .cse145 1)) (< .cse145 .cse15) (< c_~max2~0 (select .cse146 c_~A~0.offset)) (< c_~max2~0 (select .cse146 .cse7)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse149 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse147 (select .cse149 .cse5)) (.cse148 (select .cse149 c_~A~0.offset))) (or (< .cse147 .cse23) (< c_~max1~0 .cse147) (< .cse147 (+ .cse148 1)) (< .cse148 (select .cse149 .cse6)) (= c_~max1~0 .cse147) (< .cse148 .cse15) (< .cse148 (select .cse149 .cse7)))))) (or .cse46 (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse153 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse152 (select .cse153 .cse5)) (.cse151 (select .cse153 .cse7)) (.cse150 (select .cse153 .cse6))) (or (< c_~max3~0 (+ .cse150 1)) (< .cse151 .cse15) (< c_~max1~0 .cse152) (< c_~max3~0 .cse152) (< .cse150 (+ .cse151 1)) (< c_~max1~0 .cse150) (< c_~max2~0 (select .cse153 c_~A~0.offset))))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse156 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse154 (select .cse156 .cse6)) (.cse155 (select .cse156 c_~A~0.offset))) (or (< c_~max3~0 (+ .cse154 1)) (< .cse154 (+ .cse155 1)) (< .cse155 .cse2) (< .cse154 (select .cse156 .cse5)) (< .cse155 (select .cse156 .cse7)))))) (or .cse46 (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse159 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse158 (select .cse159 .cse5)) (.cse157 (select .cse159 .cse7))) (or (< .cse157 .cse15) (< c_~max1~0 .cse157) (< c_~max1~0 .cse158) (< c_~max3~0 (+ .cse157 1)) (< c_~max3~0 .cse158) (< .cse157 (select .cse159 .cse6)) (< c_~max2~0 (select .cse159 c_~A~0.offset))))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse164 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse162 (select .cse164 .cse7)) (.cse161 (select .cse164 .cse5)) (.cse163 (select .cse164 c_~A~0.offset)) (.cse160 (select .cse164 .cse6))) (or (= .cse160 c_~max1~0) (< .cse161 .cse23) (< .cse160 (+ .cse162 1)) (< .cse162 (+ .cse163 1)) (< .cse160 .cse161) (< .cse163 .cse15) (< c_~max1~0 .cse160))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse168 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse165 (select .cse168 .cse5)) (.cse166 (select .cse168 .cse7)) (.cse167 (select .cse168 c_~A~0.offset))) (or (< .cse165 (+ .cse166 1)) (< .cse165 .cse23) (< c_~max1~0 .cse165) (= c_~max1~0 .cse165) (< .cse166 (+ .cse167 1)) (< .cse166 (select .cse168 .cse6)) (< .cse167 .cse15))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse169 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse170 (select .cse169 .cse5))) (or (< c_~max1~0 (select .cse169 .cse7)) (< .cse170 .cse2) (< c_~max3~0 .cse170) (= .cse170 c_~max3~0) (< c_~max1~0 (select .cse169 c_~A~0.offset)) (< c_~max1~0 (select .cse169 .cse6)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse174 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse173 (select .cse174 c_~A~0.offset)) (.cse171 (select .cse174 .cse5)) (.cse172 (select .cse174 .cse7))) (or (< .cse171 (+ .cse172 1)) (< .cse173 .cse2) (< .cse172 (+ .cse173 1)) (< c_~max2~0 .cse171) (= .cse171 c_~max2~0) (< .cse172 (select .cse174 .cse6)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse175 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse176 (select .cse175 .cse5))) (or (< c_~max1~0 (select .cse175 .cse7)) (< .cse176 .cse2) (< c_~max2~0 .cse176) (= .cse176 c_~max2~0) (< c_~max1~0 (select .cse175 c_~A~0.offset)) (< c_~max1~0 (select .cse175 .cse6)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse179 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse178 (select .cse179 .cse5)) (.cse177 (select .cse179 .cse7))) (or (< .cse177 .cse15) (< .cse178 (+ .cse177 1)) (< .cse178 .cse23) (< c_~max1~0 .cse178) (= c_~max1~0 .cse178) (< .cse177 (select .cse179 .cse6)) (< c_~max2~0 (select .cse179 c_~A~0.offset)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse181 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse180 (select .cse181 c_~A~0.offset))) (or (< .cse180 (select .cse181 .cse5)) (= .cse180 c_~max2~0) (< .cse180 .cse2) (< .cse180 (select .cse181 .cse6)) (< .cse180 (select .cse181 .cse7)) (< c_~max2~0 .cse180))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse184 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse183 (select .cse184 .cse5)) (.cse182 (select .cse184 c_~A~0.offset))) (or (< .cse182 .cse2) (< .cse183 (+ .cse182 1)) (< .cse182 (select .cse184 .cse6)) (< c_~max2~0 .cse183) (= .cse183 c_~max2~0) (< .cse182 (select .cse184 .cse7)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse188 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse187 (select .cse188 .cse5)) (.cse185 (select .cse188 .cse6)) (.cse186 (select .cse188 c_~A~0.offset))) (or (< .cse185 (+ .cse186 1)) (< .cse186 .cse2) (< c_~max3~0 .cse187) (= .cse187 c_~max3~0) (< .cse187 (+ .cse185 1)) (< .cse186 (select .cse188 .cse7)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse192 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse189 (select .cse192 .cse7)) (.cse190 (select .cse192 .cse5)) (.cse191 (select .cse192 .cse6))) (or (< .cse189 .cse15) (< .cse190 .cse23) (< c_~max1~0 .cse190) (< .cse191 (+ .cse189 1)) (= c_~max1~0 .cse190) (< .cse190 (+ .cse191 1)) (< c_~max2~0 (select .cse192 c_~A~0.offset)))))) (or .cse46 (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse196 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse195 (select .cse196 .cse5)) (.cse193 (select .cse196 .cse6)) (.cse194 (select .cse196 c_~A~0.offset))) (or (< c_~max3~0 (+ .cse193 1)) (< .cse193 (+ .cse194 1)) (< c_~max1~0 .cse195) (< c_~max3~0 .cse195) (< .cse194 .cse15) (< c_~max1~0 .cse193) (< .cse194 (select .cse196 .cse7))))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse197 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse199 (select .cse197 .cse5)) (.cse198 (select .cse197 .cse6))) (or (< c_~max1~0 (select .cse197 .cse7)) (< .cse198 .cse2) (< c_~max2~0 .cse199) (= .cse199 c_~max2~0) (< .cse199 (+ .cse198 1)) (< c_~max1~0 (select .cse197 c_~A~0.offset)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse201 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse200 (select .cse201 .cse7))) (or (< c_~max3~0 (+ .cse200 1)) (< .cse200 .cse2) (< .cse200 (select .cse201 .cse6)) (< .cse200 (select .cse201 .cse5)) (< c_~max1~0 (select .cse201 c_~A~0.offset)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse204 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse203 (select .cse204 .cse7)) (.cse202 (select .cse204 .cse6))) (or (< .cse202 (+ .cse203 1)) (< .cse203 .cse2) (< .cse202 (select .cse204 .cse5)) (< c_~max2~0 .cse202) (= .cse202 c_~max2~0) (< c_~max1~0 (select .cse204 c_~A~0.offset)))))) (or .cse46 (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse207 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse206 (select .cse207 .cse5)) (.cse205 (select .cse207 .cse6))) (or (< c_~max3~0 (+ .cse205 1)) (< c_~max1~0 .cse206) (< c_~max3~0 .cse206) (< c_~max1~0 .cse205) (< .cse205 .cse15) (< c_~max2~0 (select .cse207 c_~A~0.offset)) (< c_~max2~0 (select .cse207 .cse7))))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse210 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) c_~A~0.base))) (let ((.cse208 (select .cse210 .cse6)) (.cse209 (select .cse210 c_~A~0.offset))) (or (< .cse208 (+ .cse209 1)) (< .cse209 .cse2) (< .cse208 (select .cse210 .cse5)) (< c_~max2~0 .cse208) (= .cse208 c_~max2~0) (< .cse209 (select .cse210 .cse7))))))))) is different from false [2023-09-07 07:12:22,271 WARN L234 SmtUtils]: Spent 1.01m on a formula simplification that was a NOOP. DAG size: 219 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 07:13:16,789 WARN L234 SmtUtils]: Spent 28.27s on a formula simplification that was a NOOP. DAG size: 219 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 07:13:21,471 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse211 (* c_~N~0 4))) (let ((.cse140 (= c_~max1~0 c_~max2~0)) (.cse0 (= c_~max1~0 c_~max3~0)) (.cse10 (+ c_~max1~0 1)) (.cse16 (+ c_~max3~0 1)) (.cse8 (+ .cse211 (- 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse4 (+ .cse211 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| (- 8))) (.cse6 (+ c_~max2~0 1)) (.cse7 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (and (or .cse0 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse1 (select .cse3 .cse8)) (.cse5 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse2 (select .cse3 .cse7))) (or (< c_~max3~0 .cse1) (< .cse2 (select .cse3 .cse4)) (< c_~max1~0 .cse2) (< c_~max1~0 .cse1) (< .cse2 (+ .cse5 1)) (< .cse5 .cse6) (< c_~max3~0 (+ .cse2 1))))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse9 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse12 (select .cse14 .cse7)) (.cse11 (select .cse14 .cse8)) (.cse13 (select .cse14 .cse4))) (or (< .cse9 .cse10) (= .cse11 c_~max2~0) (< .cse12 (+ .cse9 1)) (< .cse13 (+ .cse12 1)) (< c_~max2~0 .cse11) (< .cse11 (+ .cse13 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse17 (select .cse20 .cse7)) (.cse18 (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse15 (select .cse20 .cse8)) (.cse19 (select .cse20 .cse4))) (or (< .cse15 .cse16) (= .cse15 c_~max1~0) (< c_~max1~0 .cse15) (< .cse17 (+ .cse18 1)) (< .cse19 (+ .cse17 1)) (< .cse18 .cse6) (< .cse15 (+ .cse19 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse21 (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse21 (select .cse22 .cse4)) (< .cse21 .cse10) (= .cse21 c_~max2~0) (< c_~max2~0 .cse21) (< .cse21 (select .cse22 .cse8)) (< .cse21 (select .cse22 .cse7)))))) (or .cse0 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse25 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse23 (select .cse25 .cse8)) (.cse24 (select .cse25 .cse4)) (.cse26 (select .cse25 .cse7))) (or (< c_~max3~0 .cse23) (< c_~max1~0 .cse24) (< c_~max1~0 .cse23) (< c_~max2~0 (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse24 (+ .cse26 1)) (< c_~max3~0 (+ .cse24 1)) (< .cse26 .cse6)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse28 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse30 (select .cse28 .cse7)) (.cse27 (select .cse28 .cse4))) (or (< .cse27 (select .cse28 .cse8)) (< .cse29 .cse10) (< .cse30 (+ .cse29 1)) (< .cse27 (+ .cse30 1)) (< c_~max3~0 (+ .cse27 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse33 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse31 (select .cse33 .cse8)) (.cse32 (select .cse33 .cse4))) (or (< .cse31 .cse16) (< .cse32 .cse6) (< c_~max1~0 .cse32) (< .cse32 .cse31) (< c_~max2~0 (select .cse33 .cse7)) (< c_~max2~0 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (= .cse32 c_~max1~0))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse37 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse36 (select .cse37 .cse8)) (.cse34 (select .cse37 .cse4)) (.cse35 (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse34 (+ .cse35 1)) (< .cse35 .cse10) (= .cse36 c_~max2~0) (< c_~max2~0 .cse36) (< .cse36 (+ .cse34 1)) (< .cse35 (select .cse37 .cse7)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse40 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse38 (select .cse40 .cse8)) (.cse39 (select .cse40 .cse4)) (.cse41 (select .cse40 .cse7))) (or (< .cse38 .cse16) (< c_~max1~0 .cse39) (< .cse39 .cse38) (< c_~max2~0 (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse39 (+ .cse41 1)) (= .cse39 c_~max1~0) (< .cse41 .cse6))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse46 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse43 (select .cse46 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse44 (select .cse46 .cse7)) (.cse42 (select .cse46 .cse8)) (.cse45 (select .cse46 .cse4))) (or (< c_~max3~0 .cse42) (= .cse42 c_~max3~0) (< .cse43 .cse10) (< .cse44 (+ .cse43 1)) (< .cse45 (+ .cse44 1)) (< .cse42 (+ .cse45 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse49 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse47 (select .cse49 .cse8)) (.cse48 (select .cse49 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse47 .cse16) (< .cse48 (select .cse49 .cse4)) (< .cse47 (+ .cse48 1)) (= .cse47 c_~max1~0) (< c_~max1~0 .cse47) (< .cse48 .cse6) (< .cse48 (select .cse49 .cse7)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse50 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse51 (select .cse50 .cse4))) (or (< c_~max1~0 (select .cse50 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse51 (select .cse50 .cse8)) (< .cse51 .cse10) (< c_~max1~0 (select .cse50 .cse7)) (< c_~max3~0 (+ .cse51 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse54 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse53 (select .cse54 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse52 (select .cse54 .cse4))) (or (< .cse52 (+ .cse53 1)) (< .cse52 (select .cse54 .cse8)) (< .cse53 .cse10) (< .cse53 (select .cse54 .cse7)) (< c_~max3~0 (+ .cse52 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse55 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse56 (select .cse55 .cse7)) (.cse57 (select .cse55 .cse8)) (.cse58 (select .cse55 .cse4))) (or (< c_~max1~0 (select .cse55 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse56 .cse10) (= .cse57 c_~max2~0) (< .cse58 (+ .cse56 1)) (< c_~max2~0 .cse57) (< .cse57 (+ .cse58 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse59 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse60 (select .cse59 .cse4)) (.cse61 (select .cse59 .cse7))) (or (< c_~max3~0 (select .cse59 .cse8)) (< c_~max1~0 .cse60) (< c_~max2~0 (select .cse59 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse60 (+ .cse61 1)) (< .cse60 c_~max3~0) (= .cse60 c_~max1~0) (< .cse61 .cse6))))) (or .cse0 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse65 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse62 (select .cse65 .cse8)) (.cse64 (select .cse65 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse63 (select .cse65 .cse4))) (or (< c_~max3~0 .cse62) (< .cse63 (+ .cse64 1)) (< c_~max1~0 .cse63) (< c_~max1~0 .cse62) (< .cse64 .cse6) (< .cse64 (select .cse65 .cse7)) (< c_~max3~0 (+ .cse63 1))))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse69 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse66 (select .cse69 .cse8)) (.cse68 (select .cse69 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse67 (select .cse69 .cse4))) (or (< .cse66 .cse16) (< .cse67 (+ .cse68 1)) (< c_~max1~0 .cse67) (< .cse67 .cse66) (< .cse68 .cse6) (< .cse68 (select .cse69 .cse7)) (= .cse67 c_~max1~0))))) (or (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse72 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse70 (select .cse72 .cse8)) (.cse71 (select .cse72 .cse4))) (or (< c_~max3~0 .cse70) (< .cse71 .cse6) (< c_~max1~0 .cse71) (< c_~max2~0 (select .cse72 .cse7)) (< c_~max1~0 .cse70) (< c_~max2~0 (select .cse72 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< c_~max3~0 (+ .cse71 1)))))) .cse0) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse74 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse75 (select .cse74 .cse7)) (.cse73 (select .cse74 .cse8)) (.cse76 (select .cse74 .cse4))) (or (< c_~max3~0 .cse73) (= .cse73 c_~max3~0) (< c_~max1~0 (select .cse74 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse75 .cse10) (< .cse76 (+ .cse75 1)) (< .cse73 (+ .cse76 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse79 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse78 (select .cse79 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse77 (select .cse79 .cse4))) (or (< .cse77 (+ .cse78 1)) (< .cse77 (select .cse79 .cse8)) (< .cse78 .cse10) (< c_~max2~0 .cse77) (< .cse78 (select .cse79 .cse7)) (= .cse77 c_~max2~0))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse81 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse80 (select .cse81 .cse7)) (.cse82 (select .cse81 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse83 (select .cse81 .cse8))) (or (< .cse80 (select .cse81 .cse4)) (< .cse82 .cse10) (= .cse83 c_~max2~0) (< .cse83 (+ .cse80 1)) (< .cse80 (+ .cse82 1)) (< c_~max2~0 .cse83))))) (or (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse88 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse84 (select .cse88 .cse8)) (.cse86 (select .cse88 .cse7)) (.cse87 (select .cse88 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse85 (select .cse88 .cse4))) (or (< c_~max3~0 .cse84) (< c_~max1~0 .cse85) (< c_~max1~0 .cse84) (< .cse86 (+ .cse87 1)) (< .cse85 (+ .cse86 1)) (< .cse87 .cse6) (< c_~max3~0 (+ .cse85 1)))))) .cse0) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse90 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse91 (select .cse90 .cse8)) (.cse89 (select .cse90 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse89 (select .cse90 .cse4)) (< .cse91 (+ .cse89 1)) (< .cse89 .cse10) (= .cse91 c_~max2~0) (< c_~max2~0 .cse91) (< .cse89 (select .cse90 .cse7)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse92 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse93 (select .cse92 .cse7)) (.cse94 (select .cse92 .cse4))) (or (< c_~max1~0 (select .cse92 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse93 .cse10) (< .cse94 (select .cse92 .cse8)) (< .cse94 (+ .cse93 1)) (< c_~max3~0 (+ .cse94 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse95 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse96 (select .cse95 .cse4))) (or (< c_~max3~0 (select .cse95 .cse8)) (< .cse96 .cse6) (< c_~max1~0 .cse96) (< c_~max2~0 (select .cse95 .cse7)) (< c_~max2~0 (select .cse95 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse96 c_~max3~0) (= .cse96 c_~max1~0))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse99 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse97 (select .cse99 .cse8)) (.cse98 (select .cse99 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max3~0 .cse97) (< .cse98 (select .cse99 .cse4)) (= .cse97 c_~max3~0) (< .cse97 (+ .cse98 1)) (< .cse98 .cse10) (< .cse98 (select .cse99 .cse7)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse101 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse100 (select .cse101 .cse8)) (.cse102 (select .cse101 .cse4))) (or (< c_~max3~0 .cse100) (= .cse100 c_~max3~0) (< c_~max1~0 (select .cse101 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse102 .cse10) (< c_~max1~0 (select .cse101 .cse7)) (< .cse100 (+ .cse102 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse104 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse105 (select .cse104 .cse8)) (.cse103 (select .cse104 .cse7)) (.cse106 (select .cse104 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse103 (select .cse104 .cse4)) (< .cse105 .cse16) (< c_~max1~0 .cse103) (< .cse103 .cse105) (= c_~max1~0 .cse103) (< .cse103 (+ .cse106 1)) (< .cse106 .cse6))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse110 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse107 (select .cse110 .cse8)) (.cse108 (select .cse110 .cse4)) (.cse109 (select .cse110 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max3~0 .cse107) (< .cse108 (+ .cse109 1)) (= .cse107 c_~max3~0) (< .cse109 .cse10) (< .cse107 (+ .cse108 1)) (< .cse109 (select .cse110 .cse7)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse112 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse113 (select .cse112 .cse8)) (.cse111 (select .cse112 .cse7))) (or (< .cse111 (select .cse112 .cse4)) (< .cse113 .cse16) (< .cse113 (+ .cse111 1)) (= .cse113 c_~max1~0) (< c_~max1~0 .cse113) (< c_~max2~0 (select .cse112 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse111 .cse6))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse117 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse114 (select .cse117 .cse8)) (.cse115 (select .cse117 .cse4)) (.cse116 (select .cse117 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse114 .cse16) (< .cse115 (+ .cse116 1)) (= .cse114 c_~max1~0) (< c_~max1~0 .cse114) (< .cse116 .cse6) (< .cse114 (+ .cse115 1)) (< .cse116 (select .cse117 .cse7)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse118 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse119 (select .cse118 .cse7)) (.cse120 (select .cse118 .cse4))) (or (< c_~max1~0 (select .cse118 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse119 .cse10) (< .cse120 (select .cse118 .cse8)) (< c_~max2~0 .cse120) (< .cse120 (+ .cse119 1)) (= .cse120 c_~max2~0))))) (or .cse0 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse123 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse121 (select .cse123 .cse8)) (.cse122 (select .cse123 .cse7))) (or (< c_~max3~0 .cse121) (< .cse122 (select .cse123 .cse4)) (< c_~max1~0 .cse122) (< c_~max1~0 .cse121) (< c_~max2~0 (select .cse123 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse122 .cse6) (< c_~max3~0 (+ .cse122 1))))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse125 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse126 (select .cse125 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse127 (select .cse125 .cse7)) (.cse124 (select .cse125 .cse4))) (or (< .cse124 (select .cse125 .cse8)) (< .cse126 .cse10) (< c_~max2~0 .cse124) (< .cse127 (+ .cse126 1)) (< .cse124 (+ .cse127 1)) (= .cse124 c_~max2~0))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse129 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse130 (select .cse129 .cse8)) (.cse128 (select .cse129 .cse7)) (.cse131 (select .cse129 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse128 (select .cse129 .cse4)) (< .cse130 .cse16) (< .cse130 (+ .cse128 1)) (= .cse130 c_~max1~0) (< c_~max1~0 .cse130) (< .cse128 (+ .cse131 1)) (< .cse131 .cse6))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse132 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse133 (select .cse132 .cse7))) (or (< c_~max3~0 (select .cse132 .cse8)) (< .cse133 (select .cse132 .cse4)) (< .cse133 c_~max3~0) (< c_~max1~0 .cse133) (= c_~max1~0 .cse133) (< c_~max2~0 (select .cse132 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse133 .cse6))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse135 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse136 (select .cse135 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse134 (select .cse135 .cse7))) (or (< .cse134 (select .cse135 .cse4)) (< .cse136 .cse10) (< .cse134 (select .cse135 .cse8)) (< .cse134 (+ .cse136 1)) (< c_~max3~0 (+ .cse134 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse137 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse138 (select .cse137 .cse7)) (.cse139 (select .cse137 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max3~0 (select .cse137 .cse8)) (< .cse138 (select .cse137 .cse4)) (< .cse138 c_~max3~0) (< c_~max1~0 .cse138) (= c_~max1~0 .cse138) (< .cse138 (+ .cse139 1)) (< .cse139 .cse6))))) (or .cse140 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse145 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse142 (select .cse145 .cse4)) (.cse144 (select .cse145 .cse7)) (.cse143 (select .cse145 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse141 (select .cse145 .cse8))) (or (< .cse141 .cse16) (< c_~max1~0 .cse142) (< c_~max1~0 .cse143) (< c_~max2~0 .cse142) (< c_~max1~0 .cse144) (< c_~max2~0 .cse144) (< c_~max1~0 .cse141) (< c_~max2~0 .cse143) (< c_~max2~0 .cse141)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse147 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse146 (select .cse147 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse146 (select .cse147 .cse4)) (< .cse146 .cse10) (< c_~max3~0 (+ .cse146 1)) (< .cse146 (select .cse147 .cse8)) (< .cse146 (select .cse147 .cse7)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse152 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse148 (select .cse152 .cse8)) (.cse150 (select .cse152 .cse7)) (.cse151 (select .cse152 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse149 (select .cse152 .cse4))) (or (< .cse148 .cse16) (< c_~max1~0 .cse149) (< .cse149 .cse148) (< .cse150 (+ .cse151 1)) (< .cse149 (+ .cse150 1)) (< .cse151 .cse6) (= .cse149 c_~max1~0))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse154 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse155 (select .cse154 .cse8)) (.cse153 (select .cse154 .cse7))) (or (< .cse153 (select .cse154 .cse4)) (< .cse155 .cse16) (< c_~max1~0 .cse153) (< .cse153 .cse155) (= c_~max1~0 .cse153) (< c_~max2~0 (select .cse154 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse153 .cse6))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse158 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse156 (select .cse158 .cse8)) (.cse157 (select .cse158 .cse4))) (or (< .cse156 .cse16) (< .cse157 .cse6) (< c_~max2~0 (select .cse158 .cse7)) (= .cse156 c_~max1~0) (< c_~max1~0 .cse156) (< c_~max2~0 (select .cse158 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse156 (+ .cse157 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse161 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse159 (select .cse161 .cse8)) (.cse160 (select .cse161 .cse7)) (.cse162 (select .cse161 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max3~0 .cse159) (< .cse160 (select .cse161 .cse4)) (= .cse159 c_~max3~0) (< .cse162 .cse10) (< .cse159 (+ .cse160 1)) (< .cse160 (+ .cse162 1)))))) (or .cse0 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse165 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse163 (select .cse165 .cse8)) (.cse164 (select .cse165 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max3~0 .cse163) (< .cse164 (select .cse165 .cse4)) (< c_~max1~0 .cse164) (< c_~max3~0 (+ .cse164 1)) (< c_~max1~0 .cse163) (< .cse164 .cse6) (< .cse164 (select .cse165 .cse7))))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse167 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse166 (select .cse167 .cse7))) (or (< .cse166 (select .cse167 .cse4)) (< c_~max1~0 (select .cse167 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse166 .cse10) (< c_~max2~0 .cse166) (< .cse166 (select .cse167 .cse8)) (= .cse166 c_~max2~0))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse168 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse170 (select .cse168 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse169 (select .cse168 .cse4))) (or (< c_~max3~0 (select .cse168 .cse8)) (< .cse169 (+ .cse170 1)) (< c_~max1~0 .cse169) (< .cse169 c_~max3~0) (< .cse170 .cse6) (< .cse170 (select .cse168 .cse7)) (= .cse169 c_~max1~0))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse171 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse172 (select .cse171 .cse4))) (or (< c_~max1~0 (select .cse171 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse172 (select .cse171 .cse8)) (< c_~max2~0 .cse172) (< .cse172 .cse10) (< c_~max1~0 (select .cse171 .cse7)) (= .cse172 c_~max2~0))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse174 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse173 (select .cse174 .cse7)) (.cse175 (select .cse174 .cse8))) (or (< .cse173 (select .cse174 .cse4)) (< c_~max1~0 (select .cse174 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse173 .cse10) (= .cse175 c_~max2~0) (< .cse175 (+ .cse173 1)) (< c_~max2~0 .cse175))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse178 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse176 (select .cse178 .cse8)) (.cse177 (select .cse178 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse176 .cse16) (< .cse177 (select .cse178 .cse4)) (< c_~max1~0 .cse177) (< .cse177 .cse176) (= c_~max1~0 .cse177) (< .cse177 .cse6) (< .cse177 (select .cse178 .cse7)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse180 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse179 (select .cse180 .cse8))) (or (< c_~max3~0 .cse179) (< c_~max1~0 (select .cse180 .cse4)) (= .cse179 c_~max3~0) (< c_~max1~0 (select .cse180 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< c_~max1~0 (select .cse180 .cse7)) (< .cse179 .cse10))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse182 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse181 (select .cse182 .cse8)) (.cse183 (select .cse182 .cse4)) (.cse184 (select .cse182 .cse7))) (or (< .cse181 .cse16) (= .cse181 c_~max1~0) (< c_~max1~0 .cse181) (< c_~max2~0 (select .cse182 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse183 (+ .cse184 1)) (< .cse181 (+ .cse183 1)) (< .cse184 .cse6))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse185 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse187 (select .cse185 .cse7)) (.cse188 (select .cse185 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse186 (select .cse185 .cse4))) (or (< c_~max3~0 (select .cse185 .cse8)) (< c_~max1~0 .cse186) (< .cse187 (+ .cse188 1)) (< .cse186 (+ .cse187 1)) (< .cse186 c_~max3~0) (< .cse188 .cse6) (= .cse186 c_~max1~0))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse191 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse189 (select .cse191 .cse8)) (.cse190 (select .cse191 .cse7))) (or (< c_~max3~0 .cse189) (< .cse190 (select .cse191 .cse4)) (= .cse189 c_~max3~0) (< c_~max1~0 (select .cse191 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse190 .cse10) (< .cse189 (+ .cse190 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse193 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse192 (select .cse193 .cse7))) (or (< .cse192 (select .cse193 .cse4)) (< c_~max1~0 (select .cse193 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse192 .cse10) (< .cse192 (select .cse193 .cse8)) (< c_~max3~0 (+ .cse192 1)))))) (or (and (or .cse140 (< c_~max2~0 c_~max3~0)) (or .cse0 (< c_~max3~0 .cse6))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse198 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse195 (select .cse198 .cse4)) (.cse197 (select .cse198 .cse7)) (.cse194 (select .cse198 .cse8)) (.cse196 (select .cse198 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max3~0 .cse194) (< c_~max1~0 .cse195) (< c_~max1~0 .cse196) (< c_~max2~0 .cse195) (< c_~max1~0 .cse197) (< c_~max2~0 .cse197) (< c_~max1~0 .cse194) (< c_~max2~0 .cse196)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse200 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse199 (select .cse200 .cse7)) (.cse201 (select .cse200 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse199 (select .cse200 .cse4)) (< .cse201 .cse10) (< c_~max2~0 .cse199) (< .cse199 (select .cse200 .cse8)) (= .cse199 c_~max2~0) (< .cse199 (+ .cse201 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse202 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse203 (select .cse202 .cse8)) (.cse204 (select .cse202 .cse4))) (or (< c_~max1~0 (select .cse202 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (= .cse203 c_~max2~0) (< .cse204 .cse10) (< c_~max1~0 (select .cse202 .cse7)) (< c_~max2~0 .cse203) (< .cse203 (+ .cse204 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse205 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse206 (select .cse205 .cse8))) (or (< c_~max1~0 (select .cse205 .cse4)) (< c_~max1~0 (select .cse205 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (= .cse206 c_~max2~0) (< c_~max1~0 (select .cse205 .cse7)) (< c_~max2~0 .cse206) (< .cse206 .cse10))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse208 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse207 (select .cse208 .cse8))) (or (< .cse207 .cse16) (< c_~max2~0 (select .cse208 .cse4)) (< c_~max2~0 (select .cse208 .cse7)) (= .cse207 c_~max1~0) (< c_~max1~0 .cse207) (< c_~max2~0 (select .cse208 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse207 .cse6))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse209 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse210 (select .cse209 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max3~0 (select .cse209 .cse8)) (< .cse210 (select .cse209 .cse4)) (< c_~max1~0 .cse210) (< .cse210 c_~max3~0) (= c_~max1~0 .cse210) (< .cse210 .cse6) (< .cse210 (select .cse209 .cse7))))))))) is different from false [2023-09-07 07:13:25,975 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse211 (* c_~N~0 4))) (let ((.cse28 (= c_~max1~0 c_~max2~0)) (.cse0 (= c_~max1~0 c_~max3~0)) (.cse12 (+ c_~max3~0 1)) (.cse2 (+ c_~max2~0 1)) (.cse23 (+ c_~max1~0 1)) (.cse7 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse211 (- 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ .cse211 (- 8) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse0 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse3 .cse7)) (.cse5 (select .cse3 .cse6))) (or (< c_~max3~0 (+ .cse1 1)) (< .cse1 .cse2) (< c_~max1~0 .cse1) (< .cse1 (select .cse3 .cse4)) (< c_~max2~0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max3~0 .cse5) (< c_~max1~0 .cse5)))))) (or .cse0 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (select .cse9 .cse6))) (or (< .cse8 .cse2) (< .cse8 (select .cse9 .cse4)) (< c_~max1~0 .cse8) (< .cse8 (select .cse9 .cse7)) (< c_~max3~0 (+ .cse8 1)) (< c_~max3~0 .cse10) (< c_~max1~0 .cse10)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse15 .cse6)) (.cse14 (select .cse15 .cse7)) (.cse13 (select .cse15 .cse4))) (or (< .cse11 .cse12) (< .cse13 .cse11) (< .cse14 .cse2) (< .cse13 (+ .cse14 1)) (= .cse13 c_~max1~0) (< c_~max2~0 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max1~0 .cse13))))) (or .cse0 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse18 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse17 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse16 (select .cse18 .cse7)) (.cse19 (select .cse18 .cse6))) (or (< c_~max3~0 (+ .cse16 1)) (< .cse17 .cse2) (< .cse16 (+ .cse17 1)) (< c_~max1~0 .cse16) (< .cse16 (select .cse18 .cse4)) (< c_~max3~0 .cse19) (< c_~max1~0 .cse19)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse22 (select .cse21 .cse7)) (.cse20 (select .cse21 .cse4))) (or (< .cse20 (select .cse21 .cse6)) (< .cse20 (+ .cse22 1)) (< c_~max1~0 (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse22 .cse23) (< c_~max3~0 (+ .cse20 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse25 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse24 (select .cse25 .cse4))) (or (< .cse24 (select .cse25 .cse6)) (= .cse24 c_~max2~0) (< c_~max1~0 (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max1~0 (select .cse25 .cse7)) (< .cse24 .cse23) (< c_~max2~0 .cse24))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse27 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse26 (select .cse27 .cse4))) (or (< .cse26 c_~max3~0) (= .cse26 c_~max1~0) (< c_~max2~0 (select .cse27 .cse7)) (< c_~max2~0 (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse26 .cse2) (< c_~max3~0 (select .cse27 .cse6)) (< c_~max1~0 .cse26))))) (or (and (or .cse28 (< c_~max2~0 c_~max3~0)) (or .cse0 (< c_~max3~0 .cse2))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse33 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse30 (select .cse33 .cse7)) (.cse29 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse32 (select .cse33 .cse6)) (.cse31 (select .cse33 .cse4))) (or (< c_~max1~0 .cse29) (< c_~max1~0 .cse30) (< c_~max2~0 .cse31) (< c_~max2~0 .cse30) (< c_~max2~0 .cse29) (< c_~max3~0 .cse32) (< c_~max1~0 .cse32) (< c_~max1~0 .cse31)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse36 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse34 (select .cse36 .cse6)) (.cse35 (select .cse36 .cse4))) (or (= .cse34 c_~max2~0) (< .cse34 (+ .cse35 1)) (< c_~max2~0 .cse34) (< c_~max1~0 (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max1~0 (select .cse36 .cse7)) (< .cse35 .cse23))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse39 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse38 (select .cse39 .cse6)) (.cse37 (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse37 .cse38) (< .cse38 .cse12) (< .cse37 .cse2) (< .cse37 (select .cse39 .cse4)) (= c_~max1~0 .cse37) (< c_~max1~0 .cse37) (< .cse37 (select .cse39 .cse7)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse42 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse40 (select .cse42 .cse6)) (.cse41 (select .cse42 .cse4))) (or (< .cse40 .cse12) (< .cse41 .cse40) (= .cse41 c_~max1~0) (< c_~max2~0 (select .cse42 .cse7)) (< c_~max2~0 (select .cse42 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse41 .cse2) (< c_~max1~0 .cse41))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse45 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse43 (select .cse45 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse44 (select .cse45 .cse7))) (or (< .cse43 .cse23) (< c_~max3~0 (+ .cse44 1)) (< .cse44 (select .cse45 .cse6)) (< .cse44 (+ .cse43 1)) (< .cse44 (select .cse45 .cse4)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse48 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse46 (select .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse47 (select .cse48 .cse4))) (or (< .cse46 .cse2) (< .cse47 (+ .cse46 1)) (< .cse47 c_~max3~0) (= .cse47 c_~max1~0) (< .cse46 (select .cse48 .cse7)) (< c_~max3~0 (select .cse48 .cse6)) (< c_~max1~0 .cse47))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse51 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse49 (select .cse51 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse50 (select .cse51 .cse4))) (or (< .cse49 .cse23) (< .cse50 (select .cse51 .cse6)) (< .cse50 (+ .cse49 1)) (< .cse49 (select .cse51 .cse7)) (< c_~max3~0 (+ .cse50 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse54 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse52 (select .cse54 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse53 (select .cse54 .cse4))) (or (< .cse52 .cse23) (< .cse53 (select .cse54 .cse6)) (< .cse53 (+ .cse52 1)) (= .cse53 c_~max2~0) (< .cse52 (select .cse54 .cse7)) (< c_~max2~0 .cse53))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse56 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse55 (select .cse56 .cse4)) (.cse57 (select .cse56 .cse7))) (or (< .cse55 (select .cse56 .cse6)) (< .cse55 (+ .cse57 1)) (= .cse55 c_~max2~0) (< c_~max1~0 (select .cse56 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max2~0 .cse55) (< .cse57 .cse23))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse60 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse58 (select .cse60 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse59 (select .cse60 .cse7))) (or (< .cse58 .cse23) (< .cse59 (select .cse60 .cse6)) (< .cse59 (+ .cse58 1)) (= .cse59 c_~max2~0) (< .cse59 (select .cse60 .cse4)) (< c_~max2~0 .cse59))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse65 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse63 (select .cse65 .cse4)) (.cse61 (select .cse65 .cse6)) (.cse64 (select .cse65 .cse7)) (.cse62 (select .cse65 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse61 c_~max2~0) (< .cse62 .cse23) (< .cse61 (+ .cse63 1)) (< .cse63 (+ .cse64 1)) (< c_~max2~0 .cse61) (< .cse64 (+ .cse62 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse69 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse66 (select .cse69 .cse6)) (.cse68 (select .cse69 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse67 (select .cse69 .cse7))) (or (< .cse66 .cse12) (< .cse67 .cse66) (< .cse68 .cse2) (< .cse67 (+ .cse68 1)) (= .cse67 c_~max1~0) (< c_~max1~0 .cse67) (< .cse67 (select .cse69 .cse4)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse73 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse71 (select .cse73 .cse4)) (.cse72 (select .cse73 .cse7)) (.cse70 (select .cse73 .cse6))) (or (< .cse70 (+ .cse71 1)) (< .cse71 (+ .cse72 1)) (< c_~max1~0 (select .cse73 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse72 .cse23) (= .cse70 c_~max3~0) (< c_~max3~0 .cse70))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse76 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse75 (select .cse76 .cse7)) (.cse74 (select .cse76 .cse6))) (or (< .cse74 .cse12) (< .cse74 (+ .cse75 1)) (< .cse75 .cse2) (= c_~max1~0 .cse74) (< .cse75 (select .cse76 .cse4)) (< c_~max2~0 (select .cse76 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max1~0 .cse74))))) (or (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse79 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse77 (select .cse79 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse80 (select .cse79 .cse6)) (.cse78 (select .cse79 .cse4))) (or (< .cse77 .cse2) (< .cse78 (+ .cse77 1)) (< .cse77 (select .cse79 .cse7)) (< c_~max3~0 (+ .cse78 1)) (< c_~max3~0 .cse80) (< c_~max1~0 .cse80) (< c_~max1~0 .cse78))))) .cse0) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse83 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse81 (select .cse83 .cse7)) (.cse82 (select .cse83 .cse4))) (or (< .cse81 .cse2) (< .cse82 c_~max3~0) (< .cse82 (+ .cse81 1)) (= .cse82 c_~max1~0) (< c_~max2~0 (select .cse83 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max3~0 (select .cse83 .cse6)) (< c_~max1~0 .cse82))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse85 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse84 (select .cse85 .cse7))) (or (< .cse84 .cse2) (< .cse84 c_~max3~0) (= .cse84 c_~max1~0) (< c_~max1~0 .cse84) (< .cse84 (select .cse85 .cse4)) (< c_~max2~0 (select .cse85 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max3~0 (select .cse85 .cse6)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse89 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse88 (select .cse89 .cse4)) (.cse87 (select .cse89 .cse7)) (.cse86 (select .cse89 .cse6))) (or (< .cse86 .cse12) (< .cse87 .cse2) (< .cse86 (+ .cse88 1)) (= c_~max1~0 .cse86) (< .cse88 (+ .cse87 1)) (< c_~max2~0 (select .cse89 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max1~0 .cse86))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse91 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse90 (select .cse91 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse90 .cse2) (< .cse90 (select .cse91 .cse4)) (= c_~max1~0 .cse90) (< c_~max1~0 .cse90) (< .cse90 (select .cse91 .cse7)) (< .cse90 c_~max3~0) (< c_~max3~0 (select .cse91 .cse6)))))) (or (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse96 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse94 (select .cse96 .cse7)) (.cse93 (select .cse96 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse92 (select .cse96 .cse6)) (.cse95 (select .cse96 .cse4))) (or (< .cse92 .cse12) (< c_~max2~0 .cse92) (< c_~max1~0 .cse93) (< c_~max1~0 .cse94) (< c_~max2~0 .cse95) (< c_~max2~0 .cse94) (< c_~max2~0 .cse93) (< c_~max1~0 .cse92) (< c_~max1~0 .cse95))))) .cse28) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse100 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse98 (select .cse100 .cse4)) (.cse97 (select .cse100 .cse6)) (.cse99 (select .cse100 .cse7))) (or (= .cse97 c_~max2~0) (< .cse97 (+ .cse98 1)) (< .cse98 (+ .cse99 1)) (< c_~max2~0 .cse97) (< c_~max1~0 (select .cse100 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse99 .cse23))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse102 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse101 (select .cse102 .cse6))) (or (< .cse101 .cse12) (< .cse101 .cse2) (= c_~max1~0 .cse101) (< c_~max2~0 (select .cse102 .cse4)) (< c_~max2~0 (select .cse102 .cse7)) (< c_~max2~0 (select .cse102 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max1~0 .cse101))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse106 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse104 (select .cse106 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse105 (select .cse106 .cse7)) (.cse103 (select .cse106 .cse6))) (or (< .cse103 .cse12) (< .cse104 .cse2) (< .cse103 (+ .cse105 1)) (= c_~max1~0 .cse103) (< .cse105 (+ .cse104 1)) (< .cse105 (select .cse106 .cse4)) (< c_~max1~0 .cse103))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse108 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse107 (select .cse108 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse109 (select .cse108 .cse6))) (or (< .cse107 .cse23) (< .cse107 (select .cse108 .cse4)) (< .cse109 (+ .cse107 1)) (< .cse107 (select .cse108 .cse7)) (= .cse109 c_~max3~0) (< c_~max3~0 .cse109))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse111 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse110 (select .cse111 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse110 (select .cse111 .cse6)) (< .cse110 .cse23) (< .cse110 (select .cse111 .cse4)) (< .cse110 (select .cse111 .cse7)) (< c_~max3~0 (+ .cse110 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse115 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse112 (select .cse115 .cse6)) (.cse114 (select .cse115 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse113 (select .cse115 .cse4))) (or (< .cse112 .cse12) (< .cse113 .cse112) (< .cse114 .cse2) (< .cse113 (+ .cse114 1)) (= .cse113 c_~max1~0) (< .cse114 (select .cse115 .cse7)) (< c_~max1~0 .cse113))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse120 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse118 (select .cse120 .cse4)) (.cse119 (select .cse120 .cse7)) (.cse117 (select .cse120 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse116 (select .cse120 .cse6))) (or (< .cse116 .cse12) (< .cse117 .cse2) (< .cse116 (+ .cse118 1)) (= c_~max1~0 .cse116) (< .cse118 (+ .cse119 1)) (< .cse119 (+ .cse117 1)) (< c_~max1~0 .cse116))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse123 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse122 (select .cse123 .cse4)) (.cse121 (select .cse123 .cse6))) (or (< .cse121 .cse12) (< .cse121 (+ .cse122 1)) (= c_~max1~0 .cse121) (< c_~max2~0 (select .cse123 .cse7)) (< c_~max2~0 (select .cse123 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse122 .cse2) (< c_~max1~0 .cse121))))) (or .cse0 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse128 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse126 (select .cse128 .cse7)) (.cse124 (select .cse128 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse127 (select .cse128 .cse6)) (.cse125 (select .cse128 .cse4))) (or (< .cse124 .cse2) (< .cse125 (+ .cse126 1)) (< .cse126 (+ .cse124 1)) (< c_~max3~0 (+ .cse125 1)) (< c_~max3~0 .cse127) (< c_~max1~0 .cse127) (< c_~max1~0 .cse125)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse130 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse129 (select .cse130 .cse6))) (or (= .cse129 c_~max2~0) (< .cse129 .cse23) (< c_~max2~0 .cse129) (< c_~max1~0 (select .cse130 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max1~0 (select .cse130 .cse7)) (< c_~max1~0 (select .cse130 .cse4)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse132 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse131 (select .cse132 .cse6))) (or (< .cse131 .cse23) (< c_~max1~0 (select .cse132 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max1~0 (select .cse132 .cse7)) (= .cse131 c_~max3~0) (< c_~max3~0 .cse131) (< c_~max1~0 (select .cse132 .cse4)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse136 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse133 (select .cse136 .cse6)) (.cse134 (select .cse136 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse135 (select .cse136 .cse7))) (or (= .cse133 c_~max2~0) (< .cse134 .cse23) (< .cse133 (+ .cse135 1)) (< c_~max2~0 .cse133) (< .cse135 (+ .cse134 1)) (< .cse135 (select .cse136 .cse4)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse139 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse138 (select .cse139 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse137 (select .cse139 .cse6))) (or (< .cse137 .cse12) (< .cse138 .cse2) (< .cse138 (select .cse139 .cse4)) (= c_~max1~0 .cse137) (< .cse137 (+ .cse138 1)) (< .cse138 (select .cse139 .cse7)) (< c_~max1~0 .cse137))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse144 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse140 (select .cse144 .cse6)) (.cse143 (select .cse144 .cse7)) (.cse142 (select .cse144 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse141 (select .cse144 .cse4))) (or (< .cse140 .cse12) (< .cse141 .cse140) (< .cse142 .cse2) (< .cse141 (+ .cse143 1)) (= .cse141 c_~max1~0) (< .cse143 (+ .cse142 1)) (< c_~max1~0 .cse141))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse149 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse147 (select .cse149 .cse4)) (.cse148 (select .cse149 .cse7)) (.cse145 (select .cse149 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse146 (select .cse149 .cse6))) (or (< .cse145 .cse23) (< .cse146 (+ .cse147 1)) (< .cse147 (+ .cse148 1)) (< .cse148 (+ .cse145 1)) (= .cse146 c_~max3~0) (< c_~max3~0 .cse146))))) (or .cse0 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse152 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse150 (select .cse152 .cse7)) (.cse153 (select .cse152 .cse6)) (.cse151 (select .cse152 .cse4))) (or (< .cse150 .cse2) (< .cse151 (+ .cse150 1)) (< c_~max2~0 (select .cse152 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max3~0 (+ .cse151 1)) (< c_~max3~0 .cse153) (< c_~max1~0 .cse153) (< c_~max1~0 .cse151)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse156 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse157 (select .cse156 .cse7)) (.cse154 (select .cse156 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse155 (select .cse156 .cse4))) (or (< .cse154 .cse23) (< .cse155 (select .cse156 .cse6)) (< .cse155 (+ .cse157 1)) (< .cse157 (+ .cse154 1)) (= .cse155 c_~max2~0) (< c_~max2~0 .cse155))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse161 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse160 (select .cse161 .cse4)) (.cse158 (select .cse161 .cse6)) (.cse159 (select .cse161 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse158 c_~max2~0) (< .cse159 .cse23) (< .cse160 (+ .cse159 1)) (< .cse158 (+ .cse160 1)) (< c_~max2~0 .cse158) (< .cse159 (select .cse161 .cse7)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse165 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse164 (select .cse165 .cse7)) (.cse162 (select .cse165 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse163 (select .cse165 .cse4))) (or (< .cse162 .cse2) (< .cse163 c_~max3~0) (< .cse163 (+ .cse164 1)) (= .cse163 c_~max1~0) (< .cse164 (+ .cse162 1)) (< c_~max3~0 (select .cse165 .cse6)) (< c_~max1~0 .cse163))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse169 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse166 (select .cse169 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse168 (select .cse169 .cse7)) (.cse167 (select .cse169 .cse6))) (or (< .cse166 .cse23) (< .cse167 (+ .cse168 1)) (< .cse168 (+ .cse166 1)) (< .cse168 (select .cse169 .cse4)) (= .cse167 c_~max3~0) (< c_~max3~0 .cse167))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse172 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse170 (select .cse172 .cse6)) (.cse171 (select .cse172 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse170 c_~max2~0) (< .cse171 .cse23) (< .cse171 (select .cse172 .cse4)) (< .cse170 (+ .cse171 1)) (< c_~max2~0 .cse170) (< .cse171 (select .cse172 .cse7)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse175 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse174 (select .cse175 .cse7)) (.cse173 (select .cse175 .cse6))) (or (< .cse173 (+ .cse174 1)) (< c_~max1~0 (select .cse175 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse174 (select .cse175 .cse4)) (< .cse174 .cse23) (= .cse173 c_~max3~0) (< c_~max3~0 .cse173))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse178 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse176 (select .cse178 .cse6)) (.cse177 (select .cse178 .cse7))) (or (< .cse176 .cse12) (< .cse177 .cse176) (< .cse177 .cse2) (= .cse177 c_~max1~0) (< c_~max1~0 .cse177) (< .cse177 (select .cse178 .cse4)) (< c_~max2~0 (select .cse178 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse181 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse179 (select .cse181 .cse6)) (.cse180 (select .cse181 .cse7))) (or (= .cse179 c_~max2~0) (< .cse179 (+ .cse180 1)) (< c_~max2~0 .cse179) (< c_~max1~0 (select .cse181 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse180 (select .cse181 .cse4)) (< .cse180 .cse23))))) (or .cse0 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse182 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse184 (select .cse182 .cse6)) (.cse183 (select .cse182 .cse4))) (or (< c_~max2~0 (select .cse182 .cse7)) (< c_~max2~0 (select .cse182 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max3~0 (+ .cse183 1)) (< .cse183 .cse2) (< c_~max3~0 .cse184) (< c_~max1~0 .cse184) (< c_~max1~0 .cse183)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse188 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse187 (select .cse188 .cse4)) (.cse186 (select .cse188 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse185 (select .cse188 .cse6))) (or (< .cse185 .cse12) (< .cse186 .cse2) (< .cse187 (+ .cse186 1)) (< .cse185 (+ .cse187 1)) (= c_~max1~0 .cse185) (< .cse186 (select .cse188 .cse7)) (< c_~max1~0 .cse185))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse190 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse189 (select .cse190 .cse7))) (or (< c_~max3~0 (+ .cse189 1)) (< .cse189 (select .cse190 .cse6)) (< c_~max1~0 (select .cse190 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse189 (select .cse190 .cse4)) (< .cse189 .cse23))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse193 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse192 (select .cse193 .cse4)) (.cse191 (select .cse193 .cse6))) (or (< .cse191 (+ .cse192 1)) (< c_~max1~0 (select .cse193 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max1~0 (select .cse193 .cse7)) (< .cse192 .cse23) (= .cse191 c_~max3~0) (< c_~max3~0 .cse191))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse195 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse194 (select .cse195 .cse7))) (or (< .cse194 (select .cse195 .cse6)) (< c_~max1~0 (select .cse195 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= .cse194 c_~max2~0) (< .cse194 (select .cse195 .cse4)) (< .cse194 .cse23) (< c_~max2~0 .cse194))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse197 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse196 (select .cse197 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse196 (select .cse197 .cse6)) (< .cse196 .cse23) (= .cse196 c_~max2~0) (< .cse196 (select .cse197 .cse4)) (< .cse196 (select .cse197 .cse7)) (< c_~max2~0 .cse196))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse200 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse201 (select .cse200 .cse7)) (.cse198 (select .cse200 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse199 (select .cse200 .cse4))) (or (< .cse198 .cse23) (< .cse199 (select .cse200 .cse6)) (< .cse199 (+ .cse201 1)) (< .cse201 (+ .cse198 1)) (< c_~max3~0 (+ .cse199 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse204 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse202 (select .cse204 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse203 (select .cse204 .cse7))) (or (< .cse202 .cse2) (< .cse203 (+ .cse202 1)) (< .cse203 c_~max3~0) (= .cse203 c_~max1~0) (< c_~max1~0 .cse203) (< .cse203 (select .cse204 .cse4)) (< c_~max3~0 (select .cse204 .cse6)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse206 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse205 (select .cse206 .cse4))) (or (< .cse205 (select .cse206 .cse6)) (< c_~max1~0 (select .cse206 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max1~0 (select .cse206 .cse7)) (< .cse205 .cse23) (< c_~max3~0 (+ .cse205 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse210 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse208 (select .cse210 .cse4)) (.cse207 (select .cse210 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse209 (select .cse210 .cse6))) (or (< .cse207 .cse23) (< .cse208 (+ .cse207 1)) (< .cse209 (+ .cse208 1)) (< .cse207 (select .cse210 .cse7)) (= .cse209 c_~max3~0) (< c_~max3~0 .cse209)))))))) is different from false [2023-09-07 07:14:31,640 WARN L234 SmtUtils]: Spent 49.99s on a formula simplification that was a NOOP. DAG size: 223 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 07:15:48,126 WARN L234 SmtUtils]: Spent 1.00m on a formula simplification that was a NOOP. DAG size: 224 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 07:17:00,811 WARN L234 SmtUtils]: Spent 1.00m on a formula simplification that was a NOOP. DAG size: 224 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 07:17:06,839 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 07:17:06,840 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 314 treesize of output 206 [2023-09-07 07:17:07,052 INFO L322 Elim1Store]: treesize reduction 18, result has 45.5 percent of original size [2023-09-07 07:17:07,052 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1168 treesize of output 1108 [2023-09-07 07:17:07,300 INFO L322 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-09-07 07:17:07,300 INFO L351 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 1062 treesize of output 854 [2023-09-07 07:17:07,437 INFO L322 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-09-07 07:17:07,438 INFO L351 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 846 treesize of output 746 [2023-09-07 07:17:07,571 INFO L322 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-09-07 07:17:07,571 INFO L351 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 393 treesize of output 347 [2023-09-07 07:17:16,903 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 07:17:16,903 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 279 treesize of output 183 [2023-09-07 07:17:17,140 INFO L322 Elim1Store]: treesize reduction 18, result has 45.5 percent of original size [2023-09-07 07:17:17,141 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 8463 treesize of output 7957 [2023-09-07 07:17:17,217 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-07 07:17:17,217 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-07 07:17:17,218 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-07 07:17:17,285 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 07:17:17,286 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 440 treesize of output 401 [2023-09-07 07:17:17,450 INFO L322 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-09-07 07:17:17,450 INFO L351 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 873 treesize of output 693 [2023-09-07 07:17:17,586 INFO L322 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-09-07 07:17:17,586 INFO L351 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 387 treesize of output 301 [2023-09-07 07:17:19,011 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 07:17:19,011 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 160 [2023-09-07 07:17:19,230 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 07:17:19,231 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2020 treesize of output 1948 [2023-09-07 07:17:19,450 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 07:17:19,450 INFO L351 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 984 treesize of output 944 [2023-09-07 07:17:19,647 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 07:17:19,647 INFO L351 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 912 treesize of output 800 [2023-09-07 07:17:19,912 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 07:17:19,912 INFO L351 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 399 treesize of output 395 [2023-09-07 07:17:29,236 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 07:17:29,236 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 165 [2023-09-07 07:17:29,471 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 07:17:29,472 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 9257 treesize of output 8841 [2023-09-07 07:17:29,766 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 07:17:29,766 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 561 treesize of output 553 [2023-09-07 07:17:29,967 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 07:17:29,967 INFO L351 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 1113 treesize of output 985 [2023-09-07 07:17:30,175 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 07:17:30,175 INFO L351 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 513 treesize of output 465 [2023-09-07 07:17:41,216 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,217 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 255 treesize of output 1 [2023-09-07 07:17:41,242 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,243 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 254 treesize of output 1 [2023-09-07 07:17:41,266 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,267 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 281 treesize of output 1 [2023-09-07 07:17:41,289 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,290 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 1 [2023-09-07 07:17:41,327 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,327 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 280 treesize of output 1 [2023-09-07 07:17:41,351 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,351 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 268 treesize of output 1 [2023-09-07 07:17:41,376 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,376 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 1 [2023-09-07 07:17:41,405 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,405 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 1 [2023-09-07 07:17:41,429 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,429 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 305 treesize of output 1 [2023-09-07 07:17:41,453 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,453 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 193 treesize of output 1 [2023-09-07 07:17:41,477 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,478 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 303 treesize of output 1 [2023-09-07 07:17:41,503 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,503 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 289 treesize of output 1 [2023-09-07 07:17:41,527 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,528 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 275 treesize of output 1 [2023-09-07 07:17:41,551 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,552 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 1 [2023-09-07 07:17:41,575 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,575 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 1 [2023-09-07 07:17:41,600 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,600 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 1 [2023-09-07 07:17:41,623 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,624 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 1 [2023-09-07 07:17:41,647 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,647 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2023-09-07 07:17:41,671 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,672 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 276 treesize of output 1 [2023-09-07 07:17:41,708 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,708 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 1 [2023-09-07 07:17:41,732 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,733 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 1 [2023-09-07 07:17:41,757 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,757 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 1 [2023-09-07 07:17:41,782 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,782 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 193 treesize of output 1 [2023-09-07 07:17:41,806 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,806 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 254 treesize of output 1 [2023-09-07 07:17:41,831 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,831 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 312 treesize of output 1 [2023-09-07 07:17:41,856 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,856 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 241 treesize of output 1 [2023-09-07 07:17:41,885 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,885 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 311 treesize of output 1 [2023-09-07 07:17:41,921 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,921 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 1 [2023-09-07 07:17:41,971 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:41,972 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 284 treesize of output 1 [2023-09-07 07:17:42,003 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,004 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 1 [2023-09-07 07:17:42,036 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,036 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 1 [2023-09-07 07:17:42,068 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,068 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 1 [2023-09-07 07:17:42,101 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,101 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 287 treesize of output 1 [2023-09-07 07:17:42,153 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,153 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 284 treesize of output 1 [2023-09-07 07:17:42,203 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,204 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 1 [2023-09-07 07:17:42,236 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,236 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 282 treesize of output 1 [2023-09-07 07:17:42,269 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,269 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 281 treesize of output 1 [2023-09-07 07:17:42,302 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,302 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 276 treesize of output 1 [2023-09-07 07:17:42,336 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,336 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 1 [2023-09-07 07:17:42,368 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,369 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 293 treesize of output 1 [2023-09-07 07:17:42,402 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,403 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 1 [2023-09-07 07:17:42,431 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,431 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 1 [2023-09-07 07:17:42,457 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,457 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 1 [2023-09-07 07:17:42,495 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,495 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 1 [2023-09-07 07:17:42,521 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,521 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 1 [2023-09-07 07:17:42,547 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,547 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 1 [2023-09-07 07:17:42,575 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,575 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 1 [2023-09-07 07:17:42,601 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,601 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 310 treesize of output 1 [2023-09-07 07:17:42,641 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,641 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 276 treesize of output 1 [2023-09-07 07:17:42,667 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,667 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 276 treesize of output 1 [2023-09-07 07:17:42,693 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,693 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 1 [2023-09-07 07:17:42,719 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,719 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 1 [2023-09-07 07:17:42,764 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,765 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 268 treesize of output 1 [2023-09-07 07:17:42,793 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,793 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 278 treesize of output 1 [2023-09-07 07:17:42,819 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,819 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 284 treesize of output 1 [2023-09-07 07:17:42,845 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,846 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 226 treesize of output 1 [2023-09-07 07:17:42,873 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-07 07:17:42,874 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 1 [2023-09-07 07:17:51,034 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-09-07 07:17:51,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717363384] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 07:17:51,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 07:17:51,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 53, 48] total 117 [2023-09-07 07:17:51,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473103060] [2023-09-07 07:17:51,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 07:17:51,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2023-09-07 07:17:51,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 07:17:51,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2023-09-07 07:17:51,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=854, Invalid=11965, Unknown=75, NotChecked=678, Total=13572 [2023-09-07 07:17:51,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:17:51,041 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 07:17:51,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 117 states, 117 states have (on average 3.965811965811966) internal successors, (464), 117 states have internal predecessors, (464), 0 states have call successors, (0), 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-09-07 07:17:51,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:17:51,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-07 07:17:51,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-09-07 07:17:51,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2023-09-07 07:17:51,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-07 07:17:51,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-09-07 07:17:51,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2023-09-07 07:17:51,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Received shutdown request... [2023-09-07 07:22:52,193 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-07 07:22:52,193 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-07 07:22:52,193 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-07 07:22:53,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-09-07 07:22:53,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-09-07 07:22:53,407 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-09-07 07:22:53,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-09-07 07:22:53,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-07 07:22:53,512 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:167) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.partialorder.dynamicabstraction.DynamicStratifiedReduction.createSuccessors(DynamicStratifiedReduction.java:354) at de.uni_freiburg.informatik.ultimate.automata.partialorder.dynamicabstraction.DynamicStratifiedReduction.traverse(DynamicStratifiedReduction.java:224) at de.uni_freiburg.informatik.ultimate.automata.partialorder.dynamicabstraction.DynamicStratifiedReduction.(DynamicStratifiedReduction.java:158) at de.uni_freiburg.informatik.ultimate.automata.partialorder.dynamicabstraction.DynamicStratifiedReduction.traverse(DynamicStratifiedReduction.java:110) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-09-07 07:22:53,515 INFO L158 Benchmark]: Toolchain (without parser) took 840333.45ms. Allocated memory was 226.5MB in the beginning and 947.9MB in the end (delta: 721.4MB). Free memory was 176.4MB in the beginning and 604.9MB in the end (delta: -428.5MB). Peak memory consumption was 623.2MB. Max. memory is 7.0GB. [2023-09-07 07:22:53,515 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 158.3MB. Free memory is still 108.5MB. There was no memory consumed. Max. memory is 7.0GB. [2023-09-07 07:22:53,515 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.68ms. Allocated memory is still 226.5MB. Free memory was 175.9MB in the beginning and 164.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 7.0GB. [2023-09-07 07:22:53,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.39ms. Allocated memory is still 226.5MB. Free memory was 164.3MB in the beginning and 162.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 7.0GB. [2023-09-07 07:22:53,515 INFO L158 Benchmark]: Boogie Preprocessor took 50.29ms. Allocated memory is still 226.5MB. Free memory was 162.8MB in the beginning and 160.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-07 07:22:53,515 INFO L158 Benchmark]: RCFGBuilder took 504.00ms. Allocated memory is still 226.5MB. Free memory was 160.7MB in the beginning and 139.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 7.0GB. [2023-09-07 07:22:53,516 INFO L158 Benchmark]: TraceAbstraction took 839487.23ms. Allocated memory was 226.5MB in the beginning and 947.9MB in the end (delta: 721.4MB). Free memory was 139.2MB in the beginning and 604.9MB in the end (delta: -465.7MB). Peak memory consumption was 585.5MB. Max. memory is 7.0GB. [2023-09-07 07:22:53,517 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.13ms. Allocated memory is still 158.3MB. Free memory is still 108.5MB. There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 252.68ms. Allocated memory is still 226.5MB. Free memory was 175.9MB in the beginning and 164.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 34.39ms. Allocated memory is still 226.5MB. Free memory was 164.3MB in the beginning and 162.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 7.0GB. * Boogie Preprocessor took 50.29ms. Allocated memory is still 226.5MB. Free memory was 162.8MB in the beginning and 160.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * RCFGBuilder took 504.00ms. Allocated memory is still 226.5MB. Free memory was 160.7MB in the beginning and 139.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 7.0GB. * TraceAbstraction took 839487.23ms. Allocated memory was 226.5MB in the beginning and 947.9MB in the end (delta: 721.4MB). Free memory was 139.2MB in the beginning and 604.9MB in the end (delta: -465.7MB). Peak memory consumption was 585.5MB. Max. memory is 7.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown