/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 ONLY_ONE_CEGAR -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-e2ee32c-m [2023-09-08 01:42:01,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-08 01:42:01,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2023-09-08 01:42:01,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-08 01:42:01,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-08 01:42:01,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-08 01:42:01,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-08 01:42:01,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-08 01:42:01,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-08 01:42:01,818 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-08 01:42:01,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-08 01:42:01,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-08 01:42:01,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-08 01:42:01,820 INFO L153 SettingsManager]: * Use SBE=true [2023-09-08 01:42:01,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-08 01:42:01,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-08 01:42:01,821 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-08 01:42:01,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-08 01:42:01,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-08 01:42:01,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-08 01:42:01,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-08 01:42:01,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-08 01:42:01,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-08 01:42:01,827 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-08 01:42:01,830 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-08 01:42:01,830 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-08 01:42:01,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-08 01:42:01,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-08 01:42:01,832 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-08 01:42:01,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-08 01:42:01,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-08 01:42:01,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-08 01:42:01,833 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-08 01:42:01,833 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2023-09-08 01:42:01,833 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-08 01:42:01,834 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-08 01:42:01,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-08 01:42:01,834 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-08 01:42:01,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-08 01:42:01,834 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-08 01:42:01,834 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2023-09-08 01:42:01,835 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 -> ONLY_ONE_CEGAR [2023-09-08 01:42:02,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-08 01:42:02,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-08 01:42:02,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-08 01:42:02,088 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-08 01:42:02,089 INFO L274 PluginConnector]: CDTParser initialized [2023-09-08 01:42:02,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2023-09-08 01:42:03,224 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-08 01:42:03,397 INFO L384 CDTParser]: Found 1 translation units. [2023-09-08 01:42:03,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2023-09-08 01:42:03,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/942c934d8/1ae66c099a9048109a6c58a92879dcc7/FLAG60f0469af [2023-09-08 01:42:03,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/942c934d8/1ae66c099a9048109a6c58a92879dcc7 [2023-09-08 01:42:03,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-08 01:42:03,420 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-08 01:42:03,421 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-08 01:42:03,421 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-08 01:42:03,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-08 01:42:03,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:42:03" (1/1) ... [2023-09-08 01:42:03,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b7b4e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:42:03, skipping insertion in model container [2023-09-08 01:42:03,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:42:03" (1/1) ... [2023-09-08 01:42:03,448 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-08 01:42:03,593 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-min-array-hom.wvr.c[2586,2599] [2023-09-08 01:42:03,600 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 01:42:03,610 INFO L202 MainTranslator]: Completed pre-run [2023-09-08 01:42:03,628 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-min-array-hom.wvr.c[2586,2599] [2023-09-08 01:42:03,631 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 01:42:03,637 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-08 01:42:03,637 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-08 01:42:03,643 INFO L206 MainTranslator]: Completed translation [2023-09-08 01:42:03,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:42:03 WrapperNode [2023-09-08 01:42:03,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-08 01:42:03,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-08 01:42:03,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-08 01:42:03,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-08 01:42:03,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:42:03" (1/1) ... [2023-09-08 01:42:03,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:42:03" (1/1) ... [2023-09-08 01:42:03,674 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 106 [2023-09-08 01:42:03,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-08 01:42:03,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-08 01:42:03,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-08 01:42:03,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-08 01:42:03,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:42:03" (1/1) ... [2023-09-08 01:42:03,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:42:03" (1/1) ... [2023-09-08 01:42:03,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:42:03" (1/1) ... [2023-09-08 01:42:03,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:42:03" (1/1) ... [2023-09-08 01:42:03,692 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:42:03" (1/1) ... [2023-09-08 01:42:03,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:42:03" (1/1) ... [2023-09-08 01:42:03,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:42:03" (1/1) ... [2023-09-08 01:42:03,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:42:03" (1/1) ... [2023-09-08 01:42:03,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-08 01:42:03,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-08 01:42:03,701 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-08 01:42:03,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-08 01:42:03,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:42:03" (1/1) ... [2023-09-08 01:42:03,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-08 01:42:03,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 01:42:03,729 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-08 01:42:03,730 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-08 01:42:03,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-08 01:42:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-08 01:42:03,755 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-08 01:42:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-08 01:42:03,755 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-08 01:42:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-08 01:42:03,755 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-08 01:42:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-08 01:42:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-08 01:42:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-08 01:42:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-08 01:42:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-08 01:42:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-08 01:42:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-08 01:42:03,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-08 01:42:03,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-08 01:42:03,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-08 01:42:03,758 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-08 01:42:03,863 INFO L236 CfgBuilder]: Building ICFG [2023-09-08 01:42:03,873 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-08 01:42:04,126 INFO L277 CfgBuilder]: Performing block encoding [2023-09-08 01:42:04,186 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-08 01:42:04,186 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-09-08 01:42:04,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:42:04 BoogieIcfgContainer [2023-09-08 01:42:04,188 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-08 01:42:04,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-08 01:42:04,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-08 01:42:04,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-08 01:42:04,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:42:03" (1/3) ... [2023-09-08 01:42:04,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593f7318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:42:04, skipping insertion in model container [2023-09-08 01:42:04,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:42:03" (2/3) ... [2023-09-08 01:42:04,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593f7318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:42:04, skipping insertion in model container [2023-09-08 01:42:04,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:42:04" (3/3) ... [2023-09-08 01:42:04,197 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2023-09-08 01:42:04,204 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-08 01:42:04,211 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-08 01:42:04,211 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-08 01:42:04,211 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-08 01:42:04,303 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-09-08 01:42:04,353 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-08 01:42:04,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-08 01:42:04,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 01:42:04,359 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-08 01:42:04,360 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-08 01:42:04,401 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-08 01:42:04,408 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-08 01:42:04,414 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;@7ce1f8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-08 01:42:04,414 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. Found a loop, use abstraction hammer [2023-09-08 01:42:04,851 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-08 01:42:04,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 01:42:04,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1366094475, now seen corresponding path program 1 times [2023-09-08 01:42:04,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 01:42:04,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306597546] [2023-09-08 01:42:04,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 01:42:04,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 01:42:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 01:42:05,154 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-08 01:42:05,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 01:42:05,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306597546] [2023-09-08 01:42:05,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306597546] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 01:42:05,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 01:42:05,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-08 01:42:05,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061589208] [2023-09-08 01:42:05,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 01:42:05,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-08 01:42:05,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 01:42:05,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-08 01:42:05,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-08 01:42:05,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:42:05,188 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 01:42:05,189 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-08 01:42:05,189 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-08 01:42:05,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:42:05,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-08 01:42:05,418 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-08 01:42:05,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 01:42:05,418 INFO L85 PathProgramCache]: Analyzing trace with hash -158364597, now seen corresponding path program 1 times [2023-09-08 01:42:05,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 01:42:05,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101877870] [2023-09-08 01:42:05,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 01:42:05,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 01:42:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 01:42:05,799 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-08 01:42:05,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 01:42:05,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101877870] [2023-09-08 01:42:05,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101877870] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 01:42:05,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933657110] [2023-09-08 01:42:05,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 01:42:05,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 01:42:05,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 01:42:05,843 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-08 01:42:05,845 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-08 01:42:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 01:42:05,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-08 01:42:05,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 01:42:06,144 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-08 01:42:06,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 01:42:06,347 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-08 01:42:06,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933657110] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-08 01:42:06,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-08 01:42:06,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-09-08 01:42:06,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122745542] [2023-09-08 01:42:06,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 01:42:06,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-08 01:42:06,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 01:42:06,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-08 01:42:06,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-09-08 01:42:06,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:42:06,352 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 01:42:06,352 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-08 01:42:06,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:42:06,352 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-08 01:42:06,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:42:06,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-08 01:42:06,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-09-08 01:42:06,687 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-08 01:42:06,688 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-08 01:42:06,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 01:42:06,689 INFO L85 PathProgramCache]: Analyzing trace with hash -569930784, now seen corresponding path program 1 times [2023-09-08 01:42:06,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 01:42:06,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723970575] [2023-09-08 01:42:06,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 01:42:06,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 01:42:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 01:42:07,023 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-08 01:42:07,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 01:42:07,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723970575] [2023-09-08 01:42:07,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723970575] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 01:42:07,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265028146] [2023-09-08 01:42:07,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 01:42:07,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 01:42:07,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 01:42:07,026 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-08 01:42:07,033 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-08 01:42:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 01:42:07,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 10 conjunts are in the unsatisfiable core [2023-09-08 01:42:07,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 01:42:07,378 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-08 01:42:07,379 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 01:42:07,644 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-08 01:42:07,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265028146] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 01:42:07,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 01:42:07,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2023-09-08 01:42:07,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842622702] [2023-09-08 01:42:07,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 01:42:07,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-09-08 01:42:07,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 01:42:07,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-09-08 01:42:07,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2023-09-08 01:42:07,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:42:07,648 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 01:42:07,648 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-08 01:42:07,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:42:07,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-08 01:42:07,649 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-08 01:42:08,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:42:08,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-08 01:42:08,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-09-08 01:42:08,907 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-08 01:42:09,108 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-08 01:42:09,108 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-08 01:42:09,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 01:42:09,109 INFO L85 PathProgramCache]: Analyzing trace with hash 791159270, now seen corresponding path program 1 times [2023-09-08 01:42:09,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 01:42:09,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21601970] [2023-09-08 01:42:09,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 01:42:09,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 01:42:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 01:42:09,432 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-08 01:42:09,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 01:42:09,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21601970] [2023-09-08 01:42:09,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21601970] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 01:42:09,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597460969] [2023-09-08 01:42:09,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 01:42:09,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 01:42:09,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 01:42:09,434 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-08 01:42:09,457 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-08 01:42:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 01:42:09,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 14 conjunts are in the unsatisfiable core [2023-09-08 01:42:09,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 01:42:09,818 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-08 01:42:09,818 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 01:42:10,140 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-08 01:42:10,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597460969] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 01:42:10,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 01:42:10,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 36 [2023-09-08 01:42:10,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893174960] [2023-09-08 01:42:10,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 01:42:10,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-09-08 01:42:10,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 01:42:10,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-09-08 01:42:10,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2023-09-08 01:42:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:42:10,144 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 01:42:10,144 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-08 01:42:10,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:42:10,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-08 01:42:10,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-09-08 01:42:10,144 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-08 01:42:12,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:42:12,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-08 01:42:12,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-09-08 01:42:12,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-09-08 01:42:12,673 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-08 01:42:12,871 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-08 01:42:12,871 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-08 01:42:12,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 01:42:12,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1385195742, now seen corresponding path program 2 times [2023-09-08 01:42:12,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 01:42:12,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967979462] [2023-09-08 01:42:12,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 01:42:12,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 01:42:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 01:42:13,285 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-08 01:42:13,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 01:42:13,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967979462] [2023-09-08 01:42:13,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967979462] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 01:42:13,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542948164] [2023-09-08 01:42:13,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-08 01:42:13,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 01:42:13,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 01:42:13,288 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-08 01:42:13,315 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-08 01:42:13,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-09-08 01:42:13,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 01:42:13,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-08 01:42:13,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 01:42:13,678 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-08 01:42:13,679 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-08 01:42:13,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542948164] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 01:42:13,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-08 01:42:13,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2023-09-08 01:42:13,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153780438] [2023-09-08 01:42:13,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 01:42:13,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-08 01:42:13,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 01:42:13,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-08 01:42:13,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2023-09-08 01:42:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:42:13,681 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 01:42:13,681 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-08 01:42:13,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:42:13,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-08 01:42:13,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-09-08 01:42:13,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2023-09-08 01:42:13,682 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-08 01:42:14,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:42:14,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-08 01:42:14,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-09-08 01:42:14,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-09-08 01:42:14,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-08 01:42:14,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-09-08 01:42:14,595 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-08 01:42:14,596 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-08 01:42:14,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 01:42:14,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1514751982, now seen corresponding path program 1 times [2023-09-08 01:42:14,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 01:42:14,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919131151] [2023-09-08 01:42:14,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 01:42:14,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 01:42:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 01:42:15,090 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-08 01:42:15,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 01:42:15,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919131151] [2023-09-08 01:42:15,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919131151] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 01:42:15,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71332181] [2023-09-08 01:42:15,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 01:42:15,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 01:42:15,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 01:42:15,093 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-08 01:42:15,101 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-08 01:42:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 01:42:15,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 18 conjunts are in the unsatisfiable core [2023-09-08 01:42:15,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 01:42:15,619 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-08 01:42:15,619 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 01:42:16,055 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-08 01:42:16,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71332181] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 01:42:16,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 01:42:16,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 44 [2023-09-08 01:42:16,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169700093] [2023-09-08 01:42:16,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 01:42:16,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-09-08 01:42:16,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 01:42:16,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-09-08 01:42:16,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1575, Unknown=0, NotChecked=0, Total=1892 [2023-09-08 01:42:16,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:42:16,059 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 01:42:16,059 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-08 01:42:16,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:42:16,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-08 01:42:16,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-09-08 01:42:16,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2023-09-08 01:42:16,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-08 01:42:16,060 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-08 01:42:17,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:42:17,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-08 01:42:17,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-09-08 01:42:17,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-09-08 01:42:17,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-08 01:42:17,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-09-08 01:42:17,297 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-08 01:42:17,497 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-08 01:42:17,497 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-08 01:42:17,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 01:42:17,498 INFO L85 PathProgramCache]: Analyzing trace with hash 314392109, now seen corresponding path program 2 times [2023-09-08 01:42:17,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 01:42:17,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399016185] [2023-09-08 01:42:17,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 01:42:17,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 01:42:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 01:42:18,052 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-08 01:42:18,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 01:42:18,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399016185] [2023-09-08 01:42:18,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399016185] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 01:42:18,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921720521] [2023-09-08 01:42:18,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-08 01:42:18,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 01:42:18,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 01:42:18,055 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-08 01:42:18,058 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-08 01:42:18,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-08 01:42:18,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 01:42:18,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 20 conjunts are in the unsatisfiable core [2023-09-08 01:42:18,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 01:42:18,689 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-08 01:42:18,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 01:42:19,244 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-08 01:42:19,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921720521] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 01:42:19,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 01:42:19,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 48 [2023-09-08 01:42:19,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169848608] [2023-09-08 01:42:19,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 01:42:19,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-09-08 01:42:19,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 01:42:19,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-09-08 01:42:19,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2023-09-08 01:42:19,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:42:19,248 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 01:42:19,248 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-08 01:42:19,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:42:19,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-08 01:42:19,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-09-08 01:42:19,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2023-09-08 01:42:19,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-08 01:42:19,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-09-08 01:42:19,249 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-08 01:42:22,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:42:22,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-08 01:42:22,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-09-08 01:42:22,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-09-08 01:42:22,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-08 01:42:22,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-09-08 01:42:22,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-09-08 01:42:22,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-09-08 01:42:22,475 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-08 01:42:22,476 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-08 01:42:22,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 01:42:22,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1471454452, now seen corresponding path program 3 times [2023-09-08 01:42:22,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 01:42:22,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741556748] [2023-09-08 01:42:22,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 01:42:22,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 01:42:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 01:42:23,020 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-08 01:42:23,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 01:42:23,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741556748] [2023-09-08 01:42:23,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741556748] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 01:42:23,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533029175] [2023-09-08 01:42:23,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-08 01:42:23,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 01:42:23,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 01:42:23,022 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-08 01:42:23,053 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-08 01:42:23,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-09-08 01:42:23,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 01:42:23,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 90 conjunts are in the unsatisfiable core [2023-09-08 01:42:23,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 01:42:24,542 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-08 01:42:25,051 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-08 01:42:25,162 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-08 01:42:25,250 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-08 01:42:44,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 01:42:44,674 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 01:42:44,675 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 1103 treesize of output 483 [2023-09-08 01:43:00,903 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-08 01:43:00,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 01:44:13,355 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse217 (* c_~N~0 4))) (let ((.cse99 (= c_~min2~0 c_~min1~0)) (.cse8 (= c_~min1~0 c_~min3~0)) (.cse1 (+ c_~min3~0 1)) (.cse7 (+ c_~A~0.offset .cse217 (- 8))) (.cse5 (+ c_~A~0.offset 4)) (.cse6 (+ c_~A~0.offset .cse217 (- 4)))) (and (or (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 ((.cse0 (select .cse4 .cse7)) (.cse2 (select .cse4 .cse6)) (.cse3 (select .cse4 .cse5))) (or (< .cse0 .cse1) (< .cse0 c_~min1~0) (< .cse2 c_~min3~0) (< .cse3 (+ .cse0 1)) (< (select .cse4 c_~A~0.offset) c_~min2~0) (< .cse2 c_~min1~0) (< c_~min2~0 (+ .cse3 1)))))) .cse8) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse12 (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 .cse12 .cse5)) (.cse9 (select .cse12 c_~A~0.offset)) (.cse11 (select .cse12 .cse7))) (or (< .cse9 (+ .cse10 1)) (< .cse11 c_~min1~0) (< c_~min3~0 .cse11) (< (select .cse12 .cse6) c_~min3~0) (< .cse10 (+ .cse11 1)) (< c_~min2~0 (+ .cse9 1)) (= .cse11 c_~min1~0))))) (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 .cse6))) (let ((.cse15 (+ .cse17 1)) (.cse14 (select .cse18 .cse5)) (.cse16 (select .cse18 .cse7)) (.cse13 (select .cse18 c_~A~0.offset))) (or (< .cse13 (+ .cse14 1)) (< c_~min3~0 .cse15) (< .cse16 .cse15) (< .cse14 (+ .cse16 1)) (< .cse17 c_~min1~0) (= c_~min1~0 .cse17) (< c_~min2~0 (+ .cse13 1))))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse19 (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 ((.cse20 (select .cse19 .cse7))) (or (< (select .cse19 c_~A~0.offset) c_~min1~0) (= .cse20 c_~min2~0) (< (select .cse19 .cse6) .cse20) (< .cse20 c_~min2~0) (< c_~min1~0 (+ .cse20 1)) (< (select .cse19 .cse5) c_~min1~0))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse21 (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 ((.cse22 (select .cse21 c_~A~0.offset)) (.cse23 (select .cse21 .cse7))) (or (< (select .cse21 .cse5) .cse22) (< c_~min1~0 (+ .cse22 1)) (= .cse23 c_~min2~0) (< (select .cse21 .cse6) .cse23) (< .cse23 c_~min2~0) (< .cse22 (+ .cse23 1)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse24 (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 ((.cse25 (select .cse24 .cse5)) (.cse26 (select .cse24 .cse7))) (or (< (select .cse24 c_~A~0.offset) c_~min1~0) (< .cse25 (+ .cse26 1)) (= .cse26 c_~min2~0) (< (select .cse24 .cse6) .cse26) (< c_~min1~0 (+ .cse25 1)) (< .cse26 c_~min2~0))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse31 (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 ((.cse29 (select .cse31 .cse6)) (.cse28 (select .cse31 .cse5)) (.cse30 (select .cse31 .cse7)) (.cse27 (select .cse31 c_~A~0.offset))) (or (< .cse27 (+ .cse28 1)) (= .cse29 c_~min3~0) (< .cse30 (+ .cse29 1)) (< .cse29 c_~min3~0) (< .cse28 (+ .cse30 1)) (< c_~min1~0 (+ .cse27 1)))))) (or (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse36 (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 .cse36 .cse5)) (.cse32 (select .cse36 .cse7)) (.cse35 (select .cse36 .cse6)) (.cse33 (select .cse36 c_~A~0.offset))) (or (< .cse32 .cse1) (< .cse33 (+ .cse34 1)) (< .cse32 c_~min1~0) (< .cse35 c_~min3~0) (< .cse34 (+ .cse32 1)) (< .cse35 c_~min1~0) (< c_~min2~0 (+ .cse33 1)))))) .cse8) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse40 (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 .cse40 .cse5)) (.cse38 (select .cse40 c_~A~0.offset)) (.cse37 (select .cse40 .cse7))) (or (< .cse37 .cse1) (< .cse38 (+ .cse39 1)) (< .cse39 (+ .cse37 1)) (< c_~min1~0 (+ .cse38 1)) (< (select .cse40 .cse6) .cse37))))) (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 ((.cse43 (select .cse41 .cse6)) (.cse42 (select .cse41 c_~A~0.offset)) (.cse44 (select .cse41 .cse7))) (or (< (select .cse41 .cse5) .cse42) (< c_~min3~0 (+ .cse43 1)) (< .cse44 c_~min1~0) (< c_~min2~0 (+ .cse42 1)) (< .cse43 .cse44) (= .cse44 c_~min1~0) (< .cse42 (+ .cse44 1)))))) (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 ((.cse46 (select .cse45 .cse6)) (.cse47 (select .cse45 .cse7)) (.cse48 (select .cse45 .cse5))) (or (< (select .cse45 c_~A~0.offset) c_~min1~0) (= .cse46 c_~min3~0) (< .cse47 (+ .cse46 1)) (< .cse46 c_~min3~0) (< .cse48 (+ .cse47 1)) (< c_~min1~0 (+ .cse48 1)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse49 (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 .cse49 .cse6)) (.cse50 (select .cse49 c_~A~0.offset))) (or (< (select .cse49 .cse5) .cse50) (< .cse50 (+ .cse51 1)) (< .cse51 c_~min2~0) (= c_~min2~0 .cse51) (< c_~min1~0 (+ .cse50 1)) (< (select .cse49 .cse7) .cse50))))) (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 ((.cse55 (select .cse52 .cse6))) (let ((.cse54 (+ .cse55 1)) (.cse53 (select .cse52 c_~A~0.offset))) (or (< (select .cse52 .cse5) .cse53) (< c_~min3~0 .cse54) (< .cse53 .cse54) (< .cse55 c_~min1~0) (= c_~min1~0 .cse55) (< c_~min2~0 (+ .cse53 1)) (< (select .cse52 .cse7) .cse53)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse56 (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 .cse56 .cse6))) (or (< (select .cse56 c_~A~0.offset) c_~min1~0) (= .cse57 c_~min3~0) (< (select .cse56 .cse7) c_~min1~0) (< .cse57 c_~min3~0) (< c_~min1~0 (+ .cse57 1)) (< (select .cse56 .cse5) c_~min1~0))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse58 (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 ((.cse60 (select .cse58 .cse6)) (.cse59 (select .cse58 .cse7))) (or (< (select .cse58 c_~A~0.offset) c_~min1~0) (< .cse59 (+ .cse60 1)) (< .cse60 c_~min2~0) (= c_~min2~0 .cse60) (< c_~min1~0 (+ .cse59 1)) (< (select .cse58 .cse5) c_~min1~0))))) (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 ((.cse63 (select .cse64 .cse5)) (.cse61 (select .cse64 .cse6)) (.cse62 (select .cse64 .cse7))) (or (< c_~min3~0 (+ .cse61 1)) (< .cse62 c_~min1~0) (< .cse63 (+ .cse62 1)) (< (select .cse64 c_~A~0.offset) c_~min2~0) (< c_~min2~0 (+ .cse63 1)) (< .cse61 .cse62) (= .cse62 c_~min1~0))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse65 (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 ((.cse67 (select .cse65 .cse6)) (.cse66 (select .cse65 .cse5))) (or (< (select .cse65 c_~A~0.offset) c_~min1~0) (< .cse66 (+ .cse67 1)) (< .cse67 c_~min2~0) (< (select .cse65 .cse7) .cse66) (= c_~min2~0 .cse67) (< c_~min1~0 (+ .cse66 1)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse69 (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 ((.cse68 (select .cse69 .cse7))) (or (< .cse68 c_~min1~0) (< c_~min3~0 .cse68) (< (select .cse69 .cse6) c_~min3~0) (< (select .cse69 c_~A~0.offset) c_~min2~0) (< (select .cse69 .cse5) c_~min2~0) (< c_~min2~0 (+ .cse68 1)) (= .cse68 c_~min1~0))))) (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 ((.cse72 (select .cse70 .cse6)) (.cse71 (select .cse70 c_~A~0.offset))) (or (< (select .cse70 .cse5) .cse71) (= .cse72 c_~min3~0) (< .cse71 (+ .cse72 1)) (< .cse72 c_~min3~0) (< c_~min1~0 (+ .cse71 1)) (< (select .cse70 .cse7) .cse71))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse75 (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 ((.cse73 (select .cse75 .cse6)) (.cse74 (select .cse75 .cse7))) (or (< c_~min3~0 (+ .cse73 1)) (< .cse74 c_~min1~0) (< (select .cse75 c_~A~0.offset) c_~min2~0) (< (select .cse75 .cse5) c_~min2~0) (< c_~min2~0 (+ .cse74 1)) (< .cse73 .cse74) (= .cse74 c_~min1~0))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse77 (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 ((.cse78 (select .cse77 c_~A~0.offset)) (.cse76 (select .cse77 .cse7))) (or (< .cse76 .cse1) (< (select .cse77 .cse5) .cse78) (< c_~min1~0 (+ .cse78 1)) (< (select .cse77 .cse6) .cse76) (< .cse78 (+ .cse76 1)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse83 (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 .cse83 .cse5)) (.cse79 (select .cse83 c_~A~0.offset)) (.cse81 (select .cse83 .cse6)) (.cse82 (select .cse83 .cse7))) (or (< .cse79 (+ .cse80 1)) (< c_~min3~0 (+ .cse81 1)) (< .cse82 c_~min1~0) (< .cse80 (+ .cse82 1)) (< c_~min2~0 (+ .cse79 1)) (< .cse81 .cse82) (= .cse82 c_~min1~0))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse87 (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 .cse87 .cse6))) (let ((.cse86 (+ .cse88 1)) (.cse85 (select .cse87 .cse5)) (.cse84 (select .cse87 c_~A~0.offset))) (or (< .cse84 (+ .cse85 1)) (< c_~min3~0 .cse86) (< .cse85 .cse86) (< (select .cse87 .cse7) .cse85) (< .cse88 c_~min1~0) (= c_~min1~0 .cse88) (< c_~min2~0 (+ .cse84 1))))))) (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 ((.cse90 (select .cse89 .cse6))) (or (< (select .cse89 c_~A~0.offset) c_~min1~0) (< (select .cse89 .cse7) c_~min1~0) (< .cse90 c_~min2~0) (= c_~min2~0 .cse90) (< c_~min1~0 (+ .cse90 1)) (< (select .cse89 .cse5) c_~min1~0))))) (or (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse92 (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 ((.cse93 (select .cse92 .cse6)) (.cse91 (select .cse92 .cse5))) (or (< .cse91 .cse1) (< (select .cse92 .cse7) .cse91) (< .cse93 c_~min3~0) (< (select .cse92 c_~A~0.offset) c_~min2~0) (< .cse93 c_~min1~0) (< c_~min2~0 (+ .cse91 1)) (< .cse91 c_~min1~0))))) .cse8) (or (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse98 (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 ((.cse94 (select .cse98 c_~A~0.offset)) (.cse96 (select .cse98 .cse6)) (.cse95 (select .cse98 .cse7)) (.cse97 (select .cse98 .cse5))) (or (< .cse94 c_~min1~0) (< .cse95 c_~min1~0) (< .cse96 c_~min3~0) (< .cse94 c_~min2~0) (< .cse96 c_~min1~0) (< .cse97 c_~min2~0) (< .cse95 c_~min2~0) (< .cse97 c_~min1~0))))) (and (or .cse8 (< c_~min2~0 .cse1)) (or .cse99 (< c_~min3~0 c_~min2~0)))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse102 (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 .cse102 c_~A~0.offset)) (.cse101 (select .cse102 .cse5))) (or (< .cse100 (+ .cse101 1)) (< (select .cse102 .cse7) .cse101) (= c_~min2~0 .cse101) (< c_~min1~0 (+ .cse100 1)) (< .cse101 c_~min2~0) (< (select .cse102 .cse6) .cse101))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse105 (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 ((.cse103 (select .cse105 c_~A~0.offset)) (.cse104 (select .cse105 .cse5))) (or (< .cse103 (+ .cse104 1)) (< c_~min3~0 .cse104) (= c_~min1~0 .cse104) (< (select .cse105 .cse7) .cse104) (< (select .cse105 .cse6) c_~min3~0) (< c_~min2~0 (+ .cse103 1)) (< .cse104 c_~min1~0))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse106 (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 ((.cse110 (select .cse106 .cse6))) (let ((.cse108 (+ .cse110 1)) (.cse107 (select .cse106 c_~A~0.offset)) (.cse109 (select .cse106 .cse7))) (or (< (select .cse106 .cse5) .cse107) (< c_~min3~0 .cse108) (< .cse109 .cse108) (< .cse110 c_~min1~0) (= c_~min1~0 .cse110) (< c_~min2~0 (+ .cse107 1)) (< .cse107 (+ .cse109 1))))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse111 (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 ((.cse113 (select .cse111 .cse6)) (.cse112 (select .cse111 c_~A~0.offset)) (.cse114 (select .cse111 .cse7))) (or (< (select .cse111 .cse5) .cse112) (= .cse113 c_~min3~0) (< .cse114 (+ .cse113 1)) (< .cse113 c_~min3~0) (< c_~min1~0 (+ .cse112 1)) (< .cse112 (+ .cse114 1)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse116 (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 ((.cse115 (select .cse116 c_~A~0.offset))) (or (< .cse115 c_~min1~0) (< (select .cse116 .cse5) .cse115) (= c_~min1~0 .cse115) (< (select .cse116 .cse6) c_~min3~0) (< c_~min2~0 (+ .cse115 1)) (< c_~min3~0 .cse115) (< (select .cse116 .cse7) .cse115))))) (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 ((.cse118 (select .cse117 c_~A~0.offset))) (or (< (select .cse117 .cse5) .cse118) (= c_~min2~0 .cse118) (< c_~min1~0 (+ .cse118 1)) (< .cse118 c_~min2~0) (< (select .cse117 .cse6) .cse118) (< (select .cse117 .cse7) .cse118))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse121 (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 ((.cse120 (select .cse121 c_~A~0.offset)) (.cse119 (select .cse121 .cse5))) (or (< .cse119 .cse1) (< .cse120 (+ .cse119 1)) (< (select .cse121 .cse7) .cse119) (< c_~min1~0 (+ .cse120 1)) (< (select .cse121 .cse6) .cse119))))) (or .cse8 (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse124 (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 ((.cse125 (select .cse124 .cse6)) (.cse123 (select .cse124 c_~A~0.offset)) (.cse122 (select .cse124 .cse5))) (or (< .cse122 .cse1) (< .cse123 (+ .cse122 1)) (< (select .cse124 .cse7) .cse122) (< .cse125 c_~min3~0) (< .cse125 c_~min1~0) (< c_~min2~0 (+ .cse123 1)) (< .cse122 c_~min1~0)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse127 (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 ((.cse128 (select .cse127 .cse6)) (.cse126 (select .cse127 c_~A~0.offset))) (or (< .cse126 c_~min1~0) (< (select .cse127 .cse5) .cse126) (< c_~min3~0 (+ .cse128 1)) (= c_~min1~0 .cse126) (< .cse128 .cse126) (< c_~min2~0 (+ .cse126 1)) (< (select .cse127 .cse7) .cse126))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse129 (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 .cse129 c_~A~0.offset)) (.cse131 (select .cse129 .cse7))) (or (< (select .cse129 .cse5) .cse130) (< .cse131 c_~min1~0) (< c_~min3~0 .cse131) (< (select .cse129 .cse6) c_~min3~0) (< c_~min2~0 (+ .cse130 1)) (= .cse131 c_~min1~0) (< .cse130 (+ .cse131 1)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse135 (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 ((.cse133 (select .cse135 .cse5)) (.cse132 (select .cse135 c_~A~0.offset)) (.cse134 (select .cse135 .cse7))) (or (< .cse132 (+ .cse133 1)) (< .cse133 (+ .cse134 1)) (< c_~min1~0 (+ .cse132 1)) (= .cse134 c_~min2~0) (< (select .cse135 .cse6) .cse134) (< .cse134 c_~min2~0))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse137 (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 ((.cse138 (select .cse137 .cse5)) (.cse136 (select .cse137 .cse7))) (or (< .cse136 c_~min1~0) (< c_~min3~0 .cse136) (< (select .cse137 .cse6) c_~min3~0) (< .cse138 (+ .cse136 1)) (< (select .cse137 c_~A~0.offset) c_~min2~0) (< c_~min2~0 (+ .cse138 1)) (= .cse136 c_~min1~0))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse139 (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 ((.cse140 (select .cse139 .cse6)) (.cse141 (select .cse139 .cse7))) (or (< (select .cse139 c_~A~0.offset) c_~min1~0) (= .cse140 c_~min3~0) (< .cse141 (+ .cse140 1)) (< .cse140 c_~min3~0) (< c_~min1~0 (+ .cse141 1)) (< (select .cse139 .cse5) c_~min1~0))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse142 (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 ((.cse143 (select .cse142 c_~A~0.offset))) (or (< (select .cse142 .cse5) .cse143) (< .cse143 .cse1) (< c_~min1~0 (+ .cse143 1)) (< (select .cse142 .cse6) .cse143) (< (select .cse142 .cse7) .cse143))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse147 (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 .cse147 c_~A~0.offset)) (.cse146 (select .cse147 .cse6)) (.cse145 (select .cse147 .cse5))) (or (< .cse144 (+ .cse145 1)) (< c_~min3~0 (+ .cse146 1)) (= c_~min1~0 .cse145) (< (select .cse147 .cse7) .cse145) (< c_~min2~0 (+ .cse144 1)) (< .cse146 .cse145) (< .cse145 c_~min1~0))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse148 (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 ((.cse150 (select .cse148 .cse6)) (.cse149 (select .cse148 .cse7)) (.cse151 (select .cse148 .cse5))) (or (< (select .cse148 c_~A~0.offset) c_~min1~0) (< .cse149 (+ .cse150 1)) (< .cse150 c_~min2~0) (= c_~min2~0 .cse150) (< .cse151 (+ .cse149 1)) (< c_~min1~0 (+ .cse151 1)))))) (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))) (or (< .cse152 .cse1) (< (select .cse153 c_~A~0.offset) c_~min1~0) (< (select .cse153 .cse7) .cse152) (< c_~min1~0 (+ .cse152 1)) (< (select .cse153 .cse6) .cse152))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse154 (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 ((.cse155 (select .cse154 .cse6)) (.cse156 (select .cse154 .cse5))) (or (< (select .cse154 c_~A~0.offset) c_~min1~0) (= .cse155 c_~min3~0) (< .cse156 (+ .cse155 1)) (< (select .cse154 .cse7) .cse156) (< .cse155 c_~min3~0) (< c_~min1~0 (+ .cse156 1)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse157 (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 .cse157 .cse7))) (or (< (select .cse157 c_~A~0.offset) c_~min1~0) (< .cse158 .cse1) (< (select .cse157 .cse6) .cse158) (< c_~min1~0 (+ .cse158 1)) (< (select .cse157 .cse5) c_~min1~0))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse160 (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 ((.cse159 (select .cse160 .cse5))) (or (< c_~min3~0 .cse159) (= c_~min1~0 .cse159) (< (select .cse160 .cse7) .cse159) (< (select .cse160 .cse6) c_~min3~0) (< (select .cse160 c_~A~0.offset) c_~min2~0) (< c_~min2~0 (+ .cse159 1)) (< .cse159 c_~min1~0))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse161 (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 ((.cse164 (select .cse161 .cse6)) (.cse162 (select .cse161 c_~A~0.offset)) (.cse163 (select .cse161 .cse7))) (or (< (select .cse161 .cse5) .cse162) (< .cse163 (+ .cse164 1)) (< .cse164 c_~min2~0) (= c_~min2~0 .cse164) (< c_~min1~0 (+ .cse162 1)) (< .cse162 (+ .cse163 1)))))) (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 ((.cse168 (select .cse169 .cse6)) (.cse166 (select .cse169 .cse5)) (.cse167 (select .cse169 .cse7)) (.cse165 (select .cse169 c_~A~0.offset))) (or (< .cse165 (+ .cse166 1)) (< .cse167 (+ .cse168 1)) (< .cse168 c_~min2~0) (= c_~min2~0 .cse168) (< .cse166 (+ .cse167 1)) (< c_~min1~0 (+ .cse165 1)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse170 (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 ((.cse171 (select .cse170 .cse7)) (.cse172 (select .cse170 .cse5))) (or (< (select .cse170 c_~A~0.offset) c_~min1~0) (< .cse171 .cse1) (< .cse172 (+ .cse171 1)) (< (select .cse170 .cse6) .cse171) (< c_~min1~0 (+ .cse172 1)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse173 (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 ((.cse174 (select .cse173 .cse5))) (or (< (select .cse173 c_~A~0.offset) c_~min1~0) (< (select .cse173 .cse7) .cse174) (= c_~min2~0 .cse174) (< .cse174 c_~min2~0) (< c_~min1~0 (+ .cse174 1)) (< (select .cse173 .cse6) .cse174))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse178 (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 .cse178 .cse5)) (.cse177 (select .cse178 .cse6)) (.cse175 (select .cse178 c_~A~0.offset))) (or (< .cse175 (+ .cse176 1)) (< .cse176 (+ .cse177 1)) (< .cse177 c_~min2~0) (< (select .cse178 .cse7) .cse176) (= c_~min2~0 .cse177) (< c_~min1~0 (+ .cse175 1)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse182 (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 .cse182 .cse6))) (let ((.cse179 (+ .cse183 1)) (.cse180 (select .cse182 .cse7)) (.cse181 (select .cse182 .cse5))) (or (< c_~min3~0 .cse179) (< .cse180 .cse179) (< .cse181 (+ .cse180 1)) (< (select .cse182 c_~A~0.offset) c_~min2~0) (< .cse183 c_~min1~0) (= c_~min1~0 .cse183) (< c_~min2~0 (+ .cse181 1))))))) (or .cse8 (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse185 (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 .cse185 .cse6)) (.cse186 (select .cse185 c_~A~0.offset)) (.cse184 (select .cse185 .cse7))) (or (< .cse184 .cse1) (< (select .cse185 .cse5) .cse186) (< .cse184 c_~min1~0) (< .cse187 c_~min3~0) (< .cse187 c_~min1~0) (< c_~min2~0 (+ .cse186 1)) (< .cse186 (+ .cse184 1))))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse190 (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 ((.cse191 (select .cse190 .cse6))) (let ((.cse188 (+ .cse191 1)) (.cse189 (select .cse190 .cse7))) (or (< c_~min3~0 .cse188) (< .cse189 .cse188) (< (select .cse190 c_~A~0.offset) c_~min2~0) (< .cse191 c_~min1~0) (< (select .cse190 .cse5) c_~min2~0) (= c_~min1~0 .cse191) (< c_~min2~0 (+ .cse189 1))))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse193 (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 ((.cse194 (select .cse193 .cse6))) (let ((.cse192 (+ .cse194 1))) (or (< c_~min3~0 .cse192) (< (select .cse193 c_~A~0.offset) c_~min2~0) (< .cse194 c_~min1~0) (< (select .cse193 .cse5) c_~min2~0) (= c_~min1~0 .cse194) (< c_~min2~0 .cse192) (< (select .cse193 .cse7) c_~min2~0)))))) (or (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 ((.cse196 (select .cse197 .cse6)) (.cse195 (select .cse197 .cse7))) (or (< .cse195 .cse1) (< .cse195 c_~min1~0) (< .cse196 c_~min3~0) (< (select .cse197 c_~A~0.offset) c_~min2~0) (< .cse196 c_~min1~0) (< (select .cse197 .cse5) c_~min2~0) (< c_~min2~0 (+ .cse195 1)))))) .cse8) (or .cse99 (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse202 (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 ((.cse198 (select .cse202 c_~A~0.offset)) (.cse199 (select .cse202 .cse6)) (.cse200 (select .cse202 .cse7)) (.cse201 (select .cse202 .cse5))) (or (< .cse198 c_~min1~0) (< c_~min3~0 (+ .cse199 1)) (< .cse200 c_~min1~0) (< .cse199 c_~min2~0) (< .cse198 c_~min2~0) (< .cse199 c_~min1~0) (< .cse201 c_~min2~0) (< .cse200 c_~min2~0) (< .cse201 c_~min1~0)))))) (or .cse8 (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 ((.cse205 (select .cse204 .cse6)) (.cse203 (select .cse204 c_~A~0.offset))) (or (< .cse203 c_~min1~0) (< (select .cse204 .cse5) .cse203) (< .cse203 .cse1) (< .cse205 c_~min3~0) (< .cse205 c_~min1~0) (< c_~min2~0 (+ .cse203 1)) (< (select .cse204 .cse7) .cse203)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse208 (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 ((.cse209 (select .cse208 .cse6))) (let ((.cse206 (+ .cse209 1)) (.cse207 (select .cse208 .cse5))) (or (< c_~min3~0 .cse206) (< .cse207 .cse206) (< (select .cse208 .cse7) .cse207) (< (select .cse208 c_~A~0.offset) c_~min2~0) (< .cse209 c_~min1~0) (= c_~min1~0 .cse209) (< c_~min2~0 (+ .cse207 1))))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse213 (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 ((.cse211 (select .cse213 .cse5)) (.cse212 (select .cse213 .cse6)) (.cse210 (select .cse213 c_~A~0.offset))) (or (< .cse210 (+ .cse211 1)) (= .cse212 c_~min3~0) (< .cse211 (+ .cse212 1)) (< (select .cse213 .cse7) .cse211) (< .cse212 c_~min3~0) (< c_~min1~0 (+ .cse210 1)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse216 (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 ((.cse214 (select .cse216 .cse6)) (.cse215 (select .cse216 .cse5))) (or (< c_~min3~0 (+ .cse214 1)) (= c_~min1~0 .cse215) (< (select .cse216 .cse7) .cse215) (< (select .cse216 c_~A~0.offset) c_~min2~0) (< c_~min2~0 (+ .cse215 1)) (< .cse214 .cse215) (< .cse215 c_~min1~0)))))))) is different from false [2023-09-08 01:44:20,649 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse217 (* c_~N~0 4))) (let ((.cse75 (= c_~min2~0 c_~min1~0)) (.cse39 (= c_~min1~0 c_~min3~0)) (.cse19 (+ c_~min3~0 1)) (.cse3 (+ c_~A~0.offset .cse217 (- 8))) (.cse4 (+ c_~A~0.offset 4)) (.cse5 (+ c_~A~0.offset .cse217 (- 4)))) (and (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse1 (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_~A~0.base))) (let ((.cse0 (select .cse1 .cse5)) (.cse2 (select .cse1 .cse4))) (or (< .cse0 c_~min2~0) (< (select .cse1 c_~A~0.offset) c_~min1~0) (= c_~min2~0 .cse0) (< .cse2 (+ .cse0 1)) (< c_~min1~0 (+ .cse2 1)) (< (select .cse1 .cse3) .cse2))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse6 (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_~A~0.base))) (let ((.cse9 (select .cse6 .cse5))) (let ((.cse8 (+ .cse9 1)) (.cse7 (select .cse6 c_~A~0.offset))) (or (< (select .cse6 .cse4) .cse7) (< c_~min2~0 (+ 1 .cse7)) (< .cse7 .cse8) (< c_~min3~0 .cse8) (= c_~min1~0 .cse9) (< (select .cse6 .cse3) .cse7) (< .cse9 c_~min1~0)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse10 (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_~A~0.base))) (let ((.cse11 (select .cse10 .cse5)) (.cse12 (select .cse10 .cse3))) (or (< (select .cse10 .cse4) c_~min1~0) (< .cse11 c_~min2~0) (< (select .cse10 c_~A~0.offset) c_~min1~0) (= c_~min2~0 .cse11) (< .cse12 (+ .cse11 1)) (< c_~min1~0 (+ .cse12 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse13 (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_~A~0.base))) (let ((.cse14 (select .cse13 c_~A~0.offset)) (.cse16 (select .cse13 .cse3)) (.cse15 (select .cse13 .cse5))) (or (< (select .cse13 .cse4) .cse14) (< .cse15 c_~min3~0) (< c_~min1~0 (+ 1 .cse14)) (< .cse14 (+ .cse16 1)) (< .cse16 (+ .cse15 1)) (= .cse15 c_~min3~0))))) (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_~A~0.base))) (let ((.cse17 (select .cse20 c_~A~0.offset)) (.cse18 (select .cse20 .cse4))) (or (< .cse17 (+ .cse18 1)) (< c_~min1~0 (+ 1 .cse17)) (< .cse18 .cse19) (< (select .cse20 .cse5) .cse18) (< (select .cse20 .cse3) .cse18))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse23 (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_~A~0.base))) (let ((.cse21 (select .cse23 .cse3)) (.cse22 (select .cse23 .cse4))) (or (< .cse21 c_~min2~0) (< .cse22 (+ .cse21 1)) (< (select .cse23 c_~A~0.offset) c_~min1~0) (< (select .cse23 .cse5) .cse21) (= c_~min2~0 .cse21) (< c_~min1~0 (+ .cse22 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse26 (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_~A~0.base))) (let ((.cse28 (select .cse26 .cse5))) (let ((.cse24 (select .cse26 .cse4)) (.cse25 (select .cse26 .cse3)) (.cse27 (+ .cse28 1))) (or (< .cse24 (+ .cse25 1)) (< (select .cse26 c_~A~0.offset) c_~min2~0) (< c_~min2~0 (+ .cse24 1)) (< c_~min3~0 .cse27) (< .cse25 .cse27) (= c_~min1~0 .cse28) (< .cse28 c_~min1~0)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse29 (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_~A~0.base))) (let ((.cse30 (select .cse29 .cse4))) (or (< (select .cse29 c_~A~0.offset) c_~min2~0) (< .cse30 c_~min1~0) (= c_~min1~0 .cse30) (< c_~min2~0 (+ .cse30 1)) (< c_~min3~0 .cse30) (< (select .cse29 .cse5) c_~min3~0) (< (select .cse29 .cse3) .cse30))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse34 (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_~A~0.base))) (let ((.cse32 (select .cse34 .cse3)) (.cse33 (select .cse34 .cse5)) (.cse31 (select .cse34 .cse4))) (or (< .cse31 (+ .cse32 1)) (< .cse33 c_~min2~0) (< (select .cse34 c_~A~0.offset) c_~min1~0) (= c_~min2~0 .cse33) (< .cse32 (+ .cse33 1)) (< c_~min1~0 (+ .cse31 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse38 (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_~A~0.base))) (let ((.cse37 (select .cse38 .cse5)) (.cse35 (select .cse38 c_~A~0.offset)) (.cse36 (select .cse38 .cse4))) (or (< .cse35 (+ .cse36 1)) (< .cse37 c_~min2~0) (= c_~min2~0 .cse37) (< .cse36 (+ .cse37 1)) (< c_~min1~0 (+ 1 .cse35)) (< (select .cse38 .cse3) .cse36))))) (or .cse39 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse44 (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_~A~0.base))) (let ((.cse42 (select .cse44 c_~A~0.offset)) (.cse41 (select .cse44 .cse4)) (.cse40 (select .cse44 .cse3)) (.cse43 (select .cse44 .cse5))) (or (< .cse40 c_~min1~0) (< .cse41 (+ .cse40 1)) (< c_~min2~0 (+ 1 .cse42)) (< .cse42 (+ .cse41 1)) (< .cse40 .cse19) (< .cse43 c_~min3~0) (< .cse43 c_~min1~0)))))) (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_~A~0.base))) (let ((.cse45 (select .cse46 .cse3))) (or (< .cse45 c_~min2~0) (< (select .cse46 .cse4) c_~min1~0) (< (select .cse46 c_~A~0.offset) c_~min1~0) (< (select .cse46 .cse5) .cse45) (= c_~min2~0 .cse45) (< c_~min1~0 (+ .cse45 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse47 (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_~A~0.base))) (let ((.cse48 (select .cse47 c_~A~0.offset))) (or (< (select .cse47 .cse4) .cse48) (< c_~min3~0 .cse48) (< c_~min2~0 (+ 1 .cse48)) (< .cse48 c_~min1~0) (= c_~min1~0 .cse48) (< (select .cse47 .cse5) c_~min3~0) (< (select .cse47 .cse3) .cse48))))) (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_~A~0.base))) (let ((.cse49 (select .cse50 .cse4))) (or (= c_~min2~0 .cse49) (< (select .cse50 c_~A~0.offset) c_~min1~0) (< .cse49 c_~min2~0) (< c_~min1~0 (+ .cse49 1)) (< (select .cse50 .cse5) .cse49) (< (select .cse50 .cse3) .cse49))))) (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_~A~0.base))) (let ((.cse53 (select .cse55 c_~A~0.offset)) (.cse52 (select .cse55 .cse4)) (.cse54 (select .cse55 .cse5)) (.cse51 (select .cse55 .cse3))) (or (< .cse51 c_~min1~0) (< .cse52 (+ .cse51 1)) (< c_~min2~0 (+ 1 .cse53)) (< .cse53 (+ .cse52 1)) (< .cse54 .cse51) (< c_~min3~0 (+ .cse54 1)) (= c_~min1~0 .cse51))))) (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_~A~0.base))) (let ((.cse56 (select .cse59 .cse4)) (.cse57 (select .cse59 .cse3)) (.cse58 (select .cse59 c_~A~0.offset))) (or (< .cse56 (+ .cse57 1)) (< .cse58 (+ .cse56 1)) (< (select .cse59 .cse5) .cse57) (< .cse57 .cse19) (< c_~min1~0 (+ 1 .cse58)))))) (or (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_~A~0.base))) (let ((.cse62 (select .cse60 .cse5)) (.cse61 (select .cse60 .cse4))) (or (< (select .cse60 c_~A~0.offset) c_~min2~0) (< .cse61 c_~min1~0) (< c_~min2~0 (+ .cse61 1)) (< .cse62 c_~min3~0) (< .cse61 .cse19) (< .cse62 c_~min1~0) (< (select .cse60 .cse3) .cse61))))) .cse39) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse67 (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_~A~0.base))) (let ((.cse63 (select .cse67 .cse4)) (.cse65 (select .cse67 c_~A~0.offset)) (.cse64 (select .cse67 .cse3)) (.cse66 (select .cse67 .cse5))) (or (< .cse63 (+ .cse64 1)) (< .cse65 (+ .cse63 1)) (< .cse66 c_~min3~0) (< c_~min1~0 (+ 1 .cse65)) (< .cse64 (+ .cse66 1)) (= .cse66 c_~min3~0))))) (or (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse71 (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_~A~0.base))) (let ((.cse69 (select .cse71 c_~A~0.offset)) (.cse70 (select .cse71 .cse5)) (.cse68 (select .cse71 .cse4))) (or (< .cse68 c_~min1~0) (< c_~min2~0 (+ 1 .cse69)) (< .cse69 (+ .cse68 1)) (< .cse70 c_~min3~0) (< .cse68 .cse19) (< .cse70 c_~min1~0) (< (select .cse71 .cse3) .cse68))))) .cse39) (or (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_~A~0.base))) (let ((.cse72 (select .cse73 .cse3)) (.cse74 (select .cse73 .cse5))) (or (< .cse72 c_~min1~0) (< (select .cse73 c_~A~0.offset) c_~min2~0) (< c_~min2~0 (+ .cse72 1)) (< (select .cse73 .cse4) c_~min2~0) (< .cse72 .cse19) (< .cse74 c_~min3~0) (< .cse74 c_~min1~0))))) .cse39) (or .cse75 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse80 (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_~A~0.base))) (let ((.cse76 (select .cse80 .cse3)) (.cse77 (select .cse80 c_~A~0.offset)) (.cse78 (select .cse80 .cse4)) (.cse79 (select .cse80 .cse5))) (or (< .cse76 c_~min1~0) (< .cse76 c_~min2~0) (< .cse77 c_~min2~0) (< .cse78 c_~min1~0) (< .cse79 c_~min2~0) (< .cse77 c_~min1~0) (< .cse78 c_~min2~0) (< c_~min3~0 (+ .cse79 1)) (< .cse79 c_~min1~0)))))) (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_~A~0.base))) (let ((.cse82 (select .cse83 .cse4)) (.cse81 (select .cse83 .cse3))) (or (< .cse81 c_~min1~0) (< .cse82 (+ .cse81 1)) (< (select .cse83 c_~A~0.offset) c_~min2~0) (< c_~min2~0 (+ .cse82 1)) (< (select .cse83 .cse5) c_~min3~0) (< c_~min3~0 .cse81) (= c_~min1~0 .cse81))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse87 (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_~A~0.base))) (let ((.cse85 (select .cse87 c_~A~0.offset)) (.cse86 (select .cse87 .cse5)) (.cse84 (select .cse87 .cse4))) (or (< .cse84 c_~min1~0) (= c_~min1~0 .cse84) (< c_~min2~0 (+ 1 .cse85)) (< .cse85 (+ .cse84 1)) (< c_~min3~0 (+ .cse86 1)) (< .cse86 .cse84) (< (select .cse87 .cse3) .cse84))))) (or (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_~A~0.base))) (let ((.cse88 (select .cse92 .cse3)) (.cse89 (select .cse92 c_~A~0.offset)) (.cse90 (select .cse92 .cse4)) (.cse91 (select .cse92 .cse5))) (or (< .cse88 c_~min1~0) (< .cse88 c_~min2~0) (< .cse89 c_~min2~0) (< .cse90 c_~min1~0) (< .cse89 c_~min1~0) (< .cse90 c_~min2~0) (< .cse91 c_~min3~0) (< .cse91 c_~min1~0))))) (and (or .cse39 (< c_~min2~0 .cse19)) (or .cse75 (< c_~min3~0 c_~min2~0)))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse97 (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_~A~0.base))) (let ((.cse93 (select .cse97 .cse4)) (.cse95 (select .cse97 c_~A~0.offset)) (.cse94 (select .cse97 .cse3)) (.cse96 (select .cse97 .cse5))) (or (< .cse93 (+ .cse94 1)) (< .cse95 (+ .cse93 1)) (< .cse96 c_~min2~0) (= c_~min2~0 .cse96) (< c_~min1~0 (+ 1 .cse95)) (< .cse94 (+ .cse96 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse98 (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_~A~0.base))) (let ((.cse100 (select .cse98 .cse5))) (let ((.cse99 (+ .cse100 1))) (or (< (select .cse98 .cse3) c_~min2~0) (< (select .cse98 c_~A~0.offset) c_~min2~0) (< c_~min2~0 .cse99) (< (select .cse98 .cse4) c_~min2~0) (< c_~min3~0 .cse99) (= c_~min1~0 .cse100) (< .cse100 c_~min1~0)))))) (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_~A~0.base))) (let ((.cse102 (select .cse101 .cse5)) (.cse103 (select .cse101 .cse3))) (or (< (select .cse101 .cse4) c_~min1~0) (< (select .cse101 c_~A~0.offset) c_~min1~0) (< .cse102 c_~min3~0) (< .cse103 (+ .cse102 1)) (= .cse102 c_~min3~0) (< c_~min1~0 (+ .cse103 1)))))) (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_~A~0.base))) (let ((.cse105 (select .cse106 c_~A~0.offset)) (.cse104 (select .cse106 .cse4))) (or (= c_~min2~0 .cse104) (< .cse105 (+ .cse104 1)) (< .cse104 c_~min2~0) (< c_~min1~0 (+ 1 .cse105)) (< (select .cse106 .cse5) .cse104) (< (select .cse106 .cse3) .cse104))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse107 (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_~A~0.base))) (let ((.cse108 (select .cse107 .cse5))) (or (< (select .cse107 .cse3) c_~min1~0) (< (select .cse107 .cse4) c_~min1~0) (< .cse108 c_~min2~0) (< (select .cse107 c_~A~0.offset) c_~min1~0) (= c_~min2~0 .cse108) (< c_~min1~0 (+ .cse108 1)))))) (or (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_~A~0.base))) (let ((.cse111 (select .cse110 c_~A~0.offset)) (.cse109 (select .cse110 .cse3)) (.cse112 (select .cse110 .cse5))) (or (< .cse109 c_~min1~0) (< (select .cse110 .cse4) .cse111) (< c_~min2~0 (+ 1 .cse111)) (< .cse109 .cse19) (< .cse112 c_~min3~0) (< .cse111 (+ .cse109 1)) (< .cse112 c_~min1~0))))) .cse39) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse113 (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_~A~0.base))) (let ((.cse115 (select .cse113 .cse5)) (.cse114 (select .cse113 .cse4))) (or (< (select .cse113 c_~A~0.offset) c_~min2~0) (< .cse114 c_~min1~0) (= c_~min1~0 .cse114) (< c_~min2~0 (+ .cse114 1)) (< c_~min3~0 (+ .cse115 1)) (< .cse115 .cse114) (< (select .cse113 .cse3) .cse114))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse116 (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_~A~0.base))) (let ((.cse119 (select .cse116 .cse5))) (let ((.cse117 (select .cse116 .cse3)) (.cse118 (+ .cse119 1))) (or (< (select .cse116 c_~A~0.offset) c_~min2~0) (< c_~min2~0 (+ .cse117 1)) (< (select .cse116 .cse4) c_~min2~0) (< c_~min3~0 .cse118) (< .cse117 .cse118) (= c_~min1~0 .cse119) (< .cse119 c_~min1~0)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse122 (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_~A~0.base))) (let ((.cse121 (select .cse122 .cse4)) (.cse123 (select .cse122 .cse5)) (.cse120 (select .cse122 .cse3))) (or (< .cse120 c_~min1~0) (< .cse121 (+ .cse120 1)) (< (select .cse122 c_~A~0.offset) c_~min2~0) (< c_~min2~0 (+ .cse121 1)) (< .cse123 .cse120) (< c_~min3~0 (+ .cse123 1)) (= c_~min1~0 .cse120))))) (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_~A~0.base))) (let ((.cse128 (select .cse129 .cse5))) (let ((.cse126 (select .cse129 c_~A~0.offset)) (.cse124 (select .cse129 .cse4)) (.cse125 (select .cse129 .cse3)) (.cse127 (+ .cse128 1))) (or (< .cse124 (+ .cse125 1)) (< c_~min2~0 (+ 1 .cse126)) (< .cse126 (+ .cse124 1)) (< c_~min3~0 .cse127) (< .cse125 .cse127) (= c_~min1~0 .cse128) (< .cse128 c_~min1~0)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse131 (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_~A~0.base))) (let ((.cse132 (select .cse131 .cse5)) (.cse130 (select .cse131 .cse3))) (or (< .cse130 c_~min1~0) (< (select .cse131 c_~A~0.offset) c_~min2~0) (< c_~min2~0 (+ .cse130 1)) (< (select .cse131 .cse4) c_~min2~0) (< .cse132 .cse130) (< c_~min3~0 (+ .cse132 1)) (= c_~min1~0 .cse130))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse133 (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_~A~0.base))) (let ((.cse134 (select .cse133 .cse4))) (or (< (select .cse133 c_~A~0.offset) c_~min1~0) (< .cse134 .cse19) (< c_~min1~0 (+ .cse134 1)) (< (select .cse133 .cse5) .cse134) (< (select .cse133 .cse3) .cse134))))) (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_~A~0.base))) (let ((.cse136 (select .cse135 c_~A~0.offset))) (or (< (select .cse135 .cse4) .cse136) (< .cse136 c_~min2~0) (< (select .cse135 .cse5) .cse136) (= c_~min2~0 .cse136) (< c_~min1~0 (+ 1 .cse136)) (< (select .cse135 .cse3) .cse136))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse138 (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_~A~0.base))) (let ((.cse137 (select .cse138 .cse3))) (or (< .cse137 c_~min1~0) (< (select .cse138 c_~A~0.offset) c_~min2~0) (< c_~min2~0 (+ .cse137 1)) (< (select .cse138 .cse4) c_~min2~0) (< (select .cse138 .cse5) c_~min3~0) (< c_~min3~0 .cse137) (= c_~min1~0 .cse137))))) (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_~A~0.base))) (let ((.cse141 (select .cse139 .cse5)) (.cse140 (select .cse139 c_~A~0.offset))) (or (< (select .cse139 .cse4) .cse140) (< .cse140 (+ .cse141 1)) (< .cse141 c_~min3~0) (< c_~min1~0 (+ 1 .cse140)) (= .cse141 c_~min3~0) (< (select .cse139 .cse3) .cse140))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse142 (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_~A~0.base))) (let ((.cse143 (select .cse142 c_~A~0.offset))) (or (< (select .cse142 .cse4) .cse143) (< (select .cse142 .cse5) .cse143) (< c_~min1~0 (+ 1 .cse143)) (< .cse143 .cse19) (< (select .cse142 .cse3) .cse143))))) (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_~A~0.base))) (let ((.cse146 (select .cse144 .cse5)) (.cse145 (select .cse144 c_~A~0.offset))) (or (< (select .cse144 .cse4) .cse145) (< .cse146 c_~min2~0) (= c_~min2~0 .cse146) (< .cse145 (+ .cse146 1)) (< c_~min1~0 (+ 1 .cse145)) (< (select .cse144 .cse3) .cse145))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse148 (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_~A~0.base))) (let ((.cse149 (select .cse148 c_~A~0.offset)) (.cse147 (select .cse148 .cse3))) (or (< .cse147 c_~min1~0) (< (select .cse148 .cse4) .cse149) (< c_~min2~0 (+ 1 .cse149)) (< (select .cse148 .cse5) c_~min3~0) (< c_~min3~0 .cse147) (< .cse149 (+ .cse147 1)) (= c_~min1~0 .cse147))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse150 (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_~A~0.base))) (let ((.cse151 (select .cse150 c_~A~0.offset)) (.cse153 (select .cse150 .cse3)) (.cse152 (select .cse150 .cse5))) (or (< (select .cse150 .cse4) .cse151) (< .cse152 c_~min2~0) (= c_~min2~0 .cse152) (< c_~min1~0 (+ 1 .cse151)) (< .cse151 (+ .cse153 1)) (< .cse153 (+ .cse152 1)))))) (or (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_~A~0.base))) (let ((.cse155 (select .cse156 .cse4)) (.cse154 (select .cse156 .cse3)) (.cse157 (select .cse156 .cse5))) (or (< .cse154 c_~min1~0) (< .cse155 (+ .cse154 1)) (< (select .cse156 c_~A~0.offset) c_~min2~0) (< c_~min2~0 (+ .cse155 1)) (< .cse154 .cse19) (< .cse157 c_~min3~0) (< .cse157 c_~min1~0))))) .cse39) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse160 (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_~A~0.base))) (let ((.cse159 (select .cse160 .cse3)) (.cse158 (select .cse160 .cse4))) (or (< .cse158 (+ .cse159 1)) (< (select .cse160 c_~A~0.offset) c_~min1~0) (< (select .cse160 .cse5) .cse159) (< .cse159 .cse19) (< c_~min1~0 (+ .cse158 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse162 (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_~A~0.base))) (let ((.cse163 (select .cse162 c_~A~0.offset)) (.cse161 (select .cse162 .cse3))) (or (< .cse161 c_~min2~0) (< (select .cse162 .cse4) .cse163) (< (select .cse162 .cse5) .cse161) (< c_~min1~0 (+ 1 .cse163)) (< .cse163 (+ .cse161 1)) (= c_~min2~0 .cse161))))) (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_~A~0.base))) (let ((.cse166 (select .cse165 c_~A~0.offset)) (.cse167 (select .cse165 .cse5)) (.cse164 (select .cse165 .cse3))) (or (< .cse164 c_~min1~0) (< (select .cse165 .cse4) .cse166) (< c_~min2~0 (+ 1 .cse166)) (< .cse167 .cse164) (< .cse166 (+ .cse164 1)) (< c_~min3~0 (+ .cse167 1)) (= c_~min1~0 .cse164))))) (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_~A~0.base))) (let ((.cse171 (select .cse172 .cse5))) (let ((.cse168 (select .cse172 c_~A~0.offset)) (.cse170 (+ .cse171 1)) (.cse169 (select .cse172 .cse4))) (or (< c_~min2~0 (+ 1 .cse168)) (< .cse168 (+ .cse169 1)) (< .cse169 .cse170) (< c_~min3~0 .cse170) (= c_~min1~0 .cse171) (< .cse171 c_~min1~0) (< (select .cse172 .cse3) .cse169)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse173 (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_~A~0.base))) (let ((.cse174 (select .cse173 .cse3))) (or (< (select .cse173 .cse4) c_~min1~0) (< (select .cse173 c_~A~0.offset) c_~min1~0) (< (select .cse173 .cse5) .cse174) (< .cse174 .cse19) (< c_~min1~0 (+ .cse174 1)))))) (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_~A~0.base))) (let ((.cse178 (select .cse175 .cse5))) (let ((.cse177 (+ .cse178 1)) (.cse176 (select .cse175 .cse4))) (or (< (select .cse175 c_~A~0.offset) c_~min2~0) (< c_~min2~0 (+ .cse176 1)) (< .cse176 .cse177) (< c_~min3~0 .cse177) (= c_~min1~0 .cse178) (< .cse178 c_~min1~0) (< (select .cse175 .cse3) .cse176)))))) (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_~A~0.base))) (let ((.cse181 (select .cse182 c_~A~0.offset)) (.cse180 (select .cse182 .cse4)) (.cse179 (select .cse182 .cse3))) (or (< .cse179 c_~min1~0) (< .cse180 (+ .cse179 1)) (< c_~min2~0 (+ 1 .cse181)) (< .cse181 (+ .cse180 1)) (< (select .cse182 .cse5) c_~min3~0) (< c_~min3~0 .cse179) (= c_~min1~0 .cse179))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse183 (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_~A~0.base))) (let ((.cse185 (select .cse183 .cse5)) (.cse184 (select .cse183 c_~A~0.offset))) (or (< (select .cse183 .cse4) .cse184) (< .cse185 .cse184) (< c_~min2~0 (+ 1 .cse184)) (< .cse184 c_~min1~0) (= c_~min1~0 .cse184) (< c_~min3~0 (+ .cse185 1)) (< (select .cse183 .cse3) .cse184))))) (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_~A~0.base))) (let ((.cse187 (select .cse188 .cse3)) (.cse189 (select .cse188 .cse5)) (.cse186 (select .cse188 .cse4))) (or (< .cse186 (+ .cse187 1)) (< (select .cse188 c_~A~0.offset) c_~min1~0) (< .cse189 c_~min3~0) (< .cse187 (+ .cse189 1)) (= .cse189 c_~min3~0) (< c_~min1~0 (+ .cse186 1)))))) (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_~A~0.base))) (let ((.cse191 (select .cse190 c_~A~0.offset)) (.cse192 (select .cse190 .cse3))) (or (< (select .cse190 .cse4) .cse191) (< (select .cse190 .cse5) .cse192) (< .cse192 .cse19) (< c_~min1~0 (+ 1 .cse191)) (< .cse191 (+ .cse192 1)))))) (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_~A~0.base))) (let ((.cse194 (select .cse195 c_~A~0.offset)) (.cse193 (select .cse195 .cse4))) (or (< .cse193 c_~min1~0) (= c_~min1~0 .cse193) (< c_~min2~0 (+ 1 .cse194)) (< .cse194 (+ .cse193 1)) (< c_~min3~0 .cse193) (< (select .cse195 .cse5) c_~min3~0) (< (select .cse195 .cse3) .cse193))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse196 (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_~A~0.base))) (let ((.cse200 (select .cse196 .cse5))) (let ((.cse197 (select .cse196 c_~A~0.offset)) (.cse198 (select .cse196 .cse3)) (.cse199 (+ .cse200 1))) (or (< (select .cse196 .cse4) .cse197) (< c_~min2~0 (+ 1 .cse197)) (< .cse197 (+ .cse198 1)) (< c_~min3~0 .cse199) (< .cse198 .cse199) (= c_~min1~0 .cse200) (< .cse200 c_~min1~0)))))) (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_~A~0.base))) (let ((.cse201 (select .cse204 c_~A~0.offset)) (.cse203 (select .cse204 .cse5)) (.cse202 (select .cse204 .cse4))) (or (< .cse201 (+ .cse202 1)) (< .cse202 (+ .cse203 1)) (< .cse203 c_~min3~0) (< c_~min1~0 (+ 1 .cse201)) (= .cse203 c_~min3~0) (< (select .cse204 .cse3) .cse202))))) (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_~A~0.base))) (let ((.cse206 (select .cse208 .cse4)) (.cse207 (select .cse208 c_~A~0.offset)) (.cse205 (select .cse208 .cse3))) (or (< .cse205 c_~min2~0) (< .cse206 (+ .cse205 1)) (< .cse207 (+ .cse206 1)) (< (select .cse208 .cse5) .cse205) (< c_~min1~0 (+ 1 .cse207)) (= c_~min2~0 .cse205))))) (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_~A~0.base))) (let ((.cse211 (select .cse209 .cse5)) (.cse210 (select .cse209 .cse4))) (or (< (select .cse209 c_~A~0.offset) c_~min1~0) (< .cse210 (+ .cse211 1)) (< .cse211 c_~min3~0) (= .cse211 c_~min3~0) (< c_~min1~0 (+ .cse210 1)) (< (select .cse209 .cse3) .cse210))))) (or .cse39 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse212 (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_~A~0.base))) (let ((.cse213 (select .cse212 c_~A~0.offset)) (.cse214 (select .cse212 .cse5))) (or (< (select .cse212 .cse4) .cse213) (< c_~min2~0 (+ 1 .cse213)) (< .cse213 c_~min1~0) (< .cse214 c_~min3~0) (< .cse213 .cse19) (< (select .cse212 .cse3) .cse213) (< .cse214 c_~min1~0)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse215 (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_~A~0.base))) (let ((.cse216 (select .cse215 .cse5))) (or (< (select .cse215 .cse3) c_~min1~0) (< (select .cse215 .cse4) c_~min1~0) (< (select .cse215 c_~A~0.offset) c_~min1~0) (< .cse216 c_~min3~0) (< c_~min1~0 (+ .cse216 1)) (= .cse216 c_~min3~0)))))))) is different from false [2023-09-08 01:45:37,260 WARN L234 SmtUtils]: Spent 1.04m on a formula simplification that was a NOOP. DAG size: 218 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 01:47:13,363 WARN L234 SmtUtils]: Spent 1.45m on a formula simplification that was a NOOP. DAG size: 218 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 01:47:56,586 WARN L234 SmtUtils]: Spent 27.96s on a formula simplification that was a NOOP. DAG size: 218 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 01:48:41,942 WARN L234 SmtUtils]: Spent 27.91s on a formula simplification that was a NOOP. DAG size: 222 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 01:49:43,415 WARN L234 SmtUtils]: Spent 44.08s 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-08 01:50:50,420 WARN L234 SmtUtils]: Spent 54.45s 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-08 01:50:55,783 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 01:50:55,783 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-08 01:50:55,931 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 01:50:55,932 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 1081 treesize of output 1057 [2023-09-08 01:50:56,163 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 01:50:56,164 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 1153 treesize of output 1025 [2023-09-08 01:50:56,326 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 01:50:56,327 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 993 treesize of output 945 [2023-09-08 01:50:56,502 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 01:50:56,502 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 473 treesize of output 465 [2023-09-08 01:51:05,937 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:05,937 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-08 01:51:05,954 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:05,954 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-08 01:51:05,969 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:05,969 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-08 01:51:05,985 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:05,985 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-08 01:51:06,000 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,000 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-08 01:51:06,015 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,015 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-08 01:51:06,035 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,035 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 1 [2023-09-08 01:51:06,050 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,051 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-08 01:51:06,067 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,067 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-08 01:51:06,086 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,086 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-08 01:51:06,103 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,103 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-08 01:51:06,121 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,121 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-08 01:51:06,136 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,137 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-08 01:51:06,153 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,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 287 treesize of output 1 [2023-09-08 01:51:06,168 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,168 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-08 01:51:06,183 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,183 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-08 01:51:06,198 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,199 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-08 01:51:06,214 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,214 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-08 01:51:06,229 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,229 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-08 01:51:06,245 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,245 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-08 01:51:06,260 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,260 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-08 01:51:06,275 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,275 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-08 01:51:06,291 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,292 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-08 01:51:06,307 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,307 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-08 01:51:06,322 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,322 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 1 [2023-09-08 01:51:06,337 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,337 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-08 01:51:06,355 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,355 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-08 01:51:06,377 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,377 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-08 01:51:06,397 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,398 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-08 01:51:06,418 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,418 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-08 01:51:06,439 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,439 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-08 01:51:06,460 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,460 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-08 01:51:06,481 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,481 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-08 01:51:06,502 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,502 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-08 01:51:06,522 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,522 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-08 01:51:06,543 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,544 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-08 01:51:06,564 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,564 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-08 01:51:06,585 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,585 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-08 01:51:06,606 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,607 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-08 01:51:06,628 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,629 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-08 01:51:06,650 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,650 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-08 01:51:06,671 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,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 303 treesize of output 1 [2023-09-08 01:51:06,693 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,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 193 treesize of output 1 [2023-09-08 01:51:06,713 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,713 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-08 01:51:06,735 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,735 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-08 01:51:06,753 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,753 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-08 01:51:06,768 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,769 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-08 01:51:06,800 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,801 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-08 01:51:06,819 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,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 261 treesize of output 1 [2023-09-08 01:51:06,834 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,834 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-08 01:51:06,850 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,850 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-08 01:51:06,866 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,866 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-08 01:51:06,884 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,884 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-08 01:51:06,905 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,905 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-08 01:51:06,921 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,922 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-08 01:51:06,938 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,938 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-08 01:51:06,955 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,955 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-08 01:51:06,972 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,973 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-08 01:51:06,989 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:06,990 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-08 01:51:07,006 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-08 01:51:07,007 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-08 01:51:16,330 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-08 01:51:16,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533029175] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 01:51:16,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 01:51:16,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 53, 48] total 117 [2023-09-08 01:51:16,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300042868] [2023-09-08 01:51:16,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 01:51:16,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2023-09-08 01:51:16,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 01:51:16,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2023-09-08 01:51:16,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=878, Invalid=12133, Unknown=107, NotChecked=454, Total=13572 [2023-09-08 01:51:16,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:51:16,336 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 01:51:16,337 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-08 01:51:16,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 01:51:16,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-09-08 01:51:16,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-09-08 01:51:16,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2023-09-08 01:51:16,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-08 01:51:16,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-09-08 01:51:16,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2023-09-08 01:51:16,337 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-08 01:52:36,343 WARN L234 SmtUtils]: Spent 33.32s on a formula simplification. DAG size of input: 234 DAG size of output: 130 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 01:53:12,949 WARN L234 SmtUtils]: Spent 34.63s on a formula simplification. DAG size of input: 236 DAG size of output: 132 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 01:54:26,155 WARN L234 SmtUtils]: Spent 1.19m on a formula simplification. DAG size of input: 281 DAG size of output: 165 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 01:54:50,363 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-09-08 01:54:50,365 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 101 [2023-09-08 01:54:50,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-09-08 01:54:50,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-09-08 01:54:50,565 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:196) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 52 more [2023-09-08 01:54:50,568 INFO L158 Benchmark]: Toolchain (without parser) took 767148.15ms. Allocated memory was 225.4MB in the beginning and 857.7MB in the end (delta: 632.3MB). Free memory was 168.8MB in the beginning and 337.7MB in the end (delta: -168.9MB). Peak memory consumption was 464.3MB. Max. memory is 7.0GB. [2023-09-08 01:54:50,568 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 160.4MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 7.0GB. [2023-09-08 01:54:50,568 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.52ms. Allocated memory is still 225.4MB. Free memory was 168.6MB in the beginning and 157.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 7.0GB. [2023-09-08 01:54:50,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.90ms. Allocated memory is still 225.4MB. Free memory was 157.0MB in the beginning and 155.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-08 01:54:50,569 INFO L158 Benchmark]: Boogie Preprocessor took 25.60ms. Allocated memory is still 225.4MB. Free memory was 155.0MB in the beginning and 153.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 7.0GB. [2023-09-08 01:54:50,569 INFO L158 Benchmark]: RCFGBuilder took 487.45ms. Allocated memory is still 225.4MB. Free memory was 153.5MB in the beginning and 179.3MB in the end (delta: -25.8MB). Peak memory consumption was 11.9MB. Max. memory is 7.0GB. [2023-09-08 01:54:50,569 INFO L158 Benchmark]: TraceAbstraction took 766377.60ms. Allocated memory was 225.4MB in the beginning and 857.7MB in the end (delta: 632.3MB). Free memory was 178.8MB in the beginning and 337.7MB in the end (delta: -159.0MB). Peak memory consumption was 473.3MB. Max. memory is 7.0GB. [2023-09-08 01:54:50,570 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.12ms. Allocated memory is still 160.4MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 222.52ms. Allocated memory is still 225.4MB. Free memory was 168.6MB in the beginning and 157.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 29.90ms. Allocated memory is still 225.4MB. Free memory was 157.0MB in the beginning and 155.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 25.60ms. Allocated memory is still 225.4MB. Free memory was 155.0MB in the beginning and 153.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 7.0GB. * RCFGBuilder took 487.45ms. Allocated memory is still 225.4MB. Free memory was 153.5MB in the beginning and 179.3MB in the end (delta: -25.8MB). Peak memory consumption was 11.9MB. Max. memory is 7.0GB. * TraceAbstraction took 766377.60ms. Allocated memory was 225.4MB in the beginning and 857.7MB in the end (delta: 632.3MB). Free memory was 178.8MB in the beginning and 337.7MB in the end (delta: -159.0MB). Peak memory consumption was 473.3MB. Max. memory is 7.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-09-08 01:54:50,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 Received shutdown request...